Rewriting with extensional polymorphic -calculus

DOI10.1007/3-540-61377-3_40zbMATH Open1540.03032MaRDI QIDQ6560170FDOQ6560170

Authors: Roberto Di Cosmo, Delia Kesner 

Publication date: 21 June 2024

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
• The virtues of eta-expansion
• Polymorphic rewriting conserves algebraic confluence
• Title not available (Why is that?)
• Title not available (Why is that?)

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)