A scheme for compiling GHC to prolog using freeze
Number of Authors: 2
1987 (English)Report (Refereed)
By using the metapredicate freeze, object-oriented programming and process simulation can, for several problems, be done directly in Prolog; although, this is a tiresome and untidy chore. Committed choice languages, on the other hand, provide an elegant syntax for these types of programs. A scheme is given for compiling Guarded Horn Clauses into sequential Prolog, using Prolog's own scheduling principle. Synchronization is implemented using freeze, thereby avoiding busy wait. This proves that Prolog, including freeze, gives enough strength to cover a wide range of object-oriented programming problems, without redefining unification or defining a non-depth-first execution system on top of Prolog. The report presents two versions of the idea: one for flat GHC and one for full GHC. For the flat GHC version, a compiler has been developed and found to give satsfactory behavior.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1987, 1. , 16 p.
SICS Research Report, ISSN 0283-3638 ; R87:07
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22213OAI: oai:DiVA.org:ri-22213DiVA: diva2:1041757
Original report number R87007.2016-10-312016-10-31Bibliographically approved