H. Geuvers, H. Barendregt. Proof Assistants using Dependent Type Systems, Chapter 18 of the Handbook of Automated Reasoning (Vol 2), eds. A. Robinson and A. Voronkov, Elsevier (2001), 1149 - 1238. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Isabelle/Isar - a versatile environment for human-readable formal .. - Wenzel (2002) (2 citations) (Correct)
....component. Even though Coq has been implemented in a type safe programming language, Milner s Correctness by Construction of LCF HOL has been given up in favor of the venerable de Bruijn principle , with independent checking of static proof objects [de Bruijn, 1980] see also the survey of [Barendregt and Geuvers, 2001]) In practice, both Coq and HOL achieve a similar level of reliability, but Coq demands significantly more time and space resources in realistic applications. Coq provides particular infrastructure to extract functional programs from constructive proofs. In principle, the internal # term ....
....logic, which shall serve as the very basis for formal logic issues to be covered later on. The subsequent presentation draws from similar formulations of the generic framework underlying Isabelle Pure [Paulson, 1989] Paulson, 1990] with further influences of type theory presentations like [Barendregt and Geuvers, 2001]. 2.2.1 Types and terms The basic syntactic framework of the logical environment introduced below is that of simply typed # terms modulo ### conversion, following the established practice of higher order abstract syntax [Pfenning and Elliott, 1988] Let name be a globally fixed (infinite) set ....
[Article contains additional citation context not shown here]
H. Barendregt and H. Geuvers. Proof assistants using dependent type systems. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier, 2001. 303
Modelling General Recursion in Type Theory - Bove, Capretta (2002) (3 citations) (Correct)
....for those who already have some knowledge of type theory, we recall the basic ideas and notions that we use. For a complete presentation of constructive type theory, see [ML84, NPS90, CNSvS94] A general formulation of type systems and their use in formal veri cation can be found in [Bar92] and [BG01] Constructive type theory comprises a basic type called Set and few type formers. We use in this work four of them, that is, four ways of constructing new types. The rst type former constructs the type of the elements of a set. Every element of Set is an inductively de ned type. It is usual ....
H. Barendregt and H. Geuvers. Proof-assistants using dependent type systems. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, chapter 18, pages 1149-1238. Elsevier Science Publishers, 2001.
Open Proofs and Open Terms: A Basis for Interactive Logic.. - And Gueorgui Jojgov Self-citation (Geuvers) (Correct)
No context found.
H. Barendregt and H. Geuvers. Proof assistants using dependent type systems. In Handbook of Automated Reasoning. Elsevier Science Publishers B. V., 1999. 548
Computer Theorem Proving in Math - Simpson (Correct)
No context found.
H. Geuvers, H. Barendregt. Proof Assistants using Dependent Type Systems, Chapter 18 of the Handbook of Automated Reasoning (Vol 2), eds. A. Robinson and A. Voronkov, Elsevier (2001), 1149 - 1238.
Comparing Mathematical Provers - Freek Wiedijk University (2003) (3 citations) (Correct)
No context found.
Henk Barendregt and Herman Geuvers. Proof-Assistants Using Dependent Type Systems. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers B.V., 2001.
Systems for Open Terms: An Overview - Jojgov (2001) (Correct)
No context found.
Henk Barendregt and Herman Geuvers. Proof assistants using dependent type systems. In Alan Robison and Andrei Voronkov, editors, Handbook of Automated Reasoning, chapter 1. Elsevier Science Publishers B.V., 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC