Martin Hyland

According to our database, Martin Hyland authored at least 46 papers between 1975 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

The linear-non-linear substitution 2-monad.

Martin Hyland, Christine Tasson

Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

2018

The True Concurrency of Herbrand's Theorem.

Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

Classical lambda calculus in modern dress.

J. M. E. Hyland

Math. Struct. Comput. Sci., 2017

Foreword for special issue of APAL for GaLoP 2013.

Martin Hyland, Guy McCusker, Nikos Tzevelekos

Ann. Pure Appl. Log., 2017

2016

The Forgotten Turing.

J. M. E. Hyland

Proceedings of the Once and Future Turing: Computing the World, 2016

2014

Elements of a theory of algebraic theories.

J. M. E. Hyland

Theor. Comput. Sci., 2014

Turing Centenary Conference: How the World Computes.

S. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe

Ann. Pure Appl. Log., 2014

2013

Towards a Notion of Lambda Monoid.

Martin Hyland

Proceedings of the Workshop on Algebra, Coalgebra and Topology, 2013

2012

Computability in Europe 2010.

Fernando Ferreira, Martin Hyland, Benedikt Löwe, Elvira Mayordomo

Ann. Pure Appl. Log., 2012

2011

Foreword - Special Issue Dedicated to the Memory of Professor Gregory Maxwell Kelly.

George Janelidze, Martin Hyland, Michael Johnson, Peter T. Johnstone, Stephen Lack, Ross Street, Walter Tholen, Richard J. Wood

Appl. Categorical Struct., 2011

2010

Some reasons for generalising domain theory.

Martin Hyland

Math. Struct. Comput. Sci., 2010

2007

Combining algebraic effects with continuations.

Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power

Theor. Comput. Sci., 2007

The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads.

Martin Hyland, John Power

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Categorical Combinatorics for Innocent Strategies.

Russell Harmer, Martin Hyland, Paul-André Melliès

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

The Ackermann Award 2007.

Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Combining effects: Sum and tensor.

Martin Hyland, Gordon D. Plotkin, John Power

Theor. Comput. Sci., 2006

Discrete Lawvere theories and computational effects.

Martin Hyland, John Power

Theor. Comput. Sci., 2006

Categorical proof theory of classical propositional calculus.

Gianluigi Bellin, Martin Hyland, Edmund Robinson, Christian Urban

Theor. Comput. Sci., 2006

2004

A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda.

Martin Hyland, Misao Nagayama, John Power, Giuseppe Rosolini

Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2004

Abstract Interpretation of Proofs: Classical Propositional Calculus.

Martin Hyland

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Glueing and orthogonality for models of linear logic.

Martin Hyland, Andrea Schalk

Theor. Comput. Sci., 2003

Traced Premonoidal Categories.

Nick Benton, Martin Hyland

RAIRO Theor. Informatics Appl., 2003

Symmetric Monoidal Sketches and Categories of Wirings.

Martin Hyland, John Power

Proceedings of the Combined Proceedings of the Second Workshop on Categorical Methods for Concurrency, 2003

Wellfounded Trees and Dependent Polynomial Functors.

Nicola Gambino, Martin Hyland

Proceedings of the Types for Proofs and Programs, International Workshop, 2003

Pseudo-distributive Laws.

Eugenia Cheng, Martin Hyland, John Power

Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

2002

Variations on Realizability: Realizing the Propositional Axiom of Choice.

J. M. E. Hyland

Math. Struct. Comput. Sci., 2002

Proof theory in the abstract.

J. M. E. Hyland

Ann. Pure Appl. Log., 2002

Games on Graphs and Sequentially Realizable Functionals.

Martin Hyland, Andrea Schalk

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Combining Computational Effects: commutativity & sum.

Martin Hyland, Gordon D. Plotkin, John Power

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Traced pre-monoidal categories.

Nick Benton, Martin Hyland

Proceedings of the Fixed Points in Computer Science, 2002

Designs, Disputes and Strategies.

Claudia Faggian, Martin Hyland

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Two-dimensional linear algebra.

Martin Hyland, John Power

Proceedings of the Coalgebraic Methods in Computer Science, 2001

Pseudo-commutative Monads.

Martin Hyland, John Power

Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

2000

On Full Abstraction for PCF: I, II, and III.

J. M. E. Hyland, C.-H. Luke Ong

Inf. Comput., 2000

Symmetric monoidal sketches.

Martin Hyland, John Power

Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

1999

Abstract Games for Linear Logic.

Martin Hyland, Andrea Schalk

Proceedings of the Conference on Category Theory and Computer Science, 1999

Variations on Realizability: Simple examples realizing axioms of choice.

Martin Hyland

Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30, 1999

1995

Pi-Calculus, Dialogue Games and PCF.

J. M. E. Hyland, C.-H. Luke Ong

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

The S-Replete Constuction.

J. M. E. Hyland, Eugenio Moggi

Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1993

Full Intuitionistic Linear Logic (extended abstract).

Martin Hyland, Valeria de Paiva

Ann. Pure Appl. Log., 1993

Modified Realizability Toposes and Strong Normalization Proofs.

J. M. E. Hyland, C.-H. Luke Ong

Proceedings of the Typed Lambda Calculi and Applications, 1993

A Term Calculus for Intuitionistic Linear Logic.

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland

Proceedings of the Typed Lambda Calculi and Applications, 1993

1992

Linear Lambda-Calculus and Categorial Models Revisited.

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland

Proceedings of the Computer Science Logic, 6th Workshop, 1992

1989

Algebraic Types in PER Models.

J. M. E. Hyland, Edmund P. Robinson, Giuseppe Rosolini

Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

1988

A small complete category.

J. M. E. Hyland

Ann. Pure Appl. Log., 1988

1975

A survey of some useful partial order relations on terms of the lambda calculus.

J. M. E. Hyland

Proceedings of the Lambda-Calculus and Computer Science Theory, 1975