module Agda.Syntax.Concrete.Definitions
( NiceDeclaration(..)
, NiceConstructor, NiceTypeSignature
, Clause(..)
, DeclarationException(..)
, Nice, runNice
, niceDeclarations
, notSoNiceDeclarations
) where
import Control.Arrow ((***), (&&&))
import Control.Applicative
import Data.Generics (Typeable, Data)
import Data.Foldable hiding (concatMap, mapM_, notElem, elem, all)
import qualified Data.Map as Map
import Data.Map (Map)
import Control.Monad.Error
import Control.Monad.State
import Data.List
import Data.Maybe
import Data.Traversable (traverse)
import Debug.Trace (trace)
import Agda.Syntax.Concrete
import Agda.Syntax.Common
import Agda.Syntax.Position
import Agda.Syntax.Fixity
import Agda.Syntax.Notation
import Agda.Syntax.Concrete.Pretty
import Agda.Utils.Pretty
import Agda.Utils.List (mhead, isSublistOf)
import Agda.Utils.Monad
#include "../../undefined.h"
import Agda.Utils.Impossible
import Control.Applicative
import Control.Monad.Error
import Data.Char
import Debug.Trace
data NiceDeclaration
= Axiom Range Fixity' Access Relevance Name Expr
| NiceField Range Fixity' Access IsAbstract Name (Arg Expr)
| PrimitiveFunction Range Fixity' Access IsAbstract Name Expr
| NiceMutual Range [NiceDeclaration]
| NiceModule Range Access IsAbstract QName Telescope [Declaration]
| NiceModuleMacro Range Access IsAbstract Name ModuleApplication OpenShortHand ImportDirective
| NiceOpen Range QName ImportDirective
| NiceImport Range QName (Maybe AsName) OpenShortHand ImportDirective
| NicePragma Range Pragma
| NiceRecSig Range Fixity' Access Name [LamBinding] Expr
| NiceDataSig Range Fixity' Access Name [LamBinding] Expr
| FunSig Range Fixity' Access Relevance Name Expr
| FunDef Range [Declaration] Fixity' IsAbstract Name [Clause]
| DataDef Range Fixity' IsAbstract Name [LamBinding] [NiceConstructor]
| RecDef Range Fixity' IsAbstract Name (Maybe (ThingWithFixity Name)) [LamBinding] [NiceDeclaration]
deriving (Typeable, Data, Show)
type NiceConstructor = NiceTypeSignature
type NiceTypeSignature = NiceDeclaration
data Clause = Clause Name LHS RHS WhereClause [Clause]
deriving (Typeable, Data, Show)
data DeclarationException
= MultipleFixityDecls [(Name, [Fixity'])]
| MissingDefinition Name
| MissingWithClauses Name
| MissingTypeSignature LHS
| MissingDataSignature Name
| NotAllowedInMutual NiceDeclaration
| UnknownNamesInFixityDecl [Name]
| Codata Range
| DeclarationPanic String
| UselessPrivate Range
| UselessAbstract Range
| AmbiguousFunClauses LHS [Name]
deriving (Typeable)
instance HasRange DeclarationException where
getRange (MultipleFixityDecls xs) = getRange (fst $ head xs)
getRange (MissingDefinition x) = getRange x
getRange (MissingWithClauses x) = getRange x
getRange (MissingTypeSignature x) = getRange x
getRange (MissingDataSignature x) = getRange x
getRange (AmbiguousFunClauses lhs xs) = getRange lhs
getRange (NotAllowedInMutual x) = getRange x
getRange (UnknownNamesInFixityDecl xs) = getRange . head $ xs
getRange (Codata r) = r
getRange (DeclarationPanic _) = noRange
getRange (UselessPrivate r) = r
getRange (UselessAbstract r) = r
instance HasRange NiceDeclaration where
getRange (Axiom r _ _ _ _ _) = r
getRange (NiceField r _ _ _ _ _) = r
getRange (NiceMutual r _) = r
getRange (NiceModule r _ _ _ _ _) = r
getRange (NiceModuleMacro r _ _ _ _ _ _) = r
getRange (NiceOpen r _ _) = r
getRange (NiceImport r _ _ _ _) = r
getRange (NicePragma r _) = r
getRange (PrimitiveFunction r _ _ _ _ _) = r
getRange (FunSig r _ _ _ _ _) = r
getRange (FunDef r _ _ _ _ _) = r
getRange (DataDef r _ _ _ _ _) = r
getRange (RecDef r _ _ _ _ _ _) = r
getRange (NiceRecSig r _ _ _ _ _) = r
getRange (NiceDataSig r _ _ _ _ _) = r
instance Error DeclarationException where
noMsg = strMsg ""
strMsg = DeclarationPanic
instance Show DeclarationException where
show (MultipleFixityDecls xs) = show $
sep [ fsep $ pwords "Multiple fixity declarations for"
, vcat $ map f xs
]
where
f (x, fs) = pretty x <> text ":" <+> fsep (map (text . show) fs)
show (MissingDefinition x) = show $ fsep $
pwords "Missing definition for" ++ [pretty x]
show (MissingWithClauses x) = show $ fsep $
pwords "Missing with-clauses for function" ++ [pretty x]
show (MissingTypeSignature x) = show $ fsep $
pwords "Missing type signature for left hand side" ++ [pretty x]
show (MissingDataSignature x) = show $ fsep $
pwords "Missing type signature for " ++ [pretty x]
show (AmbiguousFunClauses lhs xs) = show $ fsep $
pwords "More than one matching type signature for left hand side" ++ [pretty lhs] ++
pwords "it could belong to any of:" ++ map pretty xs
show (UnknownNamesInFixityDecl xs) = show $ fsep $
pwords "Names out of scope in fixity declarations:" ++ map pretty xs
show (UselessPrivate _) = show $ fsep $
pwords "Using private here has no effect. Move it to the type signatures to make the definitions private."
show (UselessAbstract _) = show $ fsep $
pwords "Using abstract here has no effect. Move it to the definitions to make them abstract."
show (NotAllowedInMutual nd) = show $ fsep $
[text $ decl nd] ++ pwords "are not allowed in mutual blocks"
where
decl (Axiom{}) = "Postulates"
decl (NiceField{}) = "Fields"
decl (NiceMutual{}) = "Mutual blocks"
decl (NiceModule{}) = "Modules"
decl (NiceModuleMacro{}) = "Modules"
decl (NiceOpen{}) = "Open declarations"
decl (NiceImport{}) = "Import statements"
decl (NicePragma{}) = "Pragmas"
decl (PrimitiveFunction{}) = "Primitive declarations"
decl _ = __IMPOSSIBLE__
show (Codata _) =
"The codata construction has been removed. " ++
"Use the INFINITY builtin instead."
show (DeclarationPanic s) = s
data InMutual
= InMutual
| NotInMutual
deriving (Eq, Show)
data DataRecOrFun = DataName | RecName | FunName
deriving (Eq, Ord)
data NiceEnv = NiceEnv
{ loneSigs :: [(DataRecOrFun, Name)]
, fixs :: Map Name Fixity'
}
initNiceEnv :: NiceEnv
initNiceEnv = NiceEnv
{ loneSigs = []
, fixs = Map.empty
}
type Nice = StateT NiceEnv (Either DeclarationException)
localState :: Nice a -> Nice a
localState m = bracket get put (const m)
addLoneSig :: DataRecOrFun -> Name -> Nice ()
addLoneSig k x = modify $ \ niceEnv -> niceEnv { loneSigs = (k, x) : loneSigs niceEnv }
removeLoneSig :: DataRecOrFun -> Name -> Nice ()
removeLoneSig k x = modify $ \ niceEnv -> niceEnv { loneSigs = delete (k, x) $ loneSigs niceEnv }
hasSig :: DataRecOrFun -> Name -> Nice Bool
hasSig k x = gets $ elem (k, x) . loneSigs
noLoneSigs :: Nice Bool
noLoneSigs = gets $ null . loneSigs
checkLoneSigs :: Nice ()
checkLoneSigs = do
xs <- gets loneSigs
case xs of
[] -> return ()
(_, x):_ -> throwError $ MissingDefinition x
getFixity :: Name -> Nice Fixity'
getFixity x = gets $ Map.findWithDefault defaultFixity' x . fixs
runNice :: Nice a -> Either DeclarationException a
runNice nice = nice `evalStateT` initNiceEnv
data DeclKind = LoneSig DataRecOrFun Name | LoneDef DataRecOrFun Name | OtherDecl
declKind (FunSig _ _ _ _ x _) = LoneSig FunName x
declKind (NiceRecSig _ _ _ x _ _) = LoneSig RecName x
declKind (NiceDataSig _ _ _ x _ _) = LoneSig DataName x
declKind (FunDef _ _ _ _ x _) = LoneDef FunName x
declKind (DataDef _ _ _ x _ _) = LoneDef DataName x
declKind (RecDef _ _ _ x _ _ _) = LoneDef RecName x
declKind _ = OtherDecl
niceDeclarations :: [Declaration] -> Nice [NiceDeclaration]
niceDeclarations ds = do
fixs <- fixities ds
case Map.keys fixs \\ concatMap declaredNames ds of
[] -> localState $ do
put $ initNiceEnv { fixs = fixs }
ds <- nice ds
checkLoneSigs
modify $ \s -> s { loneSigs = [] }
inferMutualBlocks ds
xs -> throwError $ UnknownNamesInFixityDecl xs
where
declaredNames :: Declaration -> [Name]
declaredNames d = case d of
TypeSig _ x _ -> [x]
Field x _ -> [x]
FunClause (LHS p [] _ _) _ _
| IdentP (QName x) <- removeSingletonRawAppP p -> [x]
FunClause{} -> []
DataSig _ _ x _ _ -> [x]
Data _ _ x _ _ cs -> x : concatMap declaredNames cs
RecordSig _ x _ _ -> [x]
Record _ x c _ _ _ -> x : foldMap (:[]) c
Infix _ _ -> []
Syntax _ _ -> []
Mutual _ ds -> concatMap declaredNames ds
Abstract _ ds -> concatMap declaredNames ds
Private _ ds -> concatMap declaredNames ds
Postulate _ ds -> concatMap declaredNames ds
Primitive _ ds -> concatMap declaredNames ds
Open{} -> []
Import{} -> []
ModuleMacro{} -> []
Module{} -> []
Pragma{} -> []
inferMutualBlocks :: [NiceDeclaration] -> Nice [NiceDeclaration]
inferMutualBlocks [] = return []
inferMutualBlocks (d : ds) =
case declKind d of
OtherDecl -> (d :) <$> inferMutualBlocks ds
LoneDef _ x -> __IMPOSSIBLE__
LoneSig k x -> do
addLoneSig k x
(ds0, ds1) <- untilAllDefined ds
(NiceMutual (getRange (d : ds0)) (d : ds0) :) <$> inferMutualBlocks ds1
where
untilAllDefined ds = do
done <- noLoneSigs
if done then return ([], ds) else
case ds of
[] -> __IMPOSSIBLE__ <$ checkLoneSigs
d : ds -> case declKind d of
LoneSig k x -> addLoneSig k x >> cons d (untilAllDefined ds)
LoneDef k x -> removeLoneSig k x >> cons d (untilAllDefined ds)
OtherDecl -> cons d (untilAllDefined ds)
where
cons d = fmap ((d :) *** id)
nice :: [Declaration] -> Nice [NiceDeclaration]
nice [] = return []
nice (d:ds) = do
case d of
TypeSig rel x t -> do
fx <- getFixity x
addLoneSig FunName x
ds <- nice ds
return $ FunSig (getRange d) fx PublicAccess rel x t : ds
cl@(FunClause lhs _ _) -> do
xs <- gets $ map snd . filter ((== FunName) . fst) . loneSigs
fixs <- gets fixs
case filter (\ (x,(fits,rest)) -> not $ null fits) $
map (\ x -> (x, span (couldBeFunClauseOf (Map.lookup x fixs) x) $ d : ds)) xs of
[] -> case lhs of
LHS p [] _ _ | IdentP (QName x) <- removeSingletonRawAppP p -> do
ds <- nice ds
d <- mkFunDef Relevant x Nothing [cl]
return $ d ++ ds
_ -> throwError $ MissingTypeSignature lhs
[(x,(fits,rest))] -> do
removeLoneSig FunName x
cs <- mkClauses x $ expandEllipsis fits
ds1 <- nice rest
fx <- getFixity x
d <- return $ FunDef (getRange fits) fits fx ConcreteDef x cs
return $ d : ds1
l -> throwError $ AmbiguousFunClauses lhs (map fst l)
Field x t -> (++) <$> niceAxioms [ d ] <*> nice ds
DataSig r CoInductive x tel t -> throwError (Codata r)
Data r CoInductive x tel t cs -> throwError (Codata r)
DataSig r Inductive x tel t -> do
addLoneSig DataName x
(++) <$> dataOrRec DataDef NiceDataSig niceAxioms r x tel (Just t) Nothing
<*> nice ds
Data r Inductive x tel t cs -> do
t <- defaultTypeSig DataName x t
(++) <$> dataOrRec DataDef NiceDataSig niceAxioms r x tel t (Just cs)
<*> nice ds
RecordSig r x tel t -> do
addLoneSig RecName x
fx <- getFixity x
(NiceRecSig r fx PublicAccess x tel t :) <$> nice ds
Record r x c tel t cs -> do
t <- defaultTypeSig RecName x t
c <- traverse (\c -> ThingWithFixity c <$> getFixity c) c
(++) <$> dataOrRec (\x1 x2 x3 x4 -> RecDef x1 x2 x3 x4 c) NiceRecSig
niceDeclarations r x tel t (Just cs)
<*> nice ds
Mutual r ds' ->
(:) <$> (mkOldMutual r =<< nice ds') <*> nice ds
Abstract r ds' ->
(++) <$> (abstractBlock r =<< nice ds') <*> nice ds
Private r ds' ->
(++) <$> (privateBlock r =<< nice ds') <*> nice ds
Postulate _ ds' -> (++) <$> niceAxioms ds' <*> nice ds
Primitive _ ds' -> (++) <$> (map toPrim <$> niceAxioms ds') <*> nice ds
Module r x tel ds' ->
(NiceModule r PublicAccess ConcreteDef x tel ds' :) <$> nice ds
ModuleMacro r x modapp op is ->
(NiceModuleMacro r PublicAccess ConcreteDef x modapp op is :)
<$> nice ds
Infix _ _ -> nice ds
Syntax _ _ -> nice ds
Open r x is -> (NiceOpen r x is :) <$> nice ds
Import r x as op is -> (NiceImport r x as op is :) <$> nice ds
Pragma p -> (NicePragma (getRange p) p :) <$> nice ds
defaultTypeSig k x t@Just{} = return t
defaultTypeSig k x Nothing =
ifM (hasSig k x)
(Nothing <$ removeLoneSig k x)
(throwError $ MissingDataSignature x)
dataOrRec mkDef mkSig niceD r x tel mt mcs = do
mds <- traverse niceD mcs
f <- getFixity x
return $
[mkSig (fuseRange x t) f PublicAccess x tel t | Just t <- [mt] ] ++
[mkDef (getRange x) f ConcreteDef x (concatMap dropType tel) ds | Just ds <- [mds] ]
where
dropType (DomainFull (TypedBindings r (Arg h rel TNoBind{}))) =
[DomainFree h rel $ mkBoundName_ $ noName r]
dropType (DomainFull (TypedBindings r (Arg h rel (TBind _ xs _)))) =
map (DomainFree h rel) xs
dropType b@DomainFree{} = [b]
niceAxioms :: [TypeSignature] -> Nice [NiceDeclaration]
niceAxioms ds = mapM niceAxiom ds
niceAxiom :: TypeSignature -> Nice NiceDeclaration
niceAxiom d@(TypeSig rel x t) = do
fx <- getFixity x
return $ Axiom (getRange d) fx PublicAccess rel x t
niceAxiom d@(Field x argt) = do
fx <- getFixity x
return $ NiceField (getRange d) fx PublicAccess ConcreteDef x argt
niceAxiom _ = __IMPOSSIBLE__
toPrim :: NiceDeclaration -> NiceDeclaration
toPrim (Axiom r f a rel x t) = PrimitiveFunction r f a ConcreteDef x t
toPrim _ = __IMPOSSIBLE__
mkFunDef rel x mt ds0 = do
cs <- mkClauses x $ expandEllipsis ds0
f <- getFixity x
return [ FunSig (fuseRange x t) f PublicAccess rel x t
, FunDef (getRange ds0) ds0 f ConcreteDef x cs ]
where
t = case mt of
Just t -> t
Nothing -> underscore (getRange x)
underscore r = Underscore r Nothing
expandEllipsis :: [Declaration] -> [Declaration]
expandEllipsis [] = []
expandEllipsis (d@(FunClause Ellipsis{} _ _) : ds) =
d : expandEllipsis ds
expandEllipsis (d@(FunClause lhs@(LHS p ps _ _) _ _) : ds) =
d : expand p ps ds
where
expand _ _ [] = []
expand p ps (FunClause (Ellipsis _ ps' eqs []) rhs wh : ds) =
FunClause (LHS p (ps ++ ps') eqs []) rhs wh : expand p ps ds
expand p ps (FunClause (Ellipsis _ ps' eqs es) rhs wh : ds) =
FunClause (LHS p (ps ++ ps') eqs es) rhs wh : expand p (ps ++ ps') ds
expand p ps (d@(FunClause (LHS _ _ _ []) _ _) : ds) =
d : expand p ps ds
expand _ _ (d@(FunClause (LHS p ps _ (_ : _)) _ _) : ds) =
d : expand p ps ds
expand _ _ (_ : ds) = __IMPOSSIBLE__
expandEllipsis (_ : ds) = __IMPOSSIBLE__
mkClauses :: Name -> [Declaration] -> Nice [Clause]
mkClauses _ [] = return []
mkClauses x (FunClause lhs@(LHS _ _ _ []) rhs wh : cs) =
(Clause x lhs rhs wh [] :) <$> mkClauses x cs
mkClauses x (FunClause lhs@(LHS _ ps _ es) rhs wh : cs) = do
when (null with) $ throwError $ MissingWithClauses x
wcs <- mkClauses x with
(Clause x lhs rhs wh wcs :) <$> mkClauses x cs'
where
(with, cs') = span subClause cs
subClause (FunClause (LHS _ ps' _ _) _ _) =
length ps' >= length ps + length es
subClause (FunClause (Ellipsis _ ps' _ _) _ _) = True
subClause _ = __IMPOSSIBLE__
mkClauses x (FunClause lhs@Ellipsis{} rhs wh : cs) =
(Clause x lhs rhs wh [] :) <$> mkClauses x cs
mkClauses _ _ = __IMPOSSIBLE__
couldBeFunClauseOf :: Maybe Fixity' -> Name -> Declaration -> Bool
couldBeFunClauseOf mFixity x (FunClause Ellipsis{} _ _) = True
couldBeFunClauseOf mFixity x (FunClause (LHS p _ _ _) _ _) =
let
pns = patternNames p
xStrings = nameStringParts x
patStrings = concatMap nameStringParts pns
in
case (mhead pns, mFixity) of
(Just y, _) | x == y -> True
_ | xStrings `isSublistOf` patStrings -> True
(_, Just fix) ->
let notStrings = stringParts (theNotation fix)
in
(not $ null notStrings) && (notStrings `isSublistOf` patStrings)
_ -> False
couldBeFunClauseOf _ _ _ = False
isFunClauseOf :: Name -> Declaration -> Bool
isFunClauseOf x (FunClause Ellipsis{} _ _) = True
isFunClauseOf x (FunClause (LHS p _ _ _) _ _) =
case removeSingletonRawAppP p of
IdentP (QName q) -> x == q
_ -> True
isFunClauseOf _ _ = False
removeSingletonRawAppP :: Pattern -> Pattern
removeSingletonRawAppP (RawAppP _ [p]) = removeSingletonRawAppP p
removeSingletonRawAppP p = p
mkOldMutual :: Range -> [NiceDeclaration] -> Nice NiceDeclaration
mkOldMutual r ds = do
case filter (`notElem` defNames) sigNames of
[] -> return ()
(_, x):_ -> throwError $ MissingDefinition x
case [ d | (d, OtherDecl) <- zip ds $ map declKind ds ] of
[] -> return ()
d:_ -> throwError $ NotAllowedInMutual d
return $ NiceMutual r $ sigs ++ other
where
(sigs, other) = partition isTypeSig ds
isTypeSig d | LoneSig{} <- declKind d = True
isTypeSig _ = False
sigNames = [ (k, x) | LoneSig k x <- map declKind ds ]
defNames = [ (k, x) | LoneDef k x <- map declKind ds ]
abstractBlock _ [] = return []
abstractBlock r ds
| r == noRange = return $ map mkAbstract ds
| all uselessAbstract ds = throwError $ UselessAbstract r
| otherwise = return $ map mkAbstract ds
uselessAbstract d = case d of
FunDef{} -> False
DataDef{} -> False
RecDef{} -> False
_ -> True
privateBlock _ [] = return []
privateBlock r ds
| all uselessPrivate ds = throwError $ UselessPrivate r
| otherwise = return $ map mkPrivate ds
uselessPrivate d = case d of
FunDef{} -> True
DataDef{} -> True
RecDef{} -> True
_ -> False
mkAbstract d =
case d of
NiceField r f a _ x e -> NiceField r f a AbstractDef x e
PrimitiveFunction r f a _ x e -> PrimitiveFunction r f a AbstractDef x e
NiceMutual r ds -> NiceMutual r (map mkAbstract ds)
NiceModuleMacro r a _ x ma op is -> NiceModuleMacro r a AbstractDef x ma op is
FunDef r ds f _ x cs -> FunDef r ds f AbstractDef x (map mkAbstractClause cs)
DataDef r f _ x ps cs -> DataDef r f AbstractDef x ps $ map mkAbstract cs
RecDef r f _ x c ps cs -> RecDef r f AbstractDef x c ps $ map mkAbstract cs
NiceModule{} -> d
Axiom{} -> d
NicePragma{} -> d
NiceOpen{} -> d
NiceImport{} -> d
FunSig{} -> d
NiceRecSig{} -> d
NiceDataSig{} -> d
mkAbstractClause (Clause x lhs rhs wh with) =
Clause x lhs rhs (mkAbstractWhere wh) (map mkAbstractClause with)
mkAbstractWhere NoWhere = NoWhere
mkAbstractWhere (AnyWhere ds) = AnyWhere [Abstract noRange ds]
mkAbstractWhere (SomeWhere m ds) = SomeWhere m [Abstract noRange ds]
mkPrivate d =
case d of
Axiom r f _ rel x e -> Axiom r f PrivateAccess rel x e
NiceField r f _ a x e -> NiceField r f PrivateAccess a x e
PrimitiveFunction r f _ a x e -> PrimitiveFunction r f PrivateAccess a x e
NiceMutual r ds -> NiceMutual r (map mkPrivate ds)
NiceModule r _ a x tel ds -> NiceModule r PrivateAccess a x tel ds
NiceModuleMacro r _ a x ma op is -> NiceModuleMacro r PrivateAccess a x ma op is
FunSig r f _ rel x e -> FunSig r f PrivateAccess rel x e
NiceRecSig r f _ x ls t -> NiceRecSig r f PrivateAccess x ls t
NiceDataSig r f _ x ls t -> NiceDataSig r f PrivateAccess x ls t
NicePragma _ _ -> d
NiceOpen _ _ _ -> d
NiceImport _ _ _ _ _ -> d
FunDef{} -> d
DataDef{} -> d
RecDef{} -> d
mkPrivateClause (Clause x lhs rhs wh with) =
Clause x lhs rhs (mkPrivateWhere wh) (map mkPrivateClause with)
mkPrivateWhere NoWhere = NoWhere
mkPrivateWhere (AnyWhere ds) = AnyWhere [Private (getRange ds) ds]
mkPrivateWhere (SomeWhere m ds) = SomeWhere m [Private (getRange ds) ds]
plusFixities :: Map.Map Name Fixity' -> Map.Map Name Fixity' -> Nice (Map.Map Name Fixity')
plusFixities m1 m2
| not (null isect) = throwError $ MultipleFixityDecls isect
| otherwise = return $ Map.unionWithKey mergeFixites m1 m2
where mergeFixites name (Fixity' f1 s1) (Fixity' f2 s2) = Fixity' f s
where f | f1 == noFixity = f2
| f2 == noFixity = f1
| otherwise = __IMPOSSIBLE__
s | s1 == noNotation = s2
| s2 == noNotation = s1
| otherwise = __IMPOSSIBLE__
isect = [decls x | (x,compat) <- Map.assocs (Map.intersectionWith compatible m1 m2), not compat]
decls x = (x, map (Map.findWithDefault __IMPOSSIBLE__ x) [m1,m2])
compatible (Fixity' f1 s1) (Fixity' f2 s2) = (f1 == noFixity || f2 == noFixity) &&
(s1 == noNotation || s2 == noNotation)
fixities :: [Declaration] -> Nice (Map.Map Name Fixity')
fixities (d:ds) = case d of
Syntax x syn -> plusFixities (Map.singleton x (Fixity' noFixity syn)) =<< fixities ds
Infix f xs -> plusFixities (Map.fromList [ (x,Fixity' f noNotation) | x <- xs ]) =<< fixities ds
Mutual _ ds' -> fixities (ds' ++ ds)
Abstract _ ds' -> fixities (ds' ++ ds)
Private _ ds' -> fixities (ds' ++ ds)
_ -> fixities ds
fixities [] = return $ Map.empty
notSoNiceDeclarations :: [NiceDeclaration] -> [Declaration]
notSoNiceDeclarations = concatMap notNice
where
notNice d = case d of
Axiom _ _ _ rel x e -> [TypeSig rel x e]
NiceField _ _ _ _ x argt -> [Field x argt]
PrimitiveFunction r _ _ _ x e -> [Primitive r [TypeSig Relevant x e]]
NiceMutual _ ds -> concatMap notNice ds
NiceModule r _ _ x tel ds -> [Module r x tel ds]
NiceModuleMacro r _ _ x ma o dir -> [ModuleMacro r x ma o dir]
NiceOpen r x dir -> [Open r x dir]
NiceImport r x as o dir -> [Import r x as o dir]
NicePragma _ p -> [Pragma p]
NiceRecSig r _ _ x bs e -> [RecordSig r x bs e]
NiceDataSig r _ _ x bs e -> [DataSig r Inductive x bs e]
FunSig _ _ _ rel x e -> [TypeSig rel x e]
FunDef _ ds _ _ _ _ -> ds
DataDef r _ _ x bs cs -> [Data r Inductive x bs Nothing $ concatMap notNice cs]
RecDef r _ _ x c bs ds -> [Record r x (unThing <$> c) bs Nothing $ concatMap notNice ds]
where unThing (ThingWithFixity c _) = c