Some lambda calculi with categorical sums and products

DOI10.1007/978-3-662-21551-7_12zbMath1503.03024OpenAlexW1593641477MaRDI QIDQ5055791

Daniel J. Dougherty

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_12

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (10)

Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) ⋮ On the power of simple diagrams ⋮ Combining algebraic rewriting, extensional lambda calculi, and fixpoints ⋮ Combining first order algebraic rewriting systems, recursion and extensional lambda calculi ⋮ Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves ⋮ Investigations on the dual calculus ⋮ Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions ⋮ Equality between functionals in the presence of coproducts ⋮ Strongly Typed Rewriting For Coupled Software Transformation ⋮ A Local Graph-rewriting System for Deciding Equality in Sum-product Theories

Cites Work

• On the implementation of abstract data types by programming language constructs
• Unique normal forms for lambda calculus with surjective pairing
• The lambda calculus, its syntax and semantics
• Embedding of a free cartesian-closed category into the category of sets
• Simulating expansions without expansions
• A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some lambda calculi with categorical sums and products