(Enter summary)
Abstract: . We present an extension of type theory with a fixed point
combinator Y . We are particularly interested in using this Y for doing
unbounded proof search in the proof system. Therefore we treat
in some detail a typed -calculus for higher order predicate logic with
inductive types (a reasonable subsystem of the theory implemented in
[Dowek e.a. 1991]) and show how bounded proof search can be done in
this system, and how unbounded proof search can be done if we add
Y . Of course, proof... (Update)
Context of citations to this paper: More
...of the type system does not satisfy strong normalisation and proof objects are potential ones. It has been shown in Geuvers et al. 1999] that under mild conditions the Y rules are conservative over the ones without a Y. It is outside the scope of this article to...
...of the type system does not satisfy strong normalization and proof objects are potential ones. It has been shown in Geuvers, Poll and Zwanenburg [1999] that under mild conditions the Y rules are conservative over the ones without a Y . It is outside the scope of this...
Cited by: More
Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999)
(Correct)
Similar documents (at the sentence level):
43.1%: Safe Proof Checking in Type Theory with Y - Geuvers, Poll, Zwanenburg (1999)
(Correct)
Active bibliography (related documents): More All
0.5: The Calculus of Constructions and Higher Order Logic - Geuvers (1992)
(Correct)
0.3: A short and flexible proof of Strong Normalization for the.. - Geuvers (1994)
(Correct)
0.1: Weak Normalization Implies Strong Normalization in.. - Barthe, Hatcliff.. (1997)
(Correct)
Similar documents based on text: More All
0.6: Pure Type Systems with Explicit Substitution - Bloo (2000)
(Correct)
0.2: Equational Reasoning via Partial Reflection - Geuvers, Wiedijk, Zwanenburg (2000)
(Correct)
0.1: Informal Proceedings Of The 1993 Workshop On Types For Proofs And.. - (ed.) (1993)
(Correct)
Related documents from co-citation: More All
2: Universitaire School voor Informatica (context) - calculation, thesis - 2000
2: A proof of strong normalization for the theory of constructions using a Kripke-l..
- Coquand, Gallier - 1990
2: Architect: William McCune (context) - Internet, mcs et al. - 1998
BibTeX entry: (Update)
Geuvers, H., E. Poll and J. Zwanenburg [1999]. Safe proof checking in type theory with y, in: F. Flum and M. Rodriguez-Artalejo (eds.), Computer Science Logic (CSL'99), LNCS 1683, Spinger-Verlag, pp. 439-452. http://citeseer.ist.psu.edu/article/geuvers99safe.html More
@inproceedings{ geuvers99safe,
author = "Herman Geuvers and Erik Poll and Jan Zwanenburg",
title = "Safe Proof Checking in Type Theory with Y",
booktitle = "{CSL}",
pages = "439-452",
year = "1999",
url = "citeseer.ist.psu.edu/article/geuvers99safe.html" }
Citations (may not include all citations):
382
Lambda calculi with Types
- Barendregt - 1992
68
Logics and Type Systems
- Geuvers - 1993
25
A modular proof of strong normalisation for the calculus of .. (context) - Geuvers, Nederhof - 1991
24
Een nadere bewijstheoretische analyse van GSTT's (context) - Terlouw
18
Partial Objects in the Calculus of Constructions
- Audebaud - 1991
6
INRIA Rocquencourt - CNRS ENS Lyon (context) - Dowek, Felty et al. - 1991
6
Universita di Torino (context) - Berardi, dependence et al. - 1990
3
Paulin-Mohring Inductively defined types (context) - Coquand - 1990
Documents on the same site (http://www.cs.kun.nl/~janz/publications/index.html): More
A Type System for Record Concatenation and Subtyping - Zwanenburg (1996)
(Correct)
A Type System for Record Concatenation and Subtyping - Jan Zwanenburg Department (1996)
(Correct)
Aspects of the Proof-assistant Yarrow - Jan Zwanenburg Department
(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