Gilles Barthe, Mark Ruys, Henk Barendregt  Home/Search
Context Related
| cs.kun.nl/pub/CompMath....twolevel.pdf 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: paracas.nl/prive/mark/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a simple and e#ective methodology for equational reasoning in proof checkers. The method is based on a two-level approach distinguishing between syntax and semantics of mathematical theories. The method is very general and can be carried out in any type system with inductive and oracle types. The potential of our two-level approach is illustrated by some examples developed in Lego. 1 (Update)
Context of citations to this paper: More
.... , Mark Ruys and Henk Barendregt May 15, 1996 Abstract We present a simple and e#ective methodology for equational reasoning in proof checkers. The method is based on a two level approach distinguishing between syntax and semantics of mathematical theories. The method is very...
...in Coq by Lo c Pottier. Another aim is the use of a two level approach to the derivation of propositions about algebraic objects (see [4]) In this approach, statements about objects are lifted to a syntactic level where they can be manipulated by operators. An example is...
Cited by: More
Isabelle/Isar - a versatile environment for human-readable formal .. - Wenzel (2002) (Correct)
Type Isomorphisms and Proof Reuse in Dependent Type Theory - Barthe, Pons (2001) (Correct)
Recursive Families of Inductive Types - Capretta (2000) (Correct)
Similar documents (at the sentence level):
54.9%: A Two-Level Approach towards Lean Proof-Checking - Barthe, Ruys, Barendregt (1996) (Correct)
Active bibliography (related documents): More All
1.6: Formalising mathematics in UTT: fundamentals and case studies - Barthe (1994) (Correct)
0.8: Towards Lean Proof Checking - Barthe, Elbers (1996) (Correct)
0.5: Extensions of Pure Type Systems - Barthe (1995) (Correct)
Similar documents based on text: More All
0.4: On the Complexity of Equational Problems in CNF over a Finite.. - Pichler (2000) (Correct)
0.1: Informal Proceedings Of The 1993 Workshop On Types For Proofs And.. - (ed.) (1993) (Correct)
0.1: Setoids in Type Theory - Barthe, Capretta, Pons (2000) (Correct)
Related documents from co-citation: More All
9: Lambda Calculi with Types - Barendregt - 1992
7: Term rewriting systems - Klop - 1992
6: Using re ection to build ecient and certied decision procedures (context) - Boutin - 1997
BibTeX entry: (Update)
G. Barthe, M. Ruys, and H. Barendregt. A two-level approach towards lean proofchecking. In S. Berardi and M. Coppo, editors, Proceedings of TYPES'95, volume 1158 of Lecture Notes in Computer Science, pages 16--35. Springer-Verlag, 1996. http://citeseer.ist.psu.edu/barthe96twolevel.html More
@inproceedings{ barthe95twolevel,
author = "Gilles Barthe and Mark Ruys and Henk Barendregt",
title = "A Two-Level Approach Towards Lean Proof-Checking",
booktitle = "{TYPES}",
pages = "16-35",
year = "1995",
url = "citeseer.ist.psu.edu/barthe96twolevel.html" }
Citations (may not include all citations):505 Implementing mathematics with the NuPrl proof development sy.. - Constable - 1986
474 Term-rewriting systems - Klop - 1992
191 LEGO proof development system: user's manual (context) - Luo, Pollack - 1992
109 Programming in Martin-Lof 's type theory (context) - Nordstrom, Petersson et al. - 1990
85 The Alf proof editor and its proof engine (context) - Magnusson, Nordstrom - 1993
84 Computation and reasoning: a type theory for computer scienc.. (context) - Luo - 1994
71 Selected papers on AUTOMATH (context) - Nederpelt - 1994
66 Handbook of logic in computer science (context) - Barendregt, -calculi - 1992
55 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
22 An intuitionistic theory of types (context) - Martin-Lof - 1984
21 Extending the HOL theorem prover with a computer algebra sys.. - Harrison, Thery - 1993
19 Automating reasoning in an implementation of constructive ty.. (context) - Howe - 1988
18 Exploring abstract algebra in constructive type theory (context) - Jackson - 1994
16 A two-level approach towards lean proof-checking - Barthe, Ruys et al. - 1996
6 Representing algebra in Lego (context) - Bailey - 1993
5 Mathematics and its Applications (context) - Cohn - 1981
5 Formalising mathematics in type theory: fundamentals and cas.. (context) - Barthe - 1994
2 A machine-assisted construction of the real numbers (context) - Elbers - 1993
2 The Coq proof assistant user's guide Technical Report (context) - Dowek - 1993
2 Towards a mathematical vernacular (context) - Barthe - 1994
2 Theorems and algorithms: an interface between Maple and Isab.. (context) - Ballarins, Homann et al.
2 satisfying the group axioms (context) - be, group
1 be a signature (context) - nat, Let
1 to appear in the proceedings of CSL (context) - Barthe, Geuvers - 1995
1 terms and term are made into the setoids using Leibniz equal.. (context) - from, cs et al.
1 Metalevel Programming in Constructive Type Theory (context) - Constable - 1994
1 An extended version will appear as a CWI technical report (context) - Barthe, Elbers et al. - 1996
The graph only includes citing articles where the year of publication is known.
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