Searching for "Comprehending Monads." – sorted by Relevance.
-
Comprehending Monads
- Comprehending Monads Philip Wadler University of Glasgow Abstract Category theorists invented
- Cited by 389 (12 self) – Add To MetaCart
-
Dual M-Sets: The Theoretical Framework and Applications
- . 307--313. ACM, 1987. [Wad90] Philip Wadler. "Comprehending Monads." In Proc. ACM Conf. on LISP
- Add To MetaCart
-
New Techniques for the Analysis and Implementation of Functional Programs
- --265. Ellis Horwood, 1987. [76] Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference
- Cited by 1 (1 self) – Add To MetaCart
-
Towards an Object-Oriented Query Algebra
- Report CS-TR 987, University of Wisconsin--Madison, December 1990. [Wad90] Philip Wadler. Comprehending
- Cited by 14 (2 self) – Add To MetaCart
-
State in Functional Languages - An Annotated Bibliography
- ] Philip L. Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on Lisp and Functional
- Cited by 1 (0 self) – Add To MetaCart
-
State-Based Functional Programming
- , for arbitrary monad (F, #, ) . This is the proposal of Wadler in Comprehending Monads [3]. There are some nice
- Add To MetaCart
-
Compiling Monads
- for "comprehending" monads and with an exemplary definitional -interpreter structured with monads [27, 28
- Cited by 9 (0 self) – Add To MetaCart
-
1st Year Transfer Dissertation
- . The semantics of Concurrent Haskell is defined as an outer monadic transition semantics "wrapped around
- Add To MetaCart
-
Monadic Maps and Folds for Arbitrary Datatypes
- , for arbitrary monad (M; j; ��) . This is the proposal of Wadler in Comprehending Monads [18]. When all programs
- Cited by 15 (0 self) – Add To MetaCart
-
INDEX equality 11, 169
- --314. Cambridge University Press, 1992. [175] P. Wadler. Comprehending monads. In Proceedings of ACM Conference
- Add To MetaCart

