Why Are Proofs Relevant in Proof-Relevant Models?

Relational models of λ-calculus can be presented as type systems, the relational interpretation of a λ-term being given by the set of its typings. Within a distributors-induced bicategorical semantics generalizing the relational one, we identify the class of ‘categorified’ graph models and show that...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 7; H. POPL; S. 218 - 248
Hauptverfasser:	Kerinec, Axel, Manzonetto, Giulio, Olimpieri, Federico
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 09.01.2023
Schlagworte:	Categorical semantics Lambda calculus Theory of computation Intersection Types Approximation Theorem Lambda calculus Distributors
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!