Programatica Tools

Directory tools/base

The README file is displayed below the directory index.
NameLast modifiedSize
Parent Directory  -
AST/2006-06-13 00:15 -
Flags.ghc2002-03-15 00:03 47
HuMakefile2006-06-09 22:39 1.2K
Main.hs2001-07-30 07:07 8.5K
Makefile2003-06-19 21:47 1.2K
Makefile.ghc-4.082001-04-28 03:02 3.1K
Makefile.old2002-01-30 08:25 1.8K
Modules/2009-01-04 11:18 -
ParseHaskellProgram.hs2002-02-28 00:46 1.0K
ParseOld.hs2001-11-09 01:47 8.2K
ParseProgram.hs2002-03-15 00:03 1.6K
ScopeHaskellProgram.hs2002-02-07 01:53 395
ScopeProgram.hs2003-01-06 23:50 851
TI/2009-01-04 11:18 -
TiProgram.hs2002-03-26 07:56 1.3K
defs/2009-01-04 11:18 -
ghc_test2001-04-12 06:43 227
lib/2009-01-04 11:20 -
myghci2002-03-29 22:49 88
myhugs2002-03-11 01:45 53
parse/2009-01-04 12:00 -
parse2/2013-11-27 15:28 -
pfei.hs2002-03-13 09:41 851
pretty/2009-01-04 11:18 -
syntax/2005-04-15 01:29 -
testparse2001-04-12 06:43 99
testparse22001-10-23 01:49 149
tests/2009-01-02 11:53 -
transforms/2006-07-06 02:13 -
tstModules.hs2003-01-06 23:50 5.5K
tstScopeNames.hs2001-11-24 10:12 1.6K
tstTI.hs2003-01-06 23:50 1.1K
tstTI.srclist2002-04-13 00:05 3.7K
Extensible Haskell front-end for the Programatica project - directory base

Extensible Haskell front-end for the Programatica project

What is in this directory (base)

This directory contains the code that deals with the base language, i.e., more or less Haskell 98. It is structured to allow most of the code to be reused without changes in extended versions of the language.

Obsolete subdirectories

parse, SA, TC

Active subdirectories

nonrecursive data structures for the abstract syntax (reusable in extensions),
knot-tying recursive definitions for the base language (not reusable in extensions),
Happy parser (not reusable), lexer, lexer generator. The lexer is described in A Lexer for Haskell in Haskell.
implementation of Haskell's module system, as described in the paper A Formal Specification for the Haskell 98 Module System,
defined names, free names, mapping over names, scoping information, infix operator reassociation (both reusable parts and knot-tying parts for the base language),
type checker (both reusable parts and knot-tying parts for the base language),
library of pretty printing combinators,
general library modules (does not depend on anything else here),
Source level transformations (e.g., pattern match simplification). Generation of code for derived instances.
test input,
Haskell 98 Prelude and Standard Libraries, with some minor changes to make them go through our type checker. (This is now an important part of our tools and doesn't belong in the test subdirectory anymore!)

Authors: various
Contact: TH