On modular properties of higher order extensional lambda calculi

DOI10.1007/3-540-63165-8_181zbMath1401.03040OpenAlexW1506077699MaRDI QIDQ4571956

Neil Ghani, Roberto Di Cosmo

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_181

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection type assignment systems with higher-order algebraic rewriting
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Polymorphic rewriting conserves algebraic strong normalization
• Adding algebraic rewriting to the untyped lambda calculus
• Polymorphic rewriting conserves algebraic confluence
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints
• Developing developments
• COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
• Modularity of strong normalization in the algebraic-λ-cube
• Modularity of termination and confluence in combinations of rewrite systems with λω
• The virtues of eta-expansion

This page was built for publication: On modular properties of higher order extensional lambda calculi