Skip to main content
SpringerLink
Log in

A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2152))

Included in the following conference series:

Abstract

We present a formalisation, in the theorem proving system Isabelle/HOL, of a linear type system for the pi calculus, including a proof of runtime safety of typed processes. The use of a uniform encoding of pi calculus syntax in a meta language, the development of a general theory of type environments, and the structured formalisation of the main proofs, facilitate the adaptation of the Isabelle theories and proof scripts to variations on the language and other type systems.

Partially supported by EPSRC grants GR/L75177 and GR/N39494.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. G. deBruijn. Lambda calculus notation with nameless dummies. Indagationes Mathematicae, 34:381–392, 1972.

    MathSciNet  Google Scholar 

  2. J. Despeyroux. A higher-order specification of the pi-calculus. In Proceedings of the IFIP International Conference on Theoretical Computer Science, 2000.

    Google Scholar 

  3. C. Dubois. Proving ML type soundness within Coq. In M. Aagaard and J. Harrison, editors, Proceedings of TPHOLs2000, the 13th International Conference on Theorem Proving in Higher Order Logics, LNCS, pages 126–144. Springer, 2000.

    Chapter  Google Scholar 

  4. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 2001.

    Google Scholar 

  5. S. J. Gay and M. J. Hole. Types and subtypes for client-server interactions. In S. D. Swierstra, editor, ESOP’99: Proceedings of the European Symposium on Programming Languages and Systems, number 1576 in Lecture Notes in Computer Science, pages 74–90. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  6. J.-Y. Girard. Linear Logic. Theoretical Computer Science, 50(1):1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. D. Gordon and T. Melham. Five axioms of alpha conversion. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs’96, volume 1125 of Lecture Notes in Computer Science, pages 173–190. Springer-Verlag, 1996.

    Google Scholar 

  8. L. Henry-Gréard. Proof of the subject reduction property for a π-calculus in COQ. Technical Report 3698, INRIA Sophia-Antipolis, May 1999.

    Google Scholar 

  9. D. Hirschkoff. A full formalisation of π-calculus theory in the calculus of constructions. In Proceedings of the Tenth International Conference on Theorem Proving in Higher Order Logics, volume 1275 of Lecture Notes in Computer Science, pages 153–169. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  10. Honda, V. Vasconcelos, and M. Kubo. Language primitives and type discipline for structured communication-based programming. In Proceedings of the European Symposium on Programming, Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  11. F. Honsell, M. Miculan, and I. Scagnetto. π-calculus in (co)inductive type theory. Theoretical Computer Science, 253(2):239–285, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems, 21(5):914–947, September 1999.

    Google Scholar 

  13. J. McKinna and R. Pollack. Some lambda calculus and type theory formalized. Journal of Automated Reasoning, 23(3), 1999.

    Google Scholar 

  14. T. F. Melham. A mechanized theory of the π-calculus in HOL. Nordic Journal of Computing, 1(1):50–76, 1994.

    MathSciNet  Google Scholar 

  15. R. Milner. The polyadic π-calculus: A tutorial. Technical Report 91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1991.

    Google Scholar 

  16. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.

    Google Scholar 

  17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–77, September 1992.

    Google Scholar 

  18. L. C. Paulson. Isabelle — A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    MATH  Google Scholar 

  19. F. Pfenning and C. Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN’ 88 Symposium on Programming Language Design and Implementation. ACM Press, 1988.

    Google Scholar 

  20. Pierce and D. Sangiorgi. Types and subtypes for mobile processes. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1993.

    Google Scholar 

  21. C. Röckl. A first-order syntax for the pi-calculus in Isabelle/HOL using permutations. Technical report, Département d’Informatique, École Polytechnique Fédérale de Lausanne, 2001.

    Google Scholar 

  22. 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. In F. Honsell and M. Miculan, editors, Proceedings of FOSSACS’01, number 2030 in Lecture Notes in Computer Science, pages 364–378. Springer-Verlag, 2001.

    Google Scholar 

  23. D. Syme. Proving Java type soundness. In J. Alves-Foss, editor, Formal Syntax and Semantics of Java, volume 1523 of LNCS. Springer, 1999.

    Chapter  Google Scholar 

  24. K. Takeuchi, K. Honda, and M. Kubo. An interaction-based language and its typing system. In Proceedings of the 6th European Conference on Parallel Languages and Architectures, number 817 in Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  25. D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996.

    Google Scholar 

  26. D. von Oheimb and T. Nipkow. Machine-checking the Java specification: Proving type-safety. In J. Alves-Foss, editor, Formal Syntax and Semantics of Java, volume 1523 of LNCS, pages 119–156. Springer, 1999.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, UK

    Simon J. Gay

Authors
  1. Simon J. Gay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, G12 8QQ, Scotland, UK

    Richard J. Boulton

  2. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, King’s Buildings, Edinburgh, EH9 3JZ, Scotland, UK

    Paul B. Jackson

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gay, S.J. (2001). A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL. In: Boulton, R.J., Jackson, P.B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2001. Lecture Notes in Computer Science, vol 2152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44755-5_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-44755-5_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42525-0

  • Online ISBN: 978-3-540-44755-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation