Strong storage operators and data types

@article{Nour1995StrongSO,
  title={Strong storage operators and data types},
  author={Karim Nour},
  journal={Arch. Math. Log.},
  year={1995},
  volume={34},
  pages={65-78}
}
The storage operators were introduced by J.L. Krivine ([6]) ; they are closed A-terms which, for some fixed data type (the integers for example), allow to simulate "call by value" while using "call by name". J.L. Krivine showed that such operators can be typed, in the , / ~ type system, using G6del's translation from classical to intuitionistic logic ([8]). This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
13 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Notes sur la raise en m 6 moire

  • V. Danos, L. Regnier
  • Manuscript
  • 1992

Lambda cacul, types et module

  • J. L. Krivine
  • 1990

Op6rateurs de mise en mdmoire en lambda-cacul pur et typ6

  • K. Nour
  • Th6se de doctorat, Universit6 de Savoie 1993 11…
  • 1988
1 Excerpt

The lambda caculus: Its Syntax and Semantics

  • H. Barendregt
  • 1984

Similar Papers

Loading similar papers…