Subject
General Computer Science,Theoretical Computer Science
Reference57 articles.
1. The lazy lambda calculus;Abramsky,1990
2. Domain theory in logical form;Abramsky;Ann. Pure Appl. Logic,1991
3. Non-Well-Founded Sets;Aczel,1988
4. Simple consequence relations;Avron;Inform. and Comput.,1991
5. Ω can be anything it shouldn't be;Baeten;Indag. Math.,1979
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The theory of call-by-value solvability;Proceedings of the ACM on Programming Languages;2022-08-29
2. Residuated Structures and Orthomodular Lattices;Studia Logica;2021-04-17
3. Intuitionistic fixed point logic;Annals of Pure and Applied Logic;2021-03
4. α β-Relations and the Actual Meaning of α-Renaming;ACM Transactions on Computational Logic;2021-01-22
5. Programming language foundations in Agda;Science of Computer Programming;2020-08