| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrew M. Pitts |
Structural recursion with locally scoped names.  |
J. Funct. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Lösch, Andrew M. Pitts |
Relating Two Semantics of Locally Scoped Names. |
CSL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Nominal system T. |
POPL |
2010 |
DBLP DOI BibTeX RDF |
alpha-equivalence, types, recursion, binders |
| 1 | Matthew R. Lakin, Andrew M. Pitts |
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming. |
ESOP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Mark R. Shinwell |
Generative Unbinding of Names. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Mark R. Shinwell |
Generative Unbinding of Names |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ranald A. Clouston, Andrew M. Pitts |
Nominal Equational Logic. |
Electr. Notes Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Mark R. Shinwell |
Generative unbinding of names. |
POPL |
2007 |
DBLP DOI BibTeX RDF |
alpha-conversion, meta-programming, abstract syntax, binders |
| 1 | Andrew M. Pitts |
Techniques for Contextual Equivalence in Higher-Order, Typed Languages. |
ESOP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Alpha-structural recursion and induction. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
recursion, induction, names, Abstract syntax, binders |
| 1 | Mark R. Shinwell, Andrew M. Pitts |
On a monadic semantics for freshness. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Alpha-Structural Recursion and Induction. |
TPHOLs |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Urban, Andrew M. Pitts, Murdoch Gabbay |
Nominal unification. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark R. Shinwell, Andrew M. Pitts, Murdoch James Gabbay |
FreshML: programming with binders made simple. |
SIGPLAN Notices |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Nominal logic, a first order theory of names and binding. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay |
FreshML: programming with binders made simple. |
ICFP |
2003 |
DBLP DOI BibTeX RDF |
alpha-conversion, metaprogramming, variable binding |
| 1 | Christian Urban, Andrew M. Pitts, Murdoch Gabbay |
Nominal Unificaiton. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Murdoch Gabbay, Andrew M. Pitts |
A New Approach to Abstract Syntax with Variable Binding. |
Formal Asp. Comput. |
2002 |
DBLP DOI BibTeX RDF |
Alpha-conversion, Permutation actions, Set theory, Abstract syntax, Structural induction |
| 1 | Andrew M. Pitts |
Tripos Theory in Retrospect. |
Mathematical Structures in Computer Science |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Equivariant Syntax and Semantics. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Nominal Logic: A First Order Theory of Names and Binding. |
TACS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Pitts |
A Fresh Approach to Representing Syntax with Static Binders in Functional Programming. |
ICFP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Parametric polymorphism and operational equivalence. |
Mathematical Structures in Computer Science |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Murdoch Gabbay |
A Metalanguage for Programming with Bound Names Modulo Renaming. |
MPC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Operational Semantics and Program Equivalence. |
APPSEM |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Gordon, Andrew M. Pitts |
Preface. |
Electr. Notes Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Tripos Theory in Retrospect. |
Electr. Notes Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Murdoch Gabbay, Andrew M. Pitts |
A New Approach to Abstract Syntax Involving Binders. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
permutation models, set theory, binding, abstract syntax |
| 1 | Andrew M. Pitts, Joshua R. X. Ross |
Process Calculus Based Upon Evaluation to Committed Form. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Existential Types: Logical Relations and Operational Equivalence. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Operational Versus Denotational Methods in the Semantics of Higher Order Languages. |
PLILP/ALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
A Note on Logical Relations Between Semantics and Syntax. |
Logic Journal of the IGPL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Parametric Polymorphism and Operational Equivalence. |
Electr. Notes Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Gordon, Andrew M. Pitts, Carolyn L. Talcott |
Preface. |
Electr. Notes Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Relational Properties of Domains. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Joshua R. X. Ross |
Process Calculus Based upon Evaluation to Committed Form. |
CONCUR |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Reasoning about Local Variables with Operationally-Based Logical Relations. |
LICS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Eike Ritter, Andrew M. Pitts |
A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML. |
TLCA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
A co-Induction Principle for Recursively Defined Domains. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Completeness and Continuity Properties of Applicative Bisimulation. |
Theory and Formal Methods |
1994 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Computational Adequacy via "Mixed" Inductive Definitions. |
MFPS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts, Ian D. B. Stark |
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new? |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Relational Properties of Recursively Defined Domains |
LICS |
1993 |
RDF |
|
| 1 | Andrew M. Pitts |
Bisimulation and Co-induction (Tutorial) |
LICS |
1993 |
RDF |
|
| 1 | Roy L. Crole, Andrew M. Pitts |
New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
On an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic. |
J. Symb. Log. |
1992 |
DBLP BibTeX RDF |
|
| 1 | 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 |
CTCS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Roy L. Crole, Andrew M. Pitts |
New Foundations for Fixpoint Computations |
LICS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic. |
Ann. Pure Appl. Logic |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
Category Theory and Computer Science |
1989 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Non-trivial Power Types Can't Be Subtypes of Polymorphic Types |
LICS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Pitts |
Polymorphism is Set Theoretic, Constructively. |
Category Theory and Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")