Author:
Paolini Luca,Piccolo Mauro,Ronchi Della Rocca Simona
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. The lazy lambda-calculus;Abramsky,1990
2. Domain theory in logical form;Abramsky;Annals of Pure and Applied Logic,1991
3. Full abstraction in the lazy lambda calculus;Abramsky;Information and Computation,1993
4. The Lambda Calculus: Its Syntax and Semantics;Barendregt,1984
5. A filter lambda model and the completeness of type assignment;Barendregt;The Journal of Symbolic Logic,1983
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A tale of intersection types;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
2. New Semantical Insights Into Call-by-Value λ-Calculus;Fundamenta Informaticae;2019-10-18
3. Call-by-Value, Elementary Time and Intersection Types;Foundational and Practical Aspects of Resource Analysis;2016
4. Essential and relational models;Mathematical Structures in Computer Science;2015-07-23
5. Minimal lambda-theories by ultraproducts;Electronic Proceedings in Theoretical Computer Science;2013-03-28