Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving

Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This also applies to the support for datatype definitions. However, the internal datatype construction used in HOL4, HOL Light, and...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Traytel, Dmitry, Popescu, Andrei, Blanchette, Jasmin C.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	(co)datatypes Abstracts cardinals Category theory higher-order logic interactive theorem proving Semantics Set theory Shape Theory of computation Theory of computation > Logic Theory of computation > Models of computation Theory of computation > Models of computation > Computability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!