Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory

From Sets and Types to Topology and Analysis: Towards Practicable Foundations for Constructive Mathematics

Volumn 9780198566519, Issue , 2005, Pages

  Hancock, Peter ^a   Setzer, Anton ^b  

^a Swansea ^*  (United Kingdom)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Client programs; Dependent type theory; Guarded induction; Haskell; Interactive programs; Polynomial functor; Server programs; Weakly final coalgebra

Indexed keywords

ALGEBRA;

CLIENT PROGRAMS; DEPENDENT TYPE THEORY; FINAL COALGEBRAS; GUARDED INDUCTION; HASKELL; INTERACTIVE PROGRAMS; POLYNOMIAL FUNCTORS; SERVER PROGRAMS;

FORMAL LANGUAGES;

EID: 84920751005     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198566519.003.0007     Document Type: Chapter

References (25)

1. Moggi, E. (1989). Computational lambda-calculus and monads. In:Proceedings of the Logic in Computer Science Conference.
2. Kent Petersson, K. and Synek, D. (1989). A set constructor for inductive sets in Martin-Löf ' type theory. In: Category theory and computer science (Manchester, 1989), pp. 128-140. LNCS 389, Springer.
3. Geuvers, H. (1992). Inductive and coinductive types with iteration and recursion. In: Informal proceedings of the 1992 workshop on Types for Proofs and Pro grams, Bastad 1992, Sweden, (eds B. Nordstrom, K. Petersson, and G. Plotkin), pp. 183-207.
4. Gimenéz, E. (1994). Codifying guarded definitions with recursive schemes. In Proceedings of the 1994 Workshop on Types for Proofs and Programs, pp. 39-59. LNCS No. 996.
5. Bertot, Y. and Castéran, P. (2004). Interactive Theorem Proving and Program Development. Springer.
6. Lindström, I. (1989). A construction of non-well-founded sets within Martin-Löf' type theory. Journal of Symbolic Logic, 54(1), 57-64.
7. Nordström, B., Petersson, K., and Smith, J. M. (1990). Programming in Martin Löf's Type Theory: An Introduction. Clarendon Press, Oxford.
8. Gordon, A. (1994). Functional programming and Input/Output. Distinguished Dissertations in Computer Science. Cambridge University Press.
9. Hancock, P. and Setzer, A. The IO monad in dependent type theory. In Electronic proceedings of the workshop on dependent types in programming, Goteborg, 27-28 March 1999. Available via http://www.md.chalmers.se/Cs/ Research/Semantics/APPSEM/dtp99.html.
10. Hancock, P. and Setzer, A. (2000). Interactive programs in dependent type theory. In: Computer Science Logic. 14th international workshop, CSL 2000, (eds P. Clote and Schwichtenberg H.), Volume 1862 of Springer Lecture Notes in Computer Science, pp. 317-331.
11. Hancock, P. and Setzer, A. Specifying interactions with dependent types. In Workshop on subtyping and dependent types in programming, Portugal, 7 July 2000. Electronic proceedings, available via http://www-sop.inria.fr/oasis/ DTP00/Proceedings/proceedings.html.
12. Dybjer, P. (1997). Representing inductively defined sets by wellorderings in Martin-Löf' type theory. Theoret. Comput. Sci., 176(1-2), 329-335.
13. Michelbrink, M. and Setzer, A. (2005). State dependent IO-monads in type theory. Proceedings of the CTCS'04, Electronic Notes in Theoretical Computer Science, 122. pp. 127-146. Elsevier.
14. Dybjer, P. and Setzer, A. (2003). Induction-recursion and initial algebras. Annals of Pure and Applied Logic, 124 1-47.
15. Coquand, T. (1994). Infinite objects in type theory. In: Types for Proofs and Programs, International Workshop TYPES'93, Nijmegen, The Netherlands, May 24-28, 1993, Selected Papers, (eds H. Barendregt and T. Nipkow), volume 806 of Lecture Notes in Computer Science, pp. 62-78. Springer.
16. Altenkirch, T. (2001). Representations of first order function types as terminal coalgebras. In: Typed Lambda Calculi and Applications, TLCA 2001, number 2044 in Lecture Notes in Computer Science, pp. 8-21.
17. Hallnas, L. (1987). An intensional characterization of the largest bisimulation. Theoretical Computer Science, 53, 335-343.
18. Hancock, P. (2000). Ordinals and interactive programs. PhD thesis, LFCS, Univer sity of Edinburgh.
19. Hancock, P. and Hyvernat, P. (2004). Programming as applied basic topology. Submitted, available via http://homepages.inf.ed.ac.uk/v1phanc1/ chat.html.
20. Jacobs, B. (1999). Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics 141, North Holland, Elsevier.
21. Martin-Löf, P. (1984). Intuitionistic Type Theory, volume 1 of Studies in Proof Theory: Lecture Notes. Bibliopolis, Napoli.
22. Milner, R. (1989). Communication and Concurrency. Prentice Hall.
23. Moggi, E. (1991). Notions of computation and monads. Information and Computation, 93(1), 55-92.
24. Peyton Jones, S. L. and Wadler, P. (1993, January). Imperative functional programming. In: 20'th ACM Symposium on Principles of Programming Languages, Charlotte, North Carolina.
25. Wadler, P. (1994). Monads for functional programming. In: Program Design Calculi, volume 118 of NATO ASI series, Series F: Computer and System Sciences(ed M. Broy), Springer Verlag.