A complete coinductive logical system for bisimulation equivalence on circular objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1578, Issue , 1999, Pages 243-257

  Lenisa, Marina ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMULATION EQUIVALENCES; CARTESIAN PRODUCTS; CIRCULAR OBJECTS; COALGEBRAS; COINDUCTIVE TYPES; ENDOFUNCTORS; FIXED POINTS; LOGICAL SYSTEM;

COMPUTATION THEORY;

EID: 18944378940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_17     Document Type: Conference Paper

References (23)

1. P Aczel. Non-well-founded sets, CSLI Lecture Notes 14, Stanford 1988.
2. J.de Bakker, E.de Vink. Control Flow Semantics, Foundations of Computing Series, The MIT Press, Cambridge, 1996.
3. L Barwise, L Moss. Vicious circles: On the mathematics of non-wellfounded phenomena, CSLI Publications, Stanford, 1996.
4. M Brandt, F Henglein. Coinductive axiomatization of recursive type equality and subtyping, TLCA’97Conf. Proc., P.de Groote, R.Hindley, eds., Springer LNCS 1210, 1997, 63-81.
5. T Coquand. Infinite Objects in Type Theory, Types for Proofs and Programs TYPES-93, Springer LNCS 806, 1994, 62-78.
6. M Fiore. A Coinduction Principle for Recursive Data Types Based on Bisimulation, Inf. & Comp. 127, 1996, 186-198.
7. M Forti, F Elonsell. Set theory with free construction principles, Ann. Scuola Norm. Sup. Pisa, Cl. Sci. (4) 10, 1983, 493-522.
8. E Giménez. Codifying guarded definitions with recursive schemes, Workshop on Types for Proofs and Programs, P.Dybjer et al. eds., Springer LNCS 996, 1994, 39-59.
9. E Giménez. An application of co-Inductive types in Coq: verification of the Alternating Bit Protocol, Workshop Types Proofs and Programs, 1995.
10. E Giménez. Un calcul de constructions infinies et son application a la ver- fication de systemes communicants, PhD Thesis, École normale superieure de Lyon, December 1996.
11. F Honsell, M Lenisa. Final Semantics for Untyped Lambda Calculus, TLCA’95 Conf. Proc., M.Dezani et al eds., Springer LNCS 902, 1995, 249-265.
12. M Lenisa. Final Semantics for a Higher Order Concurrent Language, CAAP’96, H.Kirchner et. al. eds., Springer LNCS 1059, 1996, 102-118.
13. M Lenisa. Themes in Final Semantics, Ph.D. Thesis TD-6/98, Diparti- mento di Informatica, Università di Pisa, March 1998.
14. N P Mendler, P Panangaden, R.L Constable. Infinite Objects in Type Theory, 1th LICS Conf. Proc., IEEE Computer Society Press, 1986, 249-255.
15. R Milner. Calculi for synchrony and asynchrony, TCS 25, 1983, 267-310.
16. R Milner. A complete inference system for a class of regular behaviours, I. of Computer and System Sciences 28, 1984, 39-466.
17. L Moss. Coalgebraic Logic, to appear in the Annals of Pure and Applied Logic.
18. A.M Pitts. Relational Properties of Domains, Inf. & Comp. 127, 1996.
19. G.Plotkin. Types and Partial Functions, Post-Graduate Lecture Notes, Department of Computer Science, University of Edinburgh, 1985.
20. J.J.M.M Rutten. Universal coalgebra: a theory of systems, Report CS- R9652, CWI, Amsterdam, 1996.
21. J J M M Rutten, D Turi. On the Foundations of Final Semantics: NonStandard Sets, Metric Spaces, Partial Orders, REX Conf. Proc., J.de Bakker et al. eds., Springer LNCS 666, 1993, 477-530.
22. C Talcott. A Theory for Program and Data type Specification, TCS, Disco90 Special Issue, 1990.
23. D Turi. Functorial Operational Semantics and its Denotational Dual, PhD thesis, CWI, 1996.