Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference59 articles.
1. Full abstraction for PCF;Abramsky;Inform. Comput.,2000
2. Domains and Lambda-Calculi, Vol. 46 of Cambridge Tracts in Theoretical Computer Science;Amadio,1998
3. Stability and computability in coherent domains;Asperti;Inform. Comput.,1990
4. Stable models of typed λ-calculi;Berry,1978
5. Sequential algorithms on concrete data structures;Berry;Theor. Comput. Sci.,1982
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum Programming Made Easy;Electronic Proceedings in Theoretical Computer Science;2019-04-15
2. QPCF: Higher-Order Languages and Quantum Circuits;Journal of Automated Reasoning;2019-03-13
3. On the characterization of models of H*;Logical Methods in Computer Science;2016-04-27
4. On the reification of semantic linearity;Mathematical Structures in Computer Science;2014-11-10
5. On the characterization of models of
H;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14