Martin Hyland

Fernando Ferreira, Martin Hyland, Benedikt Löwe, Elvira Mayordomo: Computability in Europe 2010. Ann. Pure Appl. Logic 163(6): 621-622 (2012)

George Janelidze, Martin Hyland, Michael Johnson, Peter T. Johnstone, Stephen Lack, Ross Street, Walter Tholen, Richard J. Wood: Foreword - Special Issue Dedicated to the Memory of Professor Gregory Maxwell Kelly. Applied Categorical Structures 19(1): 1-7 (2011)

Martin Hyland: Some reasons for generalising domain theory. Mathematical Structures in Computer Science 20(2): 239-265 (2010)

Martin Hyland, John Power: The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Electr. Notes Theor. Comput. Sci. 172: 437-458 (2007)

Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power: Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007)

Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2007. CSL 2007: 589-597

Russell Harmer, Martin Hyland, Paul-André Melliès: Categorical Combinatorics for Innocent Strategies. LICS 2007: 379-388

Martin Hyland, Misao Nagayama, John Power, Giuseppe Rosolini: A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda. Electr. Notes Theor. Comput. Sci. 161: 43-57 (2006)

Martin Hyland, Gordon D. Plotkin, John Power: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006)

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

Martin Hyland, John Power: Discrete Lawvere theories and computational effects. Theor. Comput. Sci. 366(1-2): 144-162 (2006)

Martin Hyland, John Power: Symmetric Monoidal Sketches and Categories of Wirings. Electr. Notes Theor. Comput. Sci. 100: 31-46 (2004)

Martin Hyland: Abstract Interpretation of Proofs: Classical Propositional Calculus. CSL 2004: 6-21

Nick Benton, Martin Hyland: Traced Premonoidal Categories. ITA 37(4): 273-299 (2003)

Martin Hyland, Andrea Schalk: Glueing and orthogonality for models of linear logic. Theor. Comput. Sci. 294(1/2): 183-231 (2003)

Nicola Gambino, Martin Hyland: Wellfounded Trees and Dependent Polynomial Functors. TYPES 2003: 210-225

J. M. E. Hyland: Proof theory in the abstract. Ann. Pure Appl. Logic 114(1-3): 43-78 (2002)

J. M. E. Hyland: Variations on Realizability: Realizing the Propositional Axiom of Choice. Mathematical Structures in Computer Science 12(3): 295-317 (2002)

Claudia Faggian, Martin Hyland: Designs, Disputes and Strategies. CSL 2002: 442-457

Nick Benton, Martin Hyland: Traced pre-monoidal categories. FICS 2002: 12-19

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

Martin Hyland, Andrea Schalk: Games on Graphs and Sequentially Realizable Functionals. LICS 2002: 257-264

Martin Hyland, John Power: Two-dimensional linear algebra. Electr. Notes Theor. Comput. Sci. 44(1): 227-240 (2001)

Martin Hyland, John Power: Pseudo-commutative Monads. Electr. Notes Theor. Comput. Sci. 45: 197-208 (2001)

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

Martin Hyland, John Power: Symmetric monoidal sketches. PPDP 2000: 280-288

Martin Hyland: Variations on Realizability: Simple examples realizing axioms of choice. Electr. Notes Theor. Comput. Sci. 23(1): 166-188 (1999)

Martin Hyland, Andrea Schalk: Abstract Games for Linear Logic. Electr. Notes Theor. Comput. Sci. 29: 127-150 (1999)

J. M. E. Hyland, Eugenio Moggi: The S-Replete Constuction. Category Theory and Computer Science 1995: 96-116

J. M. E. Hyland, C.-H. Luke Ong: Pi-Calculus, Dialogue Games and PCF. FPCA 1995: 96-107

Martin Hyland, Valeria de Paiva: Full Intuitionistic Linear Logic (extended abstract). Ann. Pure Appl. Logic 64(3): 273-291 (1993)

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: A Term Calculus for Intuitionistic Linear Logic. TLCA 1993: 75-90

J. M. E. Hyland, C.-H. Luke Ong: Modified Realizability Toposes and Strong Normalization Proofs. TLCA 1993: 179-194

P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: Linear Lambda-Calculus and Categorial Models Revisited. CSL 1992: 61-84

J. M. E. Hyland, E. P. Robinson, Giuseppe Rosolini: Algebraic Types in PER Models. Mathematical Foundations of Programming Semantics 1989: 333-350

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