Optimal reduction in weak-&lgr;-calculus with shared environments
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Confluence of Untyped Lambda Calculus via Simple Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Type-Theoretic Study on Partial Continuations
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A computationally adequate model for overloading via domain-valued functors
Mathematical Structures in Computer Science
Parametric parameter passing λ-calculus
Information and Computation
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A Framework for Defining Logical Frameworks
Electronic Notes in Theoretical Computer Science (ENTCS)
Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Expression reduction systems with patterns
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A Simplified Proof of the Church---Rosser Theorem
Studia Logica
| Hi-index | 0.00 |
The notion of parallel reduction is extracted from the Tait-Martin-Lof proof of the Church-Rosser theorem (for @b-reduction). We define parallel @b-, @h- and @b@h-reduction by induction, and use them to give simple proofs of some fundamental theorems in @l-calculus; the normal reduction theorem for @b-reduction, that for @b@h-reduction, the postponement theorem of @h-reduction (in @b@h-reduction), and some others.