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

First Page		Document Content
Date: 2010-12-15 21:36:48 Category theory Models of computation Adjoint functors Functional programming Logic in computer science Denotational semantics Lambda calculus Cartesian closed category Sheaf F-algebra Kleisli category Monad		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 Add to Reading List Source URL: ect.bell-labs.com Download Document from Source Website File Size: 275,91 KB Share Document on Facebook

	Internal Completeness of Categories of Domains Paul Taylor 1985 This paper was presented at Category Theory and Computer Programming bf 1, University of Surrey (Guildford), SeptemberIt was published in Springer-Ve DocID: 1rqwq - View Document
	arXiv:0903.0340v3 [quant-ph] 6 JunPhysics, Topology, Logic and Computation: A Rosetta Stone John C. Baez Department of Mathematics, University of California DocID: 1r6vo - View Document
	Monoidal Indeterminates and Categories of Possible WorldsI C. Hermida, R. D. Tennent∗ School of Computing, Queen’s University, Kingston, Canada K7L 3N6 Abstract Given any symmetric monoidal category C, a small symmet DocID: 1qIeP - View Document
	Classical Mechanics, Lecture 19 March 13, 2008 lecture by John Baez notes by Alex Hoffnung 1 DocID: 1pY2p - View Document
	The Trace Factorisation of Stable Functors Paul Taylor 1998 Abstract A functor is stable if it has a left adjoint on each slice. Such functors arise as forgetful functors from categories of models of disjunctive theories DocID: 1pEJ6 - View Document