A logical operational semantics of full prolog: Part II. built-in predicates for database manipulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 452 LNCS, Issue , 1990, Pages 1-14

  Börger, Egon ^a  

^a IBM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; DYNAMICS; SEMANTICS;

ALGEBRA SEMANTICS; ITS APPLICATIONS; OPERATIONAL SEMANTICS; RESOURCE-BOUNDED; SELECTION MECHANISM; SEMANTICS OF PROGRAMMING; STEPWISE REFINEMENT; STRUCTURE SHARING;

PROLOG (PROGRAMMING LANGUAGE);

EID: 85031928294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0029592     Document Type: Conference Paper

References (14)

1. Arbab, B. & Berry, D. M. 1987: Operational and Denotational Semantics of Prolog. J. Logic Programming 4, pp. 309-329.
2. Blakley, R. 1990: Ph.D. Thesis, University of Michigan (in preparation).
3. Börger, E. 1990: A Logical Operational Semantics of Full Prolog. Part I. Selection Core and Control in: CSL’89. 3rd Workshop on Computer Science Logic.Springer LNCS 440
4. Börger, E. 1990: A Logical Operational Semantics of Full Prolog. Part III Built-in Predicates for Files, Terms, In-Output and Arithmetic. In: Proc. Workshop Logic for Computer Science, Berkeley, MSRI, November, 1989 (to appear with Springer Verlag, ed. Y. Moschovakis).
5. Deransart, P, & Ferrand, G. 1987: An operational formal definition of Prolog. INRIA RR763 (revised version of the abstract in Proc. 4th Symposium on Logic Programming, San Francisco 1987, pp. 162-172).
6. DFPS 1989: Deransart, P., Folkjaer, P., Pique, J.-F., Scowen, R. S.: Prolog. Draft for Working Draft 2.0. ISO/IEC YTCt SC22 WG17 No. 40, pp. VI + 96.
7. Gurevich, Y. 1988: Logic and the Challenge of Computer Science in: Trends in Theoretical Computer Science (E. Börger, ed.), Computer Science Press, 1988, pp. 1-57.
8. Gurevich, Y. 1988: Algorithms in the World of Bounded Resources. In: The Universal Turing Machine--a Half-Century Story (Ed. R. Herken), Oxford University Press, pp. 407-416.
9. Gurevich, Y. & Morris, J. M. 1988: Algebraic Operational Semantics and Modula-2 in: CSL’87. 1st Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter), Springer LNCS 329, pp. 81-101.
10. Gurevich, Y. & Moss, L. S. 1990: Algebraic Operational Semantics and Occam in: CSL’89, 3rd Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning, M. Richter), Springer LNCS.
11. Jones, N. D. & Mycroft, A. 1984: Stepwise Development of Operational and Denotational Semantics for Prolog in: Proc. Int. Symp. on Logic Programming 2/84, Atlantic City, IEEE, pp. 289-298.
12. Kappel, A. 1990: Implementation of Dynamic Algebras with an Application to Semantics for Prolog (tentative title). Diploma Thesis (ongoing project), University of Dortmund, Fed. Rep. of Germany.
13. Lindholm, T.G. & O’Keefe R.A 1987: Efficient Implementation of a Defensible Semantics for Dynamic Prolog Code Proceedings of the Fourth International Conference on Logic Programming, 21-39.
14. North, N. 1988: A Denotational Definition of Prolog. NPL Report DITC 106/88. National Physical Lab, Teddington, Middlesex (submitted to the Journal of Logic Programming. I have seen this manuscript in the form of November 16, 1989.).