Expression reduction systems with patterns

DOI10.1007/S10817-007-9083-0zbMATH Open1132.68429OpenAlexW2074000437MaRDI QIDQ2467565FDOQ2467565

Authors: Julien Forest, Delia Kesner 

Publication date: 22 January 2008

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-007-9083-0

Recommendations

• scientific article; zbMATH DE number 2043524
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Higher-order rewrite systems and their confluence
• scientific article; zbMATH DE number 4208054
• Pure patterns type systems

zbMATH Keywords

Pattern matchingHigher-order rewritingExpression reduction systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Combinatory reduction systems: Introduction and survey
• Term Rewriting and All That
• Title not available (Why is that?)
• Parallel reductions in \(\lambda\)-calculus
• Programming Languages and Systems
• Inductive-data-type systems
• Lambda calculus with patterns
• Title not available (Why is that?)
• The rewriting calculus. II
• Title not available (Why is that?)
• Pattern matching as cut elimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A typed pattern calculus
• Title not available (Why is that?)

Cited In (2)

• Processes, Terms and Cycles: Steps on the Road to Infinity
• Title not available (Why is that?)

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)