Search the dblp DataBase
Andrew M. Pitts :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Andrew M. Pitts Operational Semantics and Program Equivalence. [Citation Graph (0, 0)][DBLP ] APPSEM, 2000, pp:378-412 [Conf ] Andrew M. Pitts , Joshua R. X. Ross Process Calculus Based upon Evaluation to Committed Form. [Citation Graph (0, 0)][DBLP ] CONCUR, 1996, pp:18-33 [Conf ] Christian Urban , Andrew M. Pitts , Murdoch Gabbay Nominal Unificaiton. [Citation Graph (0, 0)][DBLP ] CSL, 2003, pp:513-527 [Conf ] Andrew M. Pitts Polymorphism is Set Theoretic, Constructively. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1987, pp:12-39 [Conf ] Andrew M. Pitts Equivariant Syntax and Semantics. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:32-36 [Conf ] Andrew M. Pitts Existential Types: Logical Relations and Operational Equivalence. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:309-326 [Conf ] Andrew M. Pitts A Fresh Approach to Representing Syntax with Static Binders in Functional Programming. [Citation Graph (0, 0)][DBLP ] ICFP, 2001, pp:1- [Conf ] Mark R. Shinwell , Andrew M. Pitts , Murdoch Gabbay FreshML: programming with binders made simple. [Citation Graph (0, 0)][DBLP ] ICFP, 2003, pp:263-274 [Conf ] Andrew M. Pitts Completeness and Continuity Properties of Applicative Bisimulation. [Citation Graph (0, 0)][DBLP ] Theory and Formal Methods, 1994, pp:61- [Conf ] Roy L. Crole , Andrew M. Pitts New Foundations for Fixpoint Computations [Citation Graph (0, 0)][DBLP ] LICS, 1990, pp:489-497 [Conf ] Murdoch Gabbay , Andrew M. Pitts A New Approach to Abstract Syntax Involving Binders. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:214-224 [Conf ] Andrew M. Pitts Non-trivial Power Types Can't Be Subtypes of Polymorphic Types [Citation Graph (0, 0)][DBLP ] LICS, 1989, pp:6-13 [Conf ] Andrew M. Pitts Bisimulation and Co-induction (Tutorial) [Citation Graph (0, 0)][DBLP ] LICS, 1993, pp:2-3 [Conf ] Andrew M. Pitts Relational Properties of Recursively Defined Domains [Citation Graph (0, 0)][DBLP ] LICS, 1993, pp:86-97 [Conf ] Andrew M. Pitts Reasoning about Local Variables with Operationally-Based Logical Relations. [Citation Graph (0, 0)][DBLP ] LICS, 1996, pp:152-163 [Conf ] Andrew M. Pitts , Ian D. B. Stark Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:122-141 [Conf ] Andrew M. Pitts Computational Adequacy via "Mixed" Inductive Definitions. [Citation Graph (0, 0)][DBLP ] MFPS, 1993, pp:72-82 [Conf ] Andrew M. Pitts , Murdoch Gabbay A Metalanguage for Programming with Bound Names Modulo Renaming. [Citation Graph (0, 0)][DBLP ] MPC, 2000, pp:230-255 [Conf ] Andrew M. Pitts Operational Versus Denotational Methods in the Semantics of Higher Order Languages. [Citation Graph (0, 0)][DBLP ] PLILP/ALP, 1998, pp:282-283 [Conf ] Andrew M. Pitts , Mark R. Shinwell Generative unbinding of names. [Citation Graph (0, 0)][DBLP ] POPL, 2007, pp:85-95 [Conf ] Andrew M. Pitts Nominal Logic: A First Order Theory of Names and Binding. [Citation Graph (0, 0)][DBLP ] TACS, 2001, pp:219-242 [Conf ] Eike Ritter , Andrew M. Pitts A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML. [Citation Graph (0, 0)][DBLP ] TLCA, 1995, pp:397-413 [Conf ] Andrew M. Pitts Alpha-Structural Recursion and Induction. [Citation Graph (0, 0)][DBLP ] TPHOLs, 2005, pp:17-34 [Conf ] Andrew M. Pitts Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1989, v:41, n:1, pp:33-81 [Journal ] Gavin M. Bierman , Andrew M. Pitts , Claudio V. Russo Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2000, v:41, n:3, pp:- [Journal ] Andrew Gordon , Andrew M. Pitts Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:26, n:, pp:- [Journal ] Andrew Gordon , Andrew M. Pitts , Carolyn L. Talcott Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal ] Andrew M. Pitts Parametric Polymorphism and Operational Equivalence. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal ] Andrew M. Pitts Tripos Theory in Retrospect. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal ] Ranald A. Clouston , Andrew M. Pitts Nominal Equational Logic. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:223-257 [Journal ] Murdoch Gabbay , Andrew M. Pitts A New Approach to Abstract Syntax with Variable Binding. [Citation Graph (0, 0)][DBLP ] Formal Asp. Comput., 2002, v:13, n:3-5, pp:341-363 [Journal ] Roy L. Crole , Andrew M. Pitts New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:98, n:2, pp:171-210 [Journal ] Andrew M. Pitts Nominal logic, a first order theory of names and binding. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:186, n:2, pp:165-193 [Journal ] Andrew M. Pitts Relational Properties of Domains. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1996, v:127, n:2, pp:66-90 [Journal ] Andrew M. Pitts A Note on Logical Relations Between Semantics and Syntax. [Citation Graph (0, 0)][DBLP ] Logic Journal of the IGPL, 1997, v:5, n:4, pp:- [Journal ] Andrew M. Pitts Alpha-structural recursion and induction. [Citation Graph (0, 0)][DBLP ] J. ACM, 2006, v:53, n:3, pp:459-506 [Journal ] Andrew M. Pitts On an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1992, v:57, n:1, pp:33-52 [Journal ] Andrew M. Pitts Parametric polymorphism and operational equivalence. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2000, v:10, n:3, pp:321-359 [Journal ] Andrew M. Pitts Tripos Theory in Retrospect. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2002, v:12, n:3, pp:265-279 [Journal ] Andrew M. Pitts A co-Induction Principle for Recursively Defined Domains. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:124, n:2, pp:195-219 [Journal ] Andrew M. Pitts , Joshua R. X. Ross Process Calculus Based Upon Evaluation to Committed Form. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:195, n:2, pp:155-182 [Journal ] Mark R. Shinwell , Andrew M. Pitts On a monadic semantics for freshness. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:342, n:1, pp:28-55 [Journal ] Christian Urban , Andrew M. Pitts , Murdoch Gabbay Nominal unification. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:323, n:1-3, pp:473-497 [Journal ] Andrew M. Pitts Techniques for Contextual Equivalence in Higher-Order, Typed Languages. [Citation Graph (0, 0)][DBLP ] ESOP, 2007, pp:1- [Conf ] Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming. [Citation Graph (, )][DBLP ] Nominal system T. [Citation Graph (, )][DBLP ] Generative Unbinding of Names [Citation Graph (, )][DBLP ] Search in 0.057secs, Finished in 0.060secs