Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. In: Theoretical Aspects of Computer Software, pp. 1–15 (1994)
2. Lecture Notes in Computer Science;P. Baillot,1998
3. Berry, G., Curien, P.-L.: Sequential algorithms on concrete data structures. Theoretical Computer Science 20, 265–321 (1982)
4. Lecture Notes in Computer Science;G.M. Bierman,1995
5. Boudes, P.: Non uniform hypercoherences. In: Blute, R., Selinger, P. (eds.) Electronic Notes in Theoretical Computer Science, vol. 69, Elsevier, Amsterdam (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Tale of Additives and Concurrency in Game Semantics;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. Plays as Resource Terms via Non-idempotent Intersection Types;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05
3. Non-uniform (hyper/multi)coherence spaces;Mathematical Structures in Computer Science;2010-11-01
4. Thick Subtrees, Games and Experiments;Lecture Notes in Computer Science;2009