Representing Monads (1994)

Cached

Download Links

by Andrzej Filinski
Venue:Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages
Citations:130 - 3 self

Documents Related by Co-Citation

439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
730 Notions of Computation and Monads – Eugenio Moggi - 1991
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
150 The theory and practice of first-class prompts – M Felleisen - 1988
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
1312 Monads for functional programming – Philip Wadler - 1995
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
66 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
163 An abstract view of programming languages – E Moggi - 1989
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
456 Comprehending Monads – Philip Wadler - 1992
207 Type-directed partial evaluation – Olivier Danvy - 1996
233 Monad Transformers and Modular Interpreters – Sheng Liang, Paul Hudak, Mark Jones - 1995
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975