<--- Back to Details
First PageDocument Content
Software engineering / Declarative programming / Computer programming / Functional programming / Monad / Evaluation strategy / Lambda calculus / Adjoint functors / Haskell / Type class / Ur
Date: 2012-02-14 20:56:25
Software engineering
Declarative programming
Computer programming
Functional programming
Monad
Evaluation strategy
Lambda calculus
Adjoint functors
Haskell
Type class
Ur

Evaluation strategies for monadic computations Tomas Petricek Computer Laboratory University of Cambridge United Kingdom

Add to Reading List

Source URL: arxiv.org

Download Document from Source Website

File Size: 177,73 KB

Share Document on Facebook

Similar Documents

Cartesian Closure for Stable Categories (draft) Paul Taylor

Cartesian Closure for Stable Categories (draft) Paul Taylor

DocID: 1rpTZ - View Document

207  Documenta Math. Acyclicity Versus Total Acyclicity for Complexes over Noetherian Rings

207 Documenta Math. Acyclicity Versus Total Acyclicity for Complexes over Noetherian Rings

DocID: 1rozM - View Document

ON CROSSED PRODUCT RINGS WITH TWISTED INVOLUTIONS, THEIR MODULE CATEGORIES AND L-THEORY arXiv:0710.2282v2 [math.KT] 15 Oct 2007

ON CROSSED PRODUCT RINGS WITH TWISTED INVOLUTIONS, THEIR MODULE CATEGORIES AND L-THEORY arXiv:0710.2282v2 [math.KT] 15 Oct 2007

DocID: 1rnm6 - View Document

879  Documenta Math. Rectification of Algebras and Modules Vladimir Hinich

879 Documenta Math. Rectification of Algebras and Modules Vladimir Hinich

DocID: 1rdIB - View Document

193  Documenta Math. On the Structure of Calabi-Yau Categories with a Cluster Tilting Subcategory

193 Documenta Math. On the Structure of Calabi-Yau Categories with a Cluster Tilting Subcategory

DocID: 1r84m - View Document