Abstract
We show that Kleene's theory of unimonotone functions strictly relates to the theory of sequentiality originated by the full abstraction problem for PCF. Unimonotone functions are defined via a class of oracles, which turn out to be alternative descriptions of a subclass of Berry-Curien's sequential algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Berry. Modèles complètement adéquats et stables des lambda-calculs typés. Thèse d'Etat, Université Paris 7, 1979.
G. Berry and P.L. Curien. Sequential algorithms on concrete data structures. TCS 20, 1982.
G. Berry, P.L. Curien, J.J. Levy. Full abstraction for sequential languages: the state of the art. Algebraic mehods in Semantics, Cambridge University Press 1985.
P.L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical computer Science, Pitman (1986).
P.L. Curien Algorithmes séquentiels et extensionalité. Rapport LITP 82-67, Université Paris 6–7, 1982.
G. Kahn and G. Plotkin. Domaines Concrets. Rapport IRIA-LABORIA 336, 1978.
D. P. Kierstead A Semantics for Kleene's j-expressions The Kleene Symposium (J. Barwise, H. J. Keisler and K. Kunen eds.). North-Holland 1980.
S. C. Kleene Recursive Functional and Quantifiers of Finite Types Revisited I Generalized recursion theory II, Proceedings of the 1977 Oslo Symposium (J. E. Fenstad, R. O. Gandy and G. E. Sacks eds.). North-Holland 1978.
S. C. Kleene Recursive Functional and Quantifiers of Finite Types Revisited II The Kleene Symposium (J. Barwise, H. J. Keisler and K. Kunen eds.). North-Holland 1980.
S. C. Kleene Recursive Functional and Quantifiers of Finite Types Revisited III Patras Logic Symposium (G. Metakides ed.). North-Holland 1982.
S. C. Kleene Recursive Functional and Quantifiers of Finite Types Revisited IV Proocedings of Symposia in Pure Mathematics, vol. 42, 1985. American Mathematical Society.
G. Plotkin. LCF considered as a programming language. TCS 5, december 1977, p. 223–256.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bucciarelli, A. (1994). Another approach to sequentiality: Kleene's unimonotone functions. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-58027-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58027-0
Online ISBN: 978-3-540-48419-6
eBook Packages: Springer Book Archive