Edmund Robinson

Selected Publications

• David J. Pym, Eike Ritter, and Edmund Robinson. A proof-theoretic analysis of the classical propositional matrix method. page ??, 2012. submitted.
• Matthew Collinson, David Pym, and Edmund Robinson. On bunched polymorphism. Springer Lecture Notes in Computer Science, Volume 3634, Proceedings of Computer Science Logic 2005, pages 36-50.
• Gianluigi Bellin,Martin Hyland,Edmund Robinson,and Christian Urban. Categorical proof theory of classical propositional calculus. Theoretical Computer Science, Volume 364, Issue 2, 6 November 2006, Pages 146-165
• Edmund Robinson. Proof nets for classical logic. J. Logic Comput., 13(5):777– 797, 2003. Special issue: Semantic foundations of proof-search.
• E.P. Robinson. Variations on algebra: Monadicity and generalisations of equational theories. Formal Aspects of Computing, 13(3-5):308–326, 2002. in the Festschrift for Prof RM Burstall.
• Edmund Robinson and Giuseppe Rosolini. An abstract look at realizability. In Computer science logic (Paris, 2001), volume 2142 of Lecture Notes in Comput. Sci., pages 173–187. Springer, Berlin, 2001.
• A.J. Power and E.P. Robinson. Logical relations, data abstraction and structured fibrations. In Maurizio Gabrielli and Frank Pfenning, editors, Proceedings of the Second International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDPʼ00), pages 15–23. ACM Press, 2000.
• John Power and Edmund Robinson. Logical relations and data abstraction. In Peter Clote and Helmut Schwichtenberg, editors, Computer Science Logic (Fischbachau, 2000), volume 1862 of Lecture Notes in Comput. Sci., pages 497–511. Springer, Berlin, 2000.
• John Power and Edmund Robinson. Modularity and dyads. In MFPS XV: Mathematical Foundations of Programming Semantics, Fifteenth Conference (New Orleans, LA, 1999), volume 20 of Electron. Notes Theor. Comput. Sci., page 14 pp. (electronic). Elsevier, Amsterdam, 1999.
• John Power and Edmund Robinson. Premonoidal categories and notions of computation.Math. Structures Comput. Sci., 7(5):453–468, 1997. Logic, domains, and programming languages (Darmstadt, 1995).
• E.P. Robinson. Logical relations and data abstraction. In V. De Paiva and A. Jung, editors, Proceedings of Logic and Semantics For Programming, pages 56–65. Birmingham University, 1996.