{- |

Module : $Header$

Copyright : (c) University of Cambridge, Cambridge, England

adaption (c) Till Mossakowski, Uni Bremen 2002-2005

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

Maintainer : maeder@tzi.de

Stability : provisional

Portability : portable

translate 'Id' to Isabelle strings

-}

module Isabelle.Translate

( showIsaConstT, showIsaConstIT, showIsaTypeT, transConstStringT

, mkIsaConstT, mkIsaConstIT, transString, isaPrelude, IsaPreludes

, getConstIsaToks ) where

import Common.Id

import Common.ProofUtils

import Common.GlobalAnnotations

import Common.AS_Annotation

import qualified Data.Map as Map

import qualified Data.Set as Set

import qualified Common.Lib.Rel as Rel

import Data.Char

import Isabelle.IsaSign

import Isabelle.IsaConsts

import Isabelle.IsaStrings

------------------- Id translation functions -------------------

data IsaPreludes = IsaPreludes

{ preTypes :: Map.Map BaseSig (Set.Set String)

, preConsts :: Map.Map BaseSig (Set.Set String) }

isaKeyset :: Set.Set String

isaKeyset = Set.fromList isaKeywords

mkPreludeMap :: [(BaseSig, Set.Set String)] -> Map.Map BaseSig (Set.Set String)

mkPreludeMap = Map.fromList . map (\ (b, s) -> (b, Set.union s isaKeyset))

isaPrelude :: IsaPreludes

isaPrelude = IsaPreludes {

preTypes = mkPreludeMap

[(HsHOL_thy, types mainS),

(HsHOLCF_thy, types holcfS), (MainHC_thy, types mainS),

(Main_thy, types mainS), (HOLCF_thy, types holcfS)],

preConsts = mkPreludeMap

[(HsHOL_thy, consts mainS),

(HsHOLCF_thy, Set.insert fliftbinS (consts holcfS)),

(MainHC_thy, foldr Set.insert (consts mainS)

[pAppS, aptS, appS, defOpS, pairC]),

(Main_thy, consts mainS), (HOLCF_thy, consts holcfS)]}

getAltTokenList :: String -> Int -> Id -> BaseSig -> [Token]

getAltTokenList newPlace over i@(Id ms cs qs) thy = let

(fs, ps) = splitMixToken ms

nonPlaces = filter (not . isPlace) fs

constSet = Map.findWithDefault Set.empty thy $ preConsts isaPrelude

over2 = if isSingle nonPlaces && Set.member (tokStr $ head nonPlaces)

constSet || Set.member (show i) constSet

then over + 1 else over

newFs = if null fs || over2 < 2 then fs else

init fs ++ [mkSimpleId $ let o1 = over2 - 1 in

tokStr (last fs) ++

if over2 < 4 then replicate o1 '\'' else '_' : show o1]

in getTokenList newPlace $ Id (newFs ++ ps) cs qs

toAltSyntax :: Bool -> Int -> GlobalAnnos -> Int -> Id -> BaseSig

-> Maybe AltSyntax

toAltSyntax prd over ga n i thy = let

(precMap, mx) = Rel.toPrecMap $ prec_annos ga

minPrec = if prd then 42 else 52

adjustPrec p = 2 * p + minPrec

newPlace = "/ _"

minL = replicate n lowPrio

minL1 = tail minL

minL2 = tail minL1

hd : tl = getAltTokenList newPlace over i thy

convert = \ Token { tokStr = s } -> if s == newPlace then s

else "/ " ++ quote s

tts = concatMap convert tl

ht = drop 2 $ convert hd

ts = ht ++ tts

(precList, erg) = if isInfix i then case Map.lookup i precMap of

Just p -> let

q = adjustPrec p

(l, r) = case Map.lookup i $ assoc_annos ga of

Nothing -> (q + 1, q + 1)

Just ALeft -> (q, q + 1)

Just ARight -> (q + 1, q)

in (l : minL2 ++ [r], q)

Nothing -> let q = adjustPrec $ mx + 1 in (q : minL2 ++ [q], minPrec)

else if begPlace i then let q = adjustPrec $ mx + 3 in (q : minL1 , q)

else if endPlace i then let q = adjustPrec $ mx + 2 in (minL1 ++ [q], q)

else (minL, maxPrio - 1)

in if n < 0 then Nothing

else if n == 0 then Just $ AltSyntax ts [] maxPrio

else if isMixfix i then Just $ AltSyntax

('(' : ts ++ ")") precList erg

else Just $ AltSyntax

(ts ++ "/'(" ++

concat (replicate (n - 1) "_,/ ")

++ "_')") minL $ maxPrio - 1

quote :: String -> String

quote l = case l of

[] -> l

c : r -> (if elem c "_/'()" then '\'' : [c]

else if elem c "\\\"" then '\\' : [c] else [c]) ++ quote r

showIsaT1 :: (String -> String) -> Id -> String

showIsaT1 tr ide = let

str = tr $ show ide

in if null str then error "showIsaT1" else if

elem (last str) "_" then str ++ "X" else str

showIsaConstT :: Id -> BaseSig -> String

showIsaConstT ide thy = showIsaT1 (transConstStringT thy) ide

-- also pass number of arguments

mkIsaConstT :: Bool -> GlobalAnnos -> Int -> Id -> BaseSig -> VName

mkIsaConstT prd ga n ide = mkIsaConstVName 1 showIsaConstT prd ga n ide

mkIsaConstVName :: Int -> (Id -> BaseSig -> String) -> Bool -> GlobalAnnos

-> Int -> Id -> BaseSig -> VName

mkIsaConstVName over f prd ga n ide thy = let s = f ide thy in VName

{ new = (if n < 0 || isMixfix ide || s /= show ide then id else ("X_" ++)) s

, altSyn = toAltSyntax prd over ga n ide thy }

showIsaTypeT :: Id -> BaseSig -> String

showIsaTypeT ide thy = showIsaT1 (transTypeStringT thy) ide

-- | add a number for overloading

showIsaConstIT :: Id -> Int -> BaseSig -> String

showIsaConstIT ide i thy = showIsaConstT ide thy ++ "X" ++ show i

mkIsaConstIT :: Bool -> GlobalAnnos -> Int -> Id -> Int -> BaseSig -> VName

mkIsaConstIT prd ga n ide i =

mkIsaConstVName i ( \ ide' -> showIsaConstIT ide' i) prd ga n ide

getConstIsaToks :: Id -> Int -> BaseSig -> Set.Set String

getConstIsaToks ide i thy = -- some stupid strings could be filtered out

foldr (\ Token { tokStr = s } -> Set.insert s)

Set.empty $ getAltTokenList "" i ide thy

transIsaStringT :: Map.Map BaseSig (Set.Set String) -> BaseSig

-> String -> String

transIsaStringT m i s = let t = transString s in

if Set.member t $ maybe (error "Isabelle.transIsaStringT") id

$ Map.lookup i m

then transIsaStringT m i $ "_" ++ t else t

transConstStringT :: BaseSig -> String -> String

transConstStringT = transIsaStringT $ preConsts isaPrelude

transTypeStringT :: BaseSig -> String -> String

transTypeStringT = transIsaStringT $ preTypes isaPrelude

-- | check for legal alphanumeric isabelle characters

isIsaChar :: Char -> Bool

isIsaChar c = isAlphaNum c && isAscii c || elem c "_'"

transString :: String -> String

transString str = let

x = 'X'

replaceChar1 d | d == x = [x, x] -- code out existing X!

| isIsaChar d = [d]

| otherwise = x : replaceChar d

in case str of

"" -> error "transString"

c : s -> let l = replaceChar1 c in

(if isDigit c || elem c "_'" then [x, c]

else l) ++ concatMap replaceChar1 s

-- | injective replacement of special characters

replaceChar :: Char -> String

-- <http://www.htmlhelp.com/reference/charset/>

replaceChar c = if isIsaChar c then [c] else let n = ord c in

if n <= 32 || n >= 127 && n < 160 || n > 255 then "Slash_" ++ show n

else maybe (error "Isabelle.replaceChar") id $ Map.lookup c charMap