A survey of some useful partial order relations on terms of the lambda calculus. - J. M. E. Hyland (Lambda-Calculus and Computer Science Theory, 1975)

A small complete category. - J. M. E. Hyland (Ann. Pure Appl. Log., 1988)

Algebraic Types in PER Models. - J. M. E. Hyland; Edmund P. Robinson; Giuseppe Rosolini (Mathematical Foundations of Programming Semantics, 1989)

Linear Lambda-Calculus and Categorial Models Revisited. - P. N. Benton; Gavin M. Bierman; Valeria de Paiva; Martin Hyland (CSL, 1992)

A Term Calculus for Intuitionistic Linear Logic. - P. N. Benton; Gavin M. Bierman; Valeria de Paiva; Martin Hyland (TLCA, 1993)

Modified Realizability Toposes and Strong Normalization Proofs. - J. M. E. Hyland; C.-H. Luke Ong (TLCA, 1993)

Full Intuitionistic Linear Logic (extended abstract). - Martin Hyland; Valeria de Paiva (Ann. Pure Appl. Log., 1993)

The S-Replete Constuction. - J. M. E. Hyland; Eugenio Moggi (Category Theory and Computer Science, 1995)

Pi-Calculus, Dialogue Games and PCF. - J. M. E. Hyland; C.-H. Luke Ong (FPCA, 1995)

Variations on Realizability: Simple examples realizing axioms of choice. - Martin Hyland (Realizability Semantics and Applications@FLoC, 1999)

Abstract Games for Linear Logic. - Martin Hyland; Andrea Schalk (CTCS, 1999)

Symmetric monoidal sketches. - Martin Hyland; John Power (PPDP, 2000)

On Full Abstraction for PCF: I, II, and III. - J. M. E. Hyland; C.-H. Luke Ong (Inf. Comput., 2000)

Pseudo-commutative Monads. - Martin Hyland; John Power (MFPS, 2001)

Two-dimensional linear algebra. - Martin Hyland; John Power (CMCS, 2001)

Designs, Disputes and Strategies. - Claudia Faggian; Martin Hyland (CSL, 2002)

Traced pre-monoidal categories. - Nick Benton; Martin Hyland (FICS, 2002)

Combining Computational Effects: commutativity & sum. - Martin Hyland; Gordon D. Plotkin; John Power (IFIP TCS, 2002)

Games on Graphs and Sequentially Realizable Functionals. - Martin Hyland; Andrea Schalk (LICS, 2002)

Proof theory in the abstract. - J. M. E. Hyland (Ann. Pure Appl. Log., 2002)

Variations on Realizability: Realizing the Propositional Axiom of Choice. - J. M. E. Hyland (Math. Struct. Comput. Sci., 2002)

Pseudo-distributive Laws. - Eugenia Cheng; Martin Hyland; John Power (MFPS, 2003)

Wellfounded Trees and Dependent Polynomial Functors. - Nicola Gambino; Martin Hyland (TYPES, 2003)

Symmetric Monoidal Sketches and Categories of Wirings. - Martin Hyland; John Power (CMCIM/GETCO@CONCUR, 2003)

Traced Premonoidal Categories. - Nick Benton; Martin Hyland (RAIRO Theor. Informatics Appl., 2003)

Glueing and orthogonality for models of linear logic. - Martin Hyland; Andrea Schalk (Theor. Comput. Sci., 2003)

Abstract Interpretation of Proofs: Classical Propositional Calculus. - Martin Hyland (CSL, 2004)

A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda. - Martin Hyland; Misao Nagayama; John Power; Giuseppe Rosolini (MFCSIT, 2004)

Categorical proof theory of classical propositional calculus. - Gianluigi Bellin; Martin Hyland; Edmund Robinson; Christian Urban (Theor. Comput. Sci., 2006)

Discrete Lawvere theories and computational effects. - Martin Hyland; John Power (Theor. Comput. Sci., 2006)

Combining effects: Sum and tensor. - Martin Hyland; Gordon D. Plotkin; John Power (Theor. Comput. Sci., 2006)

The Ackermann Award 2007. - Martin Grohe; Martin Hyland; Johann A. Makowsky; Damian Niwinski (CSL, 2007)

Categorical Combinatorics for Innocent Strategies. - Russell Harmer; Martin Hyland; Paul-André Melliès (LICS, 2007)

The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. - Martin Hyland; John Power (Computation, Meaning, and Logic, 2007)

Combining algebraic effects with continuations. - Martin Hyland; Paul Blain Levy; Gordon D. Plotkin; John Power (Theor. Comput. Sci., 2007)

Some reasons for generalising domain theory. - Martin Hyland (Math. Struct. Comput. Sci., 2010)

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)

Computability in Europe 2010. - Fernando Ferreira 001; Martin Hyland; Benedikt Löwe; Elvira Mayordomo (Ann. Pure Appl. Log., 2012)

Towards a Notion of Lambda Monoid. - Martin Hyland (WACT, 2013)

Turing Centenary Conference: How the World Computes. - S. Barry Cooper; Anuj Dawar; Martin Hyland; Benedikt Löwe (Ann. Pure Appl. Log., 2014)

Elements of a theory of algebraic theories. - J. M. E. Hyland (Theor. Comput. Sci., 2014)

The Forgotten Turing. - J. M. E. Hyland (The Once and Future Turing, 2016)

Foreword for special issue of APAL for GaLoP 2013. - Martin Hyland; Guy McCusker; Nikos Tzevelekos (Ann. Pure Appl. Log., 2017)

Classical lambda calculus in modern dress. - J. M. E. Hyland (Math. Struct. Comput. Sci., 2017)

The True Concurrency of Herbrand's Theorem. - Aurore Alcolei; Pierre Clairambault; Martin Hyland; Glynn Winskel (CSL, 2018)

The linear-non-linear substitution 2-monad. - Martin Hyland; Christine Tasson (ACT, 2020)

Monoidal bicategories, differential linear logic, and analytic functors. - Marco Fiore 001; Nicola Gambino; Martin Hyland (CoRR, 2024)