|
237
|
Combinatory Reduction Systems
– Jan-Willem Klop
- 1980
|
|
474
|
Lambda Calculi with Types
– Henk Barendregt, S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, H. P. Barendregt
- 1992
|
|
550
|
Term Rewriting Systems
– J. W. Klop
- 1992
|
|
26
|
The Conservation Theorem revisited
– Philippe de Groote
- 1993
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
75
|
Confluence for Abstract and Higher-Order Rewriting
– Vincent van Oostrom
- 1994
|
|
63
|
Some properties of conversion
– Alonzo Church, J B Rosser
|
|
41
|
Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types
– R P Nederpelt
- 1973
|
|
25
|
Une équivalence sur les lambda termes
– L Regnier
- 1994
|
|
18
|
Addendum to `New notions of reduction and non-semantic proofs of β-strong normalization in typed λ-calculi
– A. J. Kfoury, J. B. Wells
- 1995
|
|
38
|
T.: Orthogonal Higher-Order Rewrite Systems are Confluent
– Nipkow
- 1993
|
|
28
|
Description Abstraite des Systèmes de Réécriture. Thèse de doctorat
– Paul-André Melliès
- 1996
|
|
20
|
A useful -notation
– F Kamareddine, R P Nederpelt
- 1996
|
|
9
|
On weak and strong normalisations
– H Xi
- 1996
|
|
10
|
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
– Zurab Khasidashvili
- 1994
|
|
20
|
The Clausal Theory of Types, Cambridge Tracts
– D A Wolfram
- 1993
|
|
22
|
The Church-Rosser theorem in orthogonal combinatory reduction systems. Rapports de Recherche 1825, INRIA-Rocquencourt
– Zurab Khasidashvili
- 1992
|
|
23
|
Weak orthogonality implies confluence: the higher-order case
– V van Oostrom, F van Raamsdonk
- 1994
|
|
20
|
On Higher Order Recursive Program Schemes
– Zurab Khasidashvili
|
