Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. S. Abramsky, K. Honda, and G. McCusker. A fully abstract game semantics for general references. In13th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998.
2. S. Abramsky and G. McCusker. Linearity, Sharing and State: a Fully Abstract Game Semantics for Idealized Algol with active expressions, 1997. S. Abramsky and G. McCusker. Call-by-value games. In Mogens Nielsen and Wolfgang Thomas, editors,6th Annual Conference of the European Association for Computer Science Logic, volume 1414 ofLecture Notes in Computer Science. Springer, 1998.
3. F. Atanassow and J. Jeuring. Inferring type isomorphisms generically. In Dexter Kozen and Carron Shankland, editors,MPC, volume 3125 ofLecture Notes in Computer Science, pages 32-53. Springer, 2004.
4. G. Barthe and O. Pons. Type isomorphisms and proof reuse in dependent type theory. In Furio Honsell and Marino Miculan, editors,FoSSaCS, volume 2030 ofLecture Notes in Computer Science, pages 57-71. Springer, 2001.
5. Sequential algorithms on concrete data structures
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deconstructing General References via Game Semantics;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. Automorphisms of types in certain type theories and representation of finite groups;Mathematical Structures in Computer Science;2018-05-23
3. Foundations of dependent interoperability;Journal of Functional Programming;2018