Philip J. Scott

2008
24	EE	Esfandiar Haghverdi, Philip J. Scott: Proofs as Polynomials. Electr. Notes Theor. Comput. Sci. 218: 53-72 (2008)
2007
23	EE	Philip J. Scott: Traces, Feedback, and the Geometry of Computation (Abstract). FCT 2007: 39
22	EE	Masahiro Hamano, Philip J. Scott: A categorical semantics for polarized MALL. Ann. Pure Appl. Logic 145(3): 276-313 (2007)
2006
21	EE	Esfandiar Haghverdi, Philip J. Scott: A categorical model for the geometry of interaction. Theor. Comput. Sci. 350(2-3): 252-274 (2006)
2005
20	EE	Esfandiar Haghverdi, Philip J. Scott: Towards a Typed Geometry of Interaction. CSL 2005: 216-231
19	EE	Richard Blute, Masahiro Hamano, Philip J. Scott: Softness of hypercoherences and MALL full completeness. Ann. Pure Appl. Logic 131(1-3): 1-63 (2005)
18	EE	Esfandiar Haghverdi, Philip J. Scott: From Geometry of Interaction to Denotational Semantics. Electr. Notes Theor. Comput. Sci. 122: 67-87 (2005)
17	EE	Joachim Lambek, Philip J. Scott: An Exactification of the Monoid of Primitive Recursive Functions. Studia Logica 81(1): 1-18 (2005)
2004
16	EE	Esfandiar Haghverdi, Philip J. Scott: A Categorical Model for the Geometry of Interaction. ICALP 2004: 708-720
15	EE	Martin Hofmann, Philip J. Scott: Realizability models for BLL-like languages. Theor. Comput. Sci. 318(1-2): 121-137 (2004)
2002
14		Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott: Geometry of Interaction and Linear Combinatory Algebras. Mathematical Structures in Computer Science 12(5): 625-665 (2002)
2001
13		Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott: Normalization by Evaluation for Typed Lambda Calculus with Coproducts. LICS 2001: 303-310
2000
12		Michael Barr, Philip J. Scott, R. A. G. Seely: Introduction. Mathematical Structures in Computer Science 10(2): 97-98 (2000)
1998
11		Richard Blute, Philip J. Scott: The Shuffle Hopf Algebra and Noncommutative Full Completeness. J. Symb. Log. 63(4): 1413-1436 (1998)
10		Djordje Cubric, Peter Dybjer, Philip J. Scott: Normalization and the Yoneda Embedding. Mathematical Structures in Computer Science 8(2): 153-192 (1998)
1996
9		Richard Blute, Philip J. Scott: Linear Läuchli Semantics. Ann. Pure Appl. Logic 77(2): 101-142 (1996)
8	EE	Richard Blute, Philip J. Scott: A Noncommutative Full Completeness Theorem. Electr. Notes Theor. Comput. Sci. 3: (1996)
1995
7		N. P. Mendler, Prakash Panangaden, Philip J. Scott, R. A. G. Seely: A Logical View of Concurrent Constraint Programming. Nord. J. Comput. 2(2): 181-220 (1995)
1994
6		Gianluigi Bellin, Philip J. Scott: On the pi-Calculus and Linear Logic. Theor. Comput. Sci. 135(1): 11-65 (1994)
1992
5		Prakash Panangaden, Vijay A. Saraswat, Philip J. Scott, R. A. G. Seely: A Hyperdoctrinal View of Concurrent Constraint Programming. REX Workshop 1992: 457-476
4		Jean-Yves Girard, Andre Scedrov, Philip J. Scott: Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability. Theor. Comput. Sci. 97(1): 1-66 (1992)
1990
3		E. S. Bainbridge, Peter J. Freyd, Andre Scedrov, Philip J. Scott: Functorial Polymorphism. Theor. Comput. Sci. 70(1): 35-64 (1990)
1989
2		John N. Crossley, Philip J. Scott: Completeness Proofs for Propositional Logic with Polynomial-Time Connectives. Ann. Pure Appl. Logic 44(1-2): 39-52 (1989)
1988
1		Peter J. Freyd, Jean-Yves Girard, Andre Scedrov, Philip J. Scott: Semantic Parametricity in Polymorphic Lambda Calculus LICS 1988: 274-279

Coauthor Index

1	Samson Abramsky	[14]
2	Thorsten Altenkirch	[13]
3	E. S. Bainbridge	[3]
4	Michael Barr	[12]
5	Gianluigi Bellin	[6]
6	Richard Blute	[8] [9] [11] [19]
7	John N. Crossley	[2]
8	Djordje Cubric	[10]
9	Peter Dybjer	[10] [13]
10	Peter J. Freyd	[1] [3]
11	Jean-Yves Girard	[1] [4]
12	Esfandiar Haghverdi	[14] [16] [18] [20] [21] [24]
13	Masahiro Hamano	[19] [22]
14	Martin Hofmann	[13] [15]
15	Joachim Lambek (Jim Lambek)	[17]
16	N. P. Mendler	[7]
17	Prakash Panangaden	[5] [7]
18	Vijay A. Saraswat	[5]
19	Andre Scedrov	[1] [3] [4]
20	R. A. G. Seely	[5] [7] [12]

Colors in the list of coauthors