A Proof Search Specification of the π-Calculus

A Proof Search Specification of the π-Calculus (2004)

Cached

Download Links

by Alwen Tiu , Dale Miller

Venue:	IN 3RD WORKSHOP ON THE FOUNDATIONS OF GLOBAL UBIQUITOUS COMPUTING
Citations:	19 - 10 self

BibTeX

@INPROCEEDINGS{Tiu04aproof,
    author = {Alwen Tiu and Dale Miller},
    title = {A Proof Search Specification of the π-Calculus},
    booktitle = {IN 3RD WORKSHOP ON THE FOUNDATIONS OF GLOBAL UBIQUITOUS COMPUTING},
    year = {2004},
    pages = {79--101},
    publisher = {}
}

Bookmark

OpenURL

Abstract

We present a meta-logic that contains a new quantifier (for encoding "generic judgment") and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite π-calculus within this meta-logic. Since we

Citations

933	D.: A calculus of mobile processes - Milner, Parrow, et al. - 1992
729	A formulation of the simple theory of types - Church - 1940
367	The ⇡-calculus: A Theory of Mobile Processes - Sangiorgi, Walker - 2001
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
278	Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem - Bruijn - 1972
271	A logic programming language with lambda-abstraction, function variables, and simple unification - Miller - 1991
269	Higher-order abstract syntax - Pfenning, Elliott - 1988
209	Investigations into logical deduction - Gentzen - 1969
174	A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 - GABBAY, PITTS - 2001
173	Isabelle: The next 700 theorem provers - Paulson - 1990
146	Symbolic bisimulations - Hennessy, Lin - 1992
130	Abstract syntax and variable binding - Fiore, Plotkin, et al. - 1999
109	Unification under a mixed prefix - Miller - 1992
97	A unification algorithm for typed λ-calculus - Huet - 1975
90	Semantical analysis of higher-order abstract syntax - Hofmann
84	Reasoning with higher-order abstract syntax in a logical framework - McDowell, Miller - 2002
78	Symbolic trace analysis of cryptographic protocols - Boreale - 2001
61	A proof-theoretic approach to logic programming. II. Programs as definitions - Hallnäs, Schroeder-Heister - 1991
60	A theory of bisimulation for the π-calculus - Sangiorgi - 1996
57	Functional unification of higher-order patterns - Nipkow - 1993
56	Cut-elimination for a logic with definitions and induction - McDowell, Miller
48	Rules of definitional reflection, in: M - Schroeder-Heister - 1993
41	Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1991
38	A proof theory for generic judgments: An extended abstract - Miller, Tiu
36	A fixpoint theorem in linear logic, an email posting to the mailing list linear@cs.stanford.edu - Girard - 1992
30	System description: Teyjus—a compiler and abstract machine based implementation of λProlog - Nadathur, Mitchell - 1999
29	A logical framework for reasoning about logical specifications - Tiu - 2004
23	A finitary version of the calculus of partial inductive definitions - Eriksson - 1991
22	Abstract syntax for variable binders: An overview, in - Miller - 2000
18	Induction and co-induction in sequent calculus - Momigliano, Tiu
16	A symbolic semantics for the π-calculus - Boreale, Nicola - 1996
14	Symbolic Bisimulation using Tabled Constraint Logic Programming - Mukund, Ramakrishnan, et al. - 2000
14	The π-calculus in FM - Gabbay - 2003
13	Pi-calculus in (co)inductive type theory - Honsell, Miculan, et al.
11	A higher-order specification of the π-calculus - Despeyroux
10	Foundational aspects of syntax - Miller, Palamidessi - 1999
8	Final semantics for the π-calculus - Honsell, Lenisa, et al. - 1998
8	Higherorder abstract syntax with induction in isabelle/hol: Formalizing the pi-calculus and mechanizing the theory of contexts - Röckl, Hirschkoff, et al. - 2001
7	A full formalization of pi-calculus theory in the Calculus of Constructions - Hirschkoff - 1997
7	Cut-property and negation as failure - Stärk - 1994
6	Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem - Bruijn - 1972
3	A treatment of higher-order features in logic programming. Theory and Practice of Logic Programming - Nadathur