Resumptions, weak bisimilarity and big-step semantics for while with interactive I/O: An exercise in mixed induction-coinduction

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 32, Issue , 2010, Pages 57-75

  Nakata, Keiko ^a   Uustalu, Tarmo ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; SYSTEMS ENGINEERING; THEOREM PROVING;

BIG-STEP SEMANTICS; CO-INDUCTIVE DEFINITIONS; CONSTRUCTIVE TYPE THEORY; FINITE SEQUENCE; INDUCTIVE DEFINITIONS; OPERATIONAL SEMANTICS; TRACE-BASED SEMANTICS; WEAK BISIMILARITY;

SEMANTICS;

EID: 84954532658     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.32.5     Document Type: Conference Paper

References (21)

1. J. Bergstra, J. Klop & E.-R. Olderog (1987): Failures without chaos: A new process semantics for fair abstraction. In: M. Wirsing (ed.) Proc. of 3rd IFIP TC2/WG2.2 Working Conf. on Formal Description of Programming Concepts (Ebberup, Aug. 1986). North Holland, Amsterdam, pp. 77-101.
2. Y. Bertot (2007): A survey of programming language semantics styles. Coq development, http://www-sop.inria.fr/marelle/Yves.Bertot/proofs.html
3. A. Bohannon, B. C. Pierce, V. Sjöberg, S. Weirich & S. Zdancewic (2009): Reactive noninterference. In: Proc. of 2009 ACM Conf. on Computer and Communications Security, CCS 2009 (Chicago, IL, Nov. 2009), ACM Press, New York, pp. 79-90.
4. V Capretta (2005): General recursion via coinductive types. Logical Methods in Computer Science 1(2), article 1.
5. P. Cenciarelli & E. Moggi (1993): A syntactic approach to modularity in denotational semantics. In: Proc. of 5th Biennial Meeting on Category Theory and Computer Science, CTCS '93 (Amsterdam, Sept. 1993) Tech. report, CWI, Amsterdam.
6. N. A. Danielsson & T. Altenkirch (2009): Mixing induction and coinduction. Draft, http://www.cs.nott.ac.uk/~nad/publications/.
7. N. A. Danielsson & T. Altenkirch (2010): Subtyping, declaratively: an exercise in mixed induction and coinduction. In C. Bolduc, J. Desharnais & B. Ktari (Eds.): Proc. of 10th Int. Conf. on Mathematics of Program Construction, MPC 2010 (Québec City, July 2010), Lect. Notes in Comput. Sci. 6120. Springer, Berlin, pp. 100-118.
8. M. Ghani, P. Hancock & D. Pattinson (2009): Continuous functions on final coalgebras. In: S. Abramsky, M. Mislove & C. Palamidessi (eds.) Proc. of 25th Conf. on Mathematical Foundations of Programming Semantics, MFPS-25 (Oxford, Apr. 2009). Electr. Notes in Theor Comput. Sci. 249. Elsevier, Amsterdam, pp. 3-18.
9. E. Giménez (1995): Codifying guarded definitions with recursive schemes. In P. Dybjer, B. Nordström & J. M. Smith (Eds.): Selected Papers from Int. Wksh. on Types for Proofs and Programs, TYPES '94 (Båstad, June 1994), Lect. Notes in Comput. Sci. 996. Springer, Berlin, pp. 39-59
10. C. A. Gunter, P. D. Mosses & D. S. Scott (1989): Semantic Domains and Denotational Semantics.
11. P. Hancock, D. Pattinson & N. Ghani (2009): Representations of stream processors using nested fixed points. Logical Methods in Computer Science 5(3), article 9.
12. P. Hancock & A. Setzer, A. (2000): Interactive programs in dependent type theory. In: P. Clote & H. Schwichtenberg (eds.): Proc. of 14th Int. Wksh. on Computer Science Logic, CSL 2000 (Fischbachau, Aug. 2000). Lect. Notes in Comput. Sci. 1862. Springer, Berlin, pp. 317-331.
13. A. Kučera & R. Mayr (2002): Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theor. Comput. Sci. 270(1-2), pp. 677-700.
14. X. Leroy & H. Grall (2009): Coinductive big-step operational semantics. Inform. and Comput. 207(2), pp. 285-305.
15. N. P. Mendler (1991): Inductive types and type constraints in the second-order lambda calculus. Ann. of Pure and Appl. Logic 51(1-2), pp. 159-172.
16. R. Milner (1989): Communication and Concurrency. Prentice Hall, New York.
17. K. Nakata & T. Uustalu (2009): Trace-based coinductive operational semantics for While: big-step and small-step, relational and functional styles. In: S. Berghofer, T. Nipkow, C. Urban & M. Wenzel (eds.) Proc. of 22nd Int. Conf. on Theorem Proving in Higher-Order Logics, TPHOLs 2009 (Munich, Aug. 2009). Lect. Notes in Comput. Sci. 5674. Springer, Berlin, pp. 375-390.
18. K. Nakata & T. Uustalu (2010): A Hoare logic for the coinductive trace-based big-step semantics of While. In: A. D. Gordon (ed.) Proc. of 19th Europ. Symp. on Programming, ESOP 2010 (Paphos, March 2010). Lect. Notes in Comput. Sci. 6012. Springer, Berlin, pp. 488-506.
19. K. Nakata & T. Uustalu (2010): Mixed induction-coinduction at work for Coq (abstract). Abstract of talk presented at 2nd Coq Workshop (Edinburgh, July 2010), with accompanying slides and Coq development.
20. G. D. Plotkin (1983): Domains ("Pisa Notes"). Unpublished notes.
21. J. Rutten (1999): A note on coinduction and weak bisimilarity for While programs. Theor. Inform. and Appl. 33(4-5), pp. 393-400.