PreComorphism.hs revision 357381f0a999099cd2d4c268006df56b47847d68
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederModule : $Header$
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederDescription : Maude Comorphisms
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederCopyright : (c) Adrian Riesco, Facultad de Informatica UCM 2009
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederLicense : GPLv2 or higher, see LICENSE.txt
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederMaintainer : ariesco@fdi.ucm.es
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederStability : experimental
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederPortability : portable
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederComorphism from Maude to CASL.
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Data.List as List
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Data.Set as Set
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Data.Map as Map
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Maude.Sign as MSign
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Maude.Sentence as MSentence
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Maude.Morphism as MMorphism
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Maude.AS_Maude as MAS
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Maude.Symbol as MSym
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified CASL.Sign as CSign
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified CASL.Morphism as CMorphism
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified CASL.AS_Basic_CASL as CAS
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederimport qualified Common.Lib.Rel as Rel
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maedertype IdMap = Map.Map Id Id
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maedertype OpTransTuple = (CSign.OpMap, CSign.OpMap, Set.Set Component)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | generates a CASL morphism from a Maude morphism
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapMorphism :: MMorphism.Morphism -> Result (CMorphism.CASLMor)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapMorphism morph =
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder mk = kindMapId $ MSign.kindRel src
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder mk' = kindMapId $ MSign.kindRel tgt
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder smap' = applySortMap2CASLSorts smap mk mk'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder omap' = maudeOpMap2CASLOpMap mk omap
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder pmap = createPredMap mk smap
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder (src', _) = maude2casl src []
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder (tgt', _) = maude2casl tgt []
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder in return $ CMorphism.Morphism src' tgt' smap' omap' pmap ()
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | translates the Maude morphism between operators into a CASL morpshim between
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeOpMap2CASLOpMap :: IdMap -> MMorphism.OpMap -> CMorphism.Op_map
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeOpMap2CASLOpMap im = Map.foldWithKey (translateOpMapEntry im) Map.empty
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | translates the mapping between two symbols representing operators into
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- a CASL operators map
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedertranslateOpMapEntry :: IdMap -> MSym.Symbol -> MSym.Symbol -> CMorphism.Op_map
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedertranslateOpMapEntry im (MSym.Operator from ar co) (MSym.Operator to _ _) copm = copm'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where f = token2id . getName
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder g = \ x -> Map.findWithDefault (errorId "translate op map entry") (f x) im
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder ot = CSign.OpType CAS.Total (map g ar) (g co)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder cop = (token2id from, ot)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder to' = (token2id to, CAS.Total)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder copm' = Map.insert cop to' copm
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedertranslateOpMapEntry _ _ _ _ = Map.empty
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | generates a set of CASL symbol from a Maude Symbol
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapSymbol :: MSign.Sign -> MSym.Symbol -> Set.Set CSign.Symbol
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapSymbol sg (MSym.Sort q) = Set.singleton csym
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where mk = kindMapId $ MSign.kindRel sg
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder sym_id = token2id q
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder kind = Map.findWithDefault (errorId "map symbol") sym_id mk
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder pred_data = CSign.PredType [kind]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder csym = CSign.Symbol sym_id $ CSign.PredAsItemType pred_data
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedermapSymbol sg (MSym.Operator q ar co) = Set.singleton csym
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where mk = kindMapId $ MSign.kindRel sg
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder q' = token2id q
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder ar' = map (maudeSort2caslId mk) ar
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder co' = token2id $ getName co
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder csym = CSign.Symbol q' $ CSign.OpAsItemType op_data
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | returns the sort in CASL of the Maude sort symbol
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSort2caslId :: IdMap -> MSym.Symbol -> Id
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSort2caslId im sym = Map.findWithDefault (errorId "sort to id") (token2id $ getName sym) im
adda0e6252b14215228e4071b347c49b808894f8Christian Maeder-- | creates the predicate map for the CASL morphism from the Maude sort map and
adda0e6252b14215228e4071b347c49b808894f8Christian Maeder-- the map between sorts and kinds
adda0e6252b14215228e4071b347c49b808894f8Christian MaedercreatePredMap :: IdMap -> MMorphism.SortMap -> CMorphism.Pred_map
adda0e6252b14215228e4071b347c49b808894f8Christian MaedercreatePredMap im = Map.foldWithKey (createPredMap4sort im) Map.empty
adda0e6252b14215228e4071b347c49b808894f8Christian Maeder-- | creates an entry of the predicate map for a single sort
adda0e6252b14215228e4071b347c49b808894f8Christian MaedercreatePredMap4sort :: IdMap -> MSym.Symbol -> MSym.Symbol -> CMorphism.Pred_map
adda0e6252b14215228e4071b347c49b808894f8Christian MaedercreatePredMap4sort im from to m = Map.insert key id_to m
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where id_from = token2id $ getName from
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder id_to = token2id $ getName to
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder kind = Map.findWithDefault (errorId "predicate for sort") id_from im
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder key = (id_from, CSign.PredType [kind])
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | computes the sort morphism of CASL from the sort morphism in Maude and the set
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederapplySortMap2CASLSorts :: MMorphism.SortMap -> IdMap -> IdMap -> CMorphism.Sort_map
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederapplySortMap2CASLSorts sm im im' = Map.fromList sml'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder sml' = foldr (applySortMap2CASLSort im im') [] sml
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | computes the morphism for a single sort pair
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederapplySortMap2CASLSort :: IdMap -> IdMap -> (MSym.Symbol, MSym.Symbol) -> [(Id, Id)]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder -> [(Id, Id)]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederapplySortMap2CASLSort im im' (s1, s2) l = l'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where p1 = (mSym2caslId s1, mSym2caslId s2)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder f = \ x y -> Map.findWithDefault (errorId $ "err" ++ (show $ mSym2caslId x)) (mSym2caslId x) y
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder p2 = (f s1 im, f s2 im')
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder l' = if s1 == s2
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder else p1 : p2 : l
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | renames the sorts in a given kind
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederrename :: MMorphism.SortMap -> Token -> Token
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maederrename sm tok = new_tok
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where sym = MSym.Sort tok
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder sym' = if Map.member sym sm
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder then fromJust $ Map.lookup sym sm
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder new_tok = getName sym'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | translates a Maude sentence into a CASL formula
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapSentence :: MSign.Sign -> MSentence.Sentence -> Result CAS.CASLFORMULA
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedermapSentence sg sen@(MSentence.Equation eq) = case any MAS.owise ats of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder False -> return $ sentence $ noOwiseSen2Formula mk named
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder sg_sens = map (makeNamed "") $ Set.toList $ MSign.sentences sg
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder (no_owise_sens, _, _) = splitOwiseEqs sg_sens
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder no_owise_forms = map (noOwiseSen2Formula mk) no_owise_sens
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder trans = sentence $ owiseSen2Formula mk no_owise_forms named
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder in return trans
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where mk = kindMapId $ MSign.kindRel sg
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder MAS.Eq _ _ _ ats = eq
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder named = makeNamed "" sen
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedermapSentence sg sen@(MSentence.Membership mb) = return $ sentence form
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where mk = kindMapId $ MSign.kindRel sg
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder named = makeNamed "" sen
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder form = mb_rl2formula mk named
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedermapSentence sg sen@(MSentence.Rule rl) = return $ sentence form
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where mk = kindMapId $ MSign.kindRel sg
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder named = makeNamed "" sen
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder form = mb_rl2formula mk named
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | applies maude2casl to compute the CASL signature and sentences from
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- the Maude ones, and wraps them into a Result datatype
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapTheory :: (MSign.Sign, [Named MSentence.Sentence])
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder -> Result (CSign.CASLSign, [Named CAS.CASLFORMULA])
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermapTheory (sg, nsens) = return $ maude2casl sg nsens
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | computes new signature and sentences of CASL associated to the
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- given Maude signature and sentences
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maedermaude2casl :: MSign.Sign -> [Named MSentence.Sentence]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder -> (CSign.CASLSign, [Named CAS.CASLFORMULA])
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maedermaude2casl msign nsens = (csign { CSign.sortSet = cs,
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder CSign.declaredSymbols = syms }, new_sens)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where csign = CSign.emptySign ()
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder ss' = Set.map sym2id ss
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder mk = kindMapId $ MSign.kindRel msign
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder sbs' = maudeSbs2caslSbs sbs mk
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder cs = Set.union ss' $ kindsFromMap mk
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder preds = rewPredicates cs
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder rs = rewPredicatesSens cs
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder ops = deleteUniversal $ MSign.ops msign
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder ksyms = kinds2syms cs
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder (cops, assoc_ops, _) = translateOps mk ops -- (cops, assoc_ops, comps)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder axSens = axiomsSens mk ops
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder ctor_sen = [] -- [ctorSen False (cs, Rel.empty, comps)]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder cops' = universalOps cs cops $ booleanImported ops
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder rs' = rewPredicatesCongSens cops'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder pred_forms = loadLibraries (MSign.sorts msign) ops
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder ops_syms = ops2symbols cops'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder (no_owise_sens, owise_sens, mbs_rls_sens) = splitOwiseEqs nsens
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder no_owise_forms = map (noOwiseSen2Formula mk) no_owise_sens
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder owise_forms = map (owiseSen2Formula mk no_owise_forms) owise_sens
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder mb_rl_forms = map (mb_rl2formula mk) mbs_rls_sens
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder preds_syms = preds2syms preds
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder syms = Set.union ksyms $ Set.union ops_syms preds_syms
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder new_sens = concat [rs, rs', no_owise_forms, owise_forms,
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder mb_rl_forms, ctor_sen, pred_forms, axSens]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | translates the Maude subsorts into CASL subsorts, and adds the subsorts
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- for the kinds
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSbs2caslSbs :: MSign.SubsortRel -> IdMap -> Rel.Rel CAS.SORT
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSbs2caslSbs sbs im = Rel.fromDistinctMap m4
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder l1 = [] -- map maudeSb2caslSb l
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder l2 = idList2Subsorts $ Map.toList im
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder l3 = map subsorts2Ids l
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder m4 = Map.unionWith Set.union m1 $ Map.unionWith Set.union m2 m3
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederidList2Subsorts :: [(Id, Id)] -> [(Id, Set.Set Id)]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederidList2Subsorts [] = []
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederidList2Subsorts ((id1, id2) : il) = t1 : idList2Subsorts il
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where t1 = (id1, Set.singleton id2)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSb2caslSb :: (MSym.Symbol, Set.Set MSym.Symbol) -> (Id, Set.Set Id)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedermaudeSb2caslSb (sym, st) = (sortSym2id sym, Set.map (kindId . sortSym2id) st)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maedersubsorts2Ids :: (MSym.Symbol, Set.Set MSym.Symbol) -> (Id, Set.Set Id)
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maedersubsorts2Ids (sym, st) = (sortSym2id sym, Set.map sortSym2id st)
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedersortSym2id :: MSym.Symbol -> Id
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedersortSym2id (MSym.Sort q) = token2id q
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaedersortSym2id _ = token2id $ mkSimpleId $ "error_translation"
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | generates the sentences to state that the rew predicates are a congruence
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredicatesCongSens :: CSign.OpMap -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredicatesCongSens = Map.foldWithKey rewPredCongSet []
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- | generates the sentences to state that the rew predicates are a congruence
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder-- for the operator types in the set
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederrewPredCongSet :: Id -> Set.Set CSign.OpType -> [Named CAS.CASLFORMULA] -> [Named CAS.CASLFORMULA]
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian MaederrewPredCongSet idn ots fs = fs ++ fs'
e2ca90217abd35b3d5f98bfe73ecffb34badd837Christian Maeder where fs' = Set.fold (rewPredCong idn) [] ots
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the sentences to state that the rew predicates are a congruence
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- for a single operator
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredCong :: Id -> CSign.OpType -> [Named CAS.CASLFORMULA] -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredCong op ot fs = case args of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder _ -> nq_form : fs
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where args = CSign.opArgs ot
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder vars1 = rewPredCongPremise 0 args
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder vars2 = rewPredCongPremise (length args) args
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder res_pred_type = CAS.Pred_type [res, res] nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder pn = CAS.Qual_pred_name rewID res_pred_type nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder name = "rew_cong_" ++ show op
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder prems = rewPredsCong args vars1 vars2
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder prems_conj = createConjForm prems
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder os = CAS.Qual_op_name op (CSign.toOP_TYPE ot) nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder conc_term1 = CAS.Application os vars1 nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder conc_term2 = CAS.Application os vars2 nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder conc_form = CAS.Predication pn [conc_term1, conc_term2] nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder form = createImpForm prems_conj conc_form
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder nq_form = makeNamed name $ quantifyUniversally form
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates a list of variables of the given sorts
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredCongPremise :: Int -> [CAS.SORT] -> [CAS.CASLTERM]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredCongPremise n (s : ss) = newVarIndex n s : rewPredCongPremise (n + 1) ss
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredCongPremise _ [] = []
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates a list of rew predicates with the given variables
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredsCong :: [CAS.SORT] -> [CAS.CASLTERM] -> [CAS.CASLTERM] -> [CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredsCong (s : ss) (t : ts) (t' : ts') = form : forms
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where pred_type = CAS.Pred_type [s, s] nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder pn = CAS.Qual_pred_name rewID pred_type nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder form = CAS.Predication pn [t, t'] nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder forms = rewPredsCong ss ts ts'
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederrewPredsCong _ _ _ = []
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | load the CASL libraries for the Maude built-in operators
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederloadLibraries :: MSign.SortSet -> MSign.OpMap -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederloadLibraries ss om = case natImported ss om of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder True -> loadNaturalNatSens
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | loads the sentences associated to the natural numbers
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederloadNaturalNatSens :: [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederloadNaturalNatSens =
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder let lib = head $ unsafePerformIO $ readLib "Maude/MaudeNumbers.casl"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder in case lib of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder G_theory lid _ _ thSens _ -> let sens = toNamedList thSens
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder sens' <- coerceSens lid CASL "" sens
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder filter (not . ctorCons) sens'
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | checks if a sentence is an constructor sentence
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederctorCons :: Named CAS.CASLFORMULA -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederctorCons f = case sentence f of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | checks if the boolean values are imported
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederbooleanImported :: MSign.OpMap -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederbooleanImported = Map.member (mkSimpleId "if_then_else_fi")
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | checks if the natural numbers are imported
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedernatImported :: MSign.SortSet -> MSign.OpMap -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaedernatImported ss om = b1 && b2 && b3
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where b1 = Set.member (MSym.Sort $ mkSimpleId "Nat") ss
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder b2 = Map.member (mkSimpleId "s_") om
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder b3 = case b2 of
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder False -> True
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder True -> specialZeroSet $ om Map.! (mkSimpleId "s_")
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederspecialZeroSet :: MSign.OpDeclSet -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederspecialZeroSet = Set.fold specialZero False
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederspecialZero :: MSign.OpDecl -> Bool -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederspecialZero (_, ats) b = b' || b
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where b' = isSpecial ats
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederisSpecial :: [MAS.Attr] -> Bool
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederisSpecial [] = False
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederisSpecial ((MAS.Special _) : _) = True
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederisSpecial (_ : ats) = isSpecial ats
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | delete the universal operators from Maude specifications, that will be
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- substituted for one operator for each sort in the specification
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederdeleteUniversal :: MSign.OpMap -> MSign.OpMap
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederdeleteUniversal om = om5
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where om1 = Map.delete (mkSimpleId "if_then_else_fi") om
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om2 = Map.delete (mkSimpleId "_==_") om1
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om3 = Map.delete (mkSimpleId "_=/=_") om2
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om4 = Map.delete (mkSimpleId "upTerm") om3
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om5 = Map.delete (mkSimpleId "downTerm") om4
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the universal operators for all the sorts in the module
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalOps :: Set.Set Id -> CSign.OpMap -> Bool -> CSign.OpMap
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalOps kinds om True = Set.fold universalOpKind om kinds
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalOps _ om False = om
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the universal operators for a concrete module
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalOpKind :: Id -> CSign.OpMap -> CSign.OpMap
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalOpKind kind om = om3
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where if_id = str2id "if_then_else_fi"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder double_eq_id = str2id "_==_"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder neg_double_eq_id = str2id "_=/=_"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder bool_id = str2id "Bool"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder if_opt = Set.singleton $ CSign.OpType CAS.Total [bool_id, kind, kind] kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder eq_opt = Set.singleton $ CSign.OpType CAS.Total [kind, kind] bool_id
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om1 = Map.insertWith Set.union if_id if_opt om
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om2 = Map.insertWith Set.union double_eq_id eq_opt om1
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder om3 = Map.insertWith Set.union neg_double_eq_id eq_opt om2
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the formulas for the universal operators
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalSens :: Set.Set Id -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalSens = Set.fold universalSensKind []
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the formulas for the universal operators for the given sort
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalSensKind :: Id -> [Named CAS.CASLFORMULA] -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederuniversalSensKind kind acc = concat [iss, eqs, neqs, acc]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where iss = ifSens kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder eqs = equalitySens kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder neqs = nonEqualitySens kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder-- | generates the formulas for the if statement
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederifSens :: Id -> [Named CAS.CASLFORMULA]
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian MaederifSens kind = [form'', neg_form'']
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder where v1 = newVarIndex 1 kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder v2 = newVarIndex 2 kind
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder bk = str2id "Bool"
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder bv = newVarIndex 2 bk
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder true_type = CAS.Op_type CAS.Total [] bk nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder true_id = CAS.Qual_op_name (str2id "true") true_type nullRange
7bffb8b0e6cae4bb7ecb59b99327add6106c06b9Christian Maeder true_term = CAS.Application true_id [] nullRange
if_id = CAS.Qual_op_name if_name if_type nullRange
if_term = CAS.Application if_id [bv, v1, v2] nullRange
prem = CAS.Strong_equation bv true_term nullRange
concl = CAS.Strong_equation if_term v1 nullRange
form = CAS.Implication prem concl True nullRange
neg_prem = CAS.Negation prem nullRange
neg_concl = CAS.Strong_equation if_term v2 nullRange
neg_form = CAS.Implication neg_prem neg_concl True nullRange
equalitySens :: Id -> [Named CAS.CASLFORMULA]
true_id = CAS.Qual_op_name (str2id "true") b_type nullRange
true_term = CAS.Application true_id [] nullRange
false_id = CAS.Qual_op_name (str2id "false") b_type nullRange
false_term = CAS.Application false_id [] nullRange
prem = CAS.Strong_equation v1 v2 nullRange
double_eq_id = CAS.Qual_op_name double_eq_name double_eq_type nullRange
double_eq_term = CAS.Application double_eq_id [v1, v2] nullRange
concl = CAS.Strong_equation double_eq_term true_term nullRange
form = CAS.Implication prem concl True nullRange
neg_prem = CAS.Negation prem nullRange
new_concl = CAS.Strong_equation double_eq_term false_term nullRange
comp_form = CAS.Implication neg_prem new_concl True nullRange
nonEqualitySens :: Id -> [Named CAS.CASLFORMULA]
true_id = CAS.Qual_op_name (str2id "true") b_type nullRange
true_term = CAS.Application true_id [] nullRange
false_id = CAS.Qual_op_name (str2id "false") b_type nullRange
false_term = CAS.Application false_id [] nullRange
prem = CAS.Strong_equation v1 v2 nullRange
double_eq_id = CAS.Qual_op_name double_eq_name double_eq_type nullRange
double_eq_term = CAS.Application double_eq_id [v1, v2] nullRange
concl = CAS.Strong_equation double_eq_term false_term nullRange
form = CAS.Implication prem concl True nullRange
neg_prem = CAS.Negation prem nullRange
new_concl = CAS.Strong_equation double_eq_term true_term nullRange
comp_form = CAS.Implication neg_prem new_concl True nullRange
axiomsSens im om = Map.fold (axiomsSensODS im) [] om
-> [Named CAS.CASLFORMULA]
axiomsSensODS im ods l = Set.fold (axiomsSensOD im) l ods
axiomsSensOD im (ss, ats) l = Set.fold (axiomsSensSS im ats) l ss
-> [Named CAS.CASLFORMULA]
axiomsSensSS im ats (MSym.Operator q ar co) l = concat [l, l1]
where l1 = if elem MAS.Comm ats
os = CAS.Qual_op_name q' ot nullRange
t1 = CAS.Application os [v1, v2] nullRange
t2 = CAS.Application os [v2, v1] nullRange
form = CAS.Strong_equation t1 t2 nullRange
translateOps :: IdMap -> MSign.OpMap -> OpTransTuple
translateOpDeclSet :: IdMap -> MSign.OpDeclSet -> OpTransTuple -> OpTransTuple
translateOpDeclSet im ods tpl = Set.fold (translateOpDecl im) tpl ods
translateOpDecl :: IdMap -> MSign.OpDecl -> OpTransTuple -> OpTransTuple
where sym = head $ Set.toList syms
tl = tail $ Set.toList syms
syms' = Set.fromList tl
assoc_ops' = if any MAS.assoc ats
cs' = if any MAS.ctor ats
then Set.insert (Component cop_id ot) cs
maudeSym2CASLOp im (MSym.Operator op ar co) = Just (token2id op, ot, ot')
createConjForm [] = CAS.True_atom nullRange
createConjForm fs = CAS.Conjunction fs nullRange
createImpForm (CAS.True_atom _) form = form
createImpForm form1 form2 = CAS.Implication form1 form2 True nullRange
ops2predPremises im (MSym.Sort s : ss) i = (var : terms, form : forms)
kind = Map.findWithDefault (errorId "mb of op as predicate") s' im
pred_type = CAS.Pred_type [kind] nullRange
pred_name = CAS.Qual_pred_name s' pred_type nullRange
form = CAS.Predication pred_name [var] nullRange
ops2predPremises im (MSym.Kind k : ss) i = (var : terms, forms)
kind = Map.findWithDefault (errorId "mb of op as predicate") k' im
splitOwiseEqs :: [Named MSentence.Sentence] ->
where MSentence.Equation eq = sentence s
owiseSen2Formula :: IdMap -> [Named CAS.CASLFORMULA]
where MSentence.Equation eq = sentence s
MSentence.Membership mb -> let
MSentence.Rule rl -> let
_ -> makeNamed "" $ CAS.False_atom nullRange
newVarIndex :: Int -> Id -> CAS.CASLTERM
newVarIndex i sort = CAS.Qual_var var sort nullRange
newVar :: Id -> CAS.CASLTERM
newVar sort = CAS.Qual_var var sort nullRange
noOwiseEq2Formula im (MAS.Eq t t' [] _) = quantifyUniversally form
form = CAS.Strong_equation ct ct' nullRange
noOwiseEq2Formula im (MAS.Eq t t' conds@(_:_) _) = quantifyUniversally form
concl_form = CAS.Strong_equation ct ct' nullRange
then CAS.Conjunction ex_forms nullRange
conj_form = CAS.Conjunction prems nullRange
neg_form = CAS.Negation ex_form nullRange
createEqs (t1 : ts1) (t2 : ts2) = CAS.Strong_equation t1 t2 nullRange : ls
getLeftApp (CAS.Strong_equation term _ _) = case getLeftAppTerm term of
getLeftApp (CAS.Implication prem concl _ _) = case getLeftApp concl of
getLeftAppTerm (CAS.Application op ts _) = Just (op, ts)
getPremisesImplication (CAS.Conjunction forms _) = forms
mb2formula im (MAS.Mb t s [] _) = quantifyUniversally form
form = CAS.Membership ct s' nullRange
mb2formula im (MAS.Mb t s conds@(_ : _) _) = quantifyUniversally form
concl_form = CAS.Membership ct s' nullRange
form = CAS.Implication conds_form concl_form True nullRange
rl2formula im (MAS.Rl t t' [] _) = quantifyUniversally form
where ty = token2id $ getName $ MAS.getTermType t
kind = Map.findWithDefault (errorId "rl to formula") ty im
pred_type = CAS.Pred_type [kind, kind] nullRange
pred_name = CAS.Qual_pred_name rewID pred_type nullRange
form = CAS.Predication pred_name [ct, ct'] nullRange
rl2formula im (MAS.Rl t t' conds@(_:_) _) = quantifyUniversally form
where ty = token2id $ getName $ MAS.getTermType t
kind = Map.findWithDefault (errorId "rl to formula") ty im
pred_type = CAS.Pred_type [kind, kind] nullRange
pred_name = CAS.Qual_pred_name rewID pred_type nullRange
concl_form = CAS.Predication pred_name [ct, ct'] nullRange
form = CAS.Implication conds_form concl_form True nullRange
conds2formula im conds = CAS.Conjunction forms nullRange
ty = token2id $ getName $ MAS.getTermType t
kind = Map.findWithDefault (errorId "rw cond to formula") ty im
pred_type = CAS.Pred_type [kind, kind] nullRange
pred_name = CAS.Qual_pred_name rewID pred_type nullRange
op = CAS.Qual_op_name name op_type nullRange
op = CAS.Qual_op_name name op_type nullRange
maudeSymbol2caslSort (MSym.Sort q) _ = token2id q
maudeType2caslSort (MAS.TypeSort q) _ = token2id $ getName q
getTypes :: [CAS.CASLTERM] -> [Id]
getType :: CAS.CASLTERM -> Maybe Id
getType (CAS.Qual_var _ kind _) = Just kind
getType (CAS.Application op _ _) = case op of
rewPredicatesSens = Set.fold rewPredicateSens []
reflSen :: Id -> Named CAS.CASLFORMULA
pred_type = CAS.Pred_type [kind, kind] nullRange
pn = CAS.Qual_pred_name rewID pred_type nullRange
form = CAS.Predication pn [v, v] nullRange
transSen :: Id -> Named CAS.CASLFORMULA
pred_type = CAS.Pred_type [kind, kind] nullRange
pn = CAS.Qual_pred_name rewID pred_type nullRange
prem1 = CAS.Predication pn [v1, v2] nullRange
prem2 = CAS.Predication pn [v2, v3] nullRange
concl = CAS.Predication pn [v1, v3] nullRange
conj_form = CAS.Conjunction [prem1, prem2] nullRange
form = CAS.Implication conj_form concl True nullRange
kindsFromMap :: IdMap -> Set.Set Id
sortsTranslation ss r = sortsTranslationList (Set.toList ss) r
sortsTranslationList [] _ = Set.empty
sortsTranslationList (s : ss) r = Set.insert (sort2id tops) res
where tops@(top : _) = List.sort $ getTop r s
deleteRelated ss sym r = foldr (f sym tc) Set.empty ss
where tc = Rel.transClosure r
f = \ sort trC x y -> if MSym.sameKind trC sort x
else Set.insert x y
sym2id :: MSym.Symbol -> Id
sort2id :: [MSym.Symbol] -> Id
where sym = head $ List.sort syms
listVarDecl = Map.foldWithKey f []
noQuantification (CAS.Quantification _ vars form _) = (form, vars)
kinds2syms = Set.map kind2sym
kind2sym :: Id -> CSign.Symbol
pred2sym pn spt acc = Set.fold (createSym4id pn) acc spt
createSym4id pn pt acc = Set.insert sym acc
op2sym on sot acc = Set.union set acc
createSymOp4id on ot acc = Set.insert sym acc
getVars (CAS.Quantification _ _ f _) = getVars f
getVars (CAS.Negation f _) = getVars f
getVars (CAS.Definedness t _) = getVarsTerm t
getVars (CAS.Membership t _ _) = getVarsTerm t
getVars (CAS.Mixfix_formula t) = getVarsTerm t
getVars _ = Map.empty
getVarsTerm (CAS.Sorted_term t _ _) = getVarsTerm t
getVarsTerm (CAS.Cast t _ _) = getVarsTerm t
getVarsTerm (CAS.Mixfix_parenthesized ts _) =
getVarsTerm (CAS.Mixfix_bracketed ts _) =
getVarsTerm (CAS.Mixfix_braced ts _) =
getVarsTerm _ = Map.empty
ctorSen :: Bool -> GenAx -> Named CAS.CASLFORMULA
let sortList = Set.toList sorts
opSyms = map ( \ c -> let ide = compId c in CAS.Qual_op_name ide
resType _ (CAS.Op_name _) = False
getIndex s = maybe (-1) id $ List.findIndex (== s) sortList
addIndices (CAS.Op_name _) =
error "CASL/StaticAna: Internal error in function addIndices"
addIndices os@(CAS.Qual_op_name _ t _) =
(os,map getIndex $ CAS.args_OP_TYPE t)
CAS.Constraint s (map addIndices $ filter (resType s) allSyms) s
f = CAS.Sort_gen_ax constrs isFree
ms2vcs s = case Map.member s stringMap of
True -> Map.findWithDefault "" s stringMap
False -> let f = \ x y -> if Map.member x charMap
stringMap :: Map.Map String String
stringMap = Map.fromList
kindMapId :: MSign.KindRel -> IdMap
kindMapId kr = Map.fromList krl'
where krl = Map.toList kr
mSym2caslId :: MSym.Symbol -> Id
mSym2caslId (MSym.Sort q) = token2id q
mSym2caslId (MSym.Kind q) = kindId q'
atLeastOneSort om = Map.fromList lom'
where lom = Map.toList om
hd = if Set.null ods'
atLeastOneSortODS ods = Set.fromList lods'
where lods = Set.toList ods
res = if Set.null ss'
atLeastOneSortSS = Set.filter hasOneSort
hasOneSort :: MSym.Symbol -> Bool
hasOneSort (MSym.Operator _ ar co) = any isSymSort (co : ar)
isSymSort :: MSym.Symbol -> Bool
isSymSort (MSym.Sort _) = True
translateOps' :: IdMap -> MSign.OpMap -> OpTransTuple
translateOpDeclSet' :: IdMap -> MSign.OpDeclSet -> OpTransTuple -> OpTransTuple
translateOpDeclSet' im ods tpl = Set.fold (translateOpDecl' im) tpl ods
translateOpDecl' :: IdMap -> MSign.OpDecl -> OpTransTuple -> OpTransTuple
where sym = head $ Set.toList syms
tl = tail $ Set.toList syms
syms' = Set.fromList tl
assoc_ops' = if any MAS.assoc ats
cs' = if any MAS.ctor ats
then Set.insert (Component cop_id ot) cs
maudeSym2CASLOp' im (MSym.Operator op ar co) = Just (token2id op, ot, ot')
g = \ x -> maudeSymbol2caslSort' x im -- \ x -> Map.findWithDefault (errorId "Maude_sym2CASL_sym") (f x) im
maudeSymbol2caslSort' (MSym.Sort q) _ = token2id $ mkSimpleId $ "kind_" ++ show q