A weak calculus with explicit operators for pattern matching and substitution

DOI10.1007/3-540-45610-4_13MaRDI QIDQ4808746zbMATH OpenFDO

Authors Julien Forest

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2378/23780174.htm

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Pattern matching as cut elimination
• Lambda calculus with patterns
• Functional and Logic Programming
• A Lambda-Calculus with Constructors
• scientific article; zbMATH DE number 2186938

Cited in

(6)

• Pattern matching as cut elimination
• Expression reduction systems with patterns
• Star types: a type system for pattern calculus
• Pattern-based calculi with finitary matching
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Resource operators for \(\lambda\)-calculus

Describes a project that uses

Uses Software

• OCaml

This page was built for publication: A weak calculus with explicit operators for pattern matching and substitution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808746)