## Data Types, Infinity and Equality in System AF2 (1995)

Venue: | In CSL ’93, volume 832 of LNCS |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Raffalli95datatypes,,

author = {Christophe Raffalli},

title = {Data Types, Infinity and Equality in System AF2},

booktitle = {In CSL ’93, volume 832 of LNCS},

year = {1995},

pages = {280--294},

publisher = {Springer}

}

### OpenURL

### Abstract

This work presents an extension of system AF 2 to allow the use of infinite data types. We extend the logic with inductive and coinductive types, and show that the "programming method" is still correct. Unlike previous work in other type-systems, we only use the pure -calculus. Propositions about normalization and unicity of the representation of data have no equivalent in other systems. Moreover, the class of data types we consider is very large with some unusual ones. 1 Introduction Since the work of Curry, a lot of type-systems have been created (e.g., De Bruijn's Automath [4]; Girard's system F [5]; Martin-Lof's type theory [10]; Coquand-Huet's Calculus of construction [3]; etc). One of their purposes is program extraction via the CurryHoward isomorphism [6], which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 (second order functional arithmetic) due to Leivant and Krivine [9, 7, 8]. It uses equations as algorithmic specif...

### Citations

496 |
The calculus of constructions
- Coquand, Huet
- 1988
(Show Context)
Citation Context ...duction Since the work of Curry, a lot of type-systems have been created (e.g., De Bruijn's Automath [4]; Girard's system F [5]; Martin-Lof's type theory [10]; Coquand-Huet's Calculus of construction =-=[3]-=-; etc). One of their purposes is program extraction via the CurryHoward isomorphism [6], which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 ... |

166 |
Lambda Calculus: its Syntax and Semantics (North-Holland
- Barendregt
- 1984
(Show Context)
Citation Context ...a G. This is used only to design a sub-formula G of F 0 (we need physical substitution because G may have some free variables bounded in F 0 ). To define the type-system itself, we use pure -calculus =-=[1]-=- as an algorithmic counterpart. It's very important to note that the world of programs, represented by -terms, is kept separated from the logical world. Thus, Logical terms should not be confused with... |

150 |
The system F of variable types, fifteen years later, Theoret
- Girard
- 1986
(Show Context)
Citation Context ...lass of data types we consider is very large with some unusual ones. 1 Introduction Since the work of Curry, a lot of type-systems have been created (e.g., De Bruijn's Automath [4]; Girard's system F =-=[5]-=-; Martin-Lof's type theory [10]; Coquand-Huet's Calculus of construction [3]; etc). One of their purposes is program extraction via the CurryHoward isomorphism [6], which establishes a correspondence ... |

107 |
The mathematical language Automath, its usage and some of its extensions
- Bruijn
- 1970
(Show Context)
Citation Context ...ystems. Moreover, the class of data types we consider is very large with some unusual ones. 1 Introduction Since the work of Curry, a lot of type-systems have been created (e.g., De Bruijn's Automath =-=[4]-=-; Girard's system F [5]; Martin-Lof's type theory [10]; Coquand-Huet's Calculus of construction [3]; etc). One of their purposes is program extraction via the CurryHoward isomorphism [6], which establ... |

69 |
Inductive Definition in Type Theory
- Mendler
- 1987
(Show Context)
Citation Context ...still correct. The particulars of this work come from those of AF 2 , including data types encoded in pure -calculus, equational axioms, and second order logic. Moreover, in most of the previous work =-=[11, 13, 15]-=-, infinite data types are added through a categorical duality, 1 defined by their destructors (except for [15]), and use the coinduction principle. In our work, finite and infinite data types are adde... |

56 |
Recursive programming with proofs
- Parigot
- 1992
(Show Context)
Citation Context ...yHoward isomorphism [6], which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 (second order functional arithmetic) due to Leivant and Krivine =-=[9, 7, 8]. It uses -=-equations as algorithmic specifications, and its "programming method" ensures the correctness of programs extracted from proofs of function totality. However, the efficiency of these extract... |

35 |
Typing and computational properties of lambda expressions
- Leivant
- 1986
(Show Context)
Citation Context ...yHoward isomorphism [6], which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 (second order functional arithmetic) due to Leivant and Krivine =-=[9, 7, 8]. It uses -=-equations as algorithmic specifications, and its "programming method" ensures the correctness of programs extracted from proofs of function totality. However, the efficiency of these extract... |

27 |
Lambda Calcul — Types et Modèles. Etudes et Recherches en Informatique
- Krivine
- 1990
(Show Context)
Citation Context ...yHoward isomorphism [6], which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 (second order functional arithmetic) due to Leivant and Krivine =-=[9, 7, 8]. It uses -=-equations as algorithmic specifications, and its "programming method" ensures the correctness of programs extracted from proofs of function totality. However, the efficiency of these extract... |

18 |
The formulae-as-types notion of constructions, in To H.B
- Howard
- 1980
(Show Context)
Citation Context ...jn's Automath [4]; Girard's system F [5]; Martin-Lof's type theory [10]; Coquand-Huet's Calculus of construction [3]; etc). One of their purposes is program extraction via the CurryHoward isomorphism =-=[6]-=-, which establishes a correspondence between programs and proofs of specifications. One of these systems is AF 2 (second order functional arithmetic) due to Leivant and Krivine [9, 7, 8]. It uses equa... |

10 |
Lecture note on the domain interpretation of type theory
- Martin-Löf
- 1983
(Show Context)
Citation Context ... is very large with some unusual ones. 1 Introduction Since the work of Curry, a lot of type-systems have been created (e.g., De Bruijn's Automath [4]; Girard's system F [5]; Martin-Lof's type theory =-=[10]-=-; Coquand-Huet's Calculus of construction [3]; etc). One of their purposes is program extraction via the CurryHoward isomorphism [6], which establishes a correspondence between programs and proofs of ... |

9 | Alcune proprieta' delle forme fi-j-normali nel -Kcalcolo", Pubblicazioni dell' I.A.C. n. 696 - Bohm - 1968 |

4 |
Inductive definitions in the calculus of constructions
- Paulin-Mohring
- 1989
(Show Context)
Citation Context ...still correct. The particulars of this work come from those of AF 2 , including data types encoded in pure -calculus, equational axioms, and second order logic. Moreover, in most of the previous work =-=[11, 13, 15]-=-, infinite data types are added through a categorical duality, 1 defined by their destructors (except for [15]), and use the coinduction principle. In our work, finite and infinite data types are adde... |

2 |
Realisability Interpretation of Coinductive Definitions and Program Synthesis with Streams
- Tatsuta
- 1992
(Show Context)
Citation Context ...still correct. The particulars of this work come from those of AF 2 , including data types encoded in pure -calculus, equational axioms, and second order logic. Moreover, in most of the previous work =-=[11, 13, 15]-=-, infinite data types are added through a categorical duality, 1 defined by their destructors (except for [15]), and use the coinduction principle. In our work, finite and infinite data types are adde... |

1 | Le syst`eme AF 2 avec points fixes - Raffalli - 1994 |