module Agda.Compiler.MAlonzo.Compiler where
#if __GLASGOW_HASKELL__ <= 708
import Prelude hiding (foldl, mapM_, mapM, sequence, concat)
#endif
import Control.Applicative
import Control.Monad.Reader hiding (mapM_, forM_, mapM, forM, sequence)
import Control.Monad.State hiding (mapM_, forM_, mapM, forM, sequence)
import Data.Generics.Geniplate
import Data.Foldable hiding (any, all, foldr, sequence_)
import Data.Function
import qualified Data.List as List
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Maybe
import Data.Set (Set)
import qualified Data.Set as Set
import Data.Traversable hiding (for)
import Data.Monoid hiding ((<>))
import Numeric.IEEE
import qualified Agda.Utils.Haskell.Syntax as HS
import System.Directory (createDirectoryIfMissing)
import System.FilePath hiding (normalise)
import Agda.Compiler.CallCompiler
import Agda.Compiler.Common
import Agda.Compiler.MAlonzo.Misc
import Agda.Compiler.MAlonzo.Pretty
import Agda.Compiler.MAlonzo.Primitives
import Agda.Compiler.MAlonzo.HaskellTypes
import Agda.Compiler.MAlonzo.Pragmas
import Agda.Compiler.ToTreeless
import Agda.Compiler.Treeless.Unused
import Agda.Compiler.Treeless.Erase
import Agda.Compiler.Backend
import Agda.Interaction.FindFile
import Agda.Interaction.Imports
import Agda.Interaction.Options
import Agda.Syntax.Common
import Agda.Syntax.Fixity
import qualified Agda.Syntax.Abstract.Name as A
import qualified Agda.Syntax.Concrete.Name as C
import Agda.Syntax.Internal as I
import Agda.Syntax.Internal.Names (namesIn)
import qualified Agda.Syntax.Treeless as T
import Agda.Syntax.Literal
import Agda.TypeChecking.Monad
import Agda.TypeChecking.Monad.Builtin
import Agda.TypeChecking.Datatypes
import Agda.TypeChecking.Records
import Agda.TypeChecking.Reduce
import Agda.TypeChecking.Pretty
import Agda.TypeChecking.Substitute
import Agda.TypeChecking.Telescope
import Agda.TypeChecking.Level (reallyUnLevelView)
import Agda.TypeChecking.CompiledClause
import Agda.Utils.FileName
import Agda.Utils.Functor
import Agda.Utils.IO.Directory
import Agda.Utils.Lens
import Agda.Utils.List
import Agda.Utils.Maybe
import Agda.Utils.Monad
import Agda.Utils.Pretty (prettyShow, Pretty)
import qualified Agda.Utils.IO.UTF8 as UTF8
import qualified Agda.Utils.HashMap as HMap
import Agda.Utils.Singleton
import Agda.Utils.Size
import Agda.Utils.Tuple
import Paths_Agda
#include "undefined.h"
import Agda.Utils.Impossible
ghcBackend :: Backend
ghcBackend = Backend ghcBackend'
ghcBackend' :: Backend' GHCOptions GHCOptions GHCModuleEnv IsMain [HS.Decl]
ghcBackend' = Backend'
{ backendName = "GHC"
, backendVersion = Nothing
, options = defaultGHCOptions
, commandLineFlags = ghcCommandLineFlags
, isEnabled = optGhcCompile
, preCompile = ghcPreCompile
, postCompile = ghcPostCompile
, preModule = ghcPreModule
, postModule = ghcPostModule
, compileDef = ghcCompileDef
, scopeCheckingSuffices = False
}
data GHCOptions = GHCOptions
{ optGhcCompile :: Bool
, optGhcCallGhc :: Bool
, optGhcFlags :: [String]
}
defaultGHCOptions :: GHCOptions
defaultGHCOptions = GHCOptions
{ optGhcCompile = False
, optGhcCallGhc = True
, optGhcFlags = []
}
ghcCommandLineFlags :: [OptDescr (Flag GHCOptions)]
ghcCommandLineFlags =
[ Option ['c'] ["compile", "ghc"] (NoArg enable)
"compile program using the GHC backend"
, Option [] ["ghc-dont-call-ghc"] (NoArg dontCallGHC)
"don't call GHC, just write the GHC Haskell files."
, Option [] ["ghc-flag"] (ReqArg ghcFlag "GHC-FLAG")
"give the flag GHC-FLAG to GHC"
]
where
enable o = pure o{ optGhcCompile = True }
dontCallGHC o = pure o{ optGhcCallGhc = False }
ghcFlag f o = pure o{ optGhcFlags = optGhcFlags o ++ [f] }
ghcPreCompile :: GHCOptions -> TCM GHCOptions
ghcPreCompile ghcOpts = do
allowUnsolved <- optAllowUnsolved <$> pragmaOptions
when allowUnsolved $ genericError $ "Unsolved meta variables are not allowed when compiling."
return ghcOpts
ghcPostCompile :: GHCOptions -> IsMain -> Map ModuleName IsMain -> TCM ()
ghcPostCompile opts isMain mods = copyRTEModules >> callGHC opts isMain mods
type GHCModuleEnv = Maybe CoinductionKit
ghcPreModule :: GHCOptions -> ModuleName -> FilePath -> TCM (Recompile GHCModuleEnv IsMain)
ghcPreModule _ m ifile = ifM uptodate noComp yesComp
where
uptodate = liftIO =<< isNewerThan <$> outFile_ <*> pure ifile
noComp = do
reportSLn "compile.ghc" 2 . (++ " : no compilation is needed.") . show . A.mnameToConcrete =<< curMName
Skip . hasMainFunction <$> curIF
yesComp = do
m <- show . A.mnameToConcrete <$> curMName
out <- outFile_
reportSLn "compile.ghc" 1 $ repl [m, ifile, out] "Compiling <<0>> in <<1>> to <<2>>"
stImportedModules .= Set.empty
Recompile <$> coinductionKit
ghcPostModule :: GHCOptions -> GHCModuleEnv -> IsMain -> ModuleName -> [[HS.Decl]] -> TCM IsMain
ghcPostModule _ _ _ _ defs = do
m <- curHsMod
imps <- imports
code <- inlineHaskell
hsImps <- haskellImports
writeModule $ HS.Module m [] imps (map fakeDecl (hsImps ++ code) ++ concat defs)
hasMainFunction <$> curIF
ghcCompileDef :: GHCOptions -> GHCModuleEnv -> Definition -> TCM [HS.Decl]
ghcCompileDef _ = definition
imports :: TCM [HS.ImportDecl]
imports = (hsImps ++) <$> imps where
hsImps :: [HS.ImportDecl]
hsImps = [unqualRTE, decl mazRTE]
unqualRTE :: HS.ImportDecl
unqualRTE = HS.ImportDecl mazRTE False $ Just $
(False, [ HS.IVar $ HS.Ident x
| x <- [mazCoerceName, mazErasedName] ++
map treelessPrimName [T.PAdd, T.PSub, T.PMul, T.PQuot, T.PRem, T.PGeq, T.PLt, T.PEqI, T.PEqF] ])
imps :: TCM [HS.ImportDecl]
imps = List.map decl . uniq <$>
((++) <$> importsForPrim <*> (List.map mazMod <$> mnames))
decl :: HS.ModuleName -> HS.ImportDecl
decl m = HS.ImportDecl m True Nothing
mnames :: TCM [ModuleName]
mnames = Set.elems <$> use stImportedModules
uniq :: [HS.ModuleName] -> [HS.ModuleName]
uniq = List.map head . List.group . List.sort
definition :: Maybe CoinductionKit -> Definition -> TCM [HS.Decl]
definition kit Defn{defArgInfo = info, defName = q} | isIrrelevant info = do
reportSDoc "compile.ghc.definition" 10 $
text "Not compiling" <+> prettyTCM q <> text "."
return []
definition kit Defn{defName = q, defType = ty, theDef = d} = do
reportSDoc "compile.ghc.definition" 10 $ vcat
[ text "Compiling" <+> prettyTCM q <> text ":"
, nest 2 $ text (show d)
]
pragma <- getHaskellPragma q
checkTypeOfMain q ty $ do
infodecl q <$> case d of
_ | Just (HsDefn r hs) <- pragma -> setCurrentRange r $ do
hsty <- haskellType q
ty <- normalise ty
sequence_ [ xqual x (HS.Ident "_") | x <- Set.toList (namesIn ty) ]
inline <- (^. funInline) . theDef <$> getConstInfo q
when inline $ warning $ UselessInline q
return $ fbWithType hsty (fakeExp hs)
Datatype{} | Just q == (nameOfInf <$> kit) -> do
let infT = unqhname "T" q
infV = unqhname "d" q
a = ihname "a" 0
b = ihname "a" 1
vars = [a, b]
return [ HS.TypeDecl infT
(List.map HS.UnkindedVar vars)
(HS.TyVar b)
, HS.FunBind [HS.Match infV
(List.map HS.PVar vars)
(HS.UnGuardedRhs HS.unit_con)
emptyBinds]
]
Constructor{} | Just q == (nameOfSharp <$> kit) -> do
let sharp = unqhname "d" q
x = ihname "x" 0
return $
[ HS.TypeSig [sharp] $ fakeType $
"forall a. a -> a"
, HS.FunBind [HS.Match sharp
[HS.PVar x]
(HS.UnGuardedRhs (HS.Var (HS.UnQual x)))
emptyBinds]
]
Function{} | Just q == (nameOfFlat <$> kit) -> do
let flat = unqhname "d" q
x = ihname "x" 0
return $
[ HS.TypeSig [flat] $ fakeType $
"forall a. a -> a"
, HS.FunBind [HS.Match flat
[HS.PVar x]
(HS.UnGuardedRhs (HS.Var (HS.UnQual x)))
emptyBinds]
]
Axiom{} -> do
ar <- typeArity ty
return $ [ compiledTypeSynonym q ty ar | Just (HsType r ty) <- [pragma] ] ++
fb axiomErr
Primitive{ primName = s } -> fb <$> primBody s
Function{} -> function pragma $ functionViaTreeless q
Datatype{ dataPars = np, dataIxs = ni, dataClause = cl, dataCons = cs }
| Just (HsData r ty hsCons) <- pragma -> setCurrentRange r $ do
computeErasedConstructorArgs q
ccscov <- constructorCoverageCode q (np + ni) cs ty hsCons
cds <- mapM compiledcondecl cs
return $ tvaldecl q (dataInduction d) 0 (np + ni) [] (Just __IMPOSSIBLE__) ++
[compiledTypeSynonym q ty np] ++ cds ++ ccscov
Datatype{ dataPars = np, dataIxs = ni, dataClause = cl, dataCons = cs } -> do
computeErasedConstructorArgs q
(ars, cds) <- unzip <$> mapM condecl cs
return $ tvaldecl q (dataInduction d) (List.maximum (np:ars) np) (np + ni) cds cl
Constructor{} -> return []
Record{ recPars = np, recClause = cl, recConHead = con }
| Just (HsData r ty hsCons) <- pragma -> setCurrentRange r $ do
let cs = [conName con]
computeErasedConstructorArgs q
ccscov <- constructorCoverageCode q np cs ty hsCons
cds <- mapM compiledcondecl cs
return $ tvaldecl q Inductive 0 np [] (Just __IMPOSSIBLE__) ++
[compiledTypeSynonym q ty np] ++ cds ++ ccscov
Record{ recClause = cl, recConHead = con, recFields = flds } -> do
computeErasedConstructorArgs q
let c = conName con
let noFields = length flds
let ar = I.arity ty
cd <- snd <$> condecl c
return $ tvaldecl q Inductive noFields ar [cd] cl
AbstractDefn{} -> __IMPOSSIBLE__
where
function :: Maybe HaskellPragma -> TCM [HS.Decl] -> TCM [HS.Decl]
function mhe fun = do
ccls <- mkwhere <$> fun
case mhe of
Just (HsExport r name) -> do
t <- setCurrentRange r $ haskellType q
let tsig :: HS.Decl
tsig = HS.TypeSig [HS.Ident name] (fakeType t)
def :: HS.Decl
def = HS.FunBind [HS.Match (HS.Ident name) [] (HS.UnGuardedRhs (hsVarUQ $ dname q)) emptyBinds]
return ([tsig,def] ++ ccls)
_ -> return ccls
functionViaTreeless :: QName -> TCM [HS.Decl]
functionViaTreeless q = caseMaybeM (toTreeless q) (pure []) $ \ treeless -> do
used <- getCompiledArgUse q
let dostrip = any not used
e <- if dostrip then closedTerm (stripUnusedArguments used treeless)
else closedTerm treeless
let (ps, b) = lamView e
lamView e =
case stripTopCoerce e of
HS.Lambda ps b -> (ps, b)
b -> ([], b)
stripTopCoerce (HS.Lambda ps b) = HS.Lambda ps $ stripTopCoerce b
stripTopCoerce e =
case hsAppView e of
[c, e] | c == mazCoerce -> e
_ -> e
funbind f ps b = HS.FunBind [HS.Match f ps (HS.UnGuardedRhs b) emptyBinds]
(ps0, _) <- lamView <$> closedTerm (foldr ($) T.TErased $ replicate (length used) T.TLam)
let b0 = foldl HS.App (hsVarUQ $ duname q) [ hsVarUQ x | (~(HS.PVar x), True) <- zip ps0 used ]
return $ if dostrip
then [ funbind (dname q) ps0 b0
, funbind (duname q) ps b ]
else [ funbind (dname q) ps b ]
mkwhere :: [HS.Decl] -> [HS.Decl]
mkwhere (HS.FunBind [m0, HS.Match dn ps rhs emptyBinds] : fbs@(_:_)) =
[HS.FunBind [m0, HS.Match dn ps rhs bindsAux]]
where
bindsAux :: Maybe HS.Binds
bindsAux = Just $ HS.BDecls fbs
mkwhere fbs = fbs
fbWithType :: HaskellType -> HS.Exp -> [HS.Decl]
fbWithType ty e =
[ HS.TypeSig [unqhname "d" q] $ fakeType ty ] ++ fb e
fb :: HS.Exp -> [HS.Decl]
fb e = [HS.FunBind [HS.Match (unqhname "d" q) []
(HS.UnGuardedRhs $ e) emptyBinds]]
axiomErr :: HS.Exp
axiomErr = rtmError $ "postulate evaluated: " ++ prettyShow q
constructorCoverageCode :: QName -> Int -> [QName] -> HaskellType -> [HaskellCode] -> TCM [HS.Decl]
constructorCoverageCode q np cs hsTy hsCons = do
checkConstructorCount q cs hsCons
ifM (noCheckCover q) (return []) $ do
ccs <- List.concat <$> zipWithM checkConstructorType cs hsCons
cov <- checkCover q hsTy np cs hsCons
return $ ccs ++ cov
data CCEnv = CCEnv
{ ccNameSupply :: NameSupply
, ccCxt :: CCContext
}
type NameSupply = [HS.Name]
type CCContext = [HS.Name]
mapNameSupply :: (NameSupply -> NameSupply) -> CCEnv -> CCEnv
mapNameSupply f e = e { ccNameSupply = f (ccNameSupply e) }
mapContext :: (CCContext -> CCContext) -> CCEnv -> CCEnv
mapContext f e = e { ccCxt = f (ccCxt e) }
initCCEnv :: CCEnv
initCCEnv = CCEnv
{ ccNameSupply = map (ihname "v") [0..]
, ccCxt = []
}
lookupIndex :: Int -> CCContext -> HS.Name
lookupIndex i xs = fromMaybe __IMPOSSIBLE__ $ xs !!! i
type CC = ReaderT CCEnv TCM
freshNames :: Int -> ([HS.Name] -> CC a) -> CC a
freshNames n _ | n < 0 = __IMPOSSIBLE__
freshNames n cont = do
(xs, rest) <- splitAt n <$> asks ccNameSupply
local (mapNameSupply (const rest)) $ cont xs
intros :: Int -> ([HS.Name] -> CC a) -> CC a
intros n cont = freshNames n $ \xs ->
local (mapContext (reverse xs ++)) $ cont xs
checkConstructorType :: QName -> HaskellCode -> TCM [HS.Decl]
checkConstructorType q hs = do
ty <- haskellType q
return [ HS.TypeSig [unqhname "check" q] $ fakeType ty
, HS.FunBind [HS.Match (unqhname "check" q) []
(HS.UnGuardedRhs $ fakeExp hs) emptyBinds]
]
checkCover :: QName -> HaskellType -> Nat -> [QName] -> [HaskellCode] -> TCM [HS.Decl]
checkCover q ty n cs hsCons = do
let tvs = [ "a" ++ show i | i <- [1..n] ]
makeClause c hsc = do
a <- erasedArity c
let pat = HS.PApp (HS.UnQual $ HS.Ident hsc) $ replicate a HS.PWildCard
return $ HS.Alt pat (HS.UnGuardedRhs $ HS.unit_con) emptyBinds
cs <- zipWithM makeClause cs hsCons
let rhs = case cs of
[] -> fakeExp "()"
_ -> HS.Case (HS.Var $ HS.UnQual $ HS.Ident "x") cs
return [ HS.TypeSig [unqhname "cover" q] $ fakeType $ unwords (ty : tvs) ++ " -> ()"
, HS.FunBind [HS.Match (unqhname "cover" q) [HS.PVar $ HS.Ident "x"]
(HS.UnGuardedRhs rhs) emptyBinds]
]
closedTerm :: T.TTerm -> TCM HS.Exp
closedTerm v = hsCast <$> term v `runReaderT` initCCEnv
term :: T.TTerm -> CC HS.Exp
term tm0 = case tm0 of
T.TVar i -> do
x <- lookupIndex i <$> asks ccCxt
return $ hsVarUQ x
T.TApp (T.TDef f) ts -> do
used <- lift $ getCompiledArgUse f
isCompiled <- lift $ isJust <$> getHaskellPragma f
let given = length ts
needed = length used
missing = drop given used
if not isCompiled && any not used
then if any not missing then term (etaExpand (needed given) tm0) else do
f <- lift $ HS.Var <$> xhqn "du" f
f `apps` [ t | (t, True) <- zip ts $ used ++ repeat True ]
else do
t' <- term (T.TDef f)
t' `apps` ts
T.TApp (T.TCon c) ts -> do
kit <- lift coinductionKit
if Just c == (nameOfSharp <$> kit)
then do
t' <- HS.Var <$> lift (xhqn "d" c)
apps t' ts
else do
(ar, _) <- lift $ conArityAndPars c
erased <- lift $ getErasedConArgs c
let missing = drop (length ts) erased
notErased = not
case all notErased missing of
False -> term $ etaExpand (length missing) tm0
True -> do
f <- lift $ HS.Con <$> conhqn c
f `apps` [ t | (t, False) <- zip ts erased ]
T.TApp t ts -> do
t' <- term t
t' `apps` ts
T.TLam at -> do
(nm:_) <- asks ccNameSupply
intros 1 $ \ [x] ->
hsLambda [HS.PVar x] <$> term at
T.TLet t1 t2 -> do
t1' <- term t1
intros 1 $ \[x] -> do
t2' <- term t2
return $ hsLet x (hsCast t1') t2'
T.TCase sc ct def alts -> do
sc' <- term (T.TVar sc)
alts' <- traverse (alt sc) alts
def' <- term def
let defAlt = HS.Alt HS.PWildCard (HS.UnGuardedRhs def') emptyBinds
return $ HS.Case (hsCast sc') (alts' ++ [defAlt])
T.TLit l -> return $ literal l
T.TDef q -> do
HS.Var <$> (lift $ xhqn "d" q)
T.TCon q -> term (T.TApp (T.TCon q) [])
T.TPrim p -> return $ compilePrim p
T.TUnit -> return HS.unit_con
T.TSort -> return HS.unit_con
T.TErased -> return $ hsVarUQ $ HS.Ident mazErasedName
T.TError e -> return $ case e of
T.TUnreachable -> rtmUnreachableError
where apps = foldM (\ h a -> HS.App h <$> term a)
etaExpand n t =
foldr (const T.TLam)
(T.mkTApp (raise n t) [T.TVar i | i <- [n 1, n 2..0]])
(replicate n ())
compilePrim :: T.TPrim -> HS.Exp
compilePrim s = HS.Var $ hsName $ treelessPrimName s
alt :: Int -> T.TAlt -> CC HS.Alt
alt sc a = do
case a of
T.TACon {T.aCon = c} -> do
intros (T.aArity a) $ \ xs -> do
erased <- lift $ getErasedConArgs c
hConNm <- lift $ conhqn c
mkAlt (HS.PApp hConNm $ map HS.PVar [ x | (x, False) <- zip xs erased ])
T.TAGuard g b -> do
g <- term g
b <- term b
return $ HS.Alt HS.PWildCard
(HS.GuardedRhss [HS.GuardedRhs [HS.Qualifier g] b])
emptyBinds
T.TALit { T.aLit = LitQName _ q } -> mkAlt (litqnamepat q)
T.TALit { T.aLit = l@LitFloat{}, T.aBody = b } -> mkGuarded (treelessPrimName T.PEqF) (literal l) b
T.TALit { T.aLit = LitString _ s , T.aBody = b } -> mkGuarded "(==)" (litString s) b
T.TALit {} -> mkAlt (HS.PLit $ hslit $ T.aLit a)
where
mkGuarded eq lit b = do
b <- term b
sc <- term (T.TVar sc)
let guard =
HS.Var (HS.UnQual (HS.Ident eq)) `HS.App`
sc `HS.App` lit
return $ HS.Alt HS.PWildCard
(HS.GuardedRhss [HS.GuardedRhs [HS.Qualifier guard] b])
emptyBinds
mkAlt :: HS.Pat -> CC HS.Alt
mkAlt pat = do
body' <- term $ T.aBody a
return $ HS.Alt pat (HS.UnGuardedRhs $ hsCast body') emptyBinds
literal :: Literal -> HS.Exp
literal l = case l of
LitNat _ _ -> typed "Integer"
LitFloat _ x -> floatExp x "Double"
LitQName _ x -> litqname x
LitString _ s -> litString s
_ -> l'
where
l' = HS.Lit $ hslit l
typed = HS.ExpTypeSig l' . HS.TyCon . rtmQual
floatExp :: Double -> String -> HS.Exp
floatExp x s
| isNegativeZero x = rte "negativeZero"
| isNegativeInf x = rte "negativeInfinity"
| isInfinite x = rte "positiveInfinity"
| isNegativeNaN x = rte "negativeNaN"
| isNaN x = rte "positiveNaN"
| otherwise = typed s
rte = HS.Var . HS.Qual mazRTE . HS.Ident
isNegativeInf x = isInfinite x && x < 0.0
isNegativeNaN x = isNaN x && not (identicalIEEE x (0.0 / 0.0))
hslit :: Literal -> HS.Literal
hslit l = case l of LitNat _ x -> HS.Int x
LitFloat _ x -> HS.Frac (toRational x)
LitChar _ x -> HS.Char x
LitQName _ x -> __IMPOSSIBLE__
LitString _ _ -> __IMPOSSIBLE__
LitMeta{} -> __IMPOSSIBLE__
litString :: String -> HS.Exp
litString s =
HS.Var (HS.Qual (HS.ModuleName "Data.Text") (HS.Ident "pack")) `HS.App`
(HS.Lit $ HS.String s)
litqname :: QName -> HS.Exp
litqname x =
rteCon "QName" `apps`
[ hsTypedInt n
, hsTypedInt m
, HS.Lit $ HS.String $ prettyShow x
, rteCon "Fixity" `apps`
[ litAssoc (fixityAssoc fx)
, litPrec (fixityLevel fx) ] ]
where
apps = foldl HS.App
rteCon name = HS.Con $ HS.Qual mazRTE $ HS.Ident name
NameId n m = nameId $ qnameName x
fx = theFixity $ nameFixity $ qnameName x
litAssoc NonAssoc = rteCon "NonAssoc"
litAssoc LeftAssoc = rteCon "LeftAssoc"
litAssoc RightAssoc = rteCon "RightAssoc"
litPrec Unrelated = rteCon "Unrelated"
litPrec (Related l) = rteCon "Related" `HS.App` hsTypedInt l
litqnamepat :: QName -> HS.Pat
litqnamepat x =
HS.PApp (HS.Qual mazRTE $ HS.Ident "QName")
[ HS.PLit (HS.Int $ fromIntegral n)
, HS.PLit (HS.Int $ fromIntegral m)
, HS.PWildCard, HS.PWildCard ]
where
NameId n m = nameId $ qnameName x
erasedArity :: QName -> TCM Nat
erasedArity q = do
(ar, _) <- conArityAndPars q
erased <- length . filter id <$> getErasedConArgs q
return (ar erased)
condecl :: QName -> TCM (Nat, HS.ConDecl)
condecl q = do
(ar, np) <- conArityAndPars q
erased <- length . filter id <$> getErasedConArgs q
let ar' = ar erased
return $ (ar' + np, cdecl q ar')
cdecl :: QName -> Nat -> HS.ConDecl
cdecl q n = HS.ConDecl (unqhname "C" q)
[ HS.TyVar $ ihname "a" i | i <- [0 .. n 1] ]
compiledcondecl :: QName -> TCM HS.Decl
compiledcondecl q = do
(ar, np) <- conArityAndPars q
hsCon <- fromMaybe __IMPOSSIBLE__ <$> getHaskellConstructor q
let patVars = map (HS.PVar . ihname "a") [0 .. ar 1]
return $ HS.PatSyn (HS.PApp (HS.UnQual $ unqhname "C" q) patVars) (HS.PApp (hsName hsCon) patVars)
compiledTypeSynonym :: QName -> String -> Nat -> HS.Decl
compiledTypeSynonym q hsT arity =
HS.TypeDecl (unqhname "T" q) (map HS.UnkindedVar vs)
(foldl HS.TyApp (HS.FakeType hsT) $ map HS.TyVar vs)
where
vs = [ ihname "a" i | i <- [0 .. arity 1]]
tvaldecl :: QName
-> Induction
-> Nat -> Nat -> [HS.ConDecl] -> Maybe Clause -> [HS.Decl]
tvaldecl q ind ntv npar cds cl =
HS.FunBind [HS.Match vn pvs (HS.UnGuardedRhs HS.unit_con) emptyBinds] :
maybe [HS.DataDecl kind tn tvs cds []]
(const []) cl
where
(tn, vn) = (unqhname "T" q, unqhname "d" q)
tvs = [ HS.UnkindedVar $ ihname "a" i | i <- [0 .. ntv 1]]
pvs = [ HS.PVar $ ihname "a" i | i <- [0 .. npar 1]]
kind = case (ind, cds) of
(Inductive, [HS.ConDecl _ [_]]) -> HS.NewType
_ -> HS.DataType
infodecl :: QName -> [HS.Decl] -> [HS.Decl]
infodecl _ [] = []
infodecl q ds = fakeD (unqhname "name" q) (show $ prettyShow q) : ds
hsCast :: HS.Exp -> HS.Exp
hsCast e = hsCoerce (hsCast' e)
hsCast' :: HS.Exp -> HS.Exp
hsCast' (HS.InfixApp e1 op e2) = hsCoerce $ HS.InfixApp (hsCast' e1) op (hsCast' e2)
hsCast' (HS.Lambda ps e) = HS.Lambda ps $ hsCast' e
hsCast' (HS.Let bs e) = HS.Let bs $ hsCast' e
hsCast' (HS.Case sc alts) = HS.Case (hsCast' sc) (map (hsMapAlt hsCast') alts)
hsCast' e =
case hsAppView e of
f : es -> foldl HS.App (hsCoerce f) (map hsCastApp es)
_ -> __IMPOSSIBLE__
hsCastApp :: HS.Exp -> HS.Exp
hsCastApp (HS.Lambda ps b) = HS.Lambda ps (hsCastApp b)
hsCastApp (HS.Let bs e) = HS.Let bs $ hsCastApp e
hsCastApp (HS.Case sc bs) = HS.Case (hsCastApp sc) (map (hsMapAlt hsCastApp) bs)
hsCastApp (HS.InfixApp e1 op e2) = HS.InfixApp (hsCastApp e1) op (hsCastApp e2)
hsCastApp e =
case hsAppView e of
f : es@(_:_) -> foldl HS.App (hsCoerce f) $ map hsCastApp es
_ -> e
hsCoerce :: HS.Exp -> HS.Exp
hsCoerce e@(HS.ExpTypeSig (HS.Lit (HS.Int{})) _) = e
hsCoerce (HS.Case sc alts) = HS.Case sc (map (hsMapAlt hsCoerce) alts)
hsCoerce (HS.Let bs e) = HS.Let bs $ hsCoerce e
hsCoerce e =
case hsAppView e of
c : _ | c == mazCoerce || c == mazIncompleteMatch -> e
_ -> mazCoerce `HS.App` e
copyRTEModules :: TCM ()
copyRTEModules = do
dataDir <- lift getDataDir
let srcDir = dataDir </> "MAlonzo" </> "src"
(lift . copyDirContent srcDir) =<< compileDir
writeModule :: HS.Module -> TCM ()
writeModule (HS.Module m ps imp ds) = do
out <- outFile m
liftIO $ UTF8.writeFile out $ prettyPrint $
HS.Module m (p : ps) imp ds
where
p = HS.LanguagePragma $ List.map HS.Ident $
[ "EmptyDataDecls"
, "ExistentialQuantification"
, "ScopedTypeVariables"
, "NoMonomorphismRestriction"
, "Rank2Types"
, "PatternSynonyms"
]
outFile' :: Pretty a => a -> TCM (FilePath, FilePath)
outFile' m = do
mdir <- compileDir
let (fdir, fn) = splitFileName $ repldot pathSeparator $
prettyPrint m
let dir = mdir </> fdir
fp = dir </> replaceExtension fn "hs"
liftIO $ createDirectoryIfMissing True dir
return (mdir, fp)
where
repldot c = List.map $ \ c' -> if c' == '.' then c else c'
outFile :: HS.ModuleName -> TCM FilePath
outFile m = snd <$> outFile' m
outFile_ :: TCM FilePath
outFile_ = outFile =<< curHsMod
callGHC :: GHCOptions -> IsMain -> Map ModuleName IsMain -> TCM ()
callGHC opts modIsMain mods = do
mdir <- compileDir
hsmod <- prettyPrint <$> curHsMod
agdaMod <- curMName
let outputName = case mnameToList agdaMod of
[] -> __IMPOSSIBLE__
ms -> last ms
(mdir, fp) <- outFile' =<< curHsMod
let ghcopts = optGhcFlags opts
let modIsReallyMain = fromMaybe __IMPOSSIBLE__ $ Map.lookup agdaMod mods
isMain = mappend modIsMain modIsReallyMain
when (modIsMain /= isMain) $
genericWarning =<< fsep (pwords "No main function defined in" ++ [prettyTCM agdaMod <> text "."] ++
pwords "Use --no-main to suppress this warning.")
let overridableArgs =
[ "-O"] ++
(if isMain == IsMain then ["-o", mdir </> show (nameConcrete outputName)] else []) ++
[ "-Werror"]
otherArgs =
[ "-i" ++ mdir] ++
(if isMain == IsMain then ["-main-is", hsmod] else []) ++
[ fp
, "--make"
, "-fwarn-incomplete-patterns"
, "-fno-warn-overlapping-patterns"
]
args = overridableArgs ++ ghcopts ++ otherArgs
compiler = "ghc"
let doCall = optGhcCallGhc opts
callCompiler doCall compiler args