State dependent IO-monads in type theory

Electronic Notes in Theoretical Computer Science

Volumn 122, Issue , 2005, Pages 127-146

  Michelbrink, Markus ^a   Setzer, Anton ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Dependent type theory; Intensional type theory; Interactive programs; Martin L f type theory; Monad; Weakly final coalgebras

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPEN SYSTEMS; SET THEORY;

DEPENDENT TYPE THEORY; INTENSIONAL TYPE THEORY; INTERACTIVE PROGRAMS; MARTIN-LÖF TYPE THEORY; MONAD; WEAKLY FINAL COALGEBRAS;

COMPUTER SCIENCE;

EID: 14544297822     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.06.055     Document Type: Conference Paper

References (15)

1. Andrea Asperti, and Guiseppe Longo Categories, Types and Structures. An Introduction to Category Theory for the working computer scientist Foundations of Computing Series 1991 M.I.T. Press
2. C.D. Team The Coq proof assistant. reference manual Available from http://coq.inria.fr/doc/main.html 2003
3. Robert L. Constable Implementing Mathematics with the Nuprl Proof Development System 1986 Prentice-Hall Englewood Cliffs, NJ
4. Catarina Coquand Agda http://www.cs.chalmers.se~catarina/agda/
5. P. Hancock, and A. Setzer The IO monad in dependent type theory Electronic proceedings of the workshop on dependent types in programming Göteborg, 27-28 March 1999 2000 Available via http://www-sop.inria.fr/ oasis/DTP00/Proceedings/proceedings.html
6. Peter Hancock, and Anton Setzer Interactive programs in dependent type theory P. Clote H. Schwichtenberg Computer Science Logic. 14th international workshop CSL 2000 Springer Lecture Notes in Computer Science Vol. 1862 2000 317 331
7. Ingrid Lindström A Construction of non-well-founded Sets within Martin-Löf's Type Theory The Journal of Symbolic Logic 54 1 1989
8. Z. Luo Computation and reasoning 1994 Clarendon Press Oxford
9. Per Martin-Löf Intuitionistic Type Theory 1984 Bibliopolis Napoli
10. Lawrence S. Moss Parametric corecursion Theoretical Computer Science 260 2001
11. Bengt Nordström, Kent Peterson, and Jan M. Smith Programming in Martin-Löf's Type Theory: An Introduction 1990 Clarendon Press Oxford
12. Lawrence C. Paulson. Natural Deduction Proof as Higher-Order Resolution. Technical report 82, University of Cambridge Computer Laboratory, Cambridge, 1985
13. Kent Peterson. A Programming System for Type Theory. PMG Memo 21, Chalmers University of Technology, S-412 96 Göteborg, 1982
14. R. Pollack. The theory of LEGO. A proof checker for the extended calculus of constructions. PhD thesis, LFCS, Edinburgh, 1994
15. Philip Wadler The essence of functional programming 19th Symposium on Principles of Programming Languages Albuquerque volume 19 January 1992 ACM Press