Back to Results
First PageMeta Content
Mathematics / Adjoint functors / Computer programming / Type theory / F-coalgebra / Initial algebra / F-algebra / Map / Coalgebra / Category theory / Functional programming / Software engineering


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

Document Date: 2015-01-25 16:18:54

Open Document

File Size: 227,31 KB

Share Result on Facebook

Company

Security Type Systems / SRI International / T. Nipkow L. C. / Reliably Secure Software Systems / Cambridge University Press / MIT Press / /

Country

Germany / Netherlands / /

Facility

Germany Institute of Mathematics Simion Stoilow Bucharest / /

IndustryTerm

elegant devices / formal method tools / minimal solution / infinite systems / maximal solution / carrier set / carrier sets / /

Organization

Cambridge University / Theorem Proving Dmitriy Traytel Technische Universität München Munich / Germany Institute of Mathematics Simion Stoilow Bucharest / C.S. Lab. / Jasmin Christian Blanchette Technische Universität München Munich / MIT / Germany Andrei Popescu Technische Universität München Munich / /

Person

Tobias Nipkow / Makarius Wenzel / Mark Summerfield / Ai / Gunter Approach Melham / Florian Haftmann / Brian Huffman / Jasmin Christian Blanchette Technische Universität München / Elsa Gunter / Andreas Lochbihler / Christian Urban / /

Position

author / Proof Assistant / /

ProgrammingLanguage

ML / /

Technology

ASL / /

URL

http /

SocialTag