The involutions-as-principal types/application-as-unification analogy

DOI10.29007/NTWGzbMATH Open1416.03009OpenAlexW2907463927MaRDI QIDQ5222959FDOQ5222959

Authors: Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/ntwg

Recommendations

• Reversible combinatory logic
• On reversible combinatory logic
• Reversible, irreversible and optimal \(\lambda\)-machines
• Linear realizability and full completeness for typed lambda-calculi
• On principal types of combinators

zbMATH Keywords

geometry of interactionlambda calculusgamesreversible computations

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (1)

• lambda!-calculus, Intersection Types, and Involutions

This page was built for publication: The involutions-as-principal types/application-as-unification analogy

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