Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany

First Page		Document Content
Date: 2015-01-25 16:18:54 Category theory Functional programming F-algebra F-coalgebra Functor Initial algebra Monad Equivalence of categories Coalgebra Stoneech compactification		Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 227,31 KB Share Document on Facebook

	Blank Canvas and the remote-monad design pattern A Foreign Function Interface to the JavaScript Canvas API Extended Abstract Andrew Gill Aleksander Eskilson DocID: 1uGgr - View Document
	Verifying Higher-order Programs with the Dijkstra Monad Nikhil Swamy1 Joel Weinberger2 Cole Schlesinger3 DocID: 1uwa2 - View Document
	Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found through links on the ENTCS Web Page. Iterated covariant powerset is not a monad 1 DocID: 1uoGn - View Document
	The Monad.Reader Issue 8 by Brent Yorgey and Conrad Parker September 10, 2007 Wouter Swierstra, editor. DocID: 1u6v0 - View Document