Abstract
Kernel Andorra Prolog is a framework for nondeterministic concurrent constraint logic programming languages. Many languages, such as Prolog, GHC, Parlog, and Atomic Herbrand, can be seen as instances of this framework, by adding specific constraint systems and constraint operations, and optionally by imposing further restrictions on the language and the control of the computation model.
We systematically revisit the description in Haridi and Janson [HJ90], adding the formal machinery which is necessary in order to completely formalize the control of the computation model. To this we add a formal description of the transformational semantics of Kernel Andorra Prolog. The semantics of Kernel Andorra Prolog is a set of or-trees which also captures infinite computations.
The visit at SICS of Catuscia Palamidessi, during which this work was carried out, has been supported by the project Andorra
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
BG89] R. Bahgat and S. Gregory. Pandora: Non-deterministic Parallel Logic Programming In Giorgio Levi and Maurizio Martelli, editors, Proc. of the Sixth International Conference on Logic Programming, Series in Logic Programming, pages 471–486, Lisboa, 1989. The MIT Press.
T. Franzén. Formal aspects of Kernel Andorra Prolog. Technical Report R90008, SICS, Sweden, 1990.
HB88] S. Haridi and P. Brand. Andorra Prolog:, an integration of Prolog and commited choice languages. In Proc. of the International Conference on Fifth Generation Computer Systems,pages 745–754, Tokyo, 1988. Institute for New Generation Computer Technology (ICOT).
S. Haridi and S. Janson. Kernel Andorra Prolog and its computation model. In Proc. of the Seventh International Conference on Logic Programming, 1990.
S. Haridi and S. Janson. Programming paradigms of the Andorra Kernel Language. Technical report, SICS, Sweden, 1991.
W. Kornfeld. Constraint programming in Andorra Prolog. Presented at the SwedishJapanese-Italian workshop, 1989.
V.A. Saraswat. The concurrent logic programming language CP: definition and operational semantics. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 49–63. ACM, New York, 1987.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, january 1989. Published by The MIT Press, U.S.A., 1990.
V.A. Saraswat. Programming in Andorra Prolog. Technical report, Xerox PARC, 1989.
D. H. D. Warren. The Andorra principle. Presented at the Gigalips workshop, Stockholm, 1987.
R. Yang. Solving simple substitution ciphers in Andorra-I. In Giorgio Levi and Maurizio Martelli, editors, Proc. of the Sixth International Conference on Logic Programming, Lisboa, 1989. The MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haridi, S., Palamidessi, C. (1991). Structural Operational Semantics for Kernel Andorra Prolog. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_41
Download citation
DOI: https://doi.org/10.1007/978-3-662-25209-3_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-23206-4
Online ISBN: 978-3-662-25209-3
eBook Packages: Springer Book Archive