Author:
Dezani-Ciancaglini M.,Honsell F.,Motohama Y.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51(1–2):1–77, 1991.
2. S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Inform. and Comput., 105(2):159–267, 1993.
3. F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. A complete characterization of the complete intersection-type theories. In Proceedings in Informatics. ITRS’00 Workshop, Carleton-Scientific, 2000.
4. R. M. Amadio and P.-L. Curien. Domains and lambda-calculi. Cambridge University Press, Cambridge, 1998.
5. S. van Bakel. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci., 102(1):135–163, 1992.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types;Foundations of Software Science and Computational Structures;2011
2. Simple Easy Terms;Electronic Notes in Theoretical Computer Science;2003-02
3. Two Behavioural Lambda Models;Lecture Notes in Computer Science;2003
4. Characterising Strong Normalisation for Explicit Substitutions;LATIN 2002: Theoretical Informatics;2002
5. Infinite Intersection and Union Types for the Lazy Lambda Calculus;Lecture Notes in Computer Science;2001