Theoretical Computer Science
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Reasoning about programs in continuation-passing style.
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
An equivalence between lambda-terms
Theoretical Computer Science
The Conservation Theorem revisited
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Monadic Translation of Intuitionistic Sequent Calculus
Types for Proofs and Programs
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A short proof that adding some permutation rules to β preserves SN
Theoretical Computer Science
Note: A note on preservation of strong normalisation in the λ-calculus
Theoretical Computer Science
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce the permutative λ-calculus, an extension of λ-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier's sigma-equivalence and Moggi's assoc-equivalence. We prove confluence modulo the equations and preservation of beta-strong normalisation (PSN) by means of an auxiliary substitution calculus. The proof of confluence relies on M-developments, a new notion of development for λ-terms.