Prof Edmund Robinson

Edmund Robinson

Professor of Computer Science
Head of The Centre for Fundamental Computer Science

School of Electronic Engineering and Computer Science
Queen Mary University of London

Research

Logic, Category Theory, Semantics

Publications

solid heart iconPublications of specific relevance to the Centre for Fundamental Computer Science

2024

bullet iconPym D, Ritter E and Robinson E (2024). Categorical Proof-theoretic Semantics. Studia Logica, Springer Nature, 1-38.  
03-05-2024

2022

Relevant PublicationRobinson E, Hermida C, Reddy U and Sanatamaria A (2022). Bisimulation as a logical relation., Editors: Hasegawa M. Mathematical Structures in Computer Science, Cambridge University Press (CUP) 
12-04-2022

2020

Relevant PublicationAndrew L-S, Oliva P and Robinson E (2020). Kripke Semantics for Intuitionistic Lukasiewicz Logic. Studia Logica: an international journal for symbolic logic, Springer Verlag 
21-04-2020

2019

Relevant PublicationHermida C, Reddy US and Robinson EP (2019). Deriving Logical Relations from Interpretations of Predicate Logic. Electronic Notes in Theoretical Computer Science, Elsevier vol. 347, 241-259.  
01-11-2019

2014

bullet iconHermida C, Reddy US and Robinson EP (2014). Logical Relations and Parametricity – A Reynolds Programme for Category Theory and Programming Languages. Electronic Notes in Theoretical Computer Science, Elsevier vol. 303, 149-180.  
19-03-2014

2012

bullet iconROBINSON EP, Pym DJ and Ritter E (2012). A Proof-theoretic Analysis of the Classical Propositional Matrix Method., Editors: Avron A. Journal of Logic and Computation 
01-01-2012

2008

bullet iconCollinson M, Pym D and Robinson E (2008). Bunched polymorphism. MATH STRUCT COMP SCI vol. 18 (6), 1091-1132.  
01-12-2008

2006

bullet iconBellin G, Hyland M, Robinson E and Urban C (2006). Categorical proof theory of classical propositional calculus. THEORETICAL COMPUTER SCIENCE vol. 364 (2), 146-165.  
06-11-2006

2005

bullet iconCollinson M, Pym D and Robinson E (2005). On bunched polyrnorphism., Editors: Ong L. 
01-01-2005
bullet iconCollinson M, Pym D and Robinson E (2005). On Bunched Polymorphism. Computer Science Logic  36-50.  
01-01-2005

2003

bullet iconRobinson E (2003). Proof nets for classical logic. JOURNAL OF LOGIC AND COMPUTATION vol. 13 (5), 777-797.  
01-10-2003

2002

bullet iconROBINSON EP (2002). Variations on Algebra: Monadicity and Generalisations of Equational Theories. Formal Aspects of Computing vol. 13 (3-5), 308-326.  
01-07-2002

2001

bullet iconROBINSON EP and Rosolini G (2001). An abstract look at realizability. 
01-01-2001

2000

bullet iconPower AJ and Robinson EP (2000). Logical Relations and Data Abstraction., Editors: Clote P and Schwichtenberg H. 
01-01-2000
bullet iconPower AJ and Robinson EP (2000). Logical Relations, Data Abstraction and Structured Fibrations., Editors: Gabrielli M and Pfenning F. 
01-01-2000

1999

bullet iconPower J and Robinson E (1999). Modularity and Dyads. Electronic Notes in Theoretical Computer Science vol. 20, 14pp-14pp.  
01-01-1999

1997

bullet iconPower J and Robinson E (1997). Premonoidal categories and notions of computation. Mathematical Structures in Computer Science vol. 7, 453-468-453-468.  
01-01-1997

1996

bullet iconRobinson EP (1996). Logical Relations and Data Abstraction., Editors: Paiva VD and Jung A. 
01-01-1996

1994

bullet iconRobinson EP and Rosolini G (1994). Reflexive Graphs and Parametric Polymorphism., Editors: Abramsky S. 
01-01-1994
bullet iconRobinson E (1994). Parametricity as isomorphism. Theoretical Computer Science vol. 136, 163-181-163-181.  
01-01-1994

1992

bullet iconFreyd PJ, Robinson EP and Rosolini G (1992). Dinaturality for free., Editors: Fourman MP, Johnstone PT and Pitts AM. 
01-01-1992
bullet iconFreyd PJ, Robinson EP and Rosolini G (1992). Functorial Parametricity., Editors: Scedrov A. 
01-01-1992

1991

bullet iconPower AJ and Robinson EP (1991). A characterization of pie limits. Mathematical Proceedings of the Cambridge Philosophical Society vol. 110, 33-47-33-47.  
01-01-1991

1990

bullet iconRobinson EP and Rosolini G (1990). Colimit completions and the effective topos. Journal of Symbolic Logic vol. 55, 678-699-678-699.  
01-06-1990
bullet iconRobinson EP and Rosolini G (1990). Polymorphism, set theory and call-by-value., Editors: Mitchell JC. 
01-01-1990
bullet iconHyland JME, Robinson EP and Rosolini G (1990). Algebraic types in PER models., Editors: Main M, Melton A, Mislove M and Schmidt D. 
01-01-1990
bullet iconHyland JME, Robinson EP and Rosolini G (1990). The discrete objects in the effective topos. Proceedings of the London Mathematical Society vol. 60, 1-36-1-36.  
01-01-1990

1989

bullet iconRobinson EP (1989). How complete is PER?, Editors: Meyer A. 
01-01-1989
bullet iconJohnstone PT and Robinson EP (1989). A note on inequivalence of realizability toposes. Mathematical Proceedings of the Cambridge Philosophical Society vol. 105, 1-3-1-3.  
01-01-1989
bullet iconBlevis E, Jenkins MA and Robinson EP (1989). On Seeger’s Music Logic. Interface: Journal of New Music Research vol. 18, 9-31-9-31.  
01-01-1989
bullet iconJohnstone PT and Robinson EP (1989). Mathematical Proceedings of the Cambridge Philosophical Society. Mathematical Proceedings of the Cambridge Philosophical Society vol. 105 (1), 1-3.  
01-01-1989

1988

bullet iconRobinson EP and Rosolini G (1988). Categories of partial maps. Information and Computation vol. 79, 95-130-95-130.  
01-01-1988

1987

bullet iconRobinson EP (1987). Logical aspects of denotational semantics., Editors: Pitt DH, Poigné A and Rydeheard DE. 
01-01-1987
bullet iconRobinson EP (1987). The geometric theory of p-adic fields. Journal of Algebra vol. 110, 158-172-158-172.  
01-01-1987
bullet iconRobinson EP and Rosolini G (1987). Two internal complete full subcategories of the effective topos. Abstracts of the American Mathematical Society vol. 8, 464-465-464-465.  
01-01-1987

1986

bullet iconRobinson EP (1986). The p-adic spectrum. Journal of Pure and Applied Algebra vol. 40, 281-296-281-296.  
01-01-1986
bullet iconRobinson EP (1986). Powerdomains, modalities and the Vietoris monad. 
01-01-1986

1983

bullet iconRobinson EP (1983). Stable theories of local rings., Editors: Kock A. 
01-01-1983

1982

bullet iconRobinson EP (1982). Recovering the Zariski spectrum from the étale., Editors: Mulvey CJ. 
01-01-1982

Grants

solid heart iconGrants of specific relevance to the Centre for Fundamental Computer Science
solid heart iconOfS Data Science & AI competition
Edmund Robinson
£322,127 Office for Students (14-05-2020 - 13-02-2023)
solid heart iconInterface reasoning for interacting systems (IRIS)
Edmund Robinson
£869,078 EPSRC Engineering and Physical Sciences Research Council (01-01-2018 - 31-12-2024)