--# -path=.:englishExtended:abstract:common: concrete BasicEng of Basic = open CatEng, ExtensionEng, DictLangEng, DictEng, ParadigmsEng, ResEng, Coordination, Prelude, ParamBasic, ConjunctionEng, NounEng in { lincat Class = CatEng.CN ; El = CatEng.NP ; Ind = CatEng.NP ; Var = CatEng.PN ; SubClass = {} ; Inherits = {} ; Desc = CatEng.CN ; Formula = ExtensionEng.PolSentence; [El] = ConjunctionEng.ListNP; [Class] =ExtensionEng.ListCN ; Stmt = ExtensionEng.StmtS ; lin BaseClass = {s1,s2 = \\_,_ => ""; g = Neutr; lock_ListCN=<>}; ConsClass xs x = ExtensionEng.ConsCN xs x ; BaseEl c = {s1,s2 = \\_ => ""; a = agrP3 Sg; lock_ListNP=<>}; ConsEl c xs x = ConjunctionEng.ConsNP xs x ; and f1 f2 = {s = \\f,c => f1.s ! Indep ! c ++ "and" ++ f2.s ! Indep ! c; flag = NothingS; lock_PolSentence = <>}; or f1 f2 = {s = \\f,c => f1.s ! Indep ! c ++ "or" ++ f2.s ! Indep ! c; flag = NothingS; lock_PolSentence = <>}; not f1 = {s = \\f => table { Neg => "it is not true that" ++ f1.s ! f ! Neg ; Pos => f1.s ! Indep ! Neg }; flag = f1.flag; lock_PolSentence = <> }; impl f1 f2 = {s = \\f,c => "if" ++ f1.s ! Indep ! c ++ "then" ++ f2.s ! Indep ! c; flag = NothingS; lock_PolSentence = <>}; equiv f1 f2 = {s = \\f,c => f1.s ! Indep ! c ++ "is" ++ "equivalent" ++ "to" ++ f2.s ! Indep ! c; flag = NothingS; lock_PolSentence = <>}; el c1 c2 i e = e; var c1 c2 i e = UsePN e; exists C f = let np = DetCN (DetQuant IndefArt NumSg) C in { s = \\form,c => case