Résultats de complétude pour des classes de types du système AF2
J.-L. Krivine introduced the AF2 type system in order to obtain programs ($λ$-terms) which calculate functions, by writing demonstrations of their totalities. We present in this paper two results of completness for some types of AF2 and for many notions of reductions. These results generalize a theo...
| Main Authors: | , |
|---|---|
| Format: | Text |
| Language: | unknown |
| Published: |
arXiv
2009
|
| Subjects: | |
| Online Access: | https://dx.doi.org/10.48550/arxiv.0905.0575 https://arxiv.org/abs/0905.0575 |
| Summary: | J.-L. Krivine introduced the AF2 type system in order to obtain programs ($λ$-terms) which calculate functions, by writing demonstrations of their totalities. We present in this paper two results of completness for some types of AF2 and for many notions of reductions. These results generalize a theorem of R. Labib-Sami established in the system F of J.-Y. Girard. |
|---|