Hadjicocolis A (1990) Generating G-machine code from Haskell. Project report, Imperial College, Department of Computing, London, UK. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Haskell: Language Implementation as a Tool Building .. - Spinellis (1993) (6 citations) (Correct)
.... and augmented with type information [34] Conversion to supercombinators: The Haskell parse tree is semantically checked and translated into enriched calculus with pattern abstractions, then into pure calculus with letrec expressions and finally, using lifting, into supercombinators [15]. Interpreter: An eval apply interpreter is applied on the sugared calculus tree [29] Currently, the garbage collection scheme described in [4] is used. G code generation: Translation of supercombinator expressions to abstract G machine code [15] Native code generation: Translation of ....
....finally, using lifting, into supercombinators [15] Interpreter: An eval apply interpreter is applied on the sugared calculus tree [29] Currently, the garbage collection scheme described in [4] is used. G code generation: Translation of supercombinator expressions to abstract G machine code [15]. Native code generation: Translation of abstract G machine code into native machine code [29] The executable version of the system is created by linking together 23 modules written by hand in ANSI C with six modules automatically generated as follows: the parser written in yacc, the ....
Hadjicocolis A (1990) Generating G-machine code from Haskell. Project report, Imperial College, Department of Computing, London, UK.
Implementing Haskell: Language Implementation as a Tool.. - Diomidis Spinellis (1993) (6 citations) (Correct)
.... and augmented with type information [34] Conversion to supercombinators: The Haskell parse tree is semantically checked and translated into enriched calculus with pattern abstractions, then into pure calculus with letrec expressions and finally, using lifting, into supercombinators [15]. Interpreter: An eval apply interpreter is applied on the sugared calculus tree [29] Currently, the garbage collection scheme described in [4] is used. G code generation: Translation of supercombinator expressions to abstract G machine code [15] Native code generation: Translation of ....
....finally, using lifting, into supercombinators [15] Interpreter: An eval apply interpreter is applied on the sugared calculus tree [29] Currently, the garbage collection scheme described in [4] is used. G code generation: Translation of supercombinator expressions to abstract G machine code [15]. Native code generation: Translation of abstract G machine code into native machine code [29] The executable version of the system is created by linking together 23 modules written by hand in ansi C with six modules automatically generated as follows: ffl the parser written in yacc, ffl the ....
Hadjicocolis A (1990) Generating G-machine code from Haskell. Project report, Imperial College, Department of Computing, London, UK.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC