Lambda calculus with patterns

Authors:
Jan Willem Klop;Vincent van Oostrom;Roel de Vrijer
Affiliations:
Vrije Universiteit, Department of Theoretical Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands and Radboud Universiteit Nijmegen, Department of Computer Science, Toernooive ...;Universiteit Utrecht, Department of Philosophy, Heidelberglaan 8, 3584 CS Utrecht, The Netherlands;Vrije Universiteit, Department of Theoretical Computer Science, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
Venue:
Theoretical Computer Science
Year:
2008

Citing 9
Cited 3

Term-rewriting systems with rule priorities

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Pure patterns type systems

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Unique Normal Form Property of Higher-Order Rewriting Systems

ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
The pattern calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
A Framework for Defining Logical Frameworks

Electronic Notes in Theoretical Computer Science (ENTCS)
The rewriting calculus as a combinatory reduction system

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Pure pattern calculus

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

First-class patterns

Journal of Functional Programming
Optimality for dynamic patterns

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Sharing in the graph rewriting calculus

WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we revisit the @l-calculus with patterns, originating from the practice of functional programming language design. We treat this feature in a framework ranging from pure @l-calculus to orthogonal combinatory reduction systems.