Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrew M. Pitts
2010 – today
- 2013
[c29]- 2012
- [j24]Matthew R. Lakin, Andrew M. Pitts: Encoding Abstract Syntax Without Fresh Names. J. Autom. Reasoning 49(2): 115-140 (2012)
- [e4]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Lecture Notes in Computer Science 7391, Springer 2012, ISBN 978-3-642-31593-0
- [e3]Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer (Eds.): Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Lecture Notes in Computer Science 7392, Springer 2012, ISBN 978-3-642-31584-8
- 2011
- [j23]Andrew M. Pitts: Structural recursion with locally scoped names. J. Funct. Program. 21(3): 235-286 (2011)
- [c28]
- 2010
- [c27]
2000 – 2009
- 2009
- [c26]Matthew R. Lakin, Andrew M. Pitts: Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming. ESOP 2009: 47-61
- 2008
- [j22]Andrew M. Pitts, Mark R. Shinwell: Generative Unbinding of Names. Logical Methods in Computer Science 4(1) (2008)
- [i1]
- 2007
- [j21]Ranald A. Clouston, Andrew M. Pitts: Nominal Equational Logic. Electr. Notes Theor. Comput. Sci. 172: 223-257 (2007)
- [c25]Andrew M. Pitts: Techniques for Contextual Equivalence in Higher-Order, Typed Languages. ESOP 2007: 1
- [c24]
- [c23]Matthew R. Lakin, Andrew M. Pitts: A Metalanguage for Structural Operational Semantics. Trends in Functional Programming 2007: 19-35
- 2006
- [j20]
- 2005
- [j19]Mark R. Shinwell, Andrew M. Pitts: On a monadic semantics for freshness. Theor. Comput. Sci. 342(1): 28-55 (2005)
- [c22]
- 2004
- [j18]Christian Urban, Andrew M. Pitts, Murdoch Gabbay: Nominal unification. Theor. Comput. Sci. 323(1-3): 473-497 (2004)
- 2003
- [j17]Andrew M. Pitts: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2): 165-193 (2003)
- [j16]Mark R. Shinwell, Andrew M. Pitts, Murdoch James Gabbay: FreshML: programming with binders made simple. SIGPLAN Notices 38(9): 263-274 (2003)
- [c21]
- [c20]Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay: FreshML: programming with binders made simple. ICFP 2003: 263-274
- 2002
- [j15]Murdoch Gabbay, Andrew M. Pitts: A New Approach to Abstract Syntax with Variable Binding. Formal Asp. Comput. 13(3-5): 341-363 (2002)
- [j14]Andrew M. Pitts: Tripos Theory in Retrospect. Mathematical Structures in Computer Science 12(3): 265-279 (2002)
- [c19]
- 2001
- [c18]Andrew M. Pitts: A Fresh Approach to Representing Syntax with Static Binders in Functional Programming. ICFP 2001: 1
- [c17]
- 2000
- [j13]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): 70-88 (2000)
- [j12]Andrew M. Pitts: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10(3): 321-359 (2000)
- [c16]
- [c15]Andrew M. Pitts, Murdoch Gabbay: A Metalanguage for Programming with Bound Names Modulo Renaming. MPC 2000: 230-255
1990 – 1999
- 1999
- [j11]Andrew M. Pitts: Tripos Theory in Retrospect. Electr. Notes Theor. Comput. Sci. 23(1): 111-127 (1999)
- [j10]
- [c14]Murdoch Gabbay, Andrew M. Pitts: A New Approach to Abstract Syntax Involving Binders. LICS 1999: 214-224
- 1998
- [j9]Andrew M. Pitts, Joshua R. X. Ross: Process Calculus Based Upon Evaluation to Committed Form. Theor. Comput. Sci. 195(2): 155-182 (1998)
- [c13]Andrew M. Pitts: Existential Types: Logical Relations and Operational Equivalence. ICALP 1998: 309-326
- [c12]Andrew M. Pitts: Operational Versus Denotational Methods in the Semantics of Higher Order Languages. PLILP/ALP 1998: 282-283
- 1997
- [j8]Andrew D. Gordon, Andrew M. Pitts, Carolyn L. Talcott: Preface. Electr. Notes Theor. Comput. Sci. 10: 1 (1997)
- [j7]Andrew M. Pitts: Parametric Polymorphism and Operational Equivalence. Electr. Notes Theor. Comput. Sci. 10: 2-27 (1997)
- [j6]Andrew M. Pitts: A Note on Logical Relations Between Semantics and Syntax. Logic Journal of the IGPL 5(4): 589-601 (1997)
- 1996
- [j5]
- [c11]Andrew M. Pitts, Joshua R. X. Ross: Process Calculus Based upon Evaluation to Committed Form. CONCUR 1996: 18-33
- [c10]Andrew M. Pitts: Reasoning about Local Variables with Operationally-Based Logical Relations. LICS 1996: 152-163
- 1995
- [c9]Eike Ritter, Andrew M. Pitts: A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML. TLCA 1995: 397-413
- 1994
- [j4]Andrew M. Pitts: A co-Induction Principle for Recursively Defined Domains. Theor. Comput. Sci. 124(2): 195-219 (1994)
- [c8]Andrew M. Pitts: Completeness and Continuity Properties of Applicative Bisimulation. Theory and Formal Methods 1994: 61
- 1993
- [c7]
- [c6]
- [c5]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
- [c4]
- 1992
- [j3]Roy L. Crole, Andrew M. Pitts: New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic. Inf. Comput. 98(2): 171-210 (1992)
- [j2]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
- [e2]David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew M. Pitts, Axel Poigné, David E. Rydeheard (Eds.): Category Theory and Computer Science, 4th International Conference, Paris, France, September 3-6, 1991, Proceedings. Lecture Notes in Computer Science 530, Springer 1991, ISBN 3-540-54495-X
- 1990
- [c3]
1980 – 1989
- 1989
- [j1]Andrew M. Pitts: Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic. Ann. Pure Appl. Logic 41(1): 33-81 (1989)
- [c2]
- [e1]David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew M. Pitts, Axel Poigné (Eds.): Category Theory and Computer Science, Manchester, UK, September 5-8, 1989, Proceedings. Lecture Notes in Computer Science 389, Springer 1989, ISBN 3-540-51662-X
- 1987
- [c1]Andrew M. Pitts: Polymorphism is Set Theoretic, Constructively. Category Theory and Computer Science 1987: 12-39
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:16 CEST by the dblp team