On the formalization of the modal μ-calculus in the calculus of inductive constructions

Information and Computation

Volumn 164, Issue 1, 2001, Pages 199-231

  Miculan, Marino ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Formal methods; Modal and temporal logics; Type theory; calculus

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONTEXT SENSITIVE GRAMMARS; SET THEORY; SYNTACTICS;

TEMPORAL LOGIC;

COMPUTATION THEORY;

EID: 0035835292     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2902     Document Type: Article

References (31)

1. Avron, A. (1991), Simple consequence relations, Inform. and Computation 92, 105-139.
2. Avron, A., Honsell, F., Mason, I. A., and Pollack, R. (1992), Using typed lambda calculus to implement formal systems on a machine, J. Automated Reasoning 9, 309-354.
3. Avron, A., Honsell, F., Miculan, M., and Paravano, C. (1998), Encoding modal logics in logical frameworks, Studia Logica 60, 161-208.
4. Benevides, M., and Maibaum, T. (1992), A constructive presentation for the modal connective of necessity (), J. Logic Comput 2, 31-50.
5. "The Coq Proof Assistant Reference Manual," Version 6.2, INRIA, May 1998, Available at ftp://ftp.inria.fr/INRIA/coq/V6.2/doc.
6. Church, A. (1940), A formulation of the simple theory of types, J. Symbolic Logic 5, 56-68.
7. D'Agostino, G., and Hollenberg, M. (2000), Logical questions concerning the μ-calculus: interpolation, Lyndon, and Łoś-Tarski, J. Symbolic Logic, in press.
8. Despeyroux, J., Felty, A., and Hirschowitz, A. (1995), Higher-order syntax in Coq, in "Proc. of TLCA'95," Lecture Notes in Computer Science, Vol. 902, Springer-Verlag, Berlin/New York.
9. Despeyroux, J., and Leleu, P. (1999), Primitive recursion for higher-order abstract syntax with dependant types, in "Proc. of FLOC'99 IMLA workshop."
10. Fiore, M.. Plotkin, G., and Turi, D. (1999), Abstract syntax and variable binding, in "Proc. of 14th LICS," pp. 193-202, IEEE Press, New York.
11. Gabbay, M., and Pitts, A. (1999), A new approach to abstract syntax involving binders, in "Proc. of 14th LICS," pp. 214-224, IEEE Press, New York.
12. Gentzen, G. (1969), Investigations into logical deduction, in "The collected papers of Gerhard Gentzen" (M. Szabo, Ed.), pp. 68-131, North Holland, Amsterdam.
13. Harper, R., Honsell, F., and Plotkin, G. (1993), A framework for defining logics, J. Amer. Comput. Mach. 40, 143-184.
14. Hofmann, M. (1999), Semantical analysis of higher-order abstract syntax, in "Proc. of 14th LICS," pp. 204-213, IEEE Press, New York.
15. Honsell, F., and Miculan, M. (1996), A natural deduction approach to dynamic logics, in "Proceedings of TYPES'95" (S. Berardi and M. Coppo, Eds.), Lecture Notes in Computer Science, Vol. 1158, pp. 165-182, Springer-Verlag, Berlin/New York.
16. Honsell, F., Miculan, M., and Scagnetto, I., π-calculus in (Co)Inductive type theory, Theoret. Comput. Sci., in press. [Also available at ftp//ftp.dimi.uniud.it/pub/miculan/ZCS99.ps.gz]
17. Kozen, D. (1983), Results on the propositional μ-calculus, Theoret. Comput. Sci. 27, 333-354.
18. "The LEGO Proof Assistant." Department of Computer Science, University of Edinburgh. Available at http//www.dcs.ed.ac.uk/home/lego.
19. Magnusson, L., and Nordström. B. (1994), The ALF proof editor and its proof engine, in "Proc. of TYPES'93." Lecture Notes in Computer Science, Vol. 806, pp. 213-237, Springer-Verlag, Berlin/New York.
20. Martin-Löf, P. (1985), "On the Meaning of the Logical Constants and the Justifications of the Logic Laws," Technical Report 2, Dip. di Matematica, Università di Siena.
21. Miculam M. (1997), "Encoding Logical Theories of Programs," Ph.D. thesis, TD-7/97, Dipartimento di Informatica, Università di Pisa, Italy.
22. Miller, D. (1991), Unification of simply typed lambda-terms as logic programming, in "Proc. of Eighth Intl. Conf. on Logic Programming," MIT, Cambridge, MA.
23. Nordström, B., Petersson, K.. and Smith, J. M. (1990), "Programming in Martin-Löf's Type Theory: An Introduction," Oxford Univ. Press, Oxford.
24. Paulin-Mohring, C. (1993), Inductive definitions in the system Coq; rules and properties, in "Proc. TLCA'93," Lecture Notes in Computer Science, Vol. 664, pp. 328-345, Springer-Verlag, Berlin/New York.
25. Pfenning, F. (1999), Logical frameworks, in "Handbook of Automated Reasoning," Elsevier, Amsterdam.
26. Simpson, A. (1994), "The Proof Theory and Semantics of Intuitionistic Modal Logic," Ph.D. thesis, LFCS, Univ. of Edinburgh.
27. Stirling, C. (1992), Modal and temporal logics, in "Handbook of Logic in Computer Science," Vol. 2. pp. 477-563. Oxford Univ. Press, Oxford.
28. Stirling, C., and Walker, D. (1983), Local model checking in the modal μ-calculus, Theoret. Comput. Sci. 89, 161-177.
29. Uustalu, T. (1998), "Natural Deduction for Intuitionistic Least and Greatest Fixedpoint Logics, with an Application to Program Construction," Ph.D. thesis, Dissertation TRITA-IT AVH 98:03, Dept. of Teleinformatics, Royal Inst. of Technology, Stockholm.
30. Yu, S., and Luo, Z. (1997), Implementing a model checker for Lego, in "Proc. of the 4th Inter Symp. of Formal Methods Europe, FME'97." Lecture Notes in Computer Science, Vol. 1313, Springer-Verlag, Berlin/New York.
31. Walukiewicz, I. (1995), Completeness of Kozen's axiomatisation, in "Proc. 10th LICS" (D. Kozen, Ed.), pp. 14-24, IEEE Press, New York.