Glasgow Haskell Compiler
From Wikipedia, the free encyclopedia
| Glasgow Haskell Compiler | |
|---|---|
| Developed by | University of Glasgow |
| Latest release | 6.8.2 / Dec 12, 2007 |
| OS | Cross-platform |
| Genre | Compiler |
| License | BSD |
| Website | GHC home |
The Glorious Glasgow Haskell Compilation System[1][2], more commonly known as the Glasgow Haskell Compiler or GHC, is an open source native code compiler for the functional programming language Haskell. The lead developers are Simon Peyton Jones and Simon Marlow.
Contents |
[edit] History
GHC originally started in 1989 as a prototype, written in LML (Lazy ML) by Kevin Hammond at the University of Glasgow. Later that year, the prototype was completely rewritten in Haskell, except for its parser, by Cordelia Hall, Will Partain, and Simon Peyton Jones. Its first beta release was on April 1, 1991 and subsequent releases added a strictness analyzer as well as language extensions such as monadic I/O, mutable arrays, unboxed data types, and a profiler.[3]
Peyton Jones, as well as Simon Marlow, later moved to Microsoft Research in Cambridge, England, where they continue to be primarily responsible for developing GHC. GHC also contains code from more than sixty other contributors. [4]
[edit] Architecture
GHC is itself written in Haskell (in a technique known as bootstrapping), but the runtime system for Haskell, an essential part of the compiler, is written in C and C--. Much of GHC is written in the literate programming style.
GHC's front end — incorporating the lexer, parser and typechecker — is designed to preserve as much information about the source language as possible until after type inference is complete, toward the goal of providing clear error messages to users.[3] In its last phase, the front end desugars Haskell into a typed intermediate language known as "Core" (based on System F, extended with let and case expressions). Recently, Core was extended to support generalized algebraic datatypes in its type system, and is now based on an extension to System F known as System FC.[5]
In the tradition of type-directed compilation, GHC's simplifier, or "middle end", where most of the optimizations implemented in GHC are performed, is structured as a series of source-to-source transformations on Core code. The analyses and transformations performed in this compiler stage include demand analysis (a generalization of strictness analysis), application of user-defined rewrite rules (including a set of rules included in GHC's standard libraries that performs foldr/build fusion), unfolding (called "inlining" in more traditional compilers), let-floating, an analysis that determines which function arguments can be unboxed, constructed product result analysis, specialization of overloaded functions, as well as a set of simpler local transformations such as constant folding and beta reduction.[6]
The final stage of the simplifier transforms Core code into STG (short for "Spineless Tagless G-machine"), a lower-level intermediate language. Like Core, STG is itself a functional language. STG also corresponds to an abstract machine. GHC's back end performs transformations on STG before translating it into C, C--, or native machine code (the traditional "code generation" phase).[7] Emitted C or C-- code may then be used as an intermediate language before compiling to machine code.
[edit] Language
GHC complies with the latest language standard, called Haskell 98.[8] It also supports many optional extensions to the Haskell standard: for example, the STM library, which allows for Composable Memory Transactions.
[edit] Portability
Versions of GHC are available for several platforms, including Windows and most varieties of Unix (such as the numerous GNU/Linux flavors and Mac OS X.) GHC has also been ported to several different processor architectures.
[edit] References
- ^ ghc --version
- ^ The Glorious Glasgow Haskell Compilation System User's Guide, Version 6.6. Retrieved on 2007-01-28.
- ^ a b Hudak, P.; Hughes, J.; Peyton Jones, S.; Wadler, P. (June 2007). "A history of Haskell: being lazy with class". Proc. Third ACM SIGPLAN History of Programming Languages Conference (HOPL-III).
- ^ The GHC Team. Retrieved on 2007-01-28.
- ^ Sulzmann, M.; M. M. T. Chakravarty; S. Peyton Jones; K. Donnelly (January 2007). "System F with Type Equality Coercions". Proc. Workshop on Types in Language Design and Implementation (TLDI).
- ^ Peyton Jones, S. (April 1996). "Compiling Haskell by program transformation: a report from the trenches". Proc. European Symposium on Programming (ESOP).
- ^ Peyton Jones, S. (April 1992). "Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine, Version 2.5". Journal of Functional Programming 2 (2): 127-202.
- ^ Haskell 98 Language and Libraries: The Revised Report. Retrieved on 2007-01-28.
