GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-04-09 04:59:31 -06:00
Code Issues Packages Projects Releases Wiki Activity

partial application in overload resolution, with priority for full app

Browse Source
This commit is contained in:
aarne
2006-12-19 16:32:15 +00:00
parent d0b392e318
commit 2f68128323
2 changed files with 17 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
examples/logic/LogicI.gf
View File

@@ -18,7 +18,7 @@ lincat
lin
ThmWithProof = theorem ;
Conj A B = coord and_Conj A B ;
Conj A = coord and_Conj A ;
Disj A B = coord or_Conj A B ;
Impl A B = coord ifthen_DConj A B ;

21
src/GF/Compile/CheckGrammar.hs
View File

@@ -188,7 +188,6 @@ checkResInfo gr mo (c,info) = do
ResOverload tysts -> chIn "overloading" $ do
tysts' <- mapM (uncurry $ flip check) tysts
---- TODO: check uniqueness of arg type lists
let tysts2 = [(y,x) | (x,y) <- tysts']
checkUniq $ sort [map snd xs | (x,_) <- tysts2, Ok (xs,_) <- [typeFormCnc x]]
return (c,ResOverload tysts2)
@@ -585,14 +584,26 @@ inferLType gr trm = case trm of
matchOverload f typs ttys = do
let (tts,tys) = unzip ttys
case lookupOverloadInstance tys typs of
Just (val,fun) -> return (mkApp fun tts, val)
_ -> raise $ "no overload instance of" +++ prt f +++
[((val,fun),_)] -> return (mkApp fun tts, val)
[] -> raise $ "no overload instance of" +++ prt f +++
"for" +++ unwords (map prtType tys) +++ "among" ++++
unlines [unwords (map prtType ty) | (ty,_) <- typs]
---- ++++ "DEBUG" +++ unwords (map show tys) +++ ";"
---- ++++ unlines (map (show . fst) typs) ----
vfs -> case filter snd vfs of
[((val,fun),_)] -> return (mkApp fun tts, val)
_ -> raise $ "ambiguous overloading of" +++ prt f +++
"for" +++ unwords (map prtType tys) ++++ "with alternatives" ++++
unlines [prtType ty | ((ty,_),_) <- vfs]
lookupOverloadInstance tys typs = lookup tys typs ---- use Map
---- TODO: accept subtypes
---- TODO: use a trie
lookupOverloadInstance tys typs =
[((mkFunType rest val, t),null rest) |
(ty,(val,t)) <- typs,
let (pre,rest) = splitAt (length tys) ty,
pre == tys
]
checkLType :: SourceGrammar -> Term -> Type -> Check (Term, Type)
checkLType env trm typ0 = do
@@ -894,7 +905,7 @@ checkEqLType env t u trm = do
prtType :: Type -> String
prtType ty = case ty of
RecType fs -> case filter isLockLabel $ map fst fs of
[lock] -> drop 5 $ prt lock
[lock] -> (drop 5 $ prt lock) --- ++++ "Full form" +++ prt ty
_ -> prt ty
Prod x a b -> prtType a +++ "->" +++ prtType b
_ -> prt ty