Monadic type systems: Pure type systems for impure settings (Preliminary Report)

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 54-120

  Barthe, Gilles ^a   Hatcliff, John ^b   Thiemann, Peter ^c  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b Department of Computer Science   (United States)

^c UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Functional programming; Monads; Operational semantics; Polymorphism; Pure type systems

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; PROGRAM COMPILERS; SEMANTICS;

FUNCTIONAL PROGRAMMING; MONADS; OPERATIONAL SEMANTICS; POLYMORPHISM; PURE TYPE SYSTEMS;

COMPUTER SCIENCE;

EID: 19144363682     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80691-7     Document Type: Conference Paper

References (50)

1. Audebaud P. Partial objects in the calculus of constructions. In Proceedings of LICS'91. 1991;86-95 IEEE Computer Society Press
2. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.
3. Barendregt H. Introduction to Generalised Type Systems. Journal of Functional Programming. 1:(2):April 1991;125-154
4. Barendregt H. Lambda calculi with types. Abramsky S., Gabbay D., Maibaum T. Handbook of Logic in Computer Science. Volume 2:1992;117-309 Oxford Science Publications
5. G. Barthe. The relevance of proof-irrelevance. Manuscript, 1997.
6. Barthe Gilles, Hatcliff John, Heine Sørensen Morten. CPS translations and applications: the cube and beyond. Danvy Olivier. Proceedings of the Second ACM SIGPLAN Workshop on Continuations, number NS-96 - 13 in BRICS Notes. January 1997;Dept. of Computer Science, Paris, France. Aarhus, Denmark, 4-1-4-31
7. Benton N. Strictness Analysis of Lazy Functional Programs. 1992;PhD thesis, University of Cambridge
8. L. Cardelli. Phase distinctions in type theory. Unpublished Mansucript, January 1988.
9. T. Coquand. Typechecking dependent types. Privately circulated manuscript, 1998.
10. Coquand T., Herbelin H. A-translation and looping combinators in pure type systems. Journal of Functional Programming. 4:(1):January 1994;77-88
11. Danvy O. Type-directed partial evaluation. In Proceedings of POPL'96. 1996;242-257 ACM Press
12. Danvy Olivier, Hatcliff John. Cps transformation after strictness analysis. Letters on Programming Languages and Systems. 1:(3):1993;195-212
13. Danvy Olivier, Hatcliff John. On the transformation between direct and continuation semantics. Brookes Stephen, Main Michael, Melton Austin, Mislove Michael, Schmidt David. Proc. of the 9th Conference on Mathematical Foundations of Programming Semantics, volume 802 of Lecture Notes in Computer Science. April 1993;627-638 Springer-Verlag, New Orleans, Louisiana
14. Dussart D., Hughes J., Thiemann P. Type specialisation for imperative languages. In Proceedings of ICFP'97. 1997;204-216 ACM Press
15. Felleisen Matthias, Hieb Robert. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science. 10:(2):1992;235-271
16. Flanagan Cormac, Sabry Amr, Duba Bruce F., Felleisen Matthias. The essence of compiling with continuations. In Proc. of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation. June 1993;237-247 Albuquerque, New Mexico
17. Garrigue J., Rémy D. Extending ML with semi-explicit higher-order polymorphism. In Proceedings of TACS'97, volume 1281 of Lecture Notes in Computer Science. 1997;20-46 Springer-Verlag
18. Geuvers H. Logics and type systems. 1993;PhD thesis, University of Nijmegen
19. Girard J-Y. Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Thèse d'Etat. 7:1972;Université Paris
20. Girard J.-Y., Lafont Y., Taylor P. Proofs and Types. Number 7 in Tracts in Theoretical Computer Science. 1989;Cambridge University Press
21. Gordon Andrew D. Functional Programming and Input/Output. 1994;Cambridge University Press
22. Harper R., Lillibridge M. Explicit polymorphism and CPS conversion. In Proceedings ofPOPL'93. 1993;206-219 ACM Press
23. Harper Robert, Lillibridge Mark. Polymorphic type assignment and cps conversion. Lisp and Symbolic Computation. 6:(4):1993;361-380
24. w with control operators. Journal of Functional Programming. 6:(3):May 1996;393-417
25. Harper Robert, Mitchell John C. On the type structure of standard ML. ACM Transactions on Programming Languages and Systems. 15:(2):April 1993;211-252
26. Harper Robert, Morrisett Greg. Compiling polymorphism using intensional type analysis. In Proc. 22nd Annual ACM Symposium on Principles of Programming Languages. January 1995;130-141 ACM Press, San Francisco, CA
27. Hatcliff J., Danvy O. A computational formalization for partial evaluation. Mathematical Structures in Computer Science. 7:(5):October 1997;507-541
28. Hatcliff John, Danvy Olivier. A generic account of continuation-passing styles. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages. January 1994;458-471 ACM Press, Portland, OG
29. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation. 124:(2):February 1996;103-112
30. Hughes John. Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference. Danvy Olivier, Glück Robert, Thiemann Peter. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. February 1996;183-215 Dagstuhl, Germany. Springer Verlag, Heidelberg.
31. S. Jones Peyton, Meijer E. Henk: a typed intermediate language. Proceedings of the ACM Workshop on Types in Compilation. 1997
32. Lawall J., Thiemann P. Sound specialization in the presence of computational effects. In Proceedings of TACS'97, volume 1281 of Lecture Notes in Computer Science. 1997;165-190 Springer-Verlag
33. Leroy X. Polymorphism by name for references and continuations. In Proceedings of POPL'93. 1993;220-231 ACM Press
34. Milner R., Tofte M., Harper R., MacQueen D. The Definition of Standard ML (Revised). 1997;The MIT Press
35. Minamide Yasuhiko, Morrisett Greg, Harper Robert. Typed closure conversion. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages. January 1996;271-283 ACM Press, St. Petersburg, Fla
36. Moggi Eugenio. Notions of computations and monads. Information and Computation. 93:1991;55-92
37. Odersky M., Läufer K. Putting type annotations to work. In Proceedings of POPL'96. 1996;54-67 ACM Press
38. Jones S.Peyton, Launchbury J., Shields M., Tolmach A. The design of a typed intermediate language. In Proceedings of POPL'98. 1998;ACM Press
39. Jones Simon L Peyton, Hall Cordelia, Hammond Kevin, Partain Will, Wadler Philip. The Glasgow Haskell compiler: a technical overview. In Proceedings of the UK Joint Framework for Information Technology (JFIT) Technical Conference, Keele. 1993
40. Peyton Jones S.L., Wadler P.L. Imperative functional programming. In Proceedings of POPL'93. 1993;71-84 ACM Press
41. Pollack R. The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. 1994;PhD thesis, University of Edinburgh
42. Reynolds John C. Definitional interpreters for higher-order programming languages. In ACM Annual Conference. July 1972;717-740
43. Ritter E., Pitts A.M. A fully abstract translation between a λ-calculus with reference types and Standard ML. Dezani-Ciancaglini M., Plotkin G. Proceedings of TLCA'95, volume 902 of Lecture Notes in Computer Science. 1995;397-413 Springer-Verlag
44. Sabry Amr, Field John. Reasoning about explicit and implicit representations of state. Hudak Paul. SIPL '93, ACM SIGPLAN Workshop on State in Programming Languages. June 1993;17-30. Copenhagen, Denmark, Yale University, Department of Computer Science, New Haven, CT. Technical Report YALEU/DCS/RR - 968.
45. Shao Zhong. Typed common intermediate format. In Conference on Domain-Specific Languages, Santa Barbara, CA. October 1997;. USENIX
46. Shao Zhong, Appel Andrew W. A type-based compiler for Standard ML. In Proc. of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, La Jolla, CA, USA. June 1995;ACM Press
47. Tarditi Dave, Morrisett Greg, Cheng P., Stone Chris, Harper Robert, Lee Peter. TIL: A type-directed optimizing compiler for ML. In Proc. of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation. May 1996;181-192 ACM Press, Philadelphia, PA, USA
48. Thiemann Peter, Dussart Dirk. Partial evaluation for higher-order languages with state. Berichte des Wilhelm-Schickard-Instituts WSI-97-XX, Universitt Tbingen. April 1997
49. Tofte Mads. Type inference for polymorphic references. Information and Computation. 89:1990;1-34
50. Wadler Philip L. The essence of functional programming. In Proc. 19th Annual ACM Symposium on Principles of Programming Languages. January 1992;1-14 ACM Press, Albuquerque, New Mexico