Subject
General Computer Science,Theoretical Computer Science
Reference29 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. F. Alessi. Structure di tipi, teoria dei domini e modelli del lambda calcolo. PhD thesis, Torino University, 1991.
4. F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. Filter models and easy terms. In A. Restivo, S. Ronchi della Rocca, and L. Roversi, editors, Mathematical Foundations of Computer Science 2000, volume 2202 of Lecture Notes in Comput. Sci., pages 17–37. Springer, 2001.
5. ω can be anything it shouldn't be;Baeten;Indag. Math,1979
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 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
2. A Finite Model Property for Intersection Types;Electronic Proceedings in Theoretical Computer Science;2015-03-17