The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew M. Pitts: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrew M. Pitts
    Operational Semantics and Program Equivalence. [Citation Graph (0, 0)][DBLP]
    APPSEM, 2000, pp:378-412 [Conf]
  2. 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]
  3. Christian Urban, Andrew M. Pitts, Murdoch Gabbay
    Nominal Unificaiton. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:513-527 [Conf]
  4. Andrew M. Pitts
    Polymorphism is Set Theoretic, Constructively. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1987, pp:12-39 [Conf]
  5. Andrew M. Pitts
    Equivariant Syntax and Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:32-36 [Conf]
  6. Andrew M. Pitts
    Existential Types: Logical Relations and Operational Equivalence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:309-326 [Conf]
  7. 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]
  8. 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]
  9. Andrew M. Pitts
    Completeness and Continuity Properties of Applicative Bisimulation. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1994, pp:61- [Conf]
  10. Roy L. Crole, Andrew M. Pitts
    New Foundations for Fixpoint Computations [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:489-497 [Conf]
  11. Murdoch Gabbay, Andrew M. Pitts
    A New Approach to Abstract Syntax Involving Binders. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:214-224 [Conf]
  12. 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]
  13. Andrew M. Pitts
    Bisimulation and Co-induction (Tutorial) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:2-3 [Conf]
  14. Andrew M. Pitts
    Relational Properties of Recursively Defined Domains [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:86-97 [Conf]
  15. Andrew M. Pitts
    Reasoning about Local Variables with Operationally-Based Logical Relations. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:152-163 [Conf]
  16. 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]
  17. Andrew M. Pitts
    Computational Adequacy via "Mixed" Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:72-82 [Conf]
  18. 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]
  19. 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]
  20. Andrew M. Pitts, Mark R. Shinwell
    Generative unbinding of names. [Citation Graph (0, 0)][DBLP]
    POPL, 2007, pp:85-95 [Conf]
  21. Andrew M. Pitts
    Nominal Logic: A First Order Theory of Names and Binding. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:219-242 [Conf]
  22. 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]
  23. Andrew M. Pitts
    Alpha-Structural Recursion and Induction. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:17-34 [Conf]
  24. 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]
  25. 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]
  26. Andrew Gordon, Andrew M. Pitts
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:26, n:, pp:- [Journal]
  27. 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]
  28. Andrew M. Pitts
    Parametric Polymorphism and Operational Equivalence. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal]
  29. Andrew M. Pitts
    Tripos Theory in Retrospect. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. Andrew M. Pitts
    Relational Properties of Domains. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:127, n:2, pp:66-90 [Journal]
  35. 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]
  36. Andrew M. Pitts
    Alpha-structural recursion and induction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:459-506 [Journal]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. Andrew M. Pitts
    Techniques for Contextual Equivalence in Higher-Order, Typed Languages. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:1- [Conf]

  45. Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming. [Citation Graph (, )][DBLP]


  46. Nominal system T. [Citation Graph (, )][DBLP]


  47. Generative Unbinding of Names [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002