Monadic state: axiomatization and type safety
Abstract
References
Index Terms
- Monadic state: axiomatization and type safety
Recommendations
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 ...
Monadic state: axiomatization and type safety
ICFP '97: Proceedings of the second ACM SIGPLAN international conference on Functional programmingType 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, ...
Truthful monadic abstractions
IJCAR'12: Proceedings of the 6th international joint conference on Automated ReasoningIn intuitionistic sequent calculi, detecting that a sequent is unprovable is often used to direct proof search. This is for instance seen in backward chaining, where an unprovable subgoal means that the proof search must backtrack. In undecidable logics,...
Comments
Information & Contributors
Information
Published In
- Chairmen:
- Simon Peyton Jones,
- Mads Tofte,
- Editor:
- A. Michael Berman
- August 1997326 pages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations23Total Citations
- 417Total Downloads
- Downloads (Last 12 months)64
- Downloads (Last 6 weeks)8
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in