Tallenna
Categorical Combinators, Sequential Algorithms, and Functional Programming
The study of the full abstraction problem for PCF and extensions of it has been enriched with a new full abstraction result: the model of sequential algorithms is fully abstract with respect to an extension of PCF with a control operator (Cartwright, Felleisen, Curien).
- Kirjailija
- P.-L. Curien
- Painos
- Softcover reprint of the original 1st ed. 1993
- ISBN
- 9781461267041
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 27.9.2012
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 404
