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

	Quantum Programs as Kleisli Maps Abraham Westerbaan Radboud University Nijmegen Furber and Jacobs have shown in their study of quantum computation that the category of commutative C∗ -algebras and DocID: 1t6A8 - View Document
	A fully abstract semantics for a higher-order functional language with nondeterministic computation A LAN J EFFREY A BSTRACT. This paper is about the relationship between the theory of monadic types and the practice of c DocID: 1jeOT - View Document
	PDF Document DocID: 1j3Hd - View Document
	Preorders on Monads and Coalgebraic Simulations Shin-ya Katsumata and Tetsuya Sato Research Institute for Mathematical Sciences, Kyoto University, Kyoto, , Japan {sinya,satoutet}@kurims.kyoto-u.ac.jp Abstract. W DocID: 1fBGG - View Document
	BRICS Basic Research in Computer Science BRICS RSPower et al.: A Representation Result for Free Cocompletions A Representation Result for DocID: 1aAD5 - View Document