Combinatory reduction systems: introduction and survey
Authors:
- Jan Willem KlopJKJan Willem Klop
- Vincent van OostromVOVincent van Oostrom
- Femke van RaamsdonkFRFemke van Raamsdonk
- 1 December 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 121 (1-2) , 279-308
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Confluence of the lambda calculus with left-linear algebraic rewritingInformation Processing Letters, 1992
- Sequential evaluation strategies for parallel-or and related reduction systemsAnnals of Pure and Applied Logic, 1989
- Parallel reductions in λ-calculusJournal of Symbolic Computation, 1989
- Unique normal forms for lambda calculus with surjective pairingInformation and Computation, 1989
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- Standard and normal reductionsTransactions of the American Mathematical Society, 1978
- LCF considered as a programming languageTheoretical Computer Science, 1977
- The equivalence of complete reductionsTransactions of the American Mathematical Society, 1977
- Pairing Without Conventional RestraintsMathematical Logic Quarterly, 1974