Henk Barendregt, Herman Geuvers  Home/Search
Context Related
| cs.kun.nl/pub/Comp...dregt_geuvers.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: school.cs.kun.nl/~henk/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Science and technology depend on true statements. Most of these are obtained via reasoning from experimental data using mathematics (models). Therefore the notion of proof that warrants correctness plays a highly important role. Even if a statement is proved, it may not be true; simply because a proof can be incorrect. Therefore a reliable technique of proof-checking has been proposed. For this method one needs fully formalised proofs. Since provability is undecidable, proofs in general cannot... (Update)
Context of citations to this paper: More
.... 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...
.... 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...
Cited by: More
Computer Theorem Proving in Math - Simpson (Correct)
Comparing Mathematical Provers - Freek Wiedijk University (2003) (Correct)
Open Proofs and Open Terms: A Basis for Interactive Logic.. - And Gueorgui Jojgov (Correct)
Similar documents (at the sentence level):
77.8%: Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999) (Correct)
Active bibliography (related documents): More All
0.6: The Impact of the Lambda Calculus in Logic and Computer Science - Barendregt (1997) (Correct)
0.5: A Linearization of the Lambda-Calculus and Consequences - Kfoury (2000) (Correct)
0.5: Reasoning about Java Classes - Jacobs, van den Berg, Huisman, van.. (1998) (Correct)
Similar documents based on text: More All
0.4: Lambda Calculi with Types - Barendregt (1992) (Correct)
0.4: Informal Proceedings Of The 1993 Workshop On Types For Proofs And.. - (ed.) (1993) (Correct)
0.3: Logics and Type Systems - Geuvers (1993) (Correct)
Related documents from co-citation: More All
4: Lambda Calculi with Types - Barendregt - 1992
3: an extended calculus of constructions - Luo - 1989
2: Construction and Deduction in Type Theories (context) - Strecker - 1999
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/article/barendregt99proofassistant.html More
@incollection{ barendregt01proofassistants,
author = "Henk Barendregt and Herman Geuvers",
title = "Proof-Assistants Using Dependent Type Systems",
booktitle = "Handbook of Automated Reasoning",
pages = "1149-1238",
year = "2001",
url = "citeseer.ist.psu.edu/article/barendregt99proofassistant.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940
382 Lambda calculi with types - Barendregt - 1992
334 A Computational Logic Handbook (context) - Boyer, Moore - 1997
133 Cambridge Tracts in Theoretical Computer Science (context) - Jean-Yves, Lafont et al. - 1989
132 Interpretation fonctionelle et elimination des coupures de l.. (context) - Girard - 1972
95 the Extended Calculus of Constructions - Luo - 1989
84 Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Zhaohui - 1994
65 The implementation of ALF: a proof-editor based on Martin-L.. - Magnusson - 1994
56 Lecture Notes in Computer Science (context) - Girard, ed - 1999
45 Synthesis of ml programs in the system coq (context) - Ch, Werner - 1993
44 An analysis of Girard's paradox - Coquand - 1986
41 Computational metatheory in nuprl (context) - Howe - 1988
24 Een nadere bewijstheoretische analyse van GSTT's (context) - Terlouw - 1989
24 Domain-free pure type systems - Barthe, orensen - 1996
23 Constructive validity (context) - Scott - 1970
23 An algorithm for type-checking dependent types - Thierry - 1996
22 The Principles of Mathematics - Russell - 1903
22 The Language Theory of Automath (context) - Daalen - 1980
20 Lecture Notes in Computer Science (context) - Bezem, Groote - 1993
19 Springer-Verlag (context) - Berardi, Coppo - 1996
18 Synthesizing proofs from programs in the calculus of inducti.. - Parent - 1995
17 Lecture Notes in Computer Science (context) - Th, Paulin-Mohring et al. - 1990
16 Type Dependence and Constructive Mathematics (context) - Berardi - 1990
16 Computer programs for checking mathematical proofs (context) - McCarthy - 1962
14 A proof of strong normalization for the theory of constructi.. - Coquand, Gallier - 1990
11 Volume 2: Background: Computational Structures (context) - Abramsky, Dov et al. - 1992
7 eorie des constructions (context) - Coquand - 1985
6 Pure type systems with denitions (context) - Severi, Poll - 1994
6 Bulletin of Symbolic Logic (context) - Barendregt - 1997
5 Type inference for pure type systems (context) - Severi - 1998
5 Weak and strong sum-elimination in intuitionistic type theor.. (context) - Swaen - 1989
5 Personal communication (context) - Elbers - 1996
4 The Church-Rosser property for -reduction in typed lambda c.. (context) - Geuvers - 1992
4 Formal verication of algorithms for critical systems (context) - Rushby, von Henke - 1993
3 Lecture Notes in Computer Science (context) - Dezani-Ciancaglini, Plotkin - 1995
3 A veried type checker (context) - Pollack - 1995
3 Universitaire School voor Informatica (context) - calculation, thesis - 2000
2 Architect: William McCune (context) - Internet, mcs et al. - 1998
2 Bezem and Groote (context) - Dowek - 1993
2 Modular verication of srt division (context) - Ruess, Shankar et al. - 1996
2 Available at URL : http://pauillac (context) - Coquand, Huet - 1988
2 Safe proof checking in type theory with y - Geuvers, Poll et al. - 1999
2 Strong normalisation in a lambda calculus with lambda struct.. (context) - Nederpelt - 1973
2 Automated Deduction|A Basis for Applications (context) - Bibel, Schmitt - 1998
1 Lecture Notes in Articial Intelligence and Lecture Notes in .. (context) - Alan, Automated et al. - 1994
1 Texts and Monographs in Symbolic Computation (context) - Wu - 1994
1 Personal communication (context) - Boyer - 1993
Documents on the same site (http://www-school.cs.kun.nl/~henk/papers.html): More
Completeness of Two Systems of Illative Combinatory.. - Dekkers, Bunder.. (1995) (Correct)
Enumerators of Lambda Terms Are Reducing Constructively - Barendregt (Correct)
Systems of Illative Combinatory Logic complete for.. - Barendregt, Bunder.. (1993) (Correct)
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