Operational semantics using the partiality monad

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2012, Pages 127-138

  Danielsson, Nils Anders ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

dependent types; mixed induction and coinduction; partiality monad

Indexed keywords

COINDUCTION; COMPILER CORRECTNESS; COMPUTABLE FUNCTIONS; DEPENDENT TYPES; FUNCTIONAL LANGUAGES; FUNCTIONAL SEMANTICS; LAMBDA-CALCULI; OPERATIONAL SEMANTICS; PARTIALITY MONAD; PROOF ASSISTANT; VIRTUAL MACHINES;

BIOMINERALIZATION; COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS; SEMANTICS;

FUNCTIONAL PROGRAMMING;

EID: 84867499838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2364527.2364546     Document Type: Conference Paper

References (31)

1. Andreas Abel. MiniAgda: Integrating sized and dependent types. In Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR 2010), volume 43 of EPTCS, 2010. doi:10.4204/EPTCS.43.2.
2. Samson Abramsky. The lazy lambda calculus. In Research Topics in Functional Programming. Addison-Wesley, 1990.
3. The Agda Team. The Agda Wiki. Available at http://wiki.portal.chalmers. se/agda/, 2012.
4. Thorsten Altenkirch and Nils Anders Danielsson. Termination checking in the presence of nested inductive and coinductive types. Short note supporting a talk given at the Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR 2010), 2010.
5. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, StephanieWeirich, and Steve Zdancewic. Mechanized metatheory for the masses: The PoplMark challenge. In Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, volume 3603 of LNCS, pages 50-65, 2005. doi:10.1007/11541868 4.
6. Nick Benton and Chung-Kil Hur. Biorthogonality, step-indexing and compiler correctness. In ICFP'09, Proceedings of the 2009 ACM SIGPLAN International Conference on Functional Programming, pages 97-107, 2009. doi:10.1145/1596550.1596567.
7. Nick Benton, Andrew Kennedy, and Carsten Varming. Some domain theory and denotational semantics in Coq. In Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, volume 5674 of LNCS, pages 115-130, 2009. doi:10.1007/978-3-642-03359-9 10.
8. Venanzio Capretta. General recursion via coinductive types. Logical Methods in Computer Science, 1(2):1-28, 2005. doi:10.2168/LMCS-1(2:1)2005.
9. The Coq Development Team. The Coq Proof Assistant, Reference Manual, Version 8.3pl3, 2011.
10. Thierry Coquand. Infinite objects in type theory. In Types for Proofs and Programs, International Workshop TYPES '93, volume 806 of LNCS, pages 62-78, 1994. doi:10.1007/3-540-58085-9-72.
11. Patrick Cousot and Radhia Cousot. Inductive definitions, semantics and abstract interpretations. In POPL '92, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 83-94, 1992. doi:10.1145/143165.143184.
12. Patrick Cousot and Radhia Cousot. Bi-inductive structural semantics. Information and Computation, 207(2):258-283, 2009. doi:10.1016/j.ic.2008.03.025.
13. Nils Anders Danielsson. Beating the productivity checker using embedded languages. In Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR 2010), volume 43 of EPTCS, pages 29-48, 2010. doi:10.4204/EPTCS.43.3.
14. Nils Anders Danielsson and Thorsten Altenkirch. Subtyping, declaratively: An exercise in mixed induction and coinduction. In Mathematics of Program Construction, 10th International Conference, MPC 2010, volume 6120 of LNCS, pages 100-118, 2010. doi:10.1007/978-3-642-13321-3-8.
15. Neil Ghani and Tarmo Uustalu. Monad combinators, non-determinism and probabilistic choice. Extended abstract distributed at the workshop on Categorical Methods in Concurrency, Interaction and Mobility (CMCIM 2004), 2004.
16. Sergey Goncharov and Lutz Schröder. A coinductive calculus for asynchronous side-effecting processes. In Fundamentals of Computation Theory, 18th International Symposium, FCT 2011, volume 6914 of LNCS, pages 276-287, 2011. doi:10.1007/978-3-642-22953-4 24.
17. Graham Hutton. Programming in Haskell. Cambridge University Press, 2007.
18. Xavier Leroy. Formal verification of a realistic compiler. Communications of the ACM, 52:107-115, 2009. doi:10.1145/1538788.1538814.
19. Xavier Leroy and Hervé Grall. Coinductive big-step operational semantics. Information and Computation, 207(2):284-304, 2009. doi:10.1016/j.ic.2007.12.004.
20. Robin Milner and Mads Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87(1):209-220, 1991. doi:10.1016/0304-3975(91) 90033-X.
21. Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Lab. for Found. of Comp. Sci., University of Edinburgh, 1990.
22. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991. doi:10.1016/0890-5401(91)90052-4.
23. Keiko Nakata and Tarmo Uustalu. Trace-based coinductive operational semantics for While: Big-step and small-step, relational and functional styles. In Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, volume 5674 of LNCS, pages 375-390, 2009. doi:10.1007/978-3-642-03359-9 26.
24. Keiko Nakata and Tarmo Uustalu. Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: An exercise in mixed induction-coinduction. In Proceedings Seventh Workshop on Structural Operational Semantics (SOS 2010), volume 32 of EPTCS, pages 57-75, 2010. doi:10.4204/EPTCS.32.5.
25. Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology and Göteborg University, 2007.
26. Christine Paulin-Mohring. A constructive denotational semantics for Kahn networks in Coq. In From Semantics to Computer Science: Essays in Honour of Gilles Kahn, pages 383-413. Cambridge University Press, 2009.
27. John C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM '72, Proceedings of the ACM annual conference, volume 2, pages 717-740, 1972. doi:10.1145/800194.805852.
28. J.J.M.M. Rutten. A note on coinduction and weak bisimilarity for while programs. Theoretical Informatics and Applications, 33:393-400, 1999. doi:10.1051/ita:1999125.
29. Davide Sangiorgi and Robin Milner. The problem of "weak bisimulation up to". In CONCUR '92, Third International Conference on Concurrency Theory, volume 630 of LNCS, pages 32-46, 1992. doi:10.1007/BFb0084781.
30. Mads Tofte. Type inference for polymorphic references. Information and Computation, 89(1):1-34, 1990. doi:10.1016/0890-5401(90)90018-D.
31. Philip Wadler. The essence of functional programming. In POPL '92, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 1-14, 1992. doi:10.1145/143165.143169.