Combinatory Reduction Systems: introduction and survey (1993)

Cached

Download Links

by Jan Willem Klop , Vincent van Oostrom , Femke van Raamsdonk
Venue:THEORETICAL COMPUTER SCIENCE
Citations:84 - 9 self

Documents Related by Co-Citation

52 Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence – J Gallier, V Breazu-Tannen - 1989
249 Combinatory Reduction Systems – J W Klop - 1980
44 Inductive Data Type Systems – Frédéric Blanqui, Jean-pierre Jouannaud, Mitsuhiro Okada - 1997
24 Strong Normalizability for the Combined System of the Typed λ Calculus and an Arbitrary Convergent Term Rewrite System – M Okada - 1989
77 Confluence for Abstract and Higher-Order Rewriting – V van Oostrom - 1994
390 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
57 Combining Algebra and Higher-order Types – V Breazu-Tannen - 1988
65 Recursive Definition in Type Theory – P Mendler - 1987
33 Executable higher-order algebraic specification languages – J-P Jouannaud, M Okada - 1991
15 λ-calculi with conditional rules – M Takahashi
58 Une Théorie des Constructions Inductives – B Werner - 1994
63 Higher-order rewrite systems and their confluence – Richard Mayr - 1998
125 Higher-order critical pairs – T Nipkow - 1991
199 The Lambda Calculus: its Syntax and Semantics (revised ed – H P Barendregt - 1984
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
33 From oe to AE a journey through calculi of explicit substitutions – P Lescanne - 1994
39 A general Church-Rosser theorem – P Aczel - 1978