Storage operators and forall-positive types of system TTR

Details Storage operators and forall-positive types of system TTR Storage operators and forall-positive types of system TTR

2009-05-05

arxiv.org/abs/0905.0550v1

Mathematical Logic Quarterly 42 (1996) 349-368

Mathematics

Logic

Scientific paper

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\"odel 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\"odel transformations (a generalization of classical G\"odel 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.

Affiliated with

Also associated with

No associations

Rating

Storage operators and forall-positive types of system TTR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Storage operators and forall-positive types of system TTR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storage operators and forall-positive types of system TTR will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450431