Refinement of a typed WAM extension by polymorphic order-sorted types

Formal Aspects of Computing

Volumn 8, Issue 5, 1996, Pages 539-564

  Beierle, Christoph ^a   Börger, Egon ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Constraint logic programming; Correctness proof; Evolving algebras; Order sorted types; Polymorphism; Types; WAM

Indexed keywords

EID: 0842274790     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01211908     Document Type: Article

References (11)

1. Aït-Kaci, H.: Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press, Cambridge, MA, 1991.
2. Beierle, C. and Börger, E.: Specification and correctness proof of a WAM extension with abstract type constraints. Formal Aspects of Computing, 8(4):428-462, 1996.
3. Beierle, C.: Logic programming with typed unification and its realization on an abstract machine. IBM Journal of Research and Development, 36(3):375-390, May 1992.
4. Beierle, C. and Meyer, G.: Run-time type computations in the Warren Abstract Machine. Journal of Logic Programming, 18(2):123-148, February 1994.
5. Börger, E.: A logical operational semantics of full Prolog. Part I. Selection core and control. CSL'89 - 3rd Workshop on Computer Science Logic, LNCS 440, pages 36-64. Springer-Verlag, Berlin, 1990.
6. Börger, E. and Rosenzweig, D.: The WAM - definition and compiler correctness. In C. Beierle and L. Plümer, editors, Logic Programming Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence, chapter 2, pages 20-90. Elsevier Science B.V./North-Holland, Amsterdam, 1995.
7. Hanus, M.: Horn clause programs with polymorphic types: Semantics and resolution. Theoretical Computer Science, 89:63-106, 1991.
8. Mycroft, A. and O'Keefe, R. A.: A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
9. Smolka, G.: TEL (Version 0.9), Report and User Manual. SEKI-Report SR 87-17, FB Informatik, Universität Kaiserslautern, 1988.
10. Smolka, G.: Logic Programming over Polymorphically Order-Sorted Types. PhD thesis, FB Informatik, Univ. Kaiserslautern, 1989.
11. Warren, D. H. D.: An Abstract PROLOG Instruction Set. Technical Report 309, SRI, 1983.