Storage operators and forall-positive types of system TTR
| dc.creator | Nour, Karim | |
| dc.date | 2009-05-05 | |
| dc.date.accessioned | 2026-07-07T13:11:50Z | |
| dc.date.available | 2026-07-07T13:11:50Z | |
| dc.description | In 1990, J.L. Krivine introduced the notion of storage operator to simulate "call by value" in the "call by name" strategy. J.L. Krivine has shown that, using Gödel translation of classical into intuitionitic logic, we can find a simple type for the storage operators in AF2 type system. This paper studies the $\forall$-positive types (the universal second order quantifier appears positively in these types), and the Gödel transformations (a generalization of classical Gödel translation) of TTR type system. We generalize, by using syntaxical methods, the J.L. Krivine's Theorem about these types and for these transformations. We give a proof of this result in the case of the type of recursive integers. | |
| dc.identifier | https://arxiv.org/abs/0905.0550 | |
| dc.identifier | http://arxiv.org/abs/0905.0550 | |
| dc.identifier | Mathematical Logic Quarterly 42 (1996) 349-368 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/229411 | |
| dc.subject | Logic | |
| dc.title | Storage operators and forall-positive types of system TTR | |
| dc.type | text |