↓ Skip to main content
What is this page? Embed badge

Types for Proofs and Programs

Overview of attention for book
Cover of 'Types for Proofs and Programs'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 (Co-)Iteration for Higher-Order Nested Datatypes
  3. Altmetric Badge
    Chapter 2 Program Extraction in Simply-Typed Higher Order Logic
  4. Altmetric Badge
    Chapter 3 General Recursion in Type Theory
  5. Altmetric Badge
    Chapter 4 Using Theory Morphisms for Implementing Formal Methods Tools
  6. Altmetric Badge
    Chapter 5 Subsets, Quotients and Partial Functions in Martin-Löf’s Type Theory
  7. Altmetric Badge
    Chapter 6 Mathematical Quotients and Quotient Types in Coq
  8. Altmetric Badge
    Chapter 7 A Constructive Formalization of the Fundamental Theorem of Calculus
  9. Altmetric Badge
    Chapter 8 Two Behavioural Lambda Models
  10. Altmetric Badge
    Chapter 9 A Unifying Approach to Recursive and Co-recursive Definitions
  11. Altmetric Badge
    Chapter 10 Holes with Binding Power
  12. Altmetric Badge
    Chapter 11 Typing with Conditions and Guarantees for Functional In-place Update
  13. Altmetric Badge
    Chapter 12 A New Extraction for Coq
  14. Altmetric Badge
    Chapter 13 Weak Transitivity in Coercive Subtyping
  15. Altmetric Badge
    Chapter 14 The Not So Simple Proof-Irrelevant Model of CC
  16. Altmetric Badge
    Chapter 15 Structured Proofs in Isar/HOL
  17. Altmetric Badge
    Chapter 16 Java as a Functional Programming Language
  18. Altmetric Badge
    Chapter 17 Monad Translating Inductive and Coinductive Types
  19. Altmetric Badge
    Chapter 18 A Finite First-Order Presentation of Set Theory
Attention for Chapter 2: Program Extraction in Simply-Typed Higher Order Logic
Altmetric Badge

Readers on

mendeley
3 Mendeley
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Program Extraction in Simply-Typed Higher Order Logic
Chapter number 2
Book title
Types for Proofs and Programs
Published by
Springer Berlin Heidelberg, January 2003
DOI 10.1007/3-540-39185-1_2
Book ISBNs
978-3-54-014031-3, 978-3-54-039185-2
Authors

Stefan Berghofer

Editors

Herman Geuvers, Freek Wiedijk

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 67%
Professor 1 33%
Readers by discipline Count As %
Computer Science 3 100%

This page is provided by Altmetric.