A GHC abstract machine and instruction set

  • Jacob Levy
Session 2a: Implementations And Architectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 225)


A description of a GHC abstract machine and its implementation are given.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Ueda, Guarded Horn Clauses. ICOT Technical Report TR-103, June 1985.Google Scholar
  2. [2]
    E. Shapiro, A Subset of Concurrent Prolog and Its Interpreter. ICOT Technical Report TR-003, February 1983.Google Scholar
  3. [3]
    K.L. Clark and F.G. McCabe, PARLOG: a Parallel Logic Programming Language. Research Report DOC 84/15, Dept. of Computing, Imperial College, London, 1984.Google Scholar
  4. [4]
    D. H. D. Warren, An Abstract Prolog Instruction Set. Technical Note 309, SRI International, Stanford, October 1983.Google Scholar
  5. [5]
    A. Houri and E. Shapiro, Tailoring The Warren Abstract Machine for FCP. To appear as Weizmann Institute Technical Report.Google Scholar
  6. [6]
    C. Mierowsky, Design and Implementation of Flat Concurrent Prolog. Weizmann Institute Technical Report CS84-21, 1984.Google Scholar
  7. [7]
    M. Codish, Compiling Or-parallelism into And-parallelism. Weizmann Institute Technical Report CS85-18, 1985.Google Scholar
  8. [8]
    J. Levy, A GHC Abstract Machine and Instruction Set. Weizmann Institute Technical Report CS85-11, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jacob Levy
    • 1
  1. 1.Department of Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations