| 2009 |
|---|
| 48 | EE | Matthew R. Lakin,
Andrew M. Pitts:
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming.
ESOP 2009: 47-61 |
| 2008 |
|---|
| 47 | EE | Andrew M. Pitts,
Mark R. Shinwell:
Generative Unbinding of Names
CoRR abs/0801.1251: (2008) |
| 2007 |
|---|
| 46 | EE | Andrew M. Pitts:
Techniques for Contextual Equivalence in Higher-Order, Typed Languages.
ESOP 2007: 1 |
| 45 | EE | Andrew M. Pitts,
Mark R. Shinwell:
Generative unbinding of names.
POPL 2007: 85-95 |
| 44 | EE | Ranald A. Clouston,
Andrew M. Pitts:
Nominal Equational Logic.
Electr. Notes Theor. Comput. Sci. 172: 223-257 (2007) |
| 2006 |
|---|
| 43 | EE | Andrew M. Pitts:
Alpha-structural recursion and induction.
J. ACM 53(3): 459-506 (2006) |
| 2005 |
|---|
| 42 | EE | Andrew M. Pitts:
Alpha-Structural Recursion and Induction.
TPHOLs 2005: 17-34 |
| 41 | EE | Mark R. Shinwell,
Andrew M. Pitts:
On a monadic semantics for freshness.
Theor. Comput. Sci. 342(1): 28-55 (2005) |
| 2004 |
|---|
| 40 | EE | Christian Urban,
Andrew M. Pitts,
Murdoch Gabbay:
Nominal unification.
Theor. Comput. Sci. 323(1-3): 473-497 (2004) |
| 2003 |
|---|
| 39 | EE | Christian Urban,
Andrew M. Pitts,
Murdoch Gabbay:
Nominal Unificaiton.
CSL 2003: 513-527 |
| 38 | EE | Mark R. Shinwell,
Andrew M. Pitts,
Murdoch Gabbay:
FreshML: programming with binders made simple.
ICFP 2003: 263-274 |
| 37 | EE | Andrew M. Pitts:
Nominal logic, a first order theory of names and binding.
Inf. Comput. 186(2): 165-193 (2003) |
| 2002 |
|---|
| 36 | EE | Andrew M. Pitts:
Equivariant Syntax and Semantics.
ICALP 2002: 32-36 |
| 35 | EE | Murdoch Gabbay,
Andrew M. Pitts:
A New Approach to Abstract Syntax with Variable Binding.
Formal Asp. Comput. 13(3-5): 341-363 (2002) |
| 34 | | Andrew M. Pitts:
Tripos Theory in Retrospect.
Mathematical Structures in Computer Science 12(3): 265-279 (2002) |
| 2001 |
|---|
| 33 | | Andrew M. Pitts:
A Fresh Approach to Representing Syntax with Static Binders in Functional Programming.
ICFP 2001: 1 |
| 32 | EE | Andrew M. Pitts:
Nominal Logic: A First Order Theory of Names and Binding.
TACS 2001: 219-242 |
| 2000 |
|---|
| 31 | EE | Andrew M. Pitts:
Operational Semantics and Program Equivalence.
APPSEM 2000: 378-412 |
| 30 | | Andrew M. Pitts,
Murdoch Gabbay:
A Metalanguage for Programming with Bound Names Modulo Renaming.
MPC 2000: 230-255 |
| 29 | EE | Gavin M. Bierman,
Andrew M. Pitts,
Claudio V. Russo:
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion.
Electr. Notes Theor. Comput. Sci. 41(3): (2000) |
| 28 | | Andrew M. Pitts:
Parametric polymorphism and operational equivalence.
Mathematical Structures in Computer Science 10(3): 321-359 (2000) |
| 1999 |
|---|
| 27 | EE | Murdoch Gabbay,
Andrew M. Pitts:
A New Approach to Abstract Syntax Involving Binders.
LICS 1999: 214-224 |
| 26 | EE | Andrew M. Pitts:
Tripos Theory in Retrospect.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 25 | EE | Andrew Gordon,
Andrew M. Pitts:
Preface.
Electr. Notes Theor. Comput. Sci. 26: (1999) |
| 1998 |
|---|
| 24 | EE | Andrew M. Pitts:
Existential Types: Logical Relations and Operational Equivalence.
ICALP 1998: 309-326 |
| 23 | EE | Andrew M. Pitts:
Operational Versus Denotational Methods in the Semantics of Higher Order Languages.
PLILP/ALP 1998: 282-283 |
| 22 | EE | Andrew M. Pitts,
Joshua R. X. Ross:
Process Calculus Based Upon Evaluation to Committed Form.
Theor. Comput. Sci. 195(2): 155-182 (1998) |
| 1997 |
|---|
| 21 | EE | Andrew M. Pitts:
Parametric Polymorphism and Operational Equivalence.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 20 | EE | Andrew Gordon,
Andrew M. Pitts,
Carolyn L. Talcott:
Preface.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 19 | EE | Andrew M. Pitts:
A Note on Logical Relations Between Semantics and Syntax.
Logic Journal of the IGPL 5(4): (1997) |
| 1996 |
|---|
| 18 | | Andrew M. Pitts,
Joshua R. X. Ross:
Process Calculus Based upon Evaluation to Committed Form.
CONCUR 1996: 18-33 |
| 17 | | Andrew M. Pitts:
Reasoning about Local Variables with Operationally-Based Logical Relations.
LICS 1996: 152-163 |
| 16 | | Andrew M. Pitts:
Relational Properties of Domains.
Inf. Comput. 127(2): 66-90 (1996) |
| 1995 |
|---|
| 15 | | Eike Ritter,
Andrew M. Pitts:
A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML.
TLCA 1995: 397-413 |
| 1994 |
|---|
| 14 | | Andrew M. Pitts:
Completeness and Continuity Properties of Applicative Bisimulation.
Theory and Formal Methods 1994: 61 |
| 13 | | Andrew M. Pitts:
A co-Induction Principle for Recursively Defined Domains.
Theor. Comput. Sci. 124(2): 195-219 (1994) |
| 1993 |
|---|
| 12 | | Andrew M. Pitts:
Bisimulation and Co-induction (Tutorial)
LICS 1993: 2-3 |
| 11 | | Andrew M. Pitts:
Relational Properties of Recursively Defined Domains
LICS 1993: 86-97 |
| 10 | | Andrew M. Pitts,
Ian D. B. Stark:
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS 1993: 122-141 |
| 9 | | Andrew M. Pitts:
Computational Adequacy via "Mixed" Inductive Definitions.
MFPS 1993: 72-82 |
| 1992 |
|---|
| 8 | | Roy L. Crole,
Andrew M. Pitts:
New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic
Inf. Comput. 98(2): 171-210 (1992) |
| 7 | | Andrew M. Pitts:
On an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic.
J. Symb. Log. 57(1): 33-52 (1992) |
| 1991 |
|---|
| 6 | | David H. Pitt,
Pierre-Louis Curien,
Samson Abramsky,
Andrew M. Pitts,
Axel Poigné,
David E. Rydeheard:
Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings
Springer 1991 |
| 1990 |
|---|
| 5 | | Roy L. Crole,
Andrew M. Pitts:
New Foundations for Fixpoint Computations
LICS 1990: 489-497 |
| 1989 |
|---|
| 4 | | David H. Pitt,
David E. Rydeheard,
Peter Dybjer,
Andrew M. Pitts,
Axel Poigné:
Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings
Springer 1989 |
| 3 | | Andrew M. Pitts:
Non-trivial Power Types Can't Be Subtypes of Polymorphic Types
LICS 1989: 6-13 |
| 2 | | Andrew M. Pitts:
Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic.
Ann. Pure Appl. Logic 41(1): 33-81 (1989) |
| 1987 |
|---|
| 1 | | Andrew M. Pitts:
Polymorphism is Set Theoretic, Constructively.
Category Theory and Computer Science 1987: 12-39 |
