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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of ACM on programming languages Vol. 7; no. POPL; pp. 218 - 248
Main Authors: Kerinec, Axel, Manzonetto, Giulio, Olimpieri, Federico
Format: Journal Article
Language:English
Published: New York, NY, USA ACM 09.01.2023
Subjects:
ISSN:2475-1421, 2475-1421
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first