Subject
General Computer Science,Theoretical Computer Science
Reference115 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, Sistemi di informazione applicativi, teoria dei domini e modelli del λ_calculo, Tesi di Dottorato di Ricerca in Informatica, Università di Milano e Torino, 1990.
4. F. Alessi, Type preorders, Trees in Algebra and Programming, CAAP’94 (Edinburg), Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, 1994, pp. 37–51.
5. Can programming be liberated from the von Neumann style?, A functional Style and its algebra of programs;Backus;Comm. ACM (Association of Computing Machinery),1978
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Genericity Through Stratification;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Why Are Proofs Relevant in Proof-Relevant Models?;Proceedings of the ACM on Programming Languages;2023-01-09
3. α β-Relations and the Actual Meaning of α-Renaming;ACM Transactions on Computational Logic;2021-01-22
4. A general approach to define binders using matching logic;Proceedings of the ACM on Programming Languages;2020-08-02
5. RELATIONAL GRAPH MODELS AT WORK;LOG METH COMPUT SCI;2018