Abstract
The multiset-based relational model of linear logic induces a semantics of the untyped λ-calculus, which corresponds with a non-idempotent intersection type system, System R. We prove that, in System R, the size of type derivations and the size of types are closely related to the execution time of λ-terms in a particular environment machine, Krivine's machine.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference33 articles.
1. Proof Nets and the λ-Calculus
2. de Carvalho D. (2007). Sémantiques de la logique linéaire et temps de calcul. PhD thesis, Université Aix-Marseille 2.
3. de Carvalho D. (2006). Execution time of lambda-terms via non-uniform semantics and intersection types. Preprint, Institut de Mathématiques de Luminy.
4. A call-by-name lambda-calculus machine
5. The lambda calculus is algebraic
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Analysis of Symmetry in Quantitative Semantics;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. The Relational Machine Calculus;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Higher Order Bayesian Networks, Exactly;Proceedings of the ACM on Programming Languages;2024-01-05
4. Monadic Intersection Types, Relationally;Lecture Notes in Computer Science;2024
5. Sharing a Perspective on the -Calculus;Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software;2023-10-18