From 68482aa7e9882ab8d65fb5fe261efc0e807f6dfd Mon Sep 17 00:00:00 2001 From: krasimir Date: Wed, 24 Mar 2010 11:11:55 +0000 Subject: now for every category we store, in PGF, the list of functions for it in source-code order. The order matters for the termination of the exhaustive generation with dependent types. --- src/runtime/haskell/PGF/Data.hs | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) (limited to 'src/runtime/haskell/PGF/Data.hs') diff --git a/src/runtime/haskell/PGF/Data.hs b/src/runtime/haskell/PGF/Data.hs index fe768cd20..b604317fc 100644 --- a/src/runtime/haskell/PGF/Data.hs +++ b/src/runtime/haskell/PGF/Data.hs @@ -24,10 +24,12 @@ data PGF = PGF { } data Abstr = Abstr { - aflags :: Map.Map CId Literal, -- value of a flag - funs :: Map.Map CId (Type,Int,Maybe [Equation]), -- type, arrity and definition of function - cats :: Map.Map CId [Hypo], -- context of a cat - catfuns :: Map.Map CId [CId] -- funs to a cat (redundant, for fast lookup) + aflags :: Map.Map CId Literal, -- ^ value of a flag + funs :: Map.Map CId (Type,Int,Maybe [Equation]), -- ^ type, arrity and definition of function + cats :: Map.Map CId ([Hypo],[CId]) -- ^ 1. context of a category + -- ^ 2. functions of a category. The order in the list is important, + -- this is the order in which the type singatures are given in the source. + -- The termination of the exhaustive generation might depend on this. } data Concr = Concr { -- cgit v1.2.3