<language> (GHC) A Haskell 1.2 compiler written in Haskell by the AQUA project at Glasgow University, headed by Simon Peyton Jones <simonpj@dcs.glasgow.ac.uk> throughout the 1990's [started?]. GHC can generate either C or native code for SPARC, DEC Alpha and other platforms. It can take advantage of features of gcc such as global register variables and has an extensive set of optimisations. GHC features an extensible I/O system based on a "monad", in-line C code, fully fledged unboxed data types, incrementally-updatable arrays, mutable reference types, generational garbage collector, concurrent threads. Time and space profiling is also supported. It requires GNU gcc 2.1+ and Perl. GHC runs on Sun-4, DEC Alpha, Sun-3, NeXT, DECstation, HP-PA and SGI. Latest version: 4.01, as of 1998-11-30. {haskell/glasgow/">Glasgow FTP (ftp://ftp.dcs.glasgow.ac.uk/pub/haskell/glasgow/)}. {haskell/glasgow/">Yale (ftp://nebula.cs.yale.edu/pub/haskell/glasgow/)}. {haskell/glasgow/">Sweden (ftp://ftp.cs.chalmers.se/pub/haskell/glasgow/)}. Papers (ftp://ftp.dcs.glasgow.ac.uk/pub/glasgow-fp). ["Imperative functional programming", Peyton Jones & Wadler, POPL '93]. ["Unboxed data types as first-class citizens", Peyton Jones & Launchbury, FPCA '91]. ["Profiling lazy functional languages", Sansom & Peyton Jones, Glasgow workshop '92]. ["Implementing lazy functional languages on stock hardware", Peyton Jones, Journal of Functional Programming, Apr 1992]. E-mail: <glasgow-haskell-request@dcs.glasgow.ac.uk>. (1999-01-05)

<person> Haskell Brooks Curry (1900-09-12 - 1982-09-01). The logician who re-invented and developed combinatory logic. The functional programming language Haskell was named after him. {Haskell Curryhistory/Mathematicians/Curry.html">Biography (http://www-groups.dcs.st-and.ac.uk/Haskell Curryhistory/Mathematicians/Curry.html)}. (1999-01-08)

A utility to generate the source code of a parser, interpreter or compiler from an annotated language description (usually in BNF). Most so called compiler-compilers are really just parser generators. Examples are Bison, Eli, FSL, META 5, MUG2, Parsley, Pre-cc, Yacc. (1995-01-23)

compiler-compiler

<b>(compilers)b>

An early compiler generator for the Atlas, with its own distinctive input language. ["The Compiler-Compiler", R.A. Brooker et al, Ann Rev Automatic Programming 3:229-275, Pergamon 1963]. (1994-10-24)

A program which takes a formal description of a grammar (e.g. in BNF) and outputs source code for a parser which will recognise valid strings obeying that grammar and perform associated actions. Unix's yacc is a well known example.

In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine.

<language> (Named after the logician Haskell Curry) A lazy purely functional language largely derived from Miranda but with several extensions. Haskell was designed by a committee from the functional programming community in April 1990. It features static polymorphic typing, {higher-order functions}, user-defined algebraic data types, and pattern-matching list comprehensions. Innovations include a class system, systematic operator overloading, a functional I/O system, functional arrays, and {separate compilation}. Haskell 1.3 added many new features, including monadic I/O, standard libraries, constructor classes, labeled fields in datatypes, strictness annotations, an improved module system, and many changes to the Prelude. Gofer is a cut-down version of Haskell with some extra features. Filename extension: .hs, .lhs (literate programming). http://haskell.org/. ["Report on the Programming Language Haskell Version 1.1", Paul Hudak & P. Wadler eds, CS Depts, U Glasgow and Yale U., Aug 1991]. [Version 1.2: SIGPLAN Notices 27(5), Apr 1992]. {haskell-report/haskell-report.html">Haskell 1.3 Report (http://haskell.cs.yale.edu/haskell-report/haskell-report.html)}. Mailing list: <haskell-request@cs.yale.edu>. Yale Haskell - Version 2.0.6, Haskell 1.2 built on {Common Lisp}. haskell/yale/">ftp://nebula.cs.yale.edu/pub/haskell/yale/. Glasgow Haskell (GHC) - Version 2.04 for DEC Alpha/OSF2; HPPA1.1/HPUX9,10; SPARC/SunOs 4, Solaris 2; MIPS/Irix 5,6; Intel 80386/Linux,Solaris 2,FreeBSD,CygWin 32; PowerPC/AIX. GHC generates C or native code. haskell/glasgow/">ftp://ftp.dcs.glasgow.ac.uk/pub/haskell/glasgow/. E-mail: <glasgow-haskell-request@dcs.glasgow.ac.uk>. Haskell-B - Haskell 1.2 implemented in LML, generates native code. haskell/chalmers/">ftp://ftp.cs.chalmers.se/pub/haskell/chalmers/. E-mail: <hbc@cs.chalmers.se>. (1997-06-06)

<programming, tool> A program that converts another program from some source language (or programming language) to machine language (object code). Some compilers output assembly language which is then converted to {machine language} by a separate assembler. A compiler is distinguished from an assembler by the fact that each input statement does not, in general, correspond to a single machine instruction or fixed sequence of instructions. A compiler may support such features as automatic allocation of variables, arbitrary arithmetic expressions, control structures such as FOR and WHILE loops, variable scope, input/ouput operations, higher-order functions and portability of source code. AUTOCODER, written in 1952, was possibly the first primitive compiler. Laning and Zierler's compiler, written in 1953-1954, was possibly the first true working algebraic compiler. See also byte-code compiler, native compiler, {optimising compiler}. (1994-11-07)