A general method to prove the normalization theorem for first and second order typed λ-calculi (1999)
by
Venanzio Capretta
,
Silvio Valentini
| Venue: | Mathematical Structures in Computer Science |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Capretta99ageneral,
author = {Venanzio Capretta and Silvio Valentini},
title = {A general method to prove the normalization theorem for first and second order typed λ-calculi},
booktitle = {Mathematical Structures in Computer Science},
year = {1999},
pages = {719--739}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
and second order typed λ-calculi
Citations
| 997 | The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984 |
| 474 | Lambda Calculi with Types - Barendregt - 1992 |
| 195 | Une extension de l’interprétation de Gödel à l’analyse et son application à l’élimination des coupures dans l’analyse et la théorie des types - Girard - 1970 |
| 129 | The system F of variable types, fifteen years later - Girard - 1986 |
| 41 | An algorithm for type-checking dependent types - Coquand - 1995 |
| 28 | types and models - Krivine, Lambda-calculus - 1993 |
| 28 | Short proofs of normalization for the simplytyped lambda-calculus, permutative conversions and Gödel’s T - Joachimski, Matthes - 2003 |
| 26 | On Girard’s “candidats de reductibilités - Gallier - 1990 |
| 21 | Extensions of System F by Iteration and Primitive Recursion on Monotone Inductive Types - Matthes - 1998 |
| 17 | Type’ is not a type — Preliminary Report - Meyer, Reinhold - 1986 |
| 6 | An early proof of normalization - Gandy - 1980 |
