|
109
|
Bisimilarity as a theory of functional programming
– A Gordon
- 1995
|
|
10
|
Hugs 98 User Manual
– M Jones, J Peterson
- 1999
|
|
22
|
Parametricity and Unboxing with Unpointed Types
– John Launchbury, Ross Paterson
- 1996
|
|
82
|
Polymorphic type inference
– Daniel Leivant
- 1983
|
|
39
|
Set theoretical models of lambda calculus: Theories, expansions and isomorphisms
– G Longo
- 1983
|
|
86
|
Computations in orthogonal rewriting systems
– G Huet, J Lévy
- 1991
|
|
33
|
Free Theorems in the Presence of seq
– Patricia Johann, Janis Voigtländer
- 2004
|
|
73
|
Operationally-based theories of program equivalence
– Andrew Pitts
- 1997
|
|
29
|
Boxy types: inference for higher-rank types and impredicativity
– D Vytiniotis, S Weirich, S Peyton Jones
- 2006
|
|
2
|
Proof Tool Support for Explicit Strictness
– Marko Van Eekelen, Maarten De Mol
|
|
19
|
An operational semantics for parallel lazy evaluation
– C Baker-Finch, D King, P Trinder
- 2000
|
|
34
|
Cyclic Lambda Graph Rewriting
– Zena M. Ariola, Jan Willem Klop
- 1994
|
|
11
|
Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321–359, 2000. A preliminary version appeared
– A M Pitts
- 1997
|
|
19
|
Fast and Loose Reasoning is Morally Correct
– Nils Anders Danielsson, Nils Anders, Danielsson John Hughes, Patrik Jansson
- 2006
|
|
10
|
P-logic: property verification for Haskell programs
– Richard B. Kieburtz
- 2002
|
|
36
|
Super-combinators: A new implementation method for applicative languages
– R Hughes
- 1982
|
|
17
|
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages
– David Sands
- 1997
|
|
55
|
Total Correctness by Local Improvement in the Transformation of Functional Programs
– David Sands
- 1996
|
|
23
|
Interprétation functionelle et élimination des coupures dans l’arithm étique d’ordre supérieure
– J Y Girard
- 1972
|
|
27
|
Eekelen. Concurrent Clean Language Report (version 2.0
– R Plasmeijer, M van
- 2001
|
