Expression reduction systems with patterns
From MaRDI portal
Publication:2467565
Recommendations
Cites work
- A de Bruijn notation for higher-order rewriting. (Extended abstract)
- A typed pattern calculus
- A weak calculus with explicit operators for pattern matching and substitution
- Combinatory reduction systems: Introduction and survey
- Expression reduction systems with patterns
- scientific article; zbMATH DE number 4208054 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- Inductive-data-type systems
- Lambda calculus with patterns
- On termination of higher-order rewriting
- Parallel reductions in \(\lambda\)-calculus
- Pattern matching as cut elimination
- Programming Languages and Systems
- Term Rewriting and All That
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The rewriting calculus. II
- Weak orthogonality implies confluence: The higher-order case
Cited in
(5)- scientific article; zbMATH DE number 4208054 (Why is no real title available?)
- scientific article; zbMATH DE number 1231495 (Why is no real title available?)
- scientific article; zbMATH DE number 1332635 (Why is no real title available?)
- Expression reduction systems with patterns
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Expression reduction systems with patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467565)