Author:
Robinson Edmund,Rosolini Giuseppe
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. S. Abramsky. Process realizability. Unpublished notes available at http://web.comlab.ox.ac.uk/oucl/work/samson.abramsky/pr209.ps.gz .
2. L. Birkedal. Developing theories of types and computability via realizability. Electronic Notes in Theoretical Computer Science, 34, 2000. Available at http://www.elsevier.nl/locate/entcs/volume34.html . The pdf version has active hyperreferences and is therefore the preferred version for reading online.
3. L. Birkedal. A general notion of realizability. In Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, June 2000. IEEE Computer Society.
4. L. Birkedal, A. Carboni, G. Rosolini, and D.S. Scott. Type theory via exact categories. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, pages 188–198, Indianapolis, Indiana, June 1998. IEEE Computer Society Press.
5. A. Carboni. Some free constructions in realizability and proof theory. Journal of Pure and Applied Algebra, 103:117–148, 1995.