Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report) (1997)
Cached
Download Links
- [www.informatik.uni-freiburg.de]
- [www.cis.ksu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Second HOOTS Workshop |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Barthe97monadictype,
author = {Gilles Barthe and John Hatcliff and Peter Thiemann},
title = {Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)},
booktitle = {In Proceedings of the Second HOOTS Workshop},
year = {1997},
publisher = {Elsevier}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Pure type systems and computational monads are two parameterized frameworks that have proved to be quite useful in both theoretical and practical applications. We join the foundational concepts of both of these to obtain monadic type systems. Essentially, monadic type systems inherit the parameterized higher-order type structure of pure type systems and the monadic term and type structure used to capture computational effects in the theory of computational monads. We demonstrate that monadic type systems nicely characterize previous work and suggest how they can support several new theoretical and practical applications. A technical foundation for monadic type systems is laid by recasting and scaling up the main results from pure type systems (confluence, subject reduction, strong normalisation for particular classes of systems, etc.) and from operational presentations of computational monads (notions of operational equivalence based on applicative similarity, co-induction proof techni...
