Syntactical data types of system F
From MaRDI portal
Syntactical data types of system \(\mathcal F\)
Abstract: We give in this paper a purely syntactical definition of input and output types of system F. We define the syntactical data types as input and output types. We show that any type with positive quantifiers is a syntactical data type and that an input type is an output type. We give some restrictions on the -elimination rule in order to prove that an output type is an input type.
Recommendations
Cites work
- Classical logic, storage operators and second-order lambda-calculus
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 46869 (Why is no real title available?)
- Opérateurs de mise en mémoire et traduction de Gödel. (Storage operators and Gödel translation)
- Opérateurs de mise en mémoire et types \forall -positifs
- The I-types of system F
- Un résultat de complétude pour les types ∀+ du système F
Cited in
(2)
This page was built for publication: Syntactical data types of system \(\mathcal F\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773019)