Imperative functional programming
Simon Jones, Philip L. Wadler · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1993
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.
Cited by 1,234 works. doi:10.1145/158511.158524 Open-access PDF
Authors
References
- The C Programming Language
- Linear logic
- Computational lambda-calculus and monads
- Comprehending monads
- The essence of functional programming
- A semantic model of reference counting and its abstraction (detailed summary)
- Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
- Linear Types can Change the World
- Computational interpretations of linear logic
- Type inference for polymorphic references