mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-18 01:09:32 -06:00
48 lines
956 B
Plaintext
48 lines
956 B
Plaintext
resource ParamX = open Prelude in {
|
|
|
|
param
|
|
Number = Sg | Pl ;
|
|
Person = P1 | P2 | P3 ;
|
|
Degree = Posit | Compar | Superl ;
|
|
|
|
Anteriority =
|
|
Simul
|
|
| Anter --# notpresent
|
|
;
|
|
Tense =
|
|
Pres
|
|
| Past --# notpresent
|
|
| Fut --# notpresent
|
|
| Cond --# notpresent
|
|
;
|
|
|
|
param
|
|
|
|
Polarity = Pos | Neg ;
|
|
|
|
QForm = QDir | QIndir ;
|
|
|
|
oper
|
|
conjNumber : Number -> Number -> Number = \m,n ->
|
|
case <m,n> of {
|
|
<Sg,Sg> => Sg ;
|
|
_ => Pl
|
|
} ;
|
|
|
|
-- For persons, we let the latter argument win ("either you or I am absent"
|
|
-- but "either I or you are absent"). This is not quite clear.
|
|
|
|
conjPerson : Person -> Person -> Person = \_,p ->
|
|
p ;
|
|
|
|
-- To construct a record with a polarity-dependent table.
|
|
|
|
polCases : SS -> SS -> {s : Polarity => Str} = \true,false -> {
|
|
s = table {
|
|
Pos => true.s ;
|
|
Neg => false.s
|
|
}
|
|
} ;
|
|
|
|
}
|