A Hybrid encoding of Howe's method for establishing congruence of bisimilarity

Electronic Notes in Theoretical Computer Science

Volumn 70, Issue 2, 2002, Pages 60-75

  Momigliano, Alberto ^a   Ambler, Simon J ^a   Crole, Roy L ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER SIMULATION; OPTIMIZATION; SEMANTICS; SET THEORY;

HIGHER ORDER ABSTRACT SYNTAX (HOAS); HYBRID ENCODING; PRECONGRUENCE; TACTICAL THEOREM PROVING;

THEOREM PROVING;

EID: 18944369789     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80506-1     Document Type: Conference Paper

References (25)

1. A. Gordon. A mechanisation of name-carrying syntax up to alpha-conversion. In J.J. Joyce and C.-J.H. Seger, editors, International Workshop on Higher Order Logic Theorem Proving and its Applications, volume 780 of Lecture Notes in Computer Science, pages 414-427, Vancouver, Canada, Aug. 1993. University of British Columbia, Springer-Verlag, published 1994.
2. Abramsky S. The lazy lambda calculus. Turner D. Research Topics in Functional Programming. 1990;65-116 Addison-Wesley
3. Abramsky S., Ong L. Full abstraction in the lazy lambda calculus. Information and Computation. 105:1992;159-267
4. S. Ambler, R. Crole, and A. Momigliano. Combining higher order abstract syntax with tactical theorem proving and (co)induction. In In V. A. Carreño editor Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, Hampton, VA, 1-3 August 2002, pages 327-343, volume 2342 Lecture Notes in Computer Science, Springer Verlag, Berlin, 2002.
5. S. J. Ambler and R. L. Crole. Mechanised Operational Semantics via (Co)Induction. In Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of Lecture Notes in Computer Science, pages 221-238. Springer-Verlag, 1999.
6. N. Benton and A. Kennedy. Monads, effects and transformations. In Proceedings of the 3rd International Workshop in Higher Order Operational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science. Elsevier, 1998.
7. I. Cervesato and F. Pfenning. A linear logical framework. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 264-275, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
8. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 124-138, Edinburgh, Scotland, Apr. 1995. Springer-Verlag LNCS 902.
9. L.-H. Eriksson. Pi: An interactive derivation editor for the calculus of partial inductive definitions. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 821-825, Nancy, France, June 1994. Springer Verlag LNAI 814.
10. A. Felty. Two-level meta-reasoning in Coq. To appear in Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, 2002.
11. J. Frost. A case study of co-induction in Isabelle. Technical Report 359, University of Cambridge, Computer Laboratory, Feb. 1995. Revised version of CUCL 308, August 1993.
12. M. Hofmann. Semantical analysis for higher-order abstract syntax. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 204-213, Trento, Italy, July 1999. IEEE Computer Society Press.
13. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on systems in higher-order abstract syntax. In Proc. ICALP'01, number 2076 in LNCS, pages 963-978. Springer-Verlag, 2001.
14. Honsell F., Miculan M., Scagnetto I. π-calculus in (co)inductive type theories. Theoretical Computer Science. 2:(253):2001;239-285
15. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation. 124:(2):1996;103-112
16. M. Gabbay and A. Pitts. A new approach to abstract syntax involving binders. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 214-224, Trento, Italy, 1999. IEEE Computer Society Press.
17. Lassen S. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. Stephen Brookes M.M., Jung Achim, Scedrov A. Electronic Notes in Theoretical Computer Science. volume 20:2000;Elsevier Science Publishers
18. McDowell R., Miller D. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic. 3:(1):January 2002;80-136
19. McDowell R., Miller D., Palamidessi C. Encoding transition systems in sequent calculus. Theoretical Computer Science. 197:(1-2):May 1998;246-272
20. James McKinna and Robert Pollack. Some lambda calculus and type theory formalized. To appear in Journal of Automated Reasoning, Special Issue on Formalized Mathematical Theories, ed. F. Pfenning.
21. M. Miculan. Developing (meta)theory of lambda-calculus in the theory of contexts. In S. Ambler, R. Crole, and A. Momigliano, editors, MERLIN 2001: Proceedings of the Workshop on MEchanized Reasoning about Languages with variable bINding, volume 58 of Electronic Notes in Theoretical Computer Science, pages 1-22, November 2001.
22. A. Momigliano, S. Ambler, and R. Crole. A comparison of formalizations of the meta-theory of a language with variable bindings in Isabelle. In Supplementary Proceedings of TPHOLs 2001, Edinburg University Technical Report, 2001.
23. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.
24. A. M. Pitts. Operationally based theories of program equivalence. Technical report, Cambridge University Computer Laboratory, 1995. Notes to accompany lectures given at the Summer School on Semantics and Logics of Computation, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK.
25. C. Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie-Mellon University, 2000. CMU-CS-00-146.