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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 7; číslo POPL; s. 218 - 248
Hlavní autori:	Kerinec, Axel, Manzonetto, Giulio, Olimpieri, Federico
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 09.01.2023
Predmet:	Categorical semantics Lambda calculus Theory of computation Intersection Types Approximation Theorem Lambda calculus Distributors
ISSN:	2475-1421, 2475-1421
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!