From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Normalization for Typed Lambda Calculi with Explicit Substitution
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Pattern Matching as Cut Elimination
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource operators for λ-calculus
Information and Computation
Expression reduction systems with patterns
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
In this paper we propose aWeak Lambda Calculus called 驴Pw having explicit operators for Pattern Matching and Substitution. This formalism is able to specify functions defined by cases via pattern matching constructors as done by most modern functional programming languages such as OCAML.We show the main property enjoyed by 驴Pw, namely subject reduction, confluence and strong normalization.