a major revision of the bytecode generator and JIT compiler. the effect is that now we can compute with lambda functions and with true tail recursion

src/runtime/haskell/PGF/Expr.hs

@@ -31,12 +31,6 @@ import Control.Monad
 import qualified Text.PrettyPrint as PP
 import qualified Text.ParserCombinators.ReadP as RP
 
-data Literal = 
-   LStr String                      -- ^ string constant
- | LInt Int                         -- ^ integer constant
- | LFlt Double                      -- ^ floating point constant
- deriving (Eq,Ord,Show)
-
 type MetaId = Int
 
 data BindType = 
@@ -274,10 +268,6 @@ pattScope scope (PTilde e)   = scope
 ppBind Explicit x = ppCId x
 ppBind Implicit x = PP.braces (ppCId x)
 
-ppLit (LStr s) = PP.text (show s)
-ppLit (LInt n) = PP.int n
-ppLit (LFlt d) = PP.double d
-
 ppMeta :: MetaId -> PP.Doc
 ppMeta n
   | n == 0    = PP.char '?'