Spinellis D (1990) An implementation of the Haskell language. Project report, Imperial College, Department of Computing, London, UK. 13 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing Haskell: Language Implementation as a Tool Building .. - Spinellis (1993) (6 citations) Self-citation (Spinellis) (Correct)
....used can be found in [11, 27] however familiarity with functional programming technology is not needed for understanding the rest of the article. The system can be roughly divided into the following parts: Lexical analysis: The Haskell source is scanned converting the text into tokens [29]. Parsing: The stream of tokens from the lexical analyser is converted into a parse tree [29] Type checking: The parse tree is type checked and augmented with type information [34] Conversion to supercombinators: The Haskell parse tree is semantically checked and translated into enriched ....
....is not needed for understanding the rest of the article. The system can be roughly divided into the following parts: Lexical analysis: The Haskell source is scanned converting the text into tokens [29] Parsing: The stream of tokens from the lexical analyser is converted into a parse tree [29]. Type checking: The parse tree is type checked 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, ....
[Article contains additional citation context not shown here]
Spinellis D (1990) An implementation of the Haskell language. Project report, Imperial College, Department of Computing, London, UK. 13
Implementing Haskell: Language Implementation as a Tool.. - Diomidis Spinellis (1993) (6 citations) Self-citation (Spinellis) (Correct)
....used can be found in [11, 27] however familiarity with functional programming technology is not needed for understanding the rest of the article. The system can be roughly divided into the following parts: Lexical analysis: The Haskell source is scanned converting the text into tokens [29]. Parsing: The stream of tokens from the lexical analyser is converted into a parse tree [29] Type checking: The parse tree is type checked and augmented with type information [34] Conversion to supercombinators: The Haskell parse tree is semantically checked and translated into enriched ....
....is not needed for understanding the rest of the article. The system can be roughly divided into the following parts: Lexical analysis: The Haskell source is scanned converting the text into tokens [29] Parsing: The stream of tokens from the lexical analyser is converted into a parse tree [29]. Type checking: The parse tree is type checked 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 ....
[Article contains additional citation context not shown here]
Spinellis D (1990) An implementation of the Haskell language. 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