|
5
|
Types and Computations in Lambda Calculi and Graph Rewrite Systems
– E Barendsen
- 1995
|
|
7
|
Fundamental Properties of Innite Trees
– B Courcelle
- 1983
|
|
2
|
calculs de substitutions explicites comme fondement de l'implantation des langages fonctionnels
– Les
- 1997
|
|
1
|
Final specication of Dactl
– J R W Glauert, J R Kennaway, M R Sleep
- 1989
|
|
2
|
de Vries. Transnite reductions in orthogonal term rewriting systems
– J R Kennaway, J W Klop, M R Sleep, F J
- 1995
|
|
1
|
A Framework for Dening Object Calculi
– F Lang, P Lescanne, L Liquori
- 1999
|
|
15
|
From � � to �¡ : a journey through calculi of explicit substitutions
– P Lescanne
- 1994
|
|
25
|
Explicit substitution — tutorial & survey
– Kristoffer H Rose
- 1996
|
|
104
|
Type inference for polymorphic references
– M Tofte
- 1990
|
|
35
|
D.P.: A syntactic theory of sequential state
– M Felleisen, Friedman
- 1989
|
|
24
|
Operational Reduction Models for Functional Programming Languages
– Kristoffer Høgsbro Rose
- 1996
|
|
27
|
Modeling Sharing and Recursion for Weak Reduction Strategies using Explicit Substitution
– Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer H. Rose, Inria Lorraine
- 1996
|
|
74
|
Co-induction in relational semantics
– Robin Milner, Mads Tofte
- 1991
|
|
161
|
A Lambda Calculus of Objects and Method Specialization
– Kathleen Fisher, Computer Science Dept, Furio Honsell, John C. Mitchell
- 1994
|
|
62
|
Equational term graph rewriting
– Zena M. Ariola, Jan Willem Klop
- 1996
|
|
58
|
Term Graph Rewriting
– Detlef Plump
- 1998
|
|
102
|
Parallel implementations of functional programming languages
– Simon L Peyton-Jones
- 1989
|
|
550
|
Term Rewriting Systems
– J. W. Klop
- 1992
|
|
723
|
Inductive-Data-Type Systems
– Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada
- 2002
|
