(Enter summary)
Abstract: LEGO is a computer program for interactive typechecking in the Extended Calculus of Constructions
and two of its subsystems. LEGO also supports the extension of these three systems
with inductive types. These type systems can be viewed as logics, and as meta languages
for expressing logics, and LEGO is intended to be used for interactively constructing proofs
in mathematical theories presented in these logics. I have developed LEGO over six years,
starting from an implementation of the Calculus ... (Update)
Cited by: More
On the role of type decorations in the Calculus of Inductive .. - Barras, Gregoire
(Correct)
On The Subject Reduction Property For Algebraic Type Systems - Barthe, Mellies (1997)
(Correct)
Type checking Dependent (Record) Types and Subtyping - Betarte
(Correct)
Active bibliography (related documents): More All
2.5: A Verified Typechecker - Pollack (1995)
(Correct)
1.1: Checking Algorithms for Pure Type Systems - Jutting, McKinna, Pollack (1992)
(Correct)
1.1: Some Lambda Calculus and Type Theory Formalized - McKinna, Pollack (1997)
(Correct)
Similar documents based on text: More All
0.2: Robotic courses based on LEGO - Johansson (2001)
(Correct)
0.2: Lego and Related Work - Luo (1999)
(Correct)
0.2: Using Graph Grammars and Genetic Algorithms to.. - Peysakhov..
(Correct)
Related documents from co-citation: More All
26: Lambda Calculi with Types
- Barendregt - 1992
21: The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
18: Implementing Mathematics with the Nuprl Proof Development System
- Constable - 1986
BibTeX entry: (Update)
Robert Pollack. The Theory of LEGO:A Proof Checker for the Extended Calculus of Constructions. PhD thesis, Department of Computer Science, University of Edinburgh, April 1995. http://citeseer.ist.psu.edu/pollack94theory.html More
@phdthesis{ pollack94theory,
author = "Robert Pollack",
title = "The Theory of {LEGO}: {A} Proof Checker for the Extended Calculus of Constructions",
year = "1994",
url = "citeseer.ist.psu.edu/pollack94theory.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
505
Implementing Mathematics with the Nuprl Proof Development Sy..
- Constable - 1986 ACM
384
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
382
Lambda calculi with types
- Barendregt - 1992
266
Information and Computation (context) - Coquand, Huet et al. - 1988 DBLP
187
HOL: A proof generating system for higher-order logic (context) - Gordon - 1988
143
The Coq proof assistant user's guide (context) - Felty, Huet et al. - 1993
96
A survey of the project AUTOMATH (context) - de Bruijn - 1980
96
An algorithm for testing conversion in type theory (context) - Coquand - 1991 ACM
95
An Extended Calculus of Constructions
- Luo - 1990
84
Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
75
Using typed lambda calculus to implement formal systems on a..
- Avron, Honsell et al. - 1992 ACM DBLP
73
Inductively defined types (context) - Coquand, Paulin-Mohring - 1990 ACM DBLP
71
Elf: A language for logic definition and verified metaprogra..
- Pfenning - 1989 ACM DBLP
61
Department of Computer Science (context) - Pym, Search et al. - 1990
60
Constructions: A higher order proof system for mechanizing m.. (context) - Coquand, Huet - 1985 DBLP
51
The Isabelle reference manual
- Paulson - 1993
41
Information and Computation (context) - Jutting, Pure et al. - 1993 DBLP
38
Parallel reductions in -calculus (context) - Takahashi - 1989
38
Pure type systems with definitions
- Severi, Poll - 1994 ACM DBLP
38
Scientific American (context) - Horgan, of - 1993
35
Formal Aspects of Computing (context) - Dybjer - 1994
33
Deliverables: a Categorical Approach to Program Development ..
- McKinna - 1992
31
A notation for lambda terms I: A generalization of environme..
- Nadathur, Wilson - 1993
29
Finitary inductively presented logics
- Feferman - 1988 ACM
29
A short description of another logical framework (context) - Augustsson, Coquand et al. - 1990
26
Set theory for verification: II (context) - Paulson - 1993
24
The constructive engine (context) - Huet - 1989
21
A formalization of the strong normalization proof for System..
- Altenkirch - 1993
21
an Smith. Programming in Martin-L of's Type Theory (context) - om, Petersson - 1990
20
Inductive Types and Strong Normalization (context) - Altenkirch - 1993
19
Representing Logics in Type Theory (context) - Gardner - 1992
18
North-Holland (context) - Heyting, An et al. - 1971
14
Theoretical Computer Science (context) - Harper, Pollack et al. - 1991 ACM
13
Inductive definitions in the system coq; rules and propertie.. (context) - Paulin-Mohring - 1993
12
Algorithm development in the calculus of constructions (context) - Mohring - 1986 DBLP
12
Pure Type Sytems formalized (context) - McKinna, Pollack - 1993
11
Dipartimento di Informatica (context) - Berardi, Constructive et al. - 1990
10
University of Stockholm (context) - of, of et al. - 1971
10
The independence of Peano's fourth axiom from Martin-L of's ..
- Smith - 1988
8
Completing the rationals and metric spaces in LEGO (context) - Jones - 1993 ACM
7
Department of Mathematics and Computer Science (context) - Geuvers, Type et al. - 1993
7
Informal Proceedings of First Workshop on Logical Frameworks (context) - Pollack - 1990
7
Inductive sets and families in Martin-L of's type theory and.. (context) - Dybjer - 1991
6
Representing algebra in LEGO (context) - Bailey - 1993
6
DEC Systems Research Centre (context) - Cardelli, the et al. - 1991
6
Introduction to Generalised Type Sytems (context) - Barendregt - 1991
6
A problem of adequacy: Conservativity of calculus of constru.. (context) - Luo - 1990
6
University of Edinburgh (context) - Maharaj, LEGO et al. - 1990
5
A plea for weaker frameworks (context) - de Bruijn - 1991
5
Typechecking in Pure Type Sytems (context) - Pollack - 1992
4
Towards checking proof checkers (context) - Dowek, Boyer - 1993
4
See http://www (context) - Jones, Pollack et al. - 1994
4
See http://www (context) - Jones, Pollack et al. - 1993
4
A modular proof of strong normalization for the calculus of .. (context) - Mark-Jan - 1991
4
See http://www (context) - Jones, Maharaj et al. - 1993
3
Towards a foundation of a general proof theory (context) - Prawitz - 1973
3
Extending calculu construction with TypeType (context) - Huet, calculus et al. - 1987
2
Girard normalization proof in LEGO (context) - Berardi - 1990
2
Typed -calculus formalized: Church-Rosser and standardisatio.. (context) - McKinna - 1994
2
Haupsatz for the intuitionistic theory of iterated inductive.. (context) - of - 1971
2
the idea of a general proof theory (context) - Prawitz - 1974
2
Functional programming and verification with LEGO (context) - Wand - 1992
1
A variation on Lagrange's theorem in LEGO: Characterizing th.. (context) - Cizek - 1993
1
A model of CCS in LEGO (context) - Bradley - 1992
1
Simulating VDM in LEGO (context) - Coleman - 1990
1
Some comments on Pure Type Sytems (context) - Coquand - 1990
1
Aframework for defining logics (context) - Harper, Honsell et al. - 1992
1
Thesis proposal (context) - Pollack, of - 1988
1
A model of constructive set theory in LEGO (context) - Mendler - 1992
1
On implicit arguments
- Hagiya, Toda - 1994 DBLP
1
LEGO proof development system: User's manual (context) - Robert - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.ed.ac.uk/~lego/html/papers.html): More
Proceedings Of The Second Workshop On Logical Frameworks.. - Huet, Plotkin, (eds.) (1991)
(Correct)
Adequate encodings of proof systems for algebraic specifications .. - Mylonakis
(Correct)
Inheritance of Proofs - Hofmann, Naraschewski, Steffen.. (1996)
(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