Partiality and recursion in interactive theorem provers – an overview
Article in Mathematical Structures in Computer Science (November 2014)
The most recent citing publication is shown below. View this citation on Dimensions.
Types for Proofs and Programs
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Collection Principles in Dependent Type Theory
-
Altmetric BadgeChapter 2 Executing Higher Order Logic
-
Altmetric BadgeChapter 3 A Tour with Constructive Real Numbers
-
Altmetric BadgeChapter 4 An Implementation of Type:Type
-
Altmetric BadgeChapter 5 On the Logical Content of Computational Type Theory: A Solution to Curry’s Problem
-
Altmetric BadgeChapter 6 Constructive Reals in Coq: Axioms and Categoricity
-
Altmetric BadgeChapter 7 A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
-
Altmetric BadgeChapter 8 A Kripke-Style Model for the Admissibility of Structural Rules
-
Altmetric BadgeChapter 9 Towards Limit Computable Mathematics
-
Altmetric BadgeChapter 10 Formalizing the Halting Problem in a Constructive Type Theory
-
Altmetric BadgeChapter 11 On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
-
Altmetric BadgeChapter 12 Changing Data Structures in Type Theory: A Study of Natural Numbers
-
Altmetric BadgeChapter 13 Elimination with a Motive
-
Altmetric BadgeChapter 14 Generalization in Type Theory Based Proof Assistants
-
Altmetric BadgeChapter 15 An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma
Attention for Chapter 5:
On the Logical Content of Computational Type Theory: A Solution to Curry’s Problem