Compiling Monads ∗ Olivier Danvy, J¨ urgen Koslowski, and Karoline Malmkjær

First Page		Document Content
Date: 2010-10-22 08:04:56 Adjoint functors Functional programming Models of computation Functional languages Monad Kleisli category Denotational semantics List comprehension Strong monad Software engineering Computing Computer programming		Compiling Monads ∗ Olivier Danvy, J¨ urgen Koslowski, and Karoline Malmkjær Add to Reading List Source URL: repository.readscheme.org Download Document from Source Website File Size: 203,56 KB Share Document on Facebook

	Prospect:  A Library and Compiler  for High-Level, High-Performance Scientific Computing in Julia Lindsey Kuper Parallel Computing Lab, Intel Labs DocID: 1qCIo - View Document
	Implicit Parallelism through Deep Language Embedding Alexander Alexandrov Asterios Katsifodimos Volker Markl DocID: 1ptjS - View Document
	Eager Comprehensions in Scheme The design of SRFI 42 Sebastian Egner Philips Research Laboratories, The Netherlands DocID: 1oZsD - View Document
	Informational_Text_Secondary_Short_August 2014.ppt DocID: 1oGyh - View Document
	Type-Directed Language Extension for Effectful Computations Evgenii Kotelnikov Chalmers University of Technology Gothenburg, Sweden DocID: 1nZQ5 - View Document