Edmund Robinson

Orcid: 0000-0002-3075-2217

Affiliations:
  • Queen Mary University of London, UK


According to our database1, Edmund Robinson authored at least 26 papers between 1987 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Categorical Proof-Theoretic Semantics.
CoRR, 2023

2022
Bisimulation as a logical relation.
Math. Struct. Comput. Sci., April, 2022

2021
Kripke Semantics for Intuitionistic Łukasiewicz Logic.
Stud Logica, 2021

2019
Deriving Logical Relations from Interpretations of Predicate Logic.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

2014
A proof-theoretic analysis of the classical propositional matrix method.
J. Log. Comput., 2014

Kohei Honda (1959-2012).
Bull. EATCS, 2014

2013
Logical Relations and Parametricity - A Reynolds Programme for Category Theory and Programming Languages.
Proceedings of the Workshop on Algebra, Coalgebra and Topology, 2013

2008
Bunched polymorphism.
Math. Struct. Comput. Sci., 2008

2007
Effective heuristics for the dynamic demand joint replenishment problem.
J. Oper. Res. Soc., 2007

2006
Categorical proof theory of classical propositional calculus.
Theor. Comput. Sci., 2006

2003
Proof Nets for Classical Logic.
J. Log. Comput., 2003

2002
Variations on Algebra: Monadicity and Generalisations of Equational Theories.
Formal Aspects Comput., 2002

2001
An Abstract Look at Realizability.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Logical relations, data abstraction, and structured fibrations.
Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

Logical Relations and Data Abstraction.
Proceedings of the Computer Science Logic, 2000

1999
Modularity and Dyads.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

1997
Premonoidal Categories and Notions of Computation.
Math. Struct. Comput. Sci., 1997

1994
Parametricity as Isomorphism.
Theor. Comput. Sci., 1994

Reflexive Graphs and Parametric Polymorphism
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1992
Functorial Parametricity
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1990
Colimit Completions and the Effective Topos.
J. Symb. Log., 1990

Polymorphism, Set Theory, and Call-by-Value
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989
Algebraic Types in PER Models.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

How Complete is PER?
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Categories of Partial Maps
Inf. Comput., November, 1988

1987
Logical Aspects of Denotational Semantics.
Proceedings of the Category Theory and Computer Science, 1987


  Loading...