Martin Hyland

Affiliations:
  • University of Cambridge, UK


According to our database1, Martin Hyland authored at least 47 papers between 1975 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Monoidal bicategories, differential linear logic, and analytic functors.
CoRR, 2024

2020
The linear-non-linear substitution 2-monad.
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

2018
The True Concurrency of Herbrand's Theorem.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
Classical lambda calculus in modern dress.
Math. Struct. Comput. Sci., 2017

Foreword for special issue of APAL for GaLoP 2013.
Ann. Pure Appl. Log., 2017

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

2014
Elements of a theory of algebraic theories.
Theor. Comput. Sci., 2014

Turing Centenary Conference: How the World Computes.
Ann. Pure Appl. Log., 2014

2013
Towards a Notion of Lambda Monoid.
Proceedings of the Workshop on Algebra, Coalgebra and Topology, 2013

2012
Computability in Europe 2010.
Ann. Pure Appl. Log., 2012

2011
Foreword - Special Issue Dedicated to the Memory of Professor Gregory Maxwell Kelly.
Appl. Categorical Struct., 2011

2010
Some reasons for generalising domain theory.
Math. Struct. Comput. Sci., 2010

2007
Combining algebraic effects with continuations.
Theor. Comput. Sci., 2007

The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Categorical Combinatorics for Innocent Strategies.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

The Ackermann Award 2007.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Combining effects: Sum and tensor.
Theor. Comput. Sci., 2006

Discrete Lawvere theories and computational effects.
Theor. Comput. Sci., 2006

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

2004
A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda.
Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2004

Abstract Interpretation of Proofs: Classical Propositional Calculus.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Glueing and orthogonality for models of linear logic.
Theor. Comput. Sci., 2003

Traced Premonoidal Categories.
RAIRO Theor. Informatics Appl., 2003

Symmetric Monoidal Sketches and Categories of Wirings.
Proceedings of the Combined Proceedings of the Second Workshop on Categorical Methods for Concurrency, 2003

Wellfounded Trees and Dependent Polynomial Functors.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

Pseudo-distributive Laws.
Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

2002
Variations on Realizability: Realizing the Propositional Axiom of Choice.
Math. Struct. Comput. Sci., 2002

Proof theory in the abstract.
Ann. Pure Appl. Log., 2002

Games on Graphs and Sequentially Realizable Functionals.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Combining Computational Effects: commutativity & sum.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Traced pre-monoidal categories.
Proceedings of the Fixed Points in Computer Science, 2002

Designs, Disputes and Strategies.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Two-dimensional linear algebra.
Proceedings of the Coalgebraic Methods in Computer Science, 2001

Pseudo-commutative Monads.
Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

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

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

1999
Abstract Games for Linear Logic.
Proceedings of the Conference on Category Theory and Computer Science, 1999

Variations on Realizability: Simple examples realizing axioms of choice.
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.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

The S-Replete Constuction.
Proceedings of the Category Theory and Computer Science, 6th International Conference, 1995

1993
Full Intuitionistic Linear Logic (extended abstract).
Ann. Pure Appl. Log., 1993

Modified Realizability Toposes and Strong Normalization Proofs.
Proceedings of the Typed Lambda Calculi and Applications, 1993

A Term Calculus for Intuitionistic Linear Logic.
Proceedings of the Typed Lambda Calculi and Applications, 1993

1992
Linear Lambda-Calculus and Categorial Models Revisited.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

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

1988
A small complete category.
Ann. Pure Appl. Log., 1988

1975
A survey of some useful partial order relations on terms of the lambda calculus.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975


  Loading...