Article

Free access

Monadic state: axiomatization and type safety

Authors:

John Launchbury,

Amr SabryAuthors Info & Claims

ICFP '97: Proceedings of the second ACM SIGPLAN international conference on Functional programming

Pages 227 - 238

https://doi.org/10.1145/258948.258970

Published: 01 August 1997 Publication History

Abstract

Type safety of imperative programs is an area fraught with difficulty and requiring great care. The SML solution to the problem, originally involving imperative type variables, has been recently simplified to the syntactic-value restriction. In Haskell, the problem is addressed in a rather different way using explicit monadic state. We present an operational semantics for state in Haskell and the first full proof of type safety. We demonstrate that the semantic notion of value provided by the explicit monadic types is able to avoid any problems with generalization.

References

[1]

ARIOLA, Z. M., AND FELLEISEN, M. The call-by-need lambda calculus. To appear in the Journal of Functional ProgramminE, 1996.

Digital Library

[2]

ARIOLA, Z. M., FELLEISEN, M., MARAIST, J., ODERSKY, M., AND WAOLER, P. A call-by-need lambda calculus. In A CM Symposium on Principles of Programming Languages (1995), pp. 233-246.

Digital Library

[3]

BOEHM, H.-J. Side effects and aliasing can have simple axiomatic descriptions. A CM T~ansactions on Programming Languages and Systems 7, 4 (Oct. 1985), 637-655.

Digital Library

[4]

CHEN, K., AND ODERSKY, M. A type system for a lambda calculus with assignment. In Theoretical Aspects of Compurer Software (1994), Springer Verlag, LNCS 789.

Digital Library

[5]

CRANK, E., AND FELLEISEN, M. Parameter-passing and the lambda calculus. In A CM Symposium on Principles of Programming Languages (1991), pp. 233-244.

Digital Library

[6]

DAMAS, L. M. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, 1985.

[7]

FELLEISEN, M., AND FRIEDMAN, D. A calculus for assignments in higher-order languages. In A CM Symposium on Principles of Programming Languages (1987), pp. 314-325.

Digital Library

[8]

FELLEISEN, M., AND HIEB, R. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science 102 (1992), 235-271. Technical Report 89-100, Rice University.

Digital Library

[9]

HOARE, C., HAYES, I., JIFENG, H., MORGAN, C., ROSCOE, A., SANDERS, J., SORENSEN, I., SP!VRY, J., AND SuttoN, B. Laws of programming. Communications of the A CM 30, 8 (1987), 672-686.

Digital Library

[10]

LAUNCHBURY, J. Lazy imperative programming. Technical Report, Yale University, 1993. ACM SIGPLAN Workshop on State in Programming Languages.

[11]

LAUNCHBURY, J., AND PEYTON JONES, S. L. Lazy functional state threads. In A CM SIGPLAN Conference on Programming Language Design and Implementation (1994), pp. 24- 35.

Digital Library

[12]

LAUNCHBURY, J., ANO PEYTON JONES, S. L. State in Haskell. Lisp and Symbolic Computation 8 (1995), 193-341.

Digital Library

[13]

MASON, I., AND TALCOTT, C. L. Equivalence in functional languages with effects. Journal of Functional Programming 1, 3 (July 1991), 287-327.

[14]

MILNER, R. A theory of type polymorphism in programming. Journal of Computer and System Sciences 17 (1978).

[15]

MILNER, R., TOFTE, M., HARPER, R., AND MACQUEEN, D. The Definition of Standard ML, Revised 1996. Forthcoming, 1996.

Digital Library

[16]

ODERSKY, M. A syntactic theory of local names. Technical Report YALEU/DCS/RR-965, Yale University, 1993.

[17]

ODERSKY, M., RABIN, D., AND HUDAK, P. Call by name, assignment, and the lambda calculus, in A CM Symposium on Principles of Programming Languages (Jan. 1993), pp. 43- 56.

[18]

O'HEARN, P. W., AND TENNENT, R. D. Relational parametricity and local variables. In A GM Symposium on Principles of Programming Languages (1993).

Digital Library

[19]

PETERSON, JOHN, ET AL. Report on the programming language Haskell (version 1.3). Technical Report YALEU/DCS/RR-1106, Yale University, 1996.

[20]

RABIN, D. Calculi for Functional Prmjramming Languages with Assignments. PhD thesis, Yale University, 1996. Technical Report YALEU/DCS/RR-1107.

Digital Library

[21]

RIECKE, J. G. Delimiting the scope of effects. In Conference on Functional Programming and Computer Architecture (1993), pp. 146-155.

Digital Library

[22]

RIECKE, J. G., AND VISWANATHAN, R. Isolating side effects in sequential languages. In A GM Symporium on Principles of Programming Languages (1995), pp. 1-12.

Digital Library

[23]

SABRY, A., AND FIELO, J. Reasoning about explicit and implicit representations of state. Technical Report YALEU/DCS/RR-968, Yale University, 1993. ACM SIG- PLAN Workshop on State in Programming Languages, pages 17-30.

[24]

SWARUP, V., REDDY, U., AND IRP. LANO, E. Assignments for applicative languages. In Conference on Functional Programming and Computer Architecture (1991), pp. 192-214.

Digital Library

[25]

TALPIN, J., AND JOUVELOT, P. The type and effect discipline. In IEEE Symposium on Logic in Computer Science (June 1992), pp. 162-173.

[26]

TOFTE, M. Type inference for polymorphic references. Information and Computation 89, 1 (November 1990), 1-34.

Digital Library

[27]

TORTS, M., ^ND TALPIN, J. Implementing the call-by-value calculus using a stack of regions. In A CM Symposium on Principles of Programming Languages (1994), pp. 188-201.

Digital Library

[28]

WADLER, P. Comprehending monads. In A CM Conference on Lisp and Functional Programming (1990), pp. 61-78.

Digital Library

[29]

WRIGHT, A. K., ANI) F~.LLEmRN, M. A syntactic approach to type soundness. Technical Report 91-160, Rice University, April 1991. Final version in Information and Computation 115 (1), 1994, 38-94.

Digital Library

Cited By

Boruch-Gruszecki AOdersky MLee ELhoták OBrachthäuser J(2023)Capturing TypesACM Transactions on Programming Languages and Systems10.1145/361800345:4(1-52)Online publication date: 20-Nov-2023
https://dl.acm.org/doi/10.1145/3618003
Ertel SAdam JRink NGoens ACastrillon JEisenberg R(2019)STCLang: state thread composition as a foundation for monadic dataflow parallelismProceedings of the 12th ACM SIGPLAN International Symposium on Haskell10.1145/3331545.3342600(146-161)Online publication date: 8-Aug-2019
https://dl.acm.org/doi/10.1145/3331545.3342600
Leijen DEisenberg RVazou N(2018)First class dynamic effect handlers: or, polymorphic heaps with dynamic effect handlersProceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3240719.3241789(51-64)Online publication date: 27-Sep-2018
https://dl.acm.org/doi/10.1145/3240719.3241789
Show More Cited By

Index Terms

Monadic state: axiomatization and type safety
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
2. Theory of computation

Recommendations

Monadic state: axiomatization and type safety

Type safety of imperative programs is an area fraught with difficulty and requiring great care. The SML solution to the problem, originally involving imperative type variables, has been recently simplified to the syntactic-value restriction. In Haskell, ...
Monadic Type Systems

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. ...
Correctness of Monadic State

The extension of Haskell with a built-in state monad combines mathematical elegance with operational efficiency: Semantically, at the source language level, constructs that act on the state are viewed as functions that pass an explicit store data ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICFP '97: Proceedings of the second ACM SIGPLAN international conference on Functional programming

August 1997

326 pages

ISBN:0897919181

DOI:10.1145/258948

Chairmen:
Simon Peyton Jones
Univ. of Glasgow, Glasgow, Scotland, UK
,
Mads Tofte
Univ. of Copenhagen, Denmark
,
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ

ACM SIGPLAN Notices Volume 32, Issue 8
Aug. 1997
322 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/258949
Chairmen:
Simon Peyton Jones
Univ. of Glasgow, Glasgow, Scotland, UK
,
Mads Tofte
Univ. of Copenhagen, Denmark
,
Editor:
A. Michael Berman
Rowan Univ. Glassboro, NJ
Issue’s Table of Contents

Copyright © 1997 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
IFIP WG 2.8: IFIP WG 2.8

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICFP97

Sponsor:

SIGPLAN
IFIP WG 2.8

ICFP97: International Conference on Functional Programming 1997

June 9 - 11, 1997

Amsterdam, The Netherlands

Acceptance Rates

ICFP '97 Paper Acceptance Rate 25 of 78 submissions, 32%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
429
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)14

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Boruch-Gruszecki AOdersky MLee ELhoták OBrachthäuser J(2023)Capturing TypesACM Transactions on Programming Languages and Systems10.1145/361800345:4(1-52)Online publication date: 20-Nov-2023
https://dl.acm.org/doi/10.1145/3618003
Ertel SAdam JRink NGoens ACastrillon JEisenberg R(2019)STCLang: state thread composition as a foundation for monadic dataflow parallelismProceedings of the 12th ACM SIGPLAN International Symposium on Haskell10.1145/3331545.3342600(146-161)Online publication date: 8-Aug-2019
https://dl.acm.org/doi/10.1145/3331545.3342600
Leijen DEisenberg RVazou N(2018)First class dynamic effect handlers: or, polymorphic heaps with dynamic effect handlersProceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3240719.3241789(51-64)Online publication date: 27-Sep-2018
https://dl.acm.org/doi/10.1145/3240719.3241789
Leijen DLindley SYorgey B(2017)Structured asynchrony with algebraic effectsProceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3122975.3122977(16-29)Online publication date: 3-Sep-2017
https://dl.acm.org/doi/10.1145/3122975.3122977
Hu ZHughes JWang M(2015)How functional programming matteredNational Science Review10.1093/nsr/nwv0422:3(349-370)Online publication date: 13-Jul-2015
https://doi.org/10.1093/nsr/nwv042
Kiselyov OShan C(2008)Lightweight monadic regionsACM SIGPLAN Notices10.1145/1543134.141128844:2(1-12)Online publication date: 25-Sep-2008
https://dl.acm.org/doi/10.1145/1543134.1411288
Kiselyov OShan CGill A(2008)Lightweight monadic regionsProceedings of the first ACM SIGPLAN symposium on Haskell10.1145/1411286.1411288(1-12)Online publication date: 25-Sep-2008
https://dl.acm.org/doi/10.1145/1411286.1411288
Terauchi TAiken A(2008)Witnessing side effectsACM Transactions on Programming Languages and Systems10.1145/1353445.135344930:3(1-42)Online publication date: 21-May-2008
https://dl.acm.org/doi/10.1145/1353445.1353449
Hudak PHughes JPeyton Jones SWadler PRyder BHailpern B(2007)A history of HaskellProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238856(12-1-12-55)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238856
Harrison W(2006)Proof abstraction for imperative languagesProceedings of the 4th Asian conference on Programming Languages and Systems10.1007/11924661_6(97-113)Online publication date: 8-Nov-2006
https://dl.acm.org/doi/10.1007/11924661_6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents