↓ 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 Weyl’s Predicative Classical Mathematics as a Logic-Enriched Type Theory
  3. Altmetric Badge
    Chapter 2 Crafting a Proof Assistant
  4. Altmetric Badge
    Chapter 3 On Constructive Cut Admissibility in Deduction Modulo
  5. Altmetric Badge
    Chapter 4 Fast Reflexive Arithmetic Tactics the Linear Case and Beyond
  6. Altmetric Badge
    Chapter 5 Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
  7. Altmetric Badge
    Chapter 6 Deciding Equality in the Constructor Theory
  8. Altmetric Badge
    Chapter 7 A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family
  9. Altmetric Badge
    Chapter 8 Truth Values Algebras and Proof Normalization
  10. Altmetric Badge
    Chapter 9 Curry-Style Types for Nominal Terms
  11. Altmetric Badge
    Chapter 10 (In)consistency of Extensions of Higher Order Logic and Type Theory
  12. Altmetric Badge
    Chapter 11 Constructive Type Classes in Isabelle
  13. Altmetric Badge
    Chapter 12 Zermelo’s Well-Ordering Theorem in Type Theory
  14. Altmetric Badge
    Chapter 13 A Finite First-Order Theory of Classes
  15. Altmetric Badge
    Chapter 14 Coinductive Correctness of Homographic and Quadratic Algorithms for Exact Real Numbers
  16. Altmetric Badge
    Chapter 15 Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
  17. Altmetric Badge
    Chapter 16 Subset Coercions in Coq
  18. Altmetric Badge
    Chapter 17 A Certified Distributed Security Logic for Authorizing Code
Attention for Chapter 5: Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
Altmetric Badge

Readers on

mendeley
10 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
Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
Chapter number 5
Book title
Types for Proofs and Programs
Published in
Lecture notes in computer science, April 2006
DOI 10.1007/978-3-540-74464-1_5
Book ISBNs
978-3-54-074463-4, 978-3-54-074464-1
Authors

Venanzio Capretta, Amy P. Felty, Capretta, Venanzio, Felty, Amy P.

Editors

Thorsten Altenkirch, Conor McBride

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 10%
Unknown 9 90%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 50%
Student > Bachelor 3 30%
Professor 2 20%
Readers by discipline Count As %
Computer Science 8 80%
Mathematics 2 20%

This page is provided by Altmetric.