Rewriting with extensional polymorphic -calculus

DOI10.1007/3-540-61377-3_40MaRDI QIDQ6560170zbMATH OpenFDO

Authors Roberto Di Cosmo, Delia Kesner

Publication date 21 June 2024

Full work available at URL https://doi.org/10.1007/3-540-61377-3_40

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2185658
• A confluent reduction for the extensional typed -calculus with pairs, sums, recursion and terminal object
• Simulating expansions without expansions
• Extensional Rewriting with Sums
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS

Cites work

• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
• scientific article; zbMATH DE number 2185658 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• scientific article; zbMATH DE number 176742 (Why is no real title available?)
• scientific article; zbMATH DE number 512797 (Why is no real title available?)
• Polymorphic rewriting conserves algebraic confluence
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The virtues of eta-expansion

This page was built for publication: Rewriting with extensional polymorphic \(\lambda \)-calculus

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