A proof search specification of the π-calculus

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 1, 2005, Pages 79-101

  Tiu, Alwen ^a   Miller, Dale ^b  

^a INRIA   (France)

^b INRIA   (France)

Author keywords

calculus; Bisimulation; Meta logic; Names; Proof search

Indexed keywords

Π-CALCULUS; BISIMULATION; INFERENCE RULES; META-LOGIC; NAMES; PROOF SEARCH;

COMPUTATIONAL METHODS; COMPUTER SIMULATION; NUMERICAL METHODS; SEMANTICS; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 24344503699     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.05.006     Document Type: Conference Paper

References (41)

1. S. Basu, M. Mukund, C.R. Ramakrishnan, I.V. Ramakrishnan, and R.M. Verma Local and symbolic bisimulation using tabled constraint logic programming Proc. of ICLP LNCS volume 2237 2001 Springer 166 180
2. M. Boreale Symbolic trace analysis of cryptographic protocols Proceedings of ICALP 2001 LNCS volume 2076 2001 Springer-Verlag 667 681
3. M. Boreale, and R.D. Nicola A symbolic semantics for the π-calculus Information and Computation 126 1 April 1996 34 52
4. A. Church A formulation of the simple theory of types Journal of Symbolic Logic 5 1940 56 68
5. N. de Bruijn Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem Indag. Math. 34 5 1972 381 392
6. J. Despeyroux. A higher-order specification of the π-calculus. In Proceedings of IFIP TCS 2000, Aug. 2000
7. L.-H. Eriksson A finitary version of the calculus of partial inductive definitions Proc. of the Second Int. Workshop on Extensions to Logic Programming LNAI volume 596 1991 Springer-Verlag 89 134
8. M.P. Fiore, G.D. Plotkin, and D. Turi Abstract syntax and variable binding Proceedings of LICS 1999 1999 IEEE 193 202
9. M.J. Gabbay The π-calculus in FM F. Kamareddine Thirty-five years of Automath, volume IV 2003 Kluwer 80 149
10. M.J. Gabbay, and A.M. Pitts A new approach to abstract syntax with variable binding Formal Aspects of Computing 13 2001 341 363
11. G. Gentzen Investigations into logical deductions M.E. Szabo The Collected Papers of Gerhard Gentzen 1969 North-Holland Publishing Co. Amsterdam 68 131
12. J.-Y. Girard. A fixpoint theorem in linear logic. Email to the linear@cs.stanford.edu mailing list, February 1992
13. L. Hallnäs, and P. Schroeder-Heister A proof-theoretic approach to logic programming. ii. Programs as definitions Journal of Logic and Computation 1 5 October 1991 635 660
14. M. Hennessy, and H. Lin Symbolic bisimulations Theoretical Computer Science 138 2 Feb. 1995 353 389
15. D. Hirschkoff A full formalization of pi-calculus theory in the Calculus of Constructions Proc. of TPHOLs'97 LNCS number 1275 1997 153 169
16. M. Hofmann Proc. of LICS 1999 1999 IEEE Computer Society Press 204 213
17. F. Honsell, M. Lenisa, U. Montanari, and M. Pistore. Final semantics for the π-calculus. In Proc. of PROCOMET'98, 1998
18. F. Honsell, M. Miculan, and I. Scagnetto Pi-calculus in (co)inductive type theory Theoretical Computer Science 253 2 2001 239 285
19. G. Huet A unification algorithm for typed λ-calculus Theoretical Computer Science 1 1975 27 57
20. R. McDowell, and D. Miller Cut-elimination for a logic with definitions and induction Theoretical Computer Science 232 2000 91 119
21. R. McDowell, and D. Miller Reasoning with higher-order abstract syntax in a logical framework ACM Trans. on Computational Logic 3 1 2002 80 136
22. D. Miller A logic programming language with lambda-abstraction, function variables, and simple unification J. of Logic and Comp. 1 4 1991 497 536
23. D. Miller Unification under a mixed prefix Journal of Symbolic Computation 14 1992 321 358
24. D. Miller Abstract syntax for variable binders: An overview J. Lloyd Computational Logic - CL 2000 LNAI number 1861 2000 Springer 239 253
25. D. Miller, and C. Palamidessi Foundational aspects of syntax P. Degano R. Gorrieri A. Marchetti-Spaccamela P. Wegner ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, volume 31 Sep 1999 ACM
26. D. Miller and A. Tiu. A proof theory for generic judgments: An extended abstract. In P. Kolaitis, editor, Proc. of LICS 2003, pages 118 - 127, July 2003
27. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes, Part II Information and Computation 1992 41 77
28. J.C. Mitchell, and E. Moggi Kripke-style models for typed lambda calculus Annals of Pure and Applied Logic 51 1991
29. A. Momigliano, and A. Tiu Induction and co-induction in sequent calculus Proc. of TYPES 2003 LNCS volume 3085 2003 Springer 293 308
30. G. Nadathur. A treatment of higher-order features in logic programming. Theory and Practice of Logic Programming, To appear
31. G. Nadathur, and D.J. Mitchell System description: Teyjus - a compiler and abstract machine based implementation of Lambda Prolog Proc. of the 16th Int. Conference on Automated Deduction 1999 Springer 287 291
32. T. Nipkow Functional unification of higher-order patterns M. Vardi LICS93 June 1993 IEEE 64 74
33. L.C. Paulson Isabelle: The next 700 theorem provers P. Odifreddi Logic and Computer Science 1990 Academic Press 361 386
34. F. Pfenning, and C. Elliott Higher-order abstract syntax Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation June 1988 ACM Press 199 208
35. F. Pfenning, and C. Schürmann System description: Twelf - A meta-logical framework for deductive systems H. Ganzinger Proc. of CADE-16 LNAI 1632 1999 Springer-Verlag 202 206
36. C. Röckl, D. Hirschkoff, and S. Berghofer Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts Proc. of FOSSACS'01 LNCS volume 2030 2001 Springer 364 378
37. D. Sangiorgi A theory of bisimulation for the π-calculus Acta Informatica 33 1 1996 69 97
38. D. Sangiorgi, and D. Walker π-Calculus: A Theory of Mobile Processes 2001 Cambridge University Press
39. P. Schroeder-Heister Rules of definitional reflection M. Vardi Proc. of LICS'93 1993 IEEE 222 232
40. R.F. Stärk Cut-property and negation as failure International Journal of Foundations of Computer Science 5 2 1994 129 164
41. A. Tiu. A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University, May 2004