A second-order pattern matching algorithm for the cube of typed -calculi

DOI10.1007/3-540-54345-7_58MaRDI QIDQ4035236zbMATH OpenFDO

Authors Gilles Dowek

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54345-7_58

zbMATH Keywords

second-order-argument-restricted matchingtype system

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient second-order matching
• Logic for Programming, Artificial Intelligence, and Reasoning
• On the complexity of higher-order matching in the linear -calculus
• A typed pattern calculus
• scientific article; zbMATH DE number 29189

Cited in

(10)

• The undecidability of pattern matching in calculi where primitive recursive functions are representable
• On the undecidability of second-order unification
• Nominal syntax with atom substitutions
• scientific article; zbMATH DE number 29189 (Why is no real title available?)
• scientific article; zbMATH DE number 626035 (Why is no real title available?)
• On the complexity of higher-order matching in the linear -calculus
• Third-order matching in the polymorphic lambda calculus
• Efficient second-order matching
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Higher-order matching for program transformation

This page was built for publication: A second-order pattern matching algorithm for the cube of typed \(\lambda\)-calculi

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