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

	Hardy-Ramanujan Journal – (yyyy), — submitted dd/mm/yyyy, accepted dd/mm/yyyy, revised dd/mm/yyyy Towards a proof of the Hodge conjecture, and cycle spaces in positive characteristic DocID: 1rj7x - View Document
	THE GEOMETRY OF FROBENIOIDS II: POLY-FROBENIOIDS Shinichi Mochizuki June 2008 DocID: 1r27W - View Document
	Categories and their Algebra James A. Overton September 13, 2005 Abstract The goal if this paper is to introduce the notion of a category, along with some basic results, and then to explore work done by Bret Tilson in hi DocID: 1pmw8 - View Document
	859 Documenta Math. Multiplicative Structures on Algebraic K -Theory Clark Barwick DocID: 1pcD8 - View Document
	Generator Induction in Order Sorted Algebras Olaf Owe and Ole-Johan Dahl Institute of Informatics University of Oslo Norway February 1989 DocID: 1oUQq - View Document