GAML: a Parallel Implementation of Lazy ML

  title={GAML: a Parallel Implementation of Lazy ML},
  author={Luc Maranget},
  • Luc Maranget
  • Published in FPCA 1991
  • Computer Science
  • We present a new parallel implementation of lazy ML. Our scheme is a direct extension of the G-machine-based implementation of lazy ML. Parallelism is introduced by fork annotations inserted by the programmer. We discuss the interference of such user annotations with strictness annotations generated by our compiler. The system has been implemented on a Sequent Balance computer. We also address the main practical issues involved, including stack and heap management. 
    23 Citations

    Topics from this paper

    A High Performance Runtime System for Parallel Evaluation of Lazy Languages
    • 3
    EQUALS { The Next GenerationOwen Kaser
    AS Partridge
    • 14
    • PDF
    Experience with a clustered parallel reduction machine
    • 3
    • PDF


    Parallel graph reduction with the (v , G)-machine
    • 80
    The spineless tagless G-machine
    • 120
    Report on the programming language Haskell
    • 355
    Compiling pattern matching by term decomposition
    • 44
    • PDF
    Runtime tags aren't necessary
    • 97
    Compiling Lazy Functional Languages Part II, Ph
    • D. Thesis, Chalmers Uni- versity of Technology,
    • 1987
    Implementation of Lazy Pattern Matching Algorithms
    • 22
    • PDF