Programatica Tools

Directory tools/base/TI

The README file is displayed below the directory index.
NameLast modifiedSize
Parent Directory  -
Unification.hs2004-12-06 23:36 2.5K
TiUtil.hs2005-05-19 07:33 4.3K
TiTypes.hs2005-07-21 00:02 4.9K
TiTEnv.hs2005-03-04 00:43 1.1K
TiT.hs2004-12-06 23:36 1.0K
TiSolve.hs2005-07-21 00:02 3.2K
TiSCC.hs2003-05-05 23:35 740
TiRhs.hs2005-05-19 06:59 688
TiPretty.hs2003-02-04 01:38 2.2K
TiPrelude.hs2005-05-19 07:33 1.8K
TiPNT.hs2005-07-21 00:02 3.0K
TiP.hs2005-06-01 21:58 1.6K
TiNames.hs2005-03-04 00:43 2.7K
TiNameMaps.hs2003-01-06 23:50 430
TiMonad.hs2002-09-29 23:44 169
TiModule.hs2005-04-29 02:32 2.7K
TiLit.hs2004-12-18 06:24 853
TiKinds.hs2005-05-11 22:52 1.5K
TiKEnv.hs2003-02-13 07:34 246
TiInstanceDB.hs2009-01-04 11:18 3.6K
TiHsName.hs2003-11-14 20:56 1.0K
TiGeneralize.hs2005-06-01 21:58 4.9K
TiFunDeps.hs2005-07-21 00:02 5.5K
TiFresh.hs2002-12-10 20:57 850
TiFreeNames.hs2002-12-10 20:57 605
TiFields.hs2004-12-16 01:36 1.1K
TiError.hs2005-04-29 02:32 948
TiEnvFM.hs2009-01-04 11:18 1.2K
TiEnv.hs2006-03-31 03:35 645
TiE.hs2004-12-18 06:24 5.9K
TiDs.hs2005-07-21 00:02 8.9K
TiDkc.hs2005-07-21 00:02 3.8K
TiDinst.hs2004-12-16 01:36 2.7K
TiDerivedInstances.hs2005-05-19 07:33 3.5K
TiDefinedNames.hs2005-07-21 00:02 1.7K
TiDefault.hs2005-05-19 07:33 2.7K
TiDecorate.hs2006-08-12 01:30 13K
TiD.hs2005-07-21 00:02 6.6K
TiContextReduction.hs2005-07-21 00:02 6.1K
TiConstraints.hs2003-03-19 09:42 214
TiClasses.hs2005-07-21 00:02 4.4K
TiClassInst2.hs2005-02-02 00:38 7.7K
TiClassInst.hs2004-12-18 06:24 3.2K
TiBySuper.hs2005-04-15 01:29 1.6K
TiBaseStruct.hs2002-05-15 22:22 346
TiBase.hs2005-07-21 00:02 3.1K
TI.hs2005-05-19 07:33 367
OrigTiMonad.hs2006-06-09 22:39 5.1K
NewTiMonad.hs2003-02-07 01:14 3.3K
NameMapsDecorate.hs2005-05-12 22:58 3.6K
Flags.ghc2004-12-18 06:24 900

Extensible Haskell front-end for the Programatica project

What is in this directory (base/TI)

This directory contains a type checker for the base language (i.e., more or less Haskell 98). It is structured to allow large parts to be reusable in extended versions of the language.

At present, the type inference monad is fixed, and the AST for inferred types is fixed, but it might be possible to factor out these aspects too.

Although various details differ, this type checker is influenced by

Modules for the basic type inference machinery

Instances and context reduction

Type inference for the base language structure

These should be reusable in extended versions of the language.

Knot-tying definitions for the base language

Type inference for sequences of declarations

Interfaces to other pieces of reusable code

Other modules