No CrossRef data available.
Article contents
Les types de données syntaxiques du système ${\cal F}$![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045634587-0111:S0988375401001175:S0988375401001175_eqnU1.gif)
Published online by Cambridge University Press: 15 April 2002
Abstract
We give in this paper a purely syntactical definition
of input and output types of system ${\cal 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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045634587-0111:S0988375401001175:S0988375401001175_eqnU5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045634587-0111:S0988375401001175:S0988375401001175_eqnU1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045634587-0111:S0988375401001175:S0988375401001175_eqnU7.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045634587-0111:S0988375401001175:S0988375401001175_eqnU1.gif?pub-status=live)