{- |

Module : $Header$

Copyright : (c) Paolo Torrini and Till Mossakowski and Uni Bremen 2004-2005

License : Asimilar to LGPL, see HetCATS/LICENSE.txt or LIZENZ.txt

Maintainer : paolot@tzi.de

Stability : provisional

Portability : non-portable (imports Logic.Logic)

The embedding comorphism from Haskell to Isabelle-HOLCF.

-}

module Comorphisms.Hs2HOLCFaux where

import Data.List

import Data.Maybe

import qualified Common.Lib.Map as Map

import Common.Result as Result

import Common.AS_Annotation

-- Haskell

import Haskell.HatParser as HatParser hiding (HsType)

import Haskell.HatAna as HatAna

-- Programatica

import HsTypeStruct

import HsKindStruct

import HsTypeMaps

import HsName

import HsIdent

import TypedIds

import OrigTiMonad

import TiTypes

import TiKinds

import TiInstanceDB -- as TiInst

import TiTEnv

import TiKEnv

import TiEnvFM

import PNT

import PosName

import UniqueNames

import PropSyntaxRec

import HsExpStruct

import HsPatStruct

import HsExpMaps

import HsPatMaps

import SyntaxRec

import TiPropDecorate

import PropSyntaxStruct

import HsDeclStruct

import HsGuardsStruct

import TiDecorate

-- Isabelle

import Isabelle.IsaSign as IsaSign

import Isabelle.IsaConsts as IsaConsts

import Isabelle.Translate as Translate

------------------------------- TYPE synonims --------------------------------------

------------------ Haskell ----------------------------------------------------------

type HsInstance = TiInstanceDB.Instance PNT

type HsInstances = [TiInstanceDB.Instance PNT]

type HsPred = TiTypes.Pred PNT

type HsType = TiTypes.Type PNT

type HsClass = TiTypes.Type PNT

type HsScheme = TiTypes.Scheme PNT

type HsId = HsIdentI PNT

type HsTypeInfo = TiTypes.TypeInfo PNT

type PrDecl = TiPropDecorate.TiDecl PNT

type PrExp = TiPropDecorate.TiExp PNT

type PrPat = TiDecorate.TiPat PNT

type HId i = HsIdentI i

type HPat = SyntaxRec.HsPatI

type VaMap = Map.Map HsId HsScheme

type TyMap = Map.Map HsId (Kind, HsTypeInfo)

------------------ Isabelle ------------------------------------------------------------

type IsaSort = IsaSign.Sort

type IsaType = IsaSign.Typ

type IsaTerm = IsaSign.Term

type IsaPattern = IsaSign.Term

type IsaExKind = IsaSign.ExKind

type IsaTypeInsts = (TName, [(IsaClass, [(IsaType, [IsaClass])])])

----------------------------- GENERIC auxiliary functions ---------------------

----------------------------- list functions ----------------------------------

removeEL :: Eq a => [[a]] -> [[a]]

removeEL ls = case ls of

a:as -> if a == [] then removeEL as else a:(removeEL as)

[] -> []

remove_duplicates :: (Eq a) => [a] -> [a]

remove_duplicates ls = remove_dupes ls []

remove_dupes :: (Eq a) => [a] -> [a] -> [a]

remove_dupes ls ms = case ls of

x:rs ->

if (elem x (rs ++ ms)) then remove_dupes rs ms else remove_dupes rs (x:ms)

[] -> ms

listEnum :: [a] -> [(a,Int)]

listEnum l = case l of

[] -> []

a:as -> (a,length (a:as)):(listEnum as)

genOr :: (a -> Bool) -> [a] -> Bool

genOr f ys = case ys of

[] -> False

x:xs -> if (f x) then True

else (genOr f xs)

---------------------------------- filters -----------------------------------------

nothingFiOut :: [(a,(Maybe b,c))] -> [(a,(b,c))]

nothingFiOut ls = [(x,(y,w)) | (x,(Just y,w)) <- ls]

--------------------------------- lifting function ----------------------------------

liftMapByList :: (x -> [(a,b)]) -> ([(c,d)] -> y) ->

(a -> c) -> (b -> d) -> x -> y

liftMapByList ma mb h k f = mb [(h a, k b) | (a, b) <- ma f]

--liftMapByListD :: (x -> [(a,b)]) -> ([(c,(d,e))] -> y) ->

-- (a -> c) -> (b -> d) -> (a -> e) -> x -> y

--liftMapByListD ma mb h k l f = mb [(h a, (k b, l a)) | (a, b) <- ma f]

-- liftMapByListD :: (x -> [(a1,a2)]) -> ([(c1,c2)] -> y) -> ((a1,a2) -> b1) ->

-- ((a1,a2) -> (b2,b3)) -> ([(b1,(b2,b3))] -> [(c1,c2)]) -> x -> y

liftMapByListD :: (x -> [a]) -> ([c] -> y) -> (a -> b1) ->

(a -> b2) -> ([(b1,b2)] -> [c]) -> x -> y

liftMapByListD l1 l2 h k g f = l2 $ g [ (h a, k a) | a <- l1 f]

liftMapByListF ::

(x -> [(a,b)]) -> ([(c,d)] -> y) -> (a -> c) -> (b -> d) ->

(a -> Bool) -> x -> y

liftMapByListF ma mb h k cs f = mb [(h a, k b) | (a, b) <- ma f, cs a]

--------------------------- generic checking of mutual dependencies -------------------

abGetDep :: Eq a => (a -> a -> Bool) -> [[a]] -> [[a]]

abGetDep f ls = case ls of

x:xs ->

remove_duplicates $

removeEL (map remove_duplicates (checkDep (abCheckDep (mutRel f)) (xs) [x] []))

[] -> []

{- called to check whether, given two lists of elements, one depends on the other -}

abCheckDep :: (a -> a -> Bool) -> [a] -> [a] -> Bool

abCheckDep f as bs = genOr (\x -> genOr (f x) bs) as

checkDep :: ([x] -> [x] -> Bool) -> [[x]] -> [[x]] -> [[x]] -> [[x]]

checkDep f ls ms cs = case ls of

a:as -> case ms of

b:bs ->

if (f a b) then checkDep f ((a ++ b):as) bs cs else checkDep f (a:as) bs (b:cs)

[] -> checkDep f as (a:cs) []

[] -> ms

{- mutual dependence -}

mutRel :: (a -> a -> Bool) -> a -> a -> Bool

mutRel f x y = f x y && f y x

depOn :: (a -> b -> Bool) -> (c -> a) -> (c -> [b]) -> c -> c -> Bool

depOn f g h x y = genOr (f (g x)) (h y)

------------------------ HASKELL representation ---------------------------------------

--------------------------- check functions -------------------------------------------

checkTyCons :: HsId -> Bool

checkTyCons d = case d of

HsCon x -> True

_ -> False

------------------------------ get functions -------------------------------

------------------------ getting info from Haskell types ----------------------

getLitName :: HsType -> PNT

getLitName (Typ t) = case t of

HsTyVar x -> x

HsTyCon x -> x

_ -> error "Type is not a literal (Haskell2IsabelleHOLCF.getLitName)"

------------------------ getting class and type ouf of predicate ---------------

getInstType :: HsPred -> HsType

getInstType x = case x of (Typ (HsTyApp _ t)) -> t

_ -> error "error, getInstType"

getInstClass :: HsPred -> HsType

getInstClass x = case x of (Typ (HsTyApp c _)) -> c

_ -> error "error, getInstClass"

----------------------------- getting type schemes --------------------------------

getHsType :: VaMap -> HsId -> HsScheme

getHsType f n = case Map.lookup n f of

Just t -> t

_ -> error "Haskell2IsabelleHOLCF.getHsType"

---------------------------- getting class information ----------------------------

extClassInfo :: HsTypeInfo -> [HsClass]

extClassInfo p = case p of

TiTypes.Class a _ _ _ -> map getInstType a

_ -> error "error Haskell2IsabelleHOLCF.extClassInfo"

--------------------------- getting info on type syns -----------------------------

extAbbrsInfo :: HsTypeInfo -> ([PNT], HsType)

extAbbrsInfo p = case p of

TiTypes.Synonym ls t -> (ls, t)

_ -> error "extAbbrsInfo"

----------- getting arity information from Haskell instances -----------------------

getInstPrems :: HsInstance -> [HsPred]

getInstPrems (_, IE _ _ ps) = ps

getMainInstType :: HsInstance -> HsType

getMainInstType i = getInstType (fst i)

getMainInstClass :: HsInstance -> HsClass

getMainInstClass i = getInstClass (fst i)

prepInst :: HsInstance -> (HsClass, [(HsType, [HsClass])])

prepInst i = (getMainInstClass i, prepInst1 i)

prepInst1 :: HsInstance -> [(HsType, [HsClass])]

prepInst1 i =

[(x, [getInstClass y | y <- getInstPrems i, showIsaString (getInstType y) == showIsaString x])

| x <- remove_duplicates $ map getInstType (getInstPrems i)]

-------------------------- ISABELLE representation ---------------------------------

-------------------------------- constants ------------------------------------------

xDummy :: IsaTerm

xDummy = conDouble "dummy"

holEq :: IsaTerm -> IsaTerm -> IsaTerm

holEq t1 t2 = termMAppl NotCont (conDouble eq) [t1, t2]

-------------------------------- Name translation ----------------------------------

-- Translating to strings compatible with Isabelle

class IsaName a where

showIsaName :: a -> String

showIsaString :: a -> String

showIsaS :: String -> String

showIsaS = transConstStringT HOLCF_thy

instance IsaName String where

showIsaName x = showIsaS x

showIsaString x = x

showIsaHsN :: Show a => (String -> a) -> HsName.HsName -> a

showIsaHsN f t = case t of

Qual _ y -> f y

UnQual w -> f w

instance IsaName HsName.HsName where

showIsaName = showIsaHsN showIsaS

showIsaString = showIsaHsN id

instance IsaName PosName.HsName where

showIsaName (SN x _) = showIsaName x

showIsaString (SN x _) = showIsaString x

instance IsaName PNT.PName where

showIsaName (PN x _) = showIsaName x

showIsaString (PN x _) = showIsaString x

instance IsaName PNT where

showIsaName (PNT x _ _) = showIsaName x

showIsaString (PNT x _ _) = showIsaString x

instance IsaName a => IsaName (HId a) where

showIsaName t = case t of

HsVar x -> showIsaName x

HsCon x -> showIsaName x

showIsaString t = case t of

HsVar x -> showIsaString x

HsCon x -> showIsaString x

instance IsaName a => IsaName (TiTypes.Type a) where

showIsaString (Typ t) = case t of

HsTyFun _ _ -> "Fun"

HsTyApp _ _ -> "App"

HsTyVar x -> showIsaString x

HsTyCon x -> showIsaString x

HsTyForall _ _ x -> showIsaString x

------------------ auxiliary name functions (inessentially) depending on IsaSign ------------------

joinNames :: [String] -> String

joinNames = concatMap (++ "_X")

transTN :: String -> String -> String

transTN s1 s2 = case (s1,s2) of

("Prelude","Bool") -> "tr"

("Prelude","Int") -> "dInt"

("Prelude","[]") -> "llist"

_ -> transPath s1 s2

transPath :: String -> String -> String

transPath s1 s2 = (showIsaName s1)++"_"++(showIsaName s2)

-------------------------- TYPES -------------------------------------------------------------

------------------------ tuples, lifting -----------------------------------------------------

typTuple :: [Typ] -> Typ

typTuple ts = case ts of

[] -> noType

[a] -> a

a:as -> mkContProduct a (typTuple as)

typeLift :: Typ -> Typ

typeLift t = IsaSign.Type "lift" (remove_duplicates $ pcpo:(typeSort t)) [t]

typeLift1 :: Typ -> Typ

typeLift1 t = case t of

IsaSign.Type name s [t1,t2] | name == funS ->

IsaSign.Type cFunS (remove_duplicates $ pcpo:s) [typeLift t1, t2]

_ -> error "Hs2HOLCFaux, typeLift1"

typeLift2 :: Typ -> Typ

typeLift2 t = case t of

IsaSign.Type name s [t1,t2] | name == funS ->

IsaSign.Type cFunS (remove_duplicates $ pcpo:s)

[typeLift t1, typeLift t2]

_ -> error "Hs2HOLCFaux, typeLift2"

----------------------------- equivalence of types modulo variables name -------------------

typEq :: Typ -> Typ -> Bool --make some distinction for case noType??

typEq t1 t2 = case (t1,t2) of

(IsaSign.Type _ _ ls1,IsaSign.Type _ _ ls2) ->

if typeId t1 == typeId t2 && typeSort t1 == typeSort t2 then typLEq ls1 ls2 else False

(TFree _ _,TFree _ _) -> if typeSort t1 == typeSort t2 then True else False

(TVar _ _,TVar _ _) -> if typeSort t1 == typeSort t2 then True else False

_ -> False

typLEq :: [Typ] -> [Typ] -> Bool

typLEq ls1 ls2 = case (ls1,ls2) of

([],[]) -> True

(a:as,b:bs) -> typEq a b && typLEq as bs

_ -> False

------------------------------- replacement functions ------------------------------------

-- constrains variables in t with sort constraints in cs

constrVarClass :: IsaType -> [(IsaType,Sort)] -> IsaType

constrVarClass t cs = typeVarsRep addSort [(typeId x,y) | (x,y) <- cs] t

addSort :: [(TName,Sort)] -> TName -> Sort -> Maybe Typ

addSort cs n s = do

as <- Map.lookup n (Map.fromList cs)

return $ (TFree n (remove_duplicates (s ++ as)))

-- replaces in t varibles of class c with nt

repVarClass :: IsaType -> IsaClass -> IsaType -> IsaType

repVarClass t c nt = typeVarsRep repVC (c,nt) t

repVC :: (IsaClass, IsaType) -> TName -> IsaSort -> Maybe IsaType

repVC (c,t) n s = if elem c s then return t else Nothing

typeVarsRep ::

(a -> TName -> Sort -> Maybe IsaType) -> a -> IsaType -> IsaType

typeVarsRep f ls t = case t of

IsaSign.Type n s vs -> IsaSign.Type n s (map (typeVarsRep f ls) vs)

IsaSign.TFree n s -> maybe t id $ f ls n s

IsaSign.TVar i s -> t

---------------------------- Instances -----------------------------------------

groupInst :: [IsaTypeInsts] -> [IsaTypeInsts]

groupInst db =

remove_duplicates [(fst y,

remove_duplicates $ concat [snd x | x <- db, fst x == fst y]) | y <- db]

------------------------- DATATYPES ------------------------------------------------

----------------------- getting mutually recursive domains in Isabelle ------------

getDepDoms :: [[IsaSign.DomainEntry]] -> IsaSign.DomainTab

getDepDoms ls = abGetDep deDepOn ls

deDepOn :: DomainEntry -> DomainEntry -> Bool

deDepOn x y = depOn subTypForm fst (concat . (map snd) . snd) x y

subTypForm :: Typ -> Typ -> Bool

subTypForm t1 t2 = case t2 of

IsaSign.Type a b cs ->

if a == IsaSign.typeId t1 &&

b == IsaSign.typeSort t1 then True

else genOr (subTypForm t1) cs

_ -> False

------------------------ getting info about domaintab ----------------------------

type AConstTab = Map.Map VName (Typ,IsaVT)

data IsaVT = IsaConst | IsaVal deriving (Eq, Show)

getDomType :: AConstTab -> VName -> IsaType

getDomType ctab c = let x = Map.lookup c ctab in

case x of

Nothing -> error "Haskell2IsabelleHOLCF.getDomType"

Just y -> getHeadType $ fst y

getHeadType :: IsaType -> IsaType

getHeadType t = case t of

IsaSign.Type name _ [t1,t2] | name == cFunS -> getHeadType t2

_ -> t

getFieldTypes :: AConstTab -> VName -> [IsaType]

getFieldTypes ctab c = let x = Map.lookup c ctab in

case x of

Nothing -> []

Just y -> argTypes (fst y)

argTypes :: IsaType -> [IsaType]

argTypes a = case a of

IsaSign.Type name _ [b,c] | name == cFunS -> b : argTypes c

_ -> []

-------------------------- TERMS --------------------------------------------------------------

---------------- lifting, tuples, multiple abstractions and applications, fixpoints -----------

termLift :: Term -> Term

termLift t = App (conDouble "Def") t NotCont

funLift1 :: Term -> Term

funLift1 f = termMAppl NotCont (conDouble "flift1") [f]

funLift2 :: Term -> Term

funLift2 f = termMAppl NotCont (conDouble "flift2") [f]

funFliftbin :: Term -> Term

funFliftbin f = termMAppl NotCont (conDouble "fliftbin") [f]

termMAbs :: Continuity -> [Term] -> Term -> Term

termMAbs c ts t =

case ts of

[] -> t

v:vs -> if isDicConst v then (termMAbs c vs t) else

IsaSign.Abs v (termType v) (termMAbs c vs t) c

-- termMAbs c vs (IsaSign.Abs v (termType v) t c)

isDicConst :: Term -> Bool

isDicConst t = case t of

Const vn _ | IsaSign.orig vn == "DIC" -> True

_ -> False

termMAppl :: Continuity -> Term -> [Term] -> Term

termMAppl c t ts =

let prelTest vn = elem (IsaSign.orig vn)

[ "inst__Prelude_Num_Int"

, "fromInteger"

, "derived__Prelude_Eq_Bool"]

in case (t, ts) of

(Const vn _, [a]) | prelTest vn -> a

(_,[]) -> t

(_,v:vs) -> case v of

Const vn _ | isDicConst v || prelTest vn -> termMAppl c t vs

_ -> termMAppl c (App t v c) vs

fixPointRep :: Term -> Term -> Term

fixPointRep t1 t2 = case t1 of

Const n x -> Fix $ IsaSign.Abs (Free n x) x (varForFun (n,x) t2) IsCont

_ -> error "Haskell2IsabelleHOLCF, fixPointRep"

tupleSelector :: Int -> Int -> Term -> Continuity -> Term

tupleSelector mx n t c

| mx < 2 = error "Haskell2IsabelleHOLCF, tupleSelector - error 1"

| n == 0 = error "Haskell2IsabelleHOLCF, tupleSelector - error 2"

| mx < n = error "Haskell2IsabelleHOLCF, tupleSelector - error 3"

| n == mx = tupleSelect (n - 1) t c

| True = termMAppl c (conDouble "cfst") $ [tupleSelect (n - 1) t c]

tupleSelect :: Int -> Term -> Continuity -> Term

tupleSelect n t c = case n of

0 -> t

_ -> tupleSelect (n - 1) (termMAppl c (conDouble "csnd") [t]) c

------------------------ replacement functions -----------------------------------------

{- replaces constants with variables of same name and type -}

varForFun :: (VName,Typ) -> Term -> Term

varForFun (vn,ty) t = varsForFuns sElem (vn,ty) t

sElem :: (VName,Typ) -> VName -> Typ -> Maybe Term

sElem (vn,ty) n t = if vn == n && typEq ty t then Just (Free n ty) else Nothing

{- replacement function 2 -}

varsForMFuns :: [(VName,Typ)] -> Term -> Term

varsForMFuns ls t = varsForFuns tElem ls t

tElem :: [(VName,Typ)] -> VName -> Typ -> Maybe Term

tElem ls x ty = let r = [t | (y,t) <- remove_duplicates ls, x == y, typEq ty t]

in case r of

[] -> Nothing

[a] -> Just (Free x ty)

_ -> error "Haskell2IsabelleHOLCF, tElem"

{- replacement function 3 -}

elaborate :: Int -> VName -> Typ -> [(VName, (Typ, Int))] -> Term -> Term

elaborate mx vn ty ls t = varsForFuns (ntElem mx vn ty) ls t

ntElem :: Int -> VName -> Typ -> [(VName,(Typ,Int))] -> VName -> Typ -> Maybe Term

ntElem mx vn ty ls x tx = let r = [(t,n) | (y,(t,n)) <- remove_duplicates ls, x == y, typEq tx t]

in case r of

[] -> Nothing

[(a,n)] -> Just $ tupleSelector mx n (Const vn ty) IsCont

_ -> error "Haskell2IsabelleHOLCF, tElem"

{- in term t, replaces variables, built according to f and ls,

for constants matching the VName and Typ parameters of f -}

varsForFuns ::

(a -> VName -> Typ -> Maybe Term) -> a -> Term -> Term

varsForFuns f ls t = case t of

IsaSign.Const n t1 -> maybe t id $ f ls n t1

-- IsaSign.Free n t1 -> maybe t id $ g ls n t1

IsaSign.Abs v y x c -> IsaSign.Abs v y (varsForFuns f ls x) c

IsaSign.App x y c -> IsaSign.App (varsForFuns f ls x) (varsForFuns f ls y) c

IsaSign.If x y z c ->

IsaSign.If (varsForFuns f ls x) (varsForFuns f ls y) (varsForFuns f ls z) c

IsaSign.Case x ys ->

IsaSign.Case (varsForFuns f ls x) [(a,varsForFuns f ls b) | (a,b) <- ys]

IsaSign.Let xs y ->

IsaSign.Let [(a,varsForFuns f ls b) | (a,b) <- xs] (varsForFuns f ls y)

IsaSign.IsaEq x y -> IsaSign.IsaEq (varsForFuns f ls x) (varsForFuns f ls y)

IsaSign.Tuplex xs c -> IsaSign.Tuplex (map (varsForFuns f ls) xs) c

IsaSign.Fix x -> IsaSign.Fix (varsForFuns f ls x)

IsaSign.Paren x -> IsaSign.Paren (varsForFuns f ls x)

_ -> t

------------------------------------- term filters --------------------------------------

extVars :: IsaPattern -> VName

extVars p = case p of

Free x _ -> x

_ -> error "Haskell2IsabelleHOLCF.extVars"

constFilter :: Term -> [Term]

constFilter t = case t of

IsaSign.Const _ _ -> [t]

IsaSign.Abs _ _ x _ -> constFilter x

IsaSign.App x y _ -> concat $ map constFilter [x,y]

IsaSign.If x y z c -> concat $ map constFilter [x,y,z]

IsaSign.Case x ys -> concat $ map constFilter (x:(map snd ys))

IsaSign.Let xs y -> concat $ map constFilter (y:(map snd xs))

IsaSign.IsaEq x y -> concat $ map constFilter [x,y]

IsaSign.Tuplex xs _ -> concat $ map constFilter xs

IsaSign.Fix x -> constFilter x

IsaSign.Paren x -> constFilter x

_ -> [t]

----------------------------- equivalence on terms ----------------------------------------

constEq :: Term -> Term -> Bool

constEq t1 t2 = case (t1,t2) of

(Const m x, Const n y) -> if n == m && typEq x y then True else False

_ -> False

litEq :: Term -> Term -> Bool

litEq t1 t2 = case (t1,t2) of

(Free m x, Const n y) -> if n == m && typEq x y then True else False

_ -> False

{- this functions was actually meant to compare only constructors - check out, there might be bugs -}

simTerms :: Term -> Term -> Bool

simTerms t1 t2 = case (t1, t2) of

(IsaSign.Const x _, IsaSign.Const y _) -> if x == y then True else False

(IsaSign.Free _ _, IsaSign.Free _ _) -> True

(IsaSign.Var _ _, IsaSign.Var _ _) -> True

(IsaSign.Bound _, IsaSign.Bound _) -> True

(IsaSign.Abs _ _ _ c, IsaSign.Abs _ _ _ d) -> if c == d then True else False

(If _ _ _ c, If _ _ _ d) -> if c == d then True else False

(Case _ _, Case _ _) -> True

(Let _ _, Let _ _) -> True

(IsaEq _ _, IsaEq _ _) -> True

(Fix _, Fix _) -> True

(Bottom, Bottom) -> True

(Tuplex _ _, Tuplex _ _) -> True

(Paren x, y) -> simTerms x y

(x, Paren y) -> simTerms x y

(Wildcard, Wildcard) -> True

_ -> False

---------------------- SENTENCES -------------------------------------------------------

--------------------- getting info from sentences ---------------------------------------

newConstTab :: [Named IsaSign.Sentence] -> ConstTab

-- newConstTab ls = Map.fromList [(extAxName x, extAxType x) | x <- ls]

newConstTab ls = Map.fromList [(mkVName $ extAxName x, extAxType x) | x <- ls]

extAxName :: Named Sentence -> String

extAxName s = senName s

-- extAxName s = case s of

-- NamedSen n _ _ _ -> n

-- _ -> error "Hs2HOLCFaux, extAxName"

extAxType :: Named Sentence -> Typ

extAxType s = case s of

NamedSen _ True _ (ConstDef (IsaEq (Const _ t) _)) -> t

_ -> error "Hs2HOLCFaux, extAxType"

extLeftH :: Named Sentence -> Term

extLeftH s = case s of

NamedSen _ _ _ (ConstDef (IsaEq t _)) -> t

_ -> error "Hs2HOLCFaux, extLeftH"

extRightH :: Named Sentence -> Term

extRightH s = case s of

NamedSen _ _ _ (ConstDef (IsaEq _ t)) -> t

_ -> error "Hs2HOLCFaux, extRightH"

{- left comp is the def name, right comp are the constants in the def -}

sentAna :: Named Sentence -> (Term, [Term])

sentAna s = case s of

NamedSen _ True _ (ConstDef (IsaEq l r)) -> (l, constFilter r)

------------------ checking for mutually recursive function defs --------------------------------------

getDepSent :: [[Named Sentence]] -> [[Named Sentence]]

getDepSent ls = abGetDep sentDepOn ls

sentDepOn :: Named Sentence -> Named Sentence -> Bool

sentDepOn x y =

depOn (\x y -> simTerms x y && typEq (termType x) (termType y)) (fst . sentAna) (snd . sentAna) x y

------------------- adding fixpoints ---------------------------------------------------------

fixMRec :: [[Named Sentence]] -> [Named Sentence]

fixMRec ls = addFixPoints $ getDepSent ls

addFixPoints :: [[Named Sentence]] -> [Named Sentence]

addFixPoints xs = concat $ map fixPoint xs

fixPoint :: [Named Sentence] -> [Named Sentence]

fixPoint xs = case xs of

[a] -> if sentDepOn a a

then case a of

NamedSen l m n (ConstDef (IsaEq lh rh)) ->

[NamedSen l m n $ RecDef "fixrec" [[holEq lh rh]]]

_ -> error "Hs2HOLCFaux, fixPoint"

else xs

a:as ->

let jn = joinNames (map extAxName xs)

ys = [[holEq (extLeftH x) $ extRightH x] | x <- xs]

in [NamedSen jn True False $ RecDef "fixrec" ys]

[] -> []

-- check out instances wrt sentDepOn

{-

fixPoint :: [Named Sentence] -> [Named Sentence]

fixPoint xs = case xs of

[a] -> case a of

NamedSen n w d (ConstDef (IsaEq lh rh)) -> if sentDepOn a a

then [NamedSen n w d $ ConstDef $ IsaEq lh $ fixPointRep lh rh]

else xs

a:as ->

let jn = joinNames (map extAxName xs)

ks = [(extAxName x, extAxType x) | x <- xs]

jv = Tuplex [(Free (extAxName x) (extAxType x)) | x <- xs] IsCont

jt = typTuple (map extAxType xs)

ys = [varsForMFuns ks (extRightH x) | x <- xs]

jr = Tuplex ys IsCont -- Tuplex (map extRightH xs) IsCont - Tuplex ys IsCont

jl = Const jn jt

js = Fix $ IsaSign.Abs jv jt jr IsCont

mainfd = NamedSen jn True False (ConstDef (IsaEq jl js))

nks = [(extAxName x, (extAxType x, n)) | (x, n) <- listEnum xs]

sF = elaborate (length xs) jn jt nks

origds = [NamedSen (extAxName x) True False $ ConstDef (IsaEq (extLeftH x) (sF (extRightH x))) | x <- xs]

in mainfd : origds

[] -> []

-}