See this document in CiteSeerX!

Short Proofs of Normalization for the simply-typed λ-calculus, permutative conversions and Gödel's T (1999)  (Make Corrections)  (1 citation)
Felix Joachimski, Ralph Matthes



  Home/Search   Context   Related

 
View or download:
tcs.informatik.unimuen...sn99letter.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tcs.informatik.unimuenchen....sn (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order to reprove weak and strong normalization for the simplytyped lambda-calculus and for an extension by sum types with permutative conversions. The analogous treatment of a new system with generalized applications inspired by von Plato's generalized elimination rules in natural deduction shows the exibility of the approach which does not use the strong... (Update)

Cited by:   More
Syntactic Analysis of eta-Expansions - In Pure Type   (Correct)

Similar documents (at the sentence level):
34.1%:   Short Proofs of Normalization for the simply-typed.. - Matthes, Joachimski (1998)   (Correct)

Active bibliography (related documents):   More   All
1.9:   Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (1999)   (Correct)
0.5:   The AMEN architecture. - Peter Hancock Abandoned   (Correct)
0.3:   Lambda Calculus: A Case for Inductive Definitions - Matthes (2000)   (Correct)

Similar documents based on text:   More   All
1.1:   Characterizing Strongly Normalizing Terms for a Lambda Calculus.. - Matthes (2000)   (Correct)
1.1:   Characterizing Strongly Normalizing Terms of a lambda-Calculus.. - Matthes   (Correct)
0.8:   Standardization and Confluence for a Lambda Calculus with.. - Joachimski, Matthes (2000)   (Correct)

BibTeX entry:   (Update)

Felix Joachimski and Ralph Matthes. Short proofs of normalization for the simply-typed lambda-calculus, permutative conversions and Godel's T. Submitted 1998, to appear. Available from http://www.tcs. informatik.uni-muenchen.de/~matthes. http://citeseer.ist.psu.edu/article/joachimski99short.html   More

@unpublished{ joachimski99short,
    author = "Felix Joachimski and Ralph Matthes",
    title = "Short Proofs of Normalization for the Simply-Typed $\lambda$-Calculus, Permutative Conversions and {G}{\"o}del's {$T$}",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/joachimski99short.html" }
Citations (may not include all citations):
116   Ideas and results in proof theory (context) - Prawitz - 1971
83   volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
44   Uber eine bisher noch nicht benutzte Erweiterung des niten .. (context) - odel - 1958
42   Program extraction from normalization proofs (context) - Berger
40   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
38   by Iteration and Primitive Recursion on Monotone Inductive T.. (context) - Matthes, System - 1998
28   Intensional interpretations of functionals of nite type (context) - Tait - 1967
21   A formalization of the strong normalization proof for system.. - Altenkirch
19   Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
17   Typed operational semantics (context) - Goguen - 1995
14   Termination of higher-order rewrite systems (context) - Pol - 1996
13   Springer-Verlag (context) - Sch, Theory - 1977
12   Termination of permutative conversions in intuitionistic Gen.. - Schwichtenberg - 1999
10   volume 42 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Hindley, Type - 1997
9   Con uence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
6   volume 664 of Lecture Notes in Computer Science (context) - Bezem, Groote et al. - 1993
5   Ordinal analysis of terms of nite type (context) - Howard - 1980
5   A proof of strongly uniform termination for Godel's T by me.. (context) - Weiermann - 1997
4   Une preuve simple de resultats classiques en  calcul (context) - David - 1995
4   Zur Berechenbarkeit primitiv-rekursiver Funktionale endliche.. (context) - Diller - 1968
4   pure type systems and calculi with permutative conversions (context) - Joachimski, in et al. - 1997
4   An early proof of normalization (context) - Gandy - 1980
3   Centrum voor Wiskunde en Informatica (context) - van Raamsdonk, Severi et al. - 1995
3   Functionals de ned by recursion (context) - Sanchis - 1967
3   the strong normalisation of natural deduction with permutati.. - de Groote - 1999
3   Information and Computation (context) - van Raamsdonk, Severi et al. - 1999
3   Proofs as programs (context) - Schwichtenberg - 1993
3   Structure of derivations in natural deduction (context) - von Plato - 1998
2   Strong normalization for arithmetic (context) - Leivant - 1975

Documents on the same site (http://www.tcs.informatik.uni-muenchen.de/~matthes/papers/sn.html):
Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (1999)   (Correct)
Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (2002)   (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