Martin Hyland

J. M. E. Hyland

	2007
33		Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2007. CSL 2007: 589-597
32		Russell Harmer, Martin Hyland, Paul-André Melliès: Categorical Combinatorics for Innocent Strategies. LICS 2007: 379-388
31		Martin Hyland, John Power: The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Electr. Notes Theor. Comput. Sci. 172: 437-458 (2007)
30		Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power: Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007)
	2006
29		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)
28		Martin Hyland, Gordon D. Plotkin, John Power: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006)
27		Gianluigi Bellin, Martin Hyland, Edmund Robinson, Christian Urban: Categorical proof theory of classical propositional calculus. Theor. Comput. Sci. 364(2): 146-165 (2006)
26		Martin Hyland, John Power: Discrete Lawvere theories and computational effects. Theor. Comput. Sci. 366(1-2): 144-162 (2006)
	2004
25		Martin Hyland: Abstract Interpretation of Proofs: Classical Propositional Calculus. CSL 2004: 6-21
24		Martin Hyland, John Power: Symmetric Monoidal Sketches and Categories of Wirings. Electr. Notes Theor. Comput. Sci. 100: 31-46 (2004)
	2003
23		Nicola Gambino, Martin Hyland: Wellfounded Trees and Dependent Polynomial Functors. TYPES 2003: 210-225
22		Nick Benton, Martin Hyland: Traced Premonoidal Categories. ITA 37(4): 273-299 (2003)
21		Martin Hyland, Andrea Schalk: Glueing and orthogonality for models of linear logic. Theor. Comput. Sci. 294(1/2): 183-231 (2003)
	2002
20		Claudia Faggian, Martin Hyland: Designs, Disputes and Strategies. CSL 2002: 442-457
19		Nick Benton, Martin Hyland: Traced pre-monoidal categories. FICS 2002: 12-19
18		Martin Hyland, Gordon D. Plotkin, John Power: Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484
17		Martin Hyland, Andrea Schalk: Games on Graphs and Sequentially Realizable Functionals. LICS 2002: 257-264
16		J. M. E. Hyland: Proof theory in the abstract. Ann. Pure Appl. Logic 114(1-3): 43-78 (2002)
15		J. M. E. Hyland: Variations on Realizability: Realizing the Propositional Axiom of Choice. Mathematical Structures in Computer Science 12(3): 295-317 (2002)
	2001
14		Martin Hyland, John Power: Two-dimensional linear algebra. Electr. Notes Theor. Comput. Sci. 44(1): (2001)
13		Martin Hyland, John Power: Pseudo-commutative Monads. Electr. Notes Theor. Comput. Sci. 45: (2001)
	2000
12		Martin Hyland, John Power: Symmetric monoidal sketches. PPDP 2000: 280-288
11		J. M. E. Hyland, C.-H. Luke Ong: On Full Abstraction for PCF: I, II, and III. Inf. Comput. 163(2): 285-408 (2000)
	1999
10		Martin Hyland: Variations on Realizability. Electr. Notes Theor. Comput. Sci. 23(1): (1999)
9		Martin Hyland, Andrea Schalk: Abstract Games for Linear Logic. Electr. Notes Theor. Comput. Sci. 29: (1999)
	1995
8		J. M. E. Hyland, Eugenio Moggi: The S-Replete Constuction. Category Theory and Computer Science 1995: 96-116
7		J. M. E. Hyland, C.-H. Luke Ong: Pi-Calculus, Dialogue Games and PCF. FPCA 1995: 96-107
	1993
6		J. M. E. Hyland, C.-H. Luke Ong: Modified Realizability Toposes and Strong Normalization Proofs. TLCA 1993: 179-194
5		P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: A Term Calculus for Intuitionistic Linear Logic. TLCA 1993: 75-90
4		Martin Hyland, Valeria de Paiva: Full Intuitionistic Linear Logic (extended abstract). Ann. Pure Appl. Logic 64(3): 273-291 (1993)
	1992
3		P. N. Benton, Gavin M. Bierman, Valeria de Paiva, Martin Hyland: Linear Lambda-Calculus and Categorial Models Revisited. CSL 1992: 61-84
	1989
2		J. M. E. Hyland, E. P. Robinson, Giuseppe Rosolini: Algebraic Types in PER Models. Mathematical Foundations of Programming Semantics 1989: 333-350
	1975
1		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

Coauthor Index

1	Gianluigi Bellin	[27]
2	Nick Benton (P. N. Benton)	[3] [5] [19] [22]
3	Gavin M. Bierman	[3] [5]
4	Claudia Faggian	[20]
5	Nicola Gambino	[23]
6	Martin Grohe	[33]
7	Russell Harmer	[32]
8	Paul Blain Levy	[30]
9	Johann A. Makowsky (Janos Makowsky)	[33]
10	Paul-André Melliès	[32]
11	Eugenio Moggi	[8]
12	Misao Nagayama	[29]
13	Damian Niwinski	[33]
14	C.-H. Luke Ong	[6] [7] [11]
15	Valeria de Paiva	[3] [4] [5]
16	Gordon D. Plotkin	[18] [28] [30]
17	John Power (A. John Power)	[12] [13] [14] [18] [24] [26] [28] [29] [30] [31]
18	Edmund Robinson (E. P. Robinson)	[2] [27]
19	Giuseppe Rosolini	[2] [29]
20	Andrea Schalk	[9] [17] [21]
21	Christian Urban	[27]

Colors in the list of coauthors