| Expressions |
Domain |
Definition |
| Data Parallel Haskell |
Computing |
Data Parallel Haskell Adds Parallel Objects with arbitrary Dimension (PODs) and POD comprehensions to Haskell. (ftp://redstar.dcs.qmw.ac.uk/cpc/jon_hill/dpGlue.ps. Z) ["Data Parallel Haskell: Mixing Old and New Glue", J. Hill]. (1995-03-30). Source: The Free On-line Dictionary of Computing.. |
| Glasgow Haskell Compiler |
Computing |
(GHC) A Haskell 1.2 compiler written in Haskell by the AQUA project at Glasgow University, headed by Simon Peyton Jones 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. Glasgow FTP (ftp://ftp.dcs.glasgow.ac.uk/pub/haskell/glasgow/). Yale (ftp://nebula.cs.yale.edu/pub/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: . (1999-01-05). Source: The Free On-line Dictionary of Computing.. |
| Haskell B |
Computing |
Haskell B An early version of Haskell by Lennart Augustsson from Chalmers. Haskell B evolved into a full-featured implementation of Haskell 1.2, with quite a few extensions. Ports exist for many platforms including Sun, DEC, Sequent, IBM PC, Symmetry and unsupported versions for NS32000, IBM RT/PC, Cray, Sun-3, Vax, ARM, and RS/6000. Version 0.999.5 included a compiler, interpreter, library, documentation, and examples. (ftp://ftp.cs.chalmers.se/pub/haskell/chalmers/). Mailing list: . E-mail: . (1996-08-21). Source: The Free On-line Dictionary of Computing.. |
| Haskell Curry |
Computing |
Haskell Curry 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. Biography (http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Curry.html). (1999-01-08). Source: The Free On-line Dictionary of Computing.. |
| Haskell User's Gofer System |
Computing |
Haskell User's Gofer System (HUGS) An implementation of Haskell derived from Gofer 2.30b with an interactive development environment much like Gofer's. Almost all of the features of Haskell 1.2 are implemented with the exception of the module system. Hugs supports Haskell style type classes, a full prelude, derived instances, defaults, overloaded numeric literals and pattern matching, and bignum arithmetic. Home (http://www.cs.nott.ac.uk/Department/Staff/mpj/hugs.html). (ftp://ftp.cs.nott.ac.uk/pub/haskell/hugs) E-mail: Mark P. Jones . (1995-02-14). Source: The Free On-line Dictionary of Computing.. |
| Parallel Haskell |
Computing |
Parallel Haskell (pH) A parallel variant of Haskell incorporating ideas from Id and Sisal.pH is under development. Mailing list: pH@abp.lcs.mit.edu. (1995-03-31). Source: The Free On-line Dictionary of Computing.. |
| Yale Haskell |
Computing |
Yale Haskell A fully integrated Haskell programming environment. It provides tightly coupled interactive editing, incremental compilation and dynamic execution of Haskell programs. Two major modes of compilation, correspond to Lisp's traditional "interpreted" and "compiled" modes. Compiled and interpreted modules may be freely mixed in any combination. Yale Haskell is run using either a command-line interface or as an inferior process running under the Emacs editor. Using the Emacs interface, simple two-keystroke commands evaluate expressions, run dialogues, compile modules, turn specific compiler diagnostics on and off and enable and disable various optimizers. Commands may be queued up arbitrarily, thus allowing, for example, a compilation to be running in the background as the editing of a source file continues in Emacs in the foreground. A "scratch pad" may be automatically created for any module. Such a pad is a logical extension of the module, in which additional function and value definitions may be added, but whose evaluation does not result in recompilation of the module. A tutorial on Haskell is also provided in the Emacs environment. A Macintosh version of Yale Haskell includes its own integrated programming environment, complete with an Emacs-like editor and pull-down menus. Yale Haskell is a complete implementation of the Haskell language, but also contains a number of extensions, including: (1) Instead of stream based I/O, a monadic I/O system is used. Although similar to what will be part of the new Haskell 1.3 report, the I/O system will change yet again when 1.3 becomes official. (2) Haskell programs can call both Lisp and C functions using a flexible foreign function interface. (3) Yale Haskell includes a dynamic typing system. Dynamic typing has been used to implement derived instances in a user extensible manner. (4) A number of small Haskell 1.3 changes have been added, including polymorphic recursion and the use of @_@ in an expression to denote bottom. Although the 1.3 report is not yet complete, these changes will almost certainly be part of the new report. (5) A complete Haskell level X Window System interface, based on CLX. (6) A number of annotations are available for controlling the optimizer, including those for specifying both function and data constructor strictness properties, "inlining" functions, and specializing over-loaded functions. Many standard prelude functions have been specialized for better performance using these annotations. (7) Separate compilation (including mutually recursive modules) is supported using a notion of a UNIT file, which is a kind of localized makefile that tells the compiler about compiler options and logical dependencies amongst program files. (8) Yale Haskell supports both standard and "literate" Haskell syntax. Performance of Yale Haskell's compiled code has been improved considerably over previous releases. Although still not as good as the Glasgow (GHC) and Chalmers (HBC) compilers, the flexibility afforded by the features described earlier makes Yale Haskell a good choice for large systems development. For some idea of performance, Hartel's latest "Nuc" benchmark runs at about the same speed under both Yale Haskell and hbc. (Our experiments suggest, however, that Yale Haskell's compiled code is on average about 3 times slower than hbc.) Binaries are provided for Sun/SPARC and Macintosh, but it is possible to build the system on virtually any system that runs one of a number of Common Lisp implementations: CMU Common Lisp, Lucid Common Lisp, Allegro Common Lisp or Harlequin LispWorks.akcl, gcl and CLisp do not have adequate performance for our compiler. The current version is 2.1. Yale (ftp://nebula.cs.yale.edu/pub/haskell/yale) (128.36.13.1). UK (ftp://ftp.dcs.glasgow.ac.uk/pub/haskell/yale/). Sweden (ftp://ftp.cs.chalmers.se/pub/haskell/yale/). E-mail: , . (1993-07-14). Source: The Free On-line Dictionary of Computing.. |
|
Source: compiled by the editor from various references; see credits.
| Top |
