π-calculus in (Co)inductive-type theory

Theoretical Computer Science

Volumn 253, Issue 2, 2001, Pages 239-285

  Honsell, Furio ^a   Miculan, Marino ^a   Scagnetto, Ivan ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Higher order abstract syntax; Logical frameworks; Proof checking; Typed calculus; calculus

Indexed keywords

EID: 0034916645     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00095-5     Document Type: Article

References (37)

1. A. Avron, F. Honsell, I.A. Mason, R. Pollack, Using typed lambda calculus to implement formal systems on a machine, J. Automat. Reason. 9 (1992) 309-354.
2. The Coq Proof Assistant Reference Manual - Version 6.2, INRIA, May 1998, Available at ftp ://ftp.inria.fr/INRIA/coq/V6.2/doc.
3. T. Coquand, Infinite objects in type theory, in: Proc. TYPES'93, Lecture Notes in Computer Science, vol. 806, Springer, Berlin, 1994, pp. 62-78.
4. T. Coquand, G. Huet, The calculus of constructions, Inform, and Control 76 (1988) 95-120.
5. C. Cornes, D. Terrasse, Automating inversion and inductive predicates in Coq, in: Proc. TYPES'95, Lecture Notes in Computer Science, vol. 1158, Springer, Berlin, 1996, pp. 85-104.
6. J. Despeyroux, A. Felty, A. Hirschowitz, Higher-order syntax in Coq, Proc. TECA'95, Lecture Notes in Computer Science, vol. 905, Springer, Berlin, 1995.
7. J. Despeyroux, F. Pfenning, C. Schürmann, Primitive recursion for higher order abstract syntax, CMU-CS-96-172, School of Computer Science, Carnegie Mellon University, Pittsburgh, August 1996.
8. M. Felchero, Sistemi di transizione in teoria dei tipi coinduttivi, Laurea's Thesis, Università di Udine, Italy, July 1996 (in Italian).
9. H. Geuvers, Inductive and coinductive types with iteration and recursion. Available at http:// www.dcs.ed.ac.uk/lfcsinfo/research/types_bra/proc/proc92.dvi.gz, June 1992.
10. E. Gimenez, Codifying guarded recursion definitions with recursive schemes, Proc. TYPES'94, Lecture Notes in Computer Science, vol. 996, Springer, Berlin, 1995.
11. E. Giménez, An application of co-inductive types in Coq: verification of the alternating bit protocol, in: Proc. TYPES'95, Lecture Notes in Computer Science, vol. 1158, Springer, Berlin, 1996, pp. 134-152.
12. R. Harper, F. Honsell, G. Plotkin, A framework for defining logics, J. ACM 40 (1) (1993) 143-184.
13. D. Hirschkoff, Bisimulation proofs for the π-calculus in the Calculus of Constructions, Proc. TPHOE'97, Lecture Notes in Computer Science, vol. 1275, Springer, Berlin, 1997.
14. F. Honsell, M. Lenisa, U. Montanari, M. Pistore, Final semantics for the π-calculus, Proc. PROCOMET'98, IFIP and Chapman & Hall, London, 1998.
15. F. Honsell, M. Miculan, A natural deduction approach to dynamic logics, in: Proc. TYPES'95, Lecture Notes in Computer Science, vol. 1158, Springer, Berlin, 1996, pp. 165-182.
16. M. Hofmann, Semantical analysis of higher-order abstract syntax, Proc. 14th LICS, IEEE, New York, 1999.
17. M. Lenisa, Themes in final semantics, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, Italy, March 1998.
18. P. Martin-Löf, On the meaning of the logical constants and the justifications of the logic laws, TR 2, Dip. di Matematica, Università di Siena, 1985.
19. R. McDowell, D. Miller, A logic for reasoning with higher-order abstract syntax, Proc. 12th LICS, IEEE, New York, 1997.
20. T.F. Melham, A mechanized theory of the π-calculus in HOL, Nordic J. Comput. 1 (1) (1994) 50-76.
21. M. Miculan, The expressive power of structural operational semantics with explicit assumptions, in: Proc. TYPES'93 Lecture Notes in Computer Science, vol. 806, Springer, Berlin, 1994, pp. 292-320.
22. M. Miculan, Encoding logical theories of programs, Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, Italy, March 1997.
23. R. Milner, The polyadic π-calculus: a tutorial, in: Logic and Algebra of Specification, NATO ASI Series F, vol. 94, Springer, Berlin, 1993.
24. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Tech. Rep. ECS-LFCS-89-85, Dept. of Computer Science, Univ. of Edinburgh, June 1989.
25. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Inform, and Comput. 100 (1) (1992) 1-77.
26. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1) (1993) 149-171.
27. T. Nipkow, L.C. Paulson, Isabelle-91 - System abstract, Proc. CADE 11, Lecture Notes in Computer Science, vol. 607, Springer, Berlin, 1992, pp. 673-676.
28. B. Nordström, K. Petersson, J.M. Smith, Programming in Martin-Löf's Type Theory: An Introduction, OUP, Oxford, 1990.
29. C. Paulin-Mohring, Inductive definitions in the system Coq; rules and properties, Proc. TLCA'94, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 328-345.
30. F. Pfenning, C. Elliott, Higher-order abstract syntax, Proc. ACM SIGPLAN '88, ACM, New York, June 1988, pp. 199-208.
31. R. Pollack, The theory of LEGO, Ph.D. Thesis, Univ. of Edinburgh, 1994.
32. A. Rossi, Tipi di dati coinduttivi: i reali, Laurea's Thesis, Università di Udine, Italy, 1994.
33. D. Sangiorgi, A theory of bisimulation for the π-calculus, Acta Inform. 33 (1996) 69-97.
34. I. Scagnetto, Rappresentazione di algebre di processi in logical frameworks, Laurea's Thesis, Università di Udine, March 1997 (in italian).
35. P. Schroeder-Heister, A natural extension of natural deduction, J. Symbolic Logic 49 (4) (1984) 1284-1300.
36. Proc. TYPES'93, Lecture Notes in Computer Science, vol. 806, Springer, Berlin, 1994.
37. Proc. TYPES'95, Lecture Notes in Computer Science, vol. 1158, Springer, Berlin, 1996.