Publications since 2001

2001

Martin Hyland and John Power. Two-dimensional linear algebra.
Electronic Notes in Theoretical Computer Science, 44(1), 2001, 227-240.

Martin Hyland and John Power. Pseudo-commutative Monads.
Electronic Notes in Theoretical Computer Science , 45, 2001, 197-208.

2002

J. M. E. Hyland. Variations on realizability: realizing the propositional axiom of choice.
Mathematical Structures in Computer Science 12, 2002, 295-317.

J. M. E. Hyland. Proof theory in the abstract.
Annals of Pure and Applied Logic 114, 2002, 43-78.

Martin Hyland and Andrea Schalk Games on Graphs and Sequentially Realizable Functionals. Extended Abstract.
In: Proceedings of 17th IEEE Symposium on Logic in Computer Science, IEEE Computer Science Press, 2002, 257-264.

Martin Hyland and John Power. Pseudo-commutative monads and pseudo-closed 2-categories.
Journal of Pure and Applied Algebra 175, 2002, 141-185.

Martin Hyland, Gordon Plotkin and John Power. Combining Computational Effects: Commutativity and Sum.
In R. A. Baeza-Yates, Ugo Montanari, Nicola Santoro (editors). Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress / 2nd IFIP International Conference on Theoretical Computer Science, IFIP Conference Proceedings 223, Kluwer 2002, 474-484.
This is superseded by the 2006 journal paper Combining Effects: Sum and Tensor.

Nick Benton and Martin Hyland. Traced Premonoidal Categories (extended abstract).
In Z. Esik and A. Ingolfsdottir (editors). Fixed Points in Computer Science, FICS 2002. BRICS Note Series NS-02-2, 2002, 12-19.
This is superseded by the 2003 journal version with the same name.

Claudia Faggian and Martin Hyland Designs, Disputes and Strategies.
In J. Bradfield (editor). Computer Science Logic, Lecture Notes in Computer Science 2471, Springer, 2002, 242-257.

2003

Martin Hyland and Andrea Schalk. Glueing and orthogonality for models of linear logic.
Theoretical computer Science 294(1-2), 2003, 183-231.

Eugenia Cheng, Martin Hyland and John Power. Pseudo-distributive laws.
In S.Brooks and P. Panangadan (editors). Proceedings of Mathematical Foundations of Programming Semantics, Theoretical Computer Science, 83, 2003, 12 pages.

Nick Benton and Martin Hyland. Traced Premonoidal Categories.
Theoretical Informatics and Applications, 37, 2003, 273-299.
This is a prepublication version.

2004

Martin Hyland, Paul Blain Levy, Gordon Plotkin and John Power Combining continuations with other effects
In H. Thielecke (editor). Proceedings of the 4th ACM SIGPLAN Continuations Workshop. Online proceedings.
This is superseded by the 2007 journal paper Combining Algebraic Effects with Continuations.

Martin Hyland and John Power. Symmetric Monoidal Sketches and Categories of Wirings.
In T. Hildebrandt, A. Kurz, E. Goubault and U. Fahrenberg (editors) Proceedings of CONCUR 2003, CMCIM and GETCO,
Electronic Notes in Theoretical Computer Science 100, (2004), 31-46.

Nicola Gambino and Martin Hyland. Well-founded Trees and Dependent Polynomial Functors.
In S. Berardi, M. Coppo and F. Damiani (editors). Types for Proofs and Programs (TYPES 2003), Lecture Notes in Computer Science 3085, (2004), 210-225.

Martin Hyland. Abstract Interpretation of Proofs: Classical Propositional Calculus.
In J. Marcinkowski and A. Tarlecki (editors). Computer Science Logic (CSL 2004), Lecture Notes in Computer Science 3210, 2004, 6-21.

2006

Martin Hyland, Gordon Plotkin and John Power. Combining Effects: Sum and Tensor
Theoretical Computer Science, 357, 2006, 70-99.
This is the journal version of Combining Computational Effects: Commutativity and Sum.

Gianluigi Bellin, Martin Hyland, Edmund Robinson and Christian Urban. Categorical proof theory of classical propositional calculus
Theoretical Computer Science, 364(2), 2006, 146-165.

Martin Hyland, and John Power. Discrete Lawvere Theories and Computational Effects
Theoretical Computer Science, 366(1-2), 2006, 144-162.

Martin Hyland, Misao Nagayama, John Power and Giuseppe Rosolini. A Category Theoretic Formulation for Engeler-style Models of the Untyped Lambda Calculus.
In L. Cardelli, M. Fiore and G. Winskel (editors). Computation, Meaning and Logic. Articles Dedicated to Gordon Plotkin.
Electronic Notes in Theoretical Computer Science 161, 2006, 43-57.

2007

Martin Hyland, Paul Blain Levy, Gordon Plotkin and John Power Combining Algebraic Effects with Continuations.
In O. Danvy, P. O'Hearn and P. Wadler (editors). Festschrift for John C. Reynolds's 70th birthday. Theoretical Computer Science, 375, 2007, 20-40.
This is the journal version of the earlier Combining Continuations with other Effects.

Martin Hyland and John Power. The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads.
In L. Cardelli, M. Fiore and G. Winskel (editors). Computation, Meaning and Logic. Articles Dedicated to Gordon Plotkin.
Electronic Notes in Theoretical Computer Science 172, 2007, 437-458.

Russ Harmer, Martin Hyland and Paul-Andre Mellies. Categorical Combinatorics for Innocent Strategies.
In Proceedings of 22nd IEEE Symposium on Logic in Computer Science, IEEE Computer Society, 2007, 379-388.
This paper accompanies an Invited Talk at the joint LICS/ASL session in Wroclaw. The slides from the talk give a different take on the material.

2008

  • Martin Hyland. Abstract and Concrete Models for Recursion.
    In O. Grumberg, T. Nipkow and C. Pfaller (editors). Formal and Logical methods for System Security and Correctness IOS Press, 2008, 175-197.
    I hope to expand this compressed, incomplete and at times misleading account. Another view at least with better pictures is in the slides from the meeting. The (not quite trivial) typical small finite automaton is the same in both accounts!

    Marcelo Fiore, Nicola Gambino, Martin Hyland and Glynn Winskel. The cartesian closed bicategory of generalised species of structures.
    Journal of the London Mathematical Society, 77, 2008, 203-220.

    2010

    Martin Hyland. Some Reasons for Generalising Domain Theory.
    Mathematical Structures in Computer Science 20, 2010, 239-265.