Author:
Dezani-Ciancaglini M.,Honsell F.,Motohama Y.
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Domain theory in logical form;Abramsky;Ann. Pure Appl. Logic,1991
2. Full abstraction in the lazy lambda calculus;Abramsky;Inform. and Comput.,1993
3. Domains and Lambda-Calculi;Amadio,1998
4. Complete restrictions of the intersection type discipline;van Bakel;Theoret. Comput. Sci.,1992
5. The Lambda Calculus: its Syntax and Semantics;Barendregt,1984
Cited by
17 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. Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types;Electronic Notes in Theoretical Computer Science;2019-08
3. Characterizing of Strong Normalization forΛμ-Calculus;Journal of Physics: Conference Series;2019-04
4. Characterizing Strongly Normalizing λGtz-terms via Non-Idempotent Intersection Types;Proceedings of the 3rd International Conference on Computer Science and Application Engineering - CSAE 2019;2019
5. Execution time of λ-terms via denotational semantics and intersection types;Mathematical Structures in Computer Science;2017-01-30