Henk Barendregt, Erik Barendsen  Home/Search
Context Related
| cs.kun.nl/pub/CompM...computations.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: Formal proofs in mathematics and computer science are being studied because these objects can be verified by a very simple computer program. An important open problem is whether these formal proofs can be generated with an effort not much greater than writing a mathematical paper in, say, L A T E X. Modern systems for proof-development make the formalization of reasoning relatively easy. Formalizing computations such that the results can be used in formal proofs is not immediate. In... (Update)
Context of citations to this paper: More
.... (on the computational level) indeed has the intended e ect (on the propositional level) The second idea, called Poincar e s principle in [2], states that propositions which can be veri ed by a computation are easy; i.e. no proof is required. This principle is incorporated in...
Cited by: More
Proof by Computation in the Coq system - Oostdijk, Geuvers (2000) (Correct)
Active bibliography (related documents): More All
0.3: The Impact of the Lambda Calculus in Logic and Computer Science - Barendregt (1997) (Correct)
0.3: Binary addition in Lego - Huisman (1997) (Correct)
0.2: Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999) (Correct)
Similar documents based on text: More All
0.1: Lambda Calculi with Types - Barendregt (1992) (Correct)
0.1: Informal Proceedings Of The 1993 Workshop On Types For Proofs And.. - (ed.) (1993) (Correct)
0.1: Learning To Program = Learning To Construct Mechanisms And.. - Soloway (1986) (Correct)
BibTeX entry: (Update)
Barendregt, H. and Barendsen, E. (1997), Autarkic Computations in Formal Proofs, Computing Science Institute, University of Nijmegen. http://citeseer.ist.psu.edu/barendregt97autarkic.html More
@misc{ barendregt97autarkic,
author = "H. Barendregt and E. Barendsen",
title = "Autarkic Computations in Formal Proofs",
text = "Barendregt, H. and Barendsen, E. (1997), Autarkic Computations in Formal
Proofs, Computing Science Institute, University of Nijmegen.",
year = "1997",
url = "citeseer.ist.psu.edu/barendregt97autarkic.html" }
Citations (may not include all citations):505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
382 Lambda calculi with types - Barendregt - 1992
191 The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
71 Selected Papers on Automath (context) - Nederpelt, Geuvers et al. - 1994
62 Programmer's Manual (context) - LISP - 1962
46 The calculus of constructions (context) - Coquand, Huet - 1988
6 La Science et l'Hypoth`ese (context) - Poincar'e - 1902
5 Personal communication (context) - Elbers - 1996
3 Proof by calculation (context) - Oostdijk - 1996
1 Lecture Notes in 5 Controlled by a `joystick (context) - Automatic, INRIA - 1994
1 University of Nijmegen (context) - Ruys - 1996
1 Stichting Mathematisch Centrum (context) - Aspers, de Bakker et al. - 1996
1 counting for mathematical proofs (context) - Cohen - 1996
1 CADE-12 (context) - Bundy - 1984
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