From 1c59cd63f95ea5a2c2731597d2819263963d7971 Mon Sep 17 00:00:00 2001 From: aarne Date: Wed, 30 May 2007 19:29:24 +0000 Subject: [PATCH] further work on tutorial --- doc/gf-logo.png | Bin 0 -> 1212 bytes doc/quick-editor.png | Bin 0 -> 96425 bytes doc/tutorial/Makefile | 6 + doc/tutorial/gf-tutorial2.html | 1461 +++++++-------- doc/tutorial/gf-tutorial2.txt | 2125 +++++++++++----------- lib/resource-1.0/finnish/CatFin.gf | 32 +- lib/resource-1.0/finnish/GrammarFin.gf | 2 +- lib/resource-1.0/finnish/ParadigmsFin.gf | 3 +- lib/resource-1.0/finnish/ResFin.gf | 22 + 9 files changed, 1799 insertions(+), 1852 deletions(-) create mode 100644 doc/gf-logo.png create mode 100644 doc/quick-editor.png create mode 100644 doc/tutorial/Makefile diff --git a/doc/gf-logo.png b/doc/gf-logo.png new file mode 100644 index 0000000000000000000000000000000000000000..4d29b7d8ed7ccc1513391a8afc76a1fea795690e GIT binary patch literal 1212 zcmeAS@N?(olHy`uVBq!ia0y~yV02($VEDkn%)r3l_SrX*fq{W7z$e7@$DbcR7#K9u zn~yUvuoQZ_IEGZrc{@9>Y_S6m%fo-u?>&EW`^HDBZw}tGa#bd+ zr&_T!b8?(>;=2iNMW6BCh)O(LkSi*7?rLD-N1wYQelwO&J*0W~i=jpCBsH#dzl#SR zJPFeh-U2#a782UB2CavU0@KZCb`Hw>`^Wf9Bl3uderAV&t_= zSF(Lp&${+Y{`R76N9&SeF7LP{`+Cx~r~i`TF7ATDT^V2S=GBdt<$rdqdwTvod&=sc#mx0e99Is^XZz>!VfjI(D+lIt z{4Rpg+Q`AsD!I2 zYgx-qIX*CQJX)D*elV%=Z{9m$mTz8850osQ7QX%FeLwST+?A``In%C2C#?3r8~wFk zV>Xu#w{wC^)N+0PSM_XngAzi+BIC*%@9t}Q_x;=M`|i!lkJ#C-ToK=(diiU$?WZ|2 zWuksHZT|N?`z*^e7SZK#4heZVPrGk(GJSrY{p;Cp_q?ovhuOz9nJ!O$eedU)kJIfE z4^L0i-z0qa^t}il;TbkbyTk3)U;g}PbzFpx$PDYp>kR7~4*uD~#L5)>n}6a>h4=?G z^((JC^d4C9>9ESYBVRtsh$Wc*WZ+OXk7+leWUARb64*l-K(YcsYe~T|6P2SV0-6^&8?)3N2zMpUVCHHx|Aj_6d+vm=8-&I+5sr>O7pF?Xm&)z5f`{BWJ zao=>m-nFp0v$K2O+I`Z;*=&kWZogKZY;W-N;p@Ho_euZ$u;Q`VvHqJ)wFUPa_O9Be|LyPICi5t}zb{iO#6BKA>TR6=|Iw^H0Y>NEe9}|U iXS&ncU1vrWYsQ&FXRbVYzhqLUi>u3-Q)l*U+wvHVKbAX}j^t$J9l7!5&7~_PRb?qnd#+r%a_8RtJ;&}WS-0oOlP7=P-JjCc5fT)# zXWyQlrka*HTUzRx&m3BE=h~e;%htTPcjnKxKWnxf`Sa_;lsQY5%v=2C-5V1llQ~Ov ze0gdTo^_iMW5965TSrmSMlqzPZXd|9({&6cfOdb)e=Jp1zI(vFhc z!ZY{Y*x1?Bv@Sd{t*2+zmX=9d=IlFi=iHe;zaAYqbK}XaM>RE_SMI%;(l=$#zVm=N=JnKc?dh2`XU(E1 zC8ZT}nku&JI&kLNoi+2;EZKW-PT!m}r;e;yx2C7A=SW}8o=Z>O+`2Gl)*K%t}YtNnQPfW~g=1iUQ<=da0o+(F8J*laivS-7dFVC(V*|lZOvL##g zojG&s&5~VbRQ#q~dH3bcr7K7F9p19-%%4|#TUQX@_t>G5dP7`F^wk@M@aOjT)Y`bTxgsy5CtkXL{@uKnmG5;mZ+7j?zgKO1`R~{3 z@%4ZIzKFm4`NaQ!d++}~u5b70|NQgD`R`?`kC#86xNNrl2lxJ(_uuzbJWtHqx7v<> zd4K)4<8gPYCVbgez4w9n&Dl4tzxBPplw4`a+FSK8=Jy=WeXH%B=gl#;mjAua{@=dl z_VaVS*QvfMKR2WJWN$G;LVb03b@+YX@UZ?%_Ek^JZ-3i-=ijYQlk@w2-*1m^KCpj| zzHIPx``?e!`Stu~rCg0rpS9-JX3sbCZJ)CFgSED;P7&3=ZGAtcrr^Qs$L5D_bicm8 zC%0LC8|%3T|F8Ub)Ng0;;nnPR)^qcOH&3(s(bRiozq!M=&-*p^qq=;3(I5Wf z^Y`qv^bPtu{bPOM&qqhQ-*yL!%g_72PyGLj13Ujj73psOm4EJOCu4Z(o9}b}d|UTz z-M#Bm|Hf=SJ70Q!wZpUzr23^-ME-GmXljOTmIjb zpF1z^_orK5zMM?u@fCRdHoMt@2#O7U-)Bd|GhsR1z)pxa(&Ie`O$mRuAY+O&({9XZI=8#>-{U+_@`{` z0&9F^_f`KszWjOLJWDI{z26r1TX(#Vuc@tiXT;)P|M_Ff+>pA*PafTQySVsy{JuY_ z+__;Fm#V&1nYr06tL9Ij$i3s`_iR7w@B5;+;>x3$)#cX%ckC}dKKtp9>s`xkeEg^` zzs`Qwzk=rve?7PR{b*_7YM%#-Cxu!h_n%rIxzmk}?JV!E^?Nt$-Eg<%;8Cp~Go;Jq z*VtNAJo|L#XEXcrW#aQ)~@H{0D_eVJc}ZY*WHG1vWi`LXhjP0Z8d{+ul>UYD!euvP8( zt!1@`%_{lV%f;#s8n2pa1Xk^}1cF_#Ph( zE}UAm`OlGLvyb)t<@=*!ZteWtEA{4AY|zTx_X=MgJ%8?In!Hx1G!K_No9$F?j}?x) z#kYx@72SAcX>1)`@dHiy9UMFw%oDJu#Q>bR=K@h?UR!!-_(5W-m$e z=JM>DdXtXpei2{it90n5ob~rr9EfU=ez5F-)Cb2puJ_@lC0Dn6KlJU8)Zr&>=iB~Vy>jgCXX)ov zdymMOS9fpsySI16!IM5k>&$mvnjN!eYw`C*qKBk|t*z7N?KS)UDn-BYt7Fna`Tx4p zJU#@T*Rk9E<702S`24-K2jtkl|Go73|D%=6>|)FF^KE{w;m{N3?C&ws0ZkZ$*hzuSBEZ@a&57T>q}cIf<` zO&k9myC{5g|F7>1XMep>ea&ueHt+49`1yCfAHL?UE29)q{r~-+5A*l@+Wd6=pT+;q zM|T``RmuAJ_*=^D`Rns?{(khg%M3f1yInXy${%CLWVdu&x zcbmJ@UOlL6sQco3?AE+(Ql$^RDeYK(`||qRk54S@|9fTc&g=Va%BypKeQV5oy{hhg zLuthRz<;0Ytv^T~eRDQ^zOH(DH}_@soJlWxJC}I;>t^15{};Rb&#Is0|L>iA#QyKg zx6McY|H`R6;U@QEZ~3zMGyY$B`_g>!&H6ve*)*jo@qcGC?+=vw z_4d)FTr4^umt^wuEN<-uORkWBk_T{r6TC8ip1X4R=+?u*zxARLXIJg$JjhU6 zSX21+*r%hP+2!pk3Tm1c1j^ig%f3xMbt~JQ%U_!1>kYpDvcGFpQF?#>-00t*?l4R5 zsE}3`UtYia$94J0m_Pmh?;U!UFMj`4Ro3hK$5pn+|9*09>eR*Tb=Cj;uZNr2=Wcy` zpfO*pzqaOJ)|E%Qa=)IvG2!UZnfpK9aCb;wUcc?fwT;X7ZTa#A>potXo0?rXE&oBxtQoTZGiG1CwNZSVxLDiP zotc}n3RD=Eo|v(+n_cYwk-}$ld9zQRUoTrHoMg9okAiyiV8U z9{kTf|G(M)_UrreS(h7?mz;C+OJ4HT+}?igw?Fr5|JDDS$nLKrQ)xt=*XRA8-SVpQrnlK!>+JpZzfZ4U`&a+y((o>C`-qsR>JO*h{NG~s z_sAQ?*HpsDp8kLP>iwUCr<=vw{aVLcC7b-9Vq3-6 zZ(p{&b@}_~jJnDjarxTPx8MH$bj~h*Z6Ew+^83i$yth6!KV2BF^DpO|*8Taik=3`_ z{v14I|MS7A-7_9MKFWV)@3&b;Z~dIQxL9^|m2rDr{ln?Sao-?wX}4%x_LrC z&c{E;yzXsFN>ek}d;ccq(S$?Co*nzy%d#uAJzU-V-pv~~cl_FT^l^CZm7l$DTLS#< zMpXZvm>yUEy!5rjvuAqqcYfbq|Kiir)9&wWzuxe_YhCqv?#|Qi_tbouJN^E~`#Vo( zTe}+G{>RV%H>vW)i#ty(Ibx#kZFBtp!u?I?$JJ(6el6R%n7_-rI6YtN|8wit$Da5{ z*@yfqxBqnR=KhbuV#hDW>zrDop&ya*TCK9^;Hr78x>f(bT4%p@eSc2B{Ow=s;t96{ zy)RqOuYTV6bqfERpT+Ob?A>Fw{bzFhmpgNxc5hqTT`&G|zi;?ILsxf!ed621+Y)o_ z-Yt;Gd~jv!y`zh}t*zs4-P->3%HFTc>C5t@7>xH?yPNyHyZz(e+_}ATYvcECwVCYj zVduT}zPvqEAAZEH4rTYR`+Mz*bZ0`V@pZNDN_!gD@7?!xt-s8zH}W%o&z`Qp)NKF#3jd7-^EZSa{r@-qW`lm*CPRJs zS-(H}*FD8KlJ0QQu_VR?)~>^yV>@4vcC$sfB#Z9 z*Z=!>=g$3KZ#>&ynQ+-C?bjZg@8_QPT}qt#M*9BuN5`i%ii?N#zS4C2h3%>&%m=A4U^Fa7f8bh_UB{Wbs2=+{2_qifM8bLV?) z{g=*Yft17h6Z=1ZecZ!xyW80N^ZXybTbLJ|*SPTW^EW<+b3Z)aewVI!#Nd_qe?Q~? z)6e&32-kdkF>~?r=jZA#{(DpS`h|GE-PcFmj~|O4Up`NIeiQS)50d5g+s`MSnJr-o zioa)vmd!bmAkbi=elTB8ed)~Vgso4FPY3(Q)$I(IS+*m^tiJYETjX1r`to(*5?&Lh zoV;VAabfOLb^ZFh-8so|`Ehe*RVCDlyg1hWw(#}6wZ_}`6}~<*^Yiw1x$kcOS;f1F zk9+Zhitk3Tw>KCUoK@$T^YSlye=MKlhhMQj4p$%j;L1|@J+`kVTuI}o zx}k=h{Gt0IC(j*iZ?ASOdhoP&?#K7`1=+fqRpPljdadthpKV+$U4DFj{jW2(Ou4q* z|K^j(cc%8w$K&s_3}oidtoqUSHPAgz*0Si|gUa8wC(?J=#Q%S_wA}ajv!#!>ro7{5 zYMN1{6DRlctMc|YN7pJp*voh8e&uVc{yF=$3b4T4h?R`TvNk2#b z%*m67Kf23*x>ZnZ(a?Q6HUHItM~}Wds)+m|=On`_el)!)!Dri^pff&q`I;E7UO9Xk z)Vg&1BlD5(mz?E`ynY!GjXfm^>}%z2oY%FVDPMlXKaIKX#C)b#&-W-ln3lH6LE@9Q zzMW|vZ@={gy$gZ7e+B-1JM`_4LCz`elBCDnXV?2qGj@G{=Shy??3fmXrp)hY-Jk9} z*||t(U93pP?dk7tHpD$@a@0G1{CIrbvx)0v{%osR*C$r7Rq$F{+*OVDv-CfFxq83m z@lu(u2bVS*Gs!K#U&!_=v&-_umG=Jv zAFmo5*024hwKlN6qM;J#k3KxPn`iRifrfrgyVJbVn>Wr2t`7XZ?$+bg$MRcB`lIuPD$(6_Mq_xTxn9^VV~da)?*xWxT%PX3IG>Yg({ zD4hLuW3Ti4yDRIjDJNFX-+O+;`Krff^X&Sor=PdulKOh`ak%;RZQpVqp06{1+TZ+P zRn-x_#e&hZ4O!kLZEj*b+?ShVW%cpCTH`Uh-%^LZ+f~nZobMZ-*Tx-KZ*gq$i^Xd` z-q$Luogkz8^SM1&W@Zn6yQ1raIsE!-LS17VLt1u|Zk4Sc5~5ls-*Z|dBPJfordca7{eIfKJ50U1%JaG3*><%okO&nm zI?S@zoy9;=Bd|y7@}#7!z|&19q+Gn$uDSSL?oNE^jt_6%ow_0W_p0kkG1)e@%x#mh z-S5>s$-Vvf<}1;X1L

zWE=ndRH_p@lQjf*A;Ch4;Nu3?@9O8IJ-y+zR+2|_%Ux& zYSjbogSIWRrq-mhri5+MVKHp-Jhdp`Q2O@=|EdmD9{iEsni7_L_kK?Y|H(*MwCTlz%fU-!;Pe=8AA(9uwSAGpS~x_Fx5 zjr-CaoR9L7yu1#~Jfm=Qis~Zmdk#_`<@l@FUv_@DCwC{F*`hk)rIW@FXF=UOD-q)# z%Q;*UBF!{89MU)gntq=7ZsvW3|5yFu8&R!c_irD!udLxtNN12M5Lu#bZ2tDX?~mCp zZ?50l7Er{-Vb?6iXtd>*=OMf12ICJOtQ9vGHoR10P3B=$UN`&C;|(`w>vegxU(YXy z=wC2VKuN^uz|4tuLV7+0!fV(cEo2fsv8w5U*sRySCVJHc^{NkFD4f*H6H`hP`Re9a zq$J_7%cF|hQ77ot={54!-fQ)QEI4kMEC~$n&;Pou`nLA%ANOa!$vyq{RLc78OyN>2 z6Seu6-o1RXylM44v!iQ&9Ar7%Y2md_@F&;uh{A-?N47dt@zA3RK41y*0uE@9}^j{a$RyZ_gz ztJUG=o(sZ*{-|hw+dbDW=+#?MTaO39qBVBD>skyX=2<+Q@Zc?jo}$CKrPKX{Dy%qX zW*hPEd%iS9YTM-{T5z@s}|!nZ_KUP}pgIMwmK5aMttJL{|< zcygMhdvfjZ?Exz1eVgVqDKOhjio91RJbC`%TI1@lw;D1|>wJT}x{@urEZjXzceEb} z(x^CoaI0sNbBD;s%k~dm8~XA*SkbsCs<&y2=A}m$HD9P#cRrSDuTFga<-g4IRdruX z+7{Lneg9A^{^0XQR`%m-E53_1CjWl7qUeU_s~LLd*WKRSu~&JbZ!MUFXC2bsC<{at&jd(WK&$?A$@-IwN?fC8~ev*rnr*vKa zaq{Er*Zz#0{H)A5^NRdh8Wu_lA6|dRyC{dTdD4gQ)6e-j{VkTJotOCb;qTK2pZzD! z-lKUc(QMf)|AtvFl$?46Uog!6Kh^%=j;V>O&;MGH9AOsFb2#kM=fh#I_!mF<+&?k+ z)f9cB2KJw4T_z~91f}WRvTRD}P-+gScFZ(#*SVNvaQMthfhDH`(mkqMm=sN#6P&UP zZtIka1pagIc=p0<*3@`kJI<=9&+p|#%#?(vSx&37JNe8BMQr|ktdWjJ8=Pf_8?#yM%<+9icKzic#+m?Kx_ zp}5>E*yZQq+nYkRs&YT>dgOKGTJ_#fFN|0&g%ybJZGW%N5w9EYbU|)Si;mjNJ6lBg z9yd>!$r+f^<+eG~T10D!p69Uxd`iZ%)hwBlYvXPAZQYd<<|xM7u|>4vLPKb=dTZ>l zvst$TY$nbO`ncwV(44({n|by8I=K@5hy83@=X)wsLQtz;h*zuKis`~?iQPUCLEX|< z_$M$+OxW2KxnxC)N6GH9J0>YnwdvTd0C~>#ew`8=;pNW-Be75V|A5 z-SMI|JLT`rTp%B6H`PV-rbxK$2~KFmK2F6S)|5zMT<+Py)% z;{4W2&-Sk0IB8|x5|@hJ-$}-d#BE7^;uCP<@sD%IWR`fr716W>sce7lnW8^ee?7$ zt6k81&pP+h`G3nb^ZC~PH{q>mI`?hcTgK0_F$@N#_bk$8F22R5y?82rvxna4n#sSU zLyS|RgDh@@1bY0N#hZR5?%Rg|j<I?Na zzVAlq56V0aZ<@{@zfD_mOYM=nXJ6O2!0^`n?(L>Kh5cVrA1fLT}z9+XmI%3huY;IcPcz~oFua&>Z{S?`H^}0)+!ady*yoGnT_@yar5NM zD3J6tTqPORd+MxYjoqssb`^yOMVkC8pU#~0Msq@3UIKGs_HAp04Z(f<;x}!5c0OU~ z`w_ImTei3SLw?rh>~<1Oxth1zN3Tle(*slKJ#k{q#z)tGn(@e`F0DMK zb9qc@#WJoWPKU^??eF#3<{y6C&aq}miCjU}P5wVp2mM3i&l_%)Y17$kIxpze`xS9N zO0vJ@s@8CQUTiA-V)3$NId$T9(;n>#|L=O!q{^%Ot+&UjMI65! zxz@D9MuxFmrFuu;rfx2$clxdVU48s}$&%nDCzR4QNbc5_dbs1T z{UV{7?kwpymAics%LU{fPjh7bvqJM@u}@m)LY9T>j|(NZJsE?zo6;h?Z(rk@bU1VU z4d&^M{ya%yW){0@UcH$aFW98IYsGWx8R-!_Y-@HO7GEh5FIB_bKPjY@h5gYJkK)ov z4?eK}>`?gKsAMH{T+?RdqHN96A@aWiEv~u$UTOb5;Cp<#?e)UqF9pJ7_on_mt9kFt ze_zhR+gt6w3tZUYd*|-5|Bst4olo5}=?4E-hk28Kcr`T3d|&i;L!o?17xxopPpdzV zg}7V)$$fF;I?k#2Swz_M-NHMEw@23mOU118-TBpU0*|fv)6=dW!l$#oe`F~?^~7TR z8CAcZh0HCBUopih?)vwWkB@K9x_oWxR{5PeGOP4XuF$>sVS4(H6RQ+AF78@C@1F0x z;|~sb{yJzG!tCyGRpPK{gz_>RYqcmDgK?vw8E{>${wdTV81_@o)Y6b)|gi zoo|cHJ~Z$C^D@2ZUD+Mm8q191b8TkG9^JTE@SlIct+`w!Ph%XPANN1ex%uA5P2U%q zEqZu0y6toK#>X6MmUTW@aiH+y77pt}t1^Ds*7*L|5VyxFOu;kgJe&Fak_C2;7;c=e zS}qnO=sVx);11zKZ*qPtnaC0;UpnF1*RQ|t)@{H2w)|y}{LYCA`jhm3-{tCP379j- zVuif3216pB-9D|T_gB6L{0xxev@?3Y?)}5S4+cx3eXsDp|6S*D-&r=>?S z#ZSKJeYx>)T)M2Z$u+}o@_bE?G;TY#a+$cDS9IRv;+k#($(_Ll2AjvY&+qJM(-dD8zXkYbozp zG;xta#XJ{J&#wYMesNYs!tSNDXdj2mOOjS?OUhT&8?SyzIfX%Hn9!2l_k9=vFH~T zPTAXd;m*H<=hp~`xF@RA=%;84>}@iXnQ{BJ%)*L;Y{wWkZDcVz{qo$s;H+xXX#!C^ zswT6zYjx&vZ@KcXDY3(*aHW+8&!nzKj;0skn?&2LA3p7Pct?h1L1R$D&0go@-_J;U zv8j5^aBaCHbV__i2LFAJ9}DXAOO{lHOcD~6JvXtSfH!V|f|J|N2cEC((ycf&)B}{K zBy7;`J}I+B&~^cfMud{9(ul%ZJ$=ryC9`F{MN{tvIe0IQPMUEmzhbmeH+aaNNVT{;QZH zqrY3~@yQMvhHOlmjvQUEwS~uHsdd{*Wu}c1$u6GjSe<9-9BI9y;Kh5)`@NiZ+a1M2 zduy!4r!YObE4NSZL#aoD;jte#G%Z7d&P_eed9YDM==DQZfsV-EP0fZ^2u;3+ltKO z&d>f!=H%oa*s9VQFvHQnaCX77j^Z;M&kr#wiB$TSx@FCod_9r3`Ju95k*sr7_ry-A z)iE6>5AN}tdZ^a#TVIEX?2@+Ng1HiW63VkrxH?aCFikN|p2D;!$VXfHcAuc1WtWQj z%AdA1&L11s^r*@lesti{fuOW4pM(xC>Rqdq{N$&qJBR1wmlA^QEpznEA-xY{76NI!ma%MPo{2iH+%PWxA-T+pqOv0m*%MYx6W%#;yJCAS*XXRp8kA7 z@XF#t>B1*0{Pyc7TND+w|2w&2A{#fu{gW242B%hhC{Q>VtFPX^+s^I9;`NiSwknnU zx|=sOPmc4`#P7B?avFaUkFrv`~gAszhBfQ{Q{hi|F>Lx`wav99I5)b^YPdf-CD*KT;D}@ujk9 zk%{5y4|f**T(O=1oy_f5>2ES!mTo;fr91J3#D0ENUG*Y{-tM28nxFc^{khI-<>$LZHuN}(@S5je?A^O8VyE~5pLd+Q`c+?WOE`1Q zDS!G?^!Vzly0_MBNA2K9?Rs>#_4KHih8R5#lCGhflF`hT;;y#TE6=o%|?m5qZ4%}Ol*C_)N_4; zXH&^v&dNDAsy9W*$8Kv=`|P}T`BY{Ld#N_b2ivcluPC{jV#(W-entL`cS4^iqxsI} zPwRY-O_z*M6Y0|Y{bJg0p;Zrl8ULHw{jK?IbZm~?ciE{fSF4X4zq0GmMbCvB)=n%{ z-_%gv*M91Og~Jv%tqmtC``yxN=ig3#qEj@DQ;g^O_LIEd*BOX3fBqM=WgqYLf)fkv zuKbhOt-POoxo@f2?@JbEBI+Ddtjx64t2Nw1vd&nq@5;2*dC=`{U?R3TZ|79$8;qYH zoZEYR*SbQFzuR;&W)vAu{u}J1kbF?XPf1#Lsa<9^jro(--%vguZdIax{rvNanU_zN zEuI&D(VK7UJU;JhZ!KgR7B=sH{_u}YjqvaM`WZco7)9P2uIaCNTRubXNN?qS^%~D} zS28|+_+q1c?svv6M;FIwVMed+SjZVQYua4qc((bVVaU6dm=%YE%u`fnZ}3sv_x#AO z=eo}$g?PSa9q^11IGDhC$gj-3O6N|Z(X=~0+3_oz=BV$QaoFtH1bcqTyzd(ort5G+@we8Gjxe%(i+-~>ulDb~ zjq4I)mz%9DnRp|3;i4zv8#;M@>BVY)3vg@GH_BsovhSI_eWtGSap}d)PM2rMsGY2I zXs(X6VoEn!ym(!J?1*Z=mk`wX|XPgOYnIY2q!Z9(((0_H;r&TpnW z7ctCf@w%PHTf48{Y`gtT?!H`x1@cLox;S@n7M{PY^*rMo-@At|7ID8{^dPWJLw@&B z^%pq;GPgVUy$@dR`0>;3)16-$uL2M7axE{bS=wy4ET-I^4wr3kee1`c=XcO^yizeeBb<{(9R}g+KCwytAg(AzXHlMj6NKXwa~aSqoB`Xio@lExL<+N zj}}L~cU+$8bRv81qJFPEjuPgd(s_D2x?dmsrk%?EO-PIFEoa}IhcEteZHz3{U0$Zz z_Q`{9+rf?L>W5d)OyfQ7vj3`9)ZVa-y#FhEx`)FJ7;^IF!ou{CTcwEDVr z_w9e&0wT_=si9j189f>LjDLx=x;tETsF})gadE$zq|Qda4S+=9d*=|JO9@cuRv@4C+B1odToRzoRD~^(!Vu%*@O+dRc-{{ zFz}YWY8FyAXOYN5^LZ~6*9%>=mSIlORb*dcck0{XzORKb@oevmAIfLi&Ro$VeZXqb z^+5jAI~lGw_`PpvJ=i03Mr-j(j}yL=G7XIKw>s5%Jv(@8iK5@s#m5{^r=? zf;m2!>H25ZezlzQ`QkMRrV~zG40RMrc)h$pF(6(}g6Tq!)BLPp)%4lf;rRjcqi^qv z^A;<(@7{g$?anW8Dy>|B71}RELeHPKJP}gJ8M3-Htf6L#&j$&!fSme?2QO_%h`VGo z&G4PZb52v!71uJq-LACYh<{a;pE>L3^lH&d!s+{uwV4TDF}k4>9CT-%;hn3~GMz-! zR-e^~-ubnabc(_c;&IGA8^zG9`ekHV$~RUZOV(ksPG&6CPH55DR8aj(Ey zXQCi;*0YVg)7qG>@=4w4-1pzh*Xoz!^x1B|O6E-zn;RJICvACS?!tB3zJx?va(Sm_ zCz{fD=EbIvC+&`1!e^(5@mol;R-ZAOGyU>`#=jbd7dCz4blh;>otZQF(mturZ!M>* zrdLj{TruYdtLFjthjzl-Z^P1(Qb0b#76w?tO`y?fU-dCc7*iwe_d7 zre0T3sIxfHRHFD^eDPBCUXJ)PS?{B3zq}C?VHkLs@DDdRAkB7#Ao8FyC)njGTg+sZR%Uo z<`tZ+Q3-eRU7lPvkzE%w&p>>~wTr)YO9i}I%+0mlB@A~vpQ3pID&ovcT$jnj5U=M%3WKUJvBKZ)5XD8QsPgD9(JX0jp zebUP0UN~d5cw>lE(M?vL*&CY{=`8E9R+VpFk?Z26p!v(b!nR?9bK61V zh-$rTwZ5;`8J?GFT-%-)T|Dfwnu(YD>-JBcS1RSMDNbgN%DbZVX+rN-E>AZ7r5kxK zmzennU(Rg&dOv@sobdPD%UibY z%{_Yg^??HQ?A;&g-|fG;{Nlne?KdvD%Wr?1oF^W)zGt`dEyLni{kOeaRm=}gQqt^E ze{nGJ-xSa6)Z0fh)_mjLIz4pDit_8nC8xb(33)2PB~){{WvxuP;gQ?L2BoDt`XUoj zZJErhmw4yy_?EzP&R(sMNAKe;bq&`rAx8mWbrFkQ?NifBI;LBjuUtAqHgQ%_nfKk3 zUVp!B+r5ir${Zz*og$`%>t>YPo}m9)MWtw)+&Aazdj4C}=iNLqEpm~oLiZ0hu8P%c z1xHs2ugGBvSvcR@kSqDfrOyUCz6Q?zvaaHd`@{){)BYH#u%|H>`SxC8=U*0(%>P>J zx#E|YSr1;UU3!`25$|N)%r+Y*<44odHmCoi zSoFL@7mCHD-~Y}1A3G^RQFEW4$=om5>6ff`&;R#*qx{A4#6RAXAGA)DnKo`m1U&hoi5&q^|Or?Unbdpnf_s|){S=z+I@XZ)|c;D%nxJW zR6hGnbrVbDEa#Zbcgh~zif%gDaO8Q7-A(@Rt4}pv?#vQjZ<)kC!=v>1IrpcU&*!FH z32FK#<-^1B^T}VA>ZD1^+iRC}9v5mcw7GY(LGrBo!QGk%LKk{1eX%cSmiqxlr`MYf z9Bj;vYBawb5w%8m^QGUS0{2A}HauS#H}UBGS!a`ftoxD9mlt5aiaCFq0{5hiVo_^; z{FAq=i?a}ukxEGPf2(j)C3G6a3(3(uR+f5Ei*e$ctkT*Att zC+CXYv7N0l@BU(ztP~N1a zZ+2N*%*veYwkPP@TV-jBYw0T{b}Tl~+;5h~Godf>Xv&J?nWvb!B)5Mm5wx||pSgFz z*6*^j1pH6_e5{?b!IA4{!?De?)bnbDVkUh&X1w&&&qnbU!z-KTys(?Qb+g%fsl9)` zTwXoXQ95_mmPrj$IHzhoJuTv+-C?|1Qk$vOL&|2Je@5TB`M(!dELkzXQ$;z{qv+`C zPus#{r(Cm|79w<7^{%R&>dHAD?JY%I&o6lDZ$2qgyts_9GkBUDni)ucdn5BZIU zZU&~XTgM3;1jviF16DU+WY@nWWtNTzy0@bt@+>n+v4m+*X(EV zn)*$fznLs8=6gTyk#YQsi;e&NO!2AO^5u&s}0t%Zx)1XEV20BbFYz= z^I*}UuO&YP0$(t595^o+zBBam;X4Q19sesd-)d81jmXU53pkn-t>VbvV>az~;3byh zi8uU|q`iATJ_tKjE1d1B`&@VX{axqh)N}W(Gx=U(wW;~6%$l4DQ&_U4qcsd_b!yGa zR(eRJxUUyyKIO1j=h^Q$=Q*RVZ`<~JSHk&%a4qkR(y6XIVJs8BCX{HLx2fseQoi!^ zvx30;CnhXkBXGcd8`~1yO|z5|5^_&iy zJ~42Ckl7p_onxsQ*XB4~`f{=%t&S&NZ?e<_jlj0`JCc@f&@uQF`|i@5VpeZy6Q&7E z@-3}A7T=4ScEw@U!8LE@^M*Pp%5*1AJA7x8osr=2Um2#+?QFL<+&uVx!`+}zRWKeytR+-ZeZ%l&lf-@be*d^$F&XbJNcn}t129e49Z zWQCR(N>zAg)H0hS3tgz3@*>3L?17%golk|ue*S%KAV2%zC(ciSE^@oXOZIpaWMx>e z%n5MnW83A__MGQfg-FN_hiUdpw}o0Ae z-TlH&-TVFWhG%v=eOeys-^`oA?${;5{gm(I<=-95O%H07zEw!gJI|2NT{LskCOO5u z`YpFEJ$PT&woy;pv}Dbt8{D6#{Cn8*gmP-RGpc`6r1~rSHtH;+_4Md zMZC9V{5<=%)Hko0XmBU~u&0{Lr6Y-!McOwS&-6?@Cj6x>K%6s*5OF%=@`s9F|2Q++Zrf+Se{+?yy7>OT`Frzq*Y2(S z_3ygEuj~ZoyZqNT&bE87NJ2WTR;fwv@a;Okh!lymtK2qA|1#dWzGi)ml+Z%30Ed+Dr}miT95C=w6+&eCd@#4ScsUW^2W!#WzMC zym+=^E?23>g7dApWv^yW__}ScvZT(khmTt1Q=hhpl!b1!63#S8u$PODOj}ex?P>K) zpIe=qzwh2sGt=sj$&BfjHXMmqRm+$0|3Z;;o}a3X=adH=QkExm{CDy{{Isy=!Hdo6 zPsN0OiMz}!lxL6HDf#t^!>vgwPqzs-L_|CD8kS_-+37EoXU^ED{bFkaQ`XW&7nVtW zdtadR%3x2Glnrl{d7Y5JO!e2l?%Dk)eZBZZ)P&P-6Pnqiu4ul}=0CIeURqmkK$&Bu z(X4is-Ig{ky-z}StY&FZdKDuJ2h`h z%Y|O^nKvetJS-G@el9y=-r<-=t)Ag`7JRk%bu$07s9Rgs$ZN}2 zOGfod?p-P2u2wN&j*iAHze(ZsFIjYV3OLVlu;<$O_u0+o*L2;lFBCiXZDl9p;si-` zsm0eq^&TJ73`_N@)s9_yF#Eh9!(D%;H1V*!GDGnTdU>3HrV4X}$tW zo^4bs%e=Q`$`6gox?>NLP1kLo?J?bC_KSH|-t1erK9qF*3e39o#6jP!El=`EShHqF zw4UhIgA+3@uRSiH_0vF#Yh_cCHtRK?JL@OA)c0gY{%@LN;v8~k^P8^LH&tb^pH_RP zylIS2<~;lIxrOn$wF>5bZs))ER0fCan5RE6(f;u1`=46Ed{e{^xYv5k(AyuJ{##N% zc>3MF8pcxIK1HHB4wHAPwLe^Vl8;f~X7ZjD#f$VU*BrLLRv0h#HKSQ$y2t__7Za)2 z19sE0#kuxse{o#$I>F^aso%*59qQ}MT$(aoTuNxyFnqJuI>yND&^6{OYj0brEq?xm zN5AjE#77UGFn^zN?2DyOR{rOf<|_;{*BNf}-(wOWKX(zkNvcY~9)1biP361hbi1*g zWRog%=iDk&oUVU0zp?+-y7`L^*B*5*be$8LS}ZhS-TbKx`&W#@2RV;=OXP_LULSfmloVeTXK}Mb3%niMb6}T79y{Bcr`yQ(p+Yd z_&1T0P13JGR?~3GRf|Lu&aGDsB98q^_##s~Wn%7|9e z(VMiu{PuE%S9+Xpugux2(EYt<-PA8~uY4-zGx3{lZb`4Qz7@66?p15>zvrj8!_PhH z*#2@~LD^k#^B>Xe8^qs){$k2(;yrL*v?DH@F?4FhLjT^!;vV@N;z^D6UT4C?HJ*wZ zE#**l`p@+Jm`2WD)+QD&m9wHs&4rWutV(0u9~t}!@k(JbSyHqh<*4QMjdN^9pnE5L;w0InJhn0iPX9Vl-644`%3O9{P2?-?=ej@j7sSnd^;#%hnMvieJ?lbq zz87f{C*5Cm+2_qnxf1+te*vp@+1yv+pC^hwlw7@3gMBL7(P?b=kNoLhY1*!f1;$B&zm<}<&WBNiNsBFu;5k}YmjQyzLYK$e|Ss! zBZjYvnp!NjH}zj1JmI(U=96!-`bp12_V_pMP<|}tE?rsH^?ZNM-nftU%h#=$f9t&6 zDf6s(@|)|^*B_WG%A!3pOzzszf2;?7v@Z_dR@k#Kyhg|DYUDmk?flQGe9f;wNshc&vv^KQS_+;Qu^Y0{Ieq6gpkPFpM;yP~sc#^>VaSNb1a^}2Jz zu;L0dCxtv)XTf;T46(f(a}Zs{3m@(KKG`fSeEI; z(e};%gW8vSvquUU-!c(6{%eQ4>v?y{OrK4&A1#Y+SHCE1b9v4#z2swaosaI3C^gw( z*R`c-io}bn*S32Sbw@u*G6UyeDc22F?Y8$McHoWJyXv^O9JD#Dr z%`Nvo_ZQ{p?f+X#&DMv1sJCyrsJO2$_|5Uc%|~W=PI~@#R)KwlU$r*p`UIvO7S*i_ zRWBqtW=&kAJ?Cc~%fcLi$zKbbq(9DGy2oI-_>8t1DxQ(4t?GO>HP%Y?mA5W?vdixmhACk(GwL4ARnUJSci6~penMCf+niO? z3bPYA^DCU9nd2UWuIM?E@!VHErnjuBfKmC3`^C#L!q?m%mIS-cVqW!M(wzOnr6-?W zsNB0;CTMxIXtJsJWQSUd58~d!!oojp_eYyvl%4aT%juy|^R#IyY4%Pp@7M7}K5}VU zyubc`i`wIDyzcu%tS~B%{7Bcp7z zDrMyYu1TtbN#1Ke2Y%o7>&gu;qg(sbPF}VAA*;T4^Uk{4JP%%Y9`os${X_cq>NnPs z)_-RI(uX%is@VSt!4@|`&n6jHTsuN$E;i5Shs}#Vw7Tn3$XU;}zAu?GDgS);=1yudZyyoa)?v(Fu!=KgjwJXCB=C)c(J!*^DL1 z)}JQ(WT$&c+sob*YunQK_(0?9Y0KwNin)7l(n0USUo-ft4Gu4!=@+zgxx-m)rX$lP z{)*cl;y6*Iem*B-@sb6K%7+B5_y78Aw|2s^eIhTdt#hOLbr!SSYV}_6IqiqaTQj+W ziDIn2`7f3gRi<|Oxy^pQQ`)}k;m_%dyT6sMUi{SNSLtuN@`C39`Oz2l-O+mg>(GV= z*K(y!ZJqTXEA{yMQ~Mw9eq6s_zQK8~qJ53joxYv1{N2ij#O3F|bGReBXF0Ejv7gwh zu9bJ5hrRo(AG3c-`}WcW5A@P=+Tt!9;J+6z-^nU&;dG-&CGIynUMtTvQ8MqJlyK)< z)fCCH$1A>1N+{OfKjGz{<=3YceKxr9@S^2qhI&0|i(PXCe4pjMn2{av?%IUZWs|xd zC;qIxIDMnt?fyrO=3zfs)Gt0sTw!yuktvfUz4O)nGifjCgpJ}C+?H6e)#%cUZ?kUv zi&g4Bwp--O$))Y$4a&QGCZt(;_oyEC)LT=QIVmDc8Ra_`NkSnqJM5#jHwiW}w6&xo{hXo(r(8$FX>oH&RVU*vF<0o!C-ag-; zoqLMu_y3_6n95Y-rk1>Xa`uGsKE?HO)@-V{6&BxSo$$}<`(mNmsMR72&~pJ^uA7v% zxLv3`v* zkG!Gb;hSQs&hzb4?Fi$^n)+&!>BCKiHreVM<~>pEtBzS6Q&)EBh_D#T(OZQPE9aG_ zyKHyuaAQ8HJtuC?z7PqAi_Qz>K3k?9Gmv#^5}482R&@VJ^1KbvGhP+%FO!%PGO2Xt zhR%yK6joTwQ<)gJEM}fs2;-u)&NWsNrs5r9Qcu=>Wd5i2dBM@gDOQ$8x9Ka-oAmi% zl-a>k0bX-X@36{~&Pd_AKGpR|kF(6wJTKkEO7A%m!8`h$iVS|3v|FYYN{>u6U6R?ELCfp0d=3le+8zT4r%mi~O< z6ovkZX$IeIjdjdrw=o*^xA4y@td*4e_$aw&-iM_evC|w~T z3pwQ5d8PzxcUH5?X_bDyuV(l38GU`uUcqtmrW@b7R48Kb_|6uot24KBRFw4`4Vba^ zvZ3r;znuqaoBI5=UUcCwy`{h5@UrMgLx%c05=GYapU%m=OW33;QsO=B(dLcQKAqTd zaz=vro;iFs?|nSGY9ecj>^j}3k_B~VBBKv#Y(1;vwPoT#IhU|a99{?8KkRbtNX&n{ zUU$N}5cd}oMEM(qLn;rd^2pwNujHQ+?_O)zZuiVJc+0DL+2ePT1l3O8R7*{G;FHNS z_momKyOw_?XU8eyjN1}XLJ`;9f6qHTZ_^A#>605{beh(r&k*T;#CBpcw_a5G{hJbL zm)I_}p8ayo+Mm00+7SuUO zkJ66TNNzm*=fsy8CEgxIVH3i4mFB$TS^urF_sdqFV{r#(9(I`)`6TLi)Y^MZUe9Z; zWWE$rXla~dde%qvkj7PkV|roD&rcUAMrbPW8k$J9xOxaltyrM3eP-C9ou8w=v{ZEe z+<0Y1-!Frk%9}=`o?mb{K4Zn>E|st1Dl>Fa<*$7`SXUdixbNbF!0Ww^J1;ub z?l0RPE$#4S@!pLt@6YhO$v4H2dXmT&i} z`y%Tl_isUtsYs&73AVF}3a6xBUN*F*Oq zOIhtd8#eWY^muGc-EUXZ_Pxa7x#%S3=a-8f3Z87N?Fm)T$`R#q{FTVr-1A4`lt!lH z=RMPxK3bR5r@YcIW^W9Z{>Yp1kymy-|0? zG)}XcrzkJf{_|4n$6xo@zBtdU@%*Dxqs1zwqY7~bHLE09R_-sOX zwOLDhr|j_yo-11;Kkc-C1e+oA=g-Eg+gyT=aP}N>S9-lOOxto&cYChgp05tJ-_C>| zSRCTkx_Dmd)Zctky2wo5 z^6O!fNS#dn;WvS&71v%8)mE7}vBgs4-u2Ud-#e%EbQ?H6y}atF@P}=)&aK~?rK$bB z^|tw}?np*q2|>|D@k7impUPMo*KX8O@L#0lI&JN$!zQi%^Yf;>t&P&N`S;PFLPo!4 zk~5!1y-n7~bys=6Ic<_k4c#P=c8b$}lm7PoXUhcJrgBC6$XXuYDtI(d%+c!ag}#St zjf^=jJUvmEvNyh0=+Ud0?i$~nWqEhqt~}7<)p*Kk)`ky?@qZZR|1NZ6{VAfgXJSd} zS_{*hd3u#1SAtkmIUaNycrpYgMyX`4XV{okn9*cXw{uQL=;WiP0*=2f)(&Wl+Lt($ z+x(85@HKZw=L?}84mz{jFaP+Mti6EgwaBtQH4j;~3^$>RucFPTrZ|M_N;>U{mlr+y z>awu1#iuYH!6vqISMvVmEC1rk&$4X)KFgi?+Oi@Z#-3+)8uBIXvnhOV+EZ-ns@&JW z>N~UFp}$`IQPPI()%HET(QrsqOGcMib|ZI9e5CG>+-mqc$9n*9Cm zb{AHKLSN6zB`UqIc-7N(#PkHj`c^gTb4yOBpF8{NhhM3p{#I3Dyi0H8R+b+&ob;jTELwY?1#{?};+dDRa&J{<|M#T<&9zs`+kPILI88U{3P-#73`3T4 z`#qBv?$)`w?(&}RXYL&iTz=iY_Vz`7HYRb0YDHV+zZyLMZMM9%Tg!Q=sHnQAy4t#Z z;gO$WnvPn_5ABs%vq&!RbHvWI8i}jwd3f!(=9P9$Pg&TmyJyPPj@wl)-D5Afe{ITV zWjoKk6*OG+G@O;=^fB>AJ1#rL&!4ue&TE^SW6aD)+K=|+h%>E8?O0cEwspdzE9dnq z0%M}4&C^{aZhRnUS5S-0hf^;Tw7$L;U4O`Fes*Tm`F&pQD*XNmCiAtjP1dUDW{J42 zPC8*IG@-mDx%O|~cGiQ-{qt|zP2L-IVbVqK#Ff*czVtuYe!+dCVanHt1xi6@jbHxJ zZ;j`0DRmHf;hy?vvDlQny-u!)Ydu4=?Oru$*UNuhc+g!}AokC4)xz&fkBJ`PW(!+5 zF{10slS`ZmhHVnZzsEekl2*o}Q=7wRB^u}8+?%U(NR@fZLSFBsmttJQIP{owg1Wdm zf`X^CepeTl%Tqn_uyD_UqQ{y+F%MmJ_`_ACFFXqH{~R;7GUVr*^=Y|& z;ifYTGenPa&OhLOuqI@C!YuJAReN4lN{Q}Lxws)ZgR<4L%_u-600N>T9i(2~<7ED`yYiWDiAMxf4yH(sr7h+mVkCQ@wT z;YA|LT@!+X&Te>ejMLkiRoA1CEBwKvt;!qxFXWcotmfm8eEwC{)e3FHajK%s_YfRlVEy+(|-_y-K1)e8kx9RTh z)zq~JnlYb{#XTa*u{dwSWUj+vQjdSWm^S-IpYtv5 zmHgRi4}R>tyxd;jz~T2V?&TTH+7{L8rpe@Yd#i}ejb0hCMoe^$MY!S2b89mvZ@71pf`n=U*Py0*7t1Jj4n)4}dj ziyiMPoxkQ)oA9+}(#lgWb-ca19Z!ikKiK6^$Nov>2?W47+JgODAM{%(QvR$F(BHwU?hWInkOw*Ss4;aWSc8WGnyc6UE%CuL^7och=MOJ(a@$CGbcDlhz~ z%w6BHQ>gHXnX94y^H(o+Nc<4%OYL6@Dw8ZvWyfczHoifQni~)Q7C1CD$$2pIaJWtzz2v&YkyvMdc{NAJsZx<{K@=SNNfAcKbP32eXCD6`S0*Vt6xu_&y1Mgs5;&E=R2Qf z;ZUxF-}sm2>}2!jb~``WF}b!edD6N`=6}NFw>DV#J_u~Sd2Vuc&eBhsTQnBACIv9e z=zh}c(HN>W=kvM1-@QraCKTmu%%0ZPnax+EW%kJvdN&w=-5bzX4Vb3W8Vlkc18 z(jR;oEjODEZ)d&#>Wy3E3eSRYqlKQ=itnxcm?gTj{Z@8*g=j*tBV%4--ieEq{Cacy zmvH_2vP{%RRx{T%P?k~8#JTaqh7M(sM_k@v+|y4h#U>tXPO=nnZ0_>cEqA@Sduj2X z%PF5XeK51Ql$G|f=Je8pUC&IJXD2LeU|J#*|FHUN#w*XOS2Gl)R=I~iUu?Fogy+~V z3nsDmnjuj?TX;m*U6Aa)yhvagTUc9Iz@lGDI}ROo@oBuK|7*pX+h0#VpQ^quEvckc z$R_UTYonKkg!$H=+naH`ttmHId+pf-3%99>=@+a!?}XntwM{E!j(_1-w?}`wG*3&d zkL}EgxFnTh`93h-%-_hJ+4YLD@X^nQav!d2Ul{e^()ag|M6_LXwJVndDXhF?#jkvJ zcf{uPe39+J!uMP2Le9Fgy4=WrI&;dRW3rmvv#!sW%9*ipZOF>&9BJ=%?Dfn7Tsg zsm?9!{bo-WDdnbKJTX1XbtjX#z>OwT;d?JCGyKx3-#;%7-eP_3quZ((>Rc|*JGwPy zPjj}8$y^SDq|P`W(FVr^b!+L($j87jK!NaY`xZftIQ*=9mJqEKQ9lluIZGe=wTJIy^++MCdw_TKF4=c@nv?}P)>>nO{@4HLRyYSiF z3r{Ss=UHZMW)!F!7@Pg-W8A5{o&573F5NpJL0x?Ri%Y#qo{?RbkDdSeZrhqT@mzs9 z>t=Q&Cv^Y+7Zb8L$TjlXlr^0@swQ3hy~{P$eRb#RkA@oW*BQ=#cswJeKW5uqxwFsm zrzf-XZoRNTk$0!bQ%?V*&wr(5OUzvHOXK*GqD-^4$0ct(e+KT{WH71U=-;i+8rJtt zFF&bwwR%CQ+_94qK@S|S-g{Bo?d9vju;+(k?dua4Tuj=J)kq!ImXSL6t>?`2K#z+2 z2)Dy>?|qKC9EyFs%TD6;@2{M%7r*$au`uxCMbD_(niEg1fZDzM|5|LWYp?!XV`1+d zyK05ZT5+wfeoqz)&F#<9dr(~z=*zda^L(?+d54uTEB=JnpIy3oS;x}uG{N83cdg+n zX=#u++03Q3khkNJ*OeuFhb=^fzbd9>GAz^DW_5Stt9%XdGwv6ooz36nmj0fap2{rp z|I?S3{^v6oeCKQ}S<1C3NbKU0xM_~LFSTYryY*2#u~E3SwAS-*&6MyJMTy(*Yw#Yv zc}peNu=?tX+TMq|x9{LSe7C7y_Kw~aLzA106Q24`+Wo-IoxL;F_&WQ?b(W8J1WNg2 z8Fwdz@GQP28(VvPq5U=S#SHUb|4o*N4e#_t?q=F&YqKaMs~{cg5;|%Pc_;Yo-Iz$U$Q;Z z?v(uN)e(jlmR(-1K5gCS;=Qe313tv)+uiuRC%RwHf8wXf+Mg~syv$qC7;$PD*R8@s z|8E|Oww*C;?K*S$t12&@-d7g{mTp;W*%R^C%$eu7sZCzQtO!jdAxZIl3bC6f%B2`Q zl4zSbYuSIRZH|*{Pvn}sF0jenQ}gvg#m`uKt{Rbjt_!xAHLgE>{&ewPktx%@#JsPq zuKM-QsC0FJaMZ3t@p5~<&5L|0`fN|ieA_^e&|SSk=ez%2bl%;HkJtAbE8?(cn8bj z(@VFld_S+hX`|hCvxR+cpZm@Kw`KR$=T+A~K8(AfSRt@^f?(Gr+o{nX9#7k0ce^?v zN}>5o#@P>hY-E(qyI=KKfBNRSUqPjI{HxD83K?}tnM$AjaWzjQMPP69r%AhyIrS*5 zYtAXVbB`x2N@q*f-C4PjlXvkiTQPIhvrR`=vdWkCmSwJ6`}*^0CNcXtc6%QwecT!M zJwd;8^`**J3oF*z-CS_wt&O9V8~@j~?k}3!FWt9(=nQ;q;yW$m+E-Jl4R^mTVl&>b zGwbi_G{rUca<_C`npf|&Y_E9ACw|B3ZSz}C;cJ0cR-gRMb6hlh?!h@3hpcYQ>pk^Z zP=)#0yu)_F=VccD{k6-GQ#&v=YL7valf&XY?A57XWY+F~W8rqbQS9I5SyQ%sk!nl5 z(LbrM(kuUW;0EvF)Y$kvI$!p$j=Q3u#<#x7QLJFcr6Zx6ZmNeEn$K-F%-X=kyZ!80 zxdlJ-L|E5xWd~Qznz~|U_hE~>Q_43lI==ovd{pg*-4buB@A=ejFi@KNzu~LD{0(`# z>!**!o0a;MF5cp_%Xi9-2kliG{~k}?zICJB5AQ^K7YD(w$th7(=_` zF%HJdXTQ>F+dS)WfmZuPvB_NrgRZ)yPnJ9SviJFImr5S1dD%09H>Y;Iewy*i+J|e_ zkKSyxjJG@ARNrgh=d1rX?{tF)#XU7Y_laOs-Y z(ji6V_ntb$Z#K*kI_$V+eR#I9_5I%$Q+ghsGLQJucKNo;_XR~f;Y$JwdDnG1y5*Sv zd~a65u;jIS?w!}}zXI(JbzWN|?xf#v`TK6sEiH?FwYYp(;y$(Q!!|$V7Ds!oYhQa; zu`2U?Hq~p$HLEl1aMVjL_(4vdeE8h7w)2Ir0yntZli=C?RO z+O7P~i=!W_&wr3B&sKYsI%CGyyhtPUE|2W9yJts4JzD?QcH@)0mwkLQOzIYWQtnvV zski6tu`6MUyc$0__O4Ll@f8X&^*a2@GEMHW`{au`W?P#-TvL2fC9?VU6S+rACH3}x z+{AOOJ?meoyTJ1s3TK*wO$#d}`e&cYjIQ1DzVgN5q+Qi_{m(mJ@NS;(pt~mQLgC!f zr=6;N0#A3YyZB{xfJ2DR*TAnrrk;;4_}|IpIj3-JPt{c(<5y=z<;5Q+?kFqfF&A3= z#Awd8L@qIZ`!l{hZMo(JXIB|TXt7-v?fd$17Uze+<=Ou8t5;5Mnj&K+{bR-SFNYZy z);;iNI$$2lKP9_qYIf6K@jDCqr4B#e*5vw<``%rr9SO2+Pd;8QaJuk{>Bla~HTQYf zcSoExv7VXutkgVhzm%}?%d2;073UnXT64#+cD3|BwcR4!lFMofV+?;ie%kq2IqZA$ zhsy9>?=9EbzOVW_HEZ2wZ^x`%Jo9I2#m$Pi^}n&RlfT35?1nU-4c4;~d>3uICoH3U z?xmIUj{lq=0@cp%j=ia0_hO|)T@ingY2=l()#9r^SDo$2t9+c96lFQf=IZB;=vJ$F zYO`LKTrKYQxHe%^f0FJjORF_D%`YTW(+VPl#dc_=-2a@OckxB#-=7-gG5qgdgj5Fo zTdFD{(tg>SMZiiaY>xV#1Fvt%m7KNzzkl`XUqN@I_evCLxie~ZndqK6bup*?ag=$L z@3qVPlUffN`hJqNH$QnI;ilY_su}+?9y!Sr8Kk!dM=URiIQd9MHtlE9yw#2C)}8y{ zcjxu)?;no6x&9_d_IXa|;&0*>UH>j!kAGAVU+j|KbZ%6y>MA}+b??7ba3=dt~4+R6*82!KV4wyl=dj9m}+L!>Y-z0-AYdF88i8f5myeb*Vwgyh-OSo^WB4 zYPGDG$$RgkE1PulWVd6NuP?Pq6K6l|5}bQ1%V63rIr+2T_jQFC7h7w~m&*ElRQM|A>*;>7GNQ|I!j5lqzP(;t zUi?Er@pantS7PaDC)-P;Qv1U=F!+PO0-^j(5^{Uowd4wJIi^Rq+C7R z#lKr^J$pwo|iND$|+wcX{vgz-gvuJ7x9IJU?9xE{z5 zv{K7|)g|%nmBkx7fBRNRoKCzD`?cd_xy}A%R}9xms;C=AiFG}^V(w^`+*`cU^V?(1 zWYf!Yf+yRV-CnGA`!Qe5qY3xUZY+Kiv3*yXl24g!)Pq(gsk$pav~%pc1gHN#=$>eQ zN=rzi|L^X+*r|VgCtPOAZ&7@(P2f@I(kWKq3xd}>Oj?>3`Aqy#^{He14;4~#ogW?4 zx>RE_bBp7I-L|u)WN#O#v+n!ezc#Xy&G~rDnGDU>3*WC5Ieb<_c2nA+```CO@$H;1 z;dj=1eMWJXQ;kT*nbOy*);TNl`O9yxdu^p9IR9kn-XhtnU1^QMFWt9tO_r9O`J+r` zcS6vaDBjJ-oAxS;p6&Ny$CvFlPY15e>Dcb)yhf(<_N|=nvrpeW(th{Dg1Vj{+`cH>lsG$wch%&Brk7=;ukSf1F>C2w zPxH2yu5q*Wc4)^RMUAx*r*dY?AGc zVOt}Qu|;kTOwsPkogph1Gw-5Fu}B_|UU?69;W?AnX@6x_w=bJjm2Y|_T$d75R0u+5YZ1T66Go+pd2Z`@5GMo7a6bK;rf5882q9 z{g_oEZ@OmP<4qfPTV)@TKYmr^>*80AJ&znS*`7)+-n25N`G+|d`y-M5xL3=nBzVR6y@Em}1iKf^lj+|@b$@Lf`4 zKbMYYb3Yf8^yiYYby4zlwWd)Qx3n3FbbinZ`=ZvkdRhO=N&6OS|Fc@h^|bWVtiHr$ z7He}8LVZPppUmpfFl>IZ<>s{?^DaI<*)+{+-kNhQ2F+O;*~8;|d@Zh(>;0+;nY!ea z@Q1HI9Nmq7Hm@zq3_Y3hb?*d|I8lwSTR5vyffIZmnN3Ti0xLefNKWK9^!~t}xP}GFHaWLd)mimf+WV&n zu2}EEJvE|zO7~N*g(tl3M$DThby>*cSkaZ!XJ+SHGub|ys#o}G^3hJ2*(RLn`c;Zn z4>s|Bv?xf-o#4Jfx+1Xj{Js~aX6v#RGV|1`9utoE5V%hMYN)*EX|rdGT^9OX-#%3) zG;@~5vTTW&2Fv1aFZO)2_S_Qr-s~wX9`;^GJGGhP{x3}CJ~v_WfuKo;_9m#vteenr z$aEc3dBBoiO;%iG>y}J8{>7DL&zCRnPFyK(_$8;O-+e{+U&y_}#o&Fs7b?fuGNv|De7wL?;YU|$7nRQ46t8J}^Ftul+sv2g8nX>` zS6rDQXOaG@d+~X%%9)*~^;*AA6JcDt^vNrcncEkO-%WU1c5Q#trK#~JFMgZpRMF+O z+k0x_#;GaC1(e)prDneTtqdHa>H^qj3M~65ms1 z?%J%%Ug?HoYsDRw0^Y|i;A(d#`h^q+~0OGNz753Wshhz=vYaiWvP<#I4+J*mvnlImcd+*zm zZ{JdG&dQ(qXD?bRujdB^uD`cq&%PwsoFZ{kmxNx>Zk2A8^$=&M4X#`gyCP*d?#W-y&^)H*n9% z?Y=Vq$MUmLhD|HyFD@=??O*$@ZkD^KR2yGg*}hjZ*7ke-_zRk*h*$^O+H2$}GGWbc zKaayvygH?c8zVw4nUu;&@|z2({F{Babz{ugYni*gf4Fwq{I#b4tg2f_6bt;SZ&@at z?iAEjonEIKesyWQz>>vJd%rHNWBIM=_R?~0$-QzbRntRL@(K^Ws<3&tFmc{@_U&7a zs^x_7ZL&%UNbW68h@|iMuv(~K@lcXFzaaHa$GCW_rCojU+z|b}B@9OKv zFYhrwFnw2E&VgTHuTn#}Zr?eeq)~KBNG{>do_|aKi1&O9Z?#+}651$lrzOzZ@O<$H z$$QFs#DjvfDypy8WQy$3zBh?Szw7w?($Jl+Wwr-xtvuIct-fH{c7faLb-4?}bkwi- zD9DS}+nxHC7nZ(QNnUhf<+{R}P=5V)4!*iwzm|#Yl6HNl+G_1{TJz3q|L5Id3$691 zDvGhqzn;_N`N4=Oj;kUvcfB3zew+E9}zklwPcP+~BkonQWzaKqJ{dniaSF6<(@f~GTQ_M~s z>J92L_R`Y$Aepi*}0}024RXygpQ&Ro51lrI+$nZz`-; z^VMzra#&jB*5xT&_qKePBx>3mV9Y&LN92A@pqbn{uM$z8mm1H$_~uXS5Lx|2IqBx< z)^LmYu8jK@1)cCHs|l2yvch`Vk6P23h}Gv~56|K(j+_5bHC{mW^o@Ted$i-Ct1=5; zUEvP@Q2X)2riwiO32!q(-S=;Cbqu(b@FD6z=%JkV48OUz#K&)s*5~`axUF91WZlvq z^&h|M6fG6Iv+<+W&HWxre+T>s+upZk&2jT9Ngi>$lX#8SLr{r6BT|Y46)~-1M(LCj`UtYV%Je}2UmL#_C7f=4@8MAETK7RkS zxcum0F`ZBAel-0$Vzou`O#QTZ(u>mG?P;q#n_JJ*+;${m|GpQ+(G_>z@czCdvWHpg z<^RR+-bSWcZgL5nadTZx;he+Ljtd?ABzTjy8QVMLbeL#qJ~lC#BPrK!#FmwEQc|Gl zCu9HSn+oak6c_Vap0&t~^+?Znf5^G-nRtqI@442)GkzLf3t!U_p>6bf#q&d}@9fqx zwhLRcHL3PU`KnV!KW#rtzqnP9H_z1I^zE%am(`3vS_!;3`jchaQ}c4M32MEOF|mvM z!<#4iCpYHt7u%=T03=>@Gg%a{0yWb&q;JC*Cd5+^hD_x*~dy)XW*K z-Rq(jfALvqJSnu{K;inYOs{|GeY1)D^)Ku1tJTr({Vm=X?_GJ!s$lD@oVc$$y-GuJ zubwusKJ`Q?)Nz;StQeKMtgD6Jis~xN{w}<*dI!}X|GqWz)8C?B+7Z?JerkM`i`#uQV$DnmzbA|TN!5x-WSO!B@UcFvWO|VidpdB| zT1UI-$+eG;-f)lg`=+60wEMf}sspQ5e_QpZLY436W1X)t(}P2|*WA^JUw^{QgUcY# zP5S7)tg`6KQ*kiV@|o- zn!fK^FY|-vvElN_@AjRGRm5D4*QK)FwzLbrrp&eT*3TVlHm|R~bWJ4uiv_3PLG?o40cZ;5NuJ?`;elwP?ZI7%vH`OT=>`%=4ZlE8L}$Hr@_-*%kUU2b{l zU}(=5{ngbEnyus`J}bv{LeX@yU&*`mTlMS zsd13=TBoPIMm)~!=>zk#?gy>;Vn5|Ibv|G8ZY_(wJHOY&BmTk0+j2LFyWDFoj4rOb z|A1qQ)t77OPU~l;cs>u1ZwyL`L-{tK~?QPe*y|rl8{uuE({`dL?%W`yixSIB~ zKem$&+s^(q`QPf9Cp-_hw-%YV2ey1)Dfz(ouo&z5q(7^g$N^4sa+lKo2mi+nwpj~1Km4YC*O-#bOF&&p(e>zDZX_5V&J*NXi!e?H~e&PyEs zPsO|KDAz5ByTA0M`(3Zh9c#bExA)ow>&$+-bn}zKxwBV9^S#?WN$A{Jx4rfGOs@`n z?8r#?YV_^Rp0k_9rp{)*7_4Poo9&S6YO$ze-_FvP{_meH__-qfOU;zfhrgzznR-~> z-dph6D}L{fZGP!h#}og)JIc1{e)p=Kk50V1Q&ji?iKpg zVoasGZpWDB*dBh;y)-`J{GQ5(wH?PjHiuj_E-LK_Z#whA?D@Rye^&X4C*Kcw|M2UL zf-hR1^|z!QTCn)Qg_o|f8_)j!x;H%9_J-7XX4VjwZ$@7}TCLhUEzV-oKK)I$s+z7B zh0?ee?!6LL(TTJ-7629H^#o0(|K1P9A?yb@lS)7l(8sie8+|kMDaeVq2NZS(5q1-e&BwmG$DZ%+=t|KZBh2ea4yyi@!&kMH%bdU^T(>;GJfz13E^i*JpaNCZ#NjTHy( zPG}4f*YQo_5x3x88DX4wl7B^fzTPSG*0NQbHvC#AY8xHW-*t0dK*gaKvjh0u;$w31 zD$dvLsGU{ib#dADp!b}6d*`N>{F-xfx$ohFpMNFTbzPem{`dSJ-RcU%jEF?;_p{eu zmb<6@mQVJ|t@V4g4qdHzxo+Mv$*`;S4{Z0u2E8bn?)~QBrR~^hrJb0_TA30>JRm8@}M*f`N(WY_ElP3%q^!^z!8PpLg5u*EU91Z1487 zxN)m~3!80zZ}{!Sp8}<8YM9@Ng!^T$E&I1>>vQ%KmiuBBg){%odwOk2mha|V6J6m7 zmM+;xPi>iY9$n_U*L~&r&9jQw*6#m$@K$le_2&+= zumAu2@#FtW* z(zZnh+;}P$= zy5B0P^0A^?(DTC|ckK)I?TIzKW-!10CsT3Eg8rwLV(H;a=6_4x@a6QMh(G;HepUF? z>-xp5Q!c6Z;S`s8{k#4AhqVjE&*iTjyk}axJ>|afqGG`Xo!IkVckRzY&I{ih{5^5Ymajkd_3N&A{hN93?B;JDwtdk2 z|M;;fe+j>K?!&(=MuC_@?r0vp$)amzj~Y zJ6ykS*5}G>?JtYh85kLMvoCon^6ShcrGnUS^L0OemQD}X{kB>DRyeQq_H?~(BKyRz z2|s&$=Z5yt(+`s`8SBU&URkZVOFeeh!=>NdSC-apJ$!g|4*w^%xLb#{kKcY6I>jSC zEv8f=w%F{h(fRYqcTBw4ZhfzN_GtO+g^68n%}<4F^Iv)NVVT1DiCI~zA9aYYF5Y^h zLLm2!ZbjUV@GkW*+f%mjnO7&zz4ysSZklb~mbg>L%AVbosf>-Ecy6`h2SaVyfJ4$R zpPw>)D*rdYece|Fr=JdM_j!Nn(p30==4k(s#{VsQN+5N=ofvbr zyzZ3M83tAJI+6YMTC%%+|89JxzVyqZDtj^W?-je2SC_34o2RXWetlav{qVDlxpLRPKK=abi#1y*GL;YaM=mea^zd`ToC^-^hL3chZ(^y}F96OjT%=&h*xH z*6r+j^$*mpd&6C?zgNC0WaY0{364AW*L}WKY_a})&V`R6cI}($AHC?K!TX%f z<6-ejwm$#$C70E`wJ4@ANtNC1s$}e^H)2iaugqqAozZ&d*{+u8$-C!oKDw~|X`tZC zF}^iUO&jfEu0NmOoqqjD@Y=xjml|iR z|5tT+1sn7Kh28an8y(%gAo26|`)BX3 zE1tZ=e`9TIT1<6czERe?FR5vFTKB|%Ilf>wyZ_<0pRa{8`!iH2x_{WI{yx4<`2TJ_ z|I(_6o2$0WpMTzIQfaLigZ#qimy7-G*EJdadploSy)<5S_3Fs$*W=n9?jJs3YaA4P z?wVIs*=4ah>+4Ymw|}lwoc27Ues9*sjURucF28Rsq5HO$XRXcgpr6zJa>Q3nxw8MK z?VdgB)>rbc4^^~ueZ2SsZ~E=C+ox=}_dRaO^p1lm?@m3R7k{U`_)phr^9eEQ$pF<*Z^ym~Y4UuEX?ucaMX&T&%{XZO!q zDf#W~b_uQOr8)BgzdhT#a!P60clW!qmfIR`)V()v?$?~>XV1J%&ggcKPHVqmn%M0< zU)c8R=T|q|!<|3xeDrWv__lEN--fkvQ6e|yym=hCe8(I+{*T+AR@R#SuVQ;rFQWK) z`+d*;|M4e1KU$w-uiL*}X12-cTVEXW@`~>%^PfG+-Tzhc%?F)O{a)3wtv7zWte%?s z{MPy)>$8D|d5Kl3Z)Z-o4gC1wMfVB8)^BH{*VoxTesHnS=k1 zu6=%)Y@!=H<^Cx?yZt`piIjEFCd;g4rS{FY)~q)3^;}gMdiznh<@)urD$iYS+}`c~A&&s;NW1#e#e zIjL~zwmq{C#~UXyehSL{tKs%Q_*>ws+C8i9WuN%{v|IP%&jX#J-?ZoHy|&sr=X2HJ zSv&W8Ew*8P>v<{g?53q>%?ix;;`*Zeb7i-xF4tde#`bpedHwm?VV!bQ&6d@!PANXH zo_n?0nxbDu3GsWlI`19MUNiH<2BZ1=o|e{~bbqKj$9ChXFip$bs;_yEJqvWKy>VpM zoM#5DuWZU(-@9jB33hZ|pSD+O)#1JI@!_{`eR_T2`pJ3MWIZ!q2k&2&`zN4p_^4Xm51(!dU2P7?_ju`@ z-5VaiFX#0B=l~sGuct-kYd6PD%OUTWme$;H%He zmh~TZ>+|yan4+m1*DP4)aC6Pi-P_pOm~7govTpymcZSeHF}|fMG&gDFiPWx`bZ^bZ z`2O(ik?+&8S@zAi^ySsTWT_Up)Li`V)|PF%aVy{pG@o3nP8v`=;& zU+w+yk6AOGNBI{2;xhI(%Qp>BUZS^a-8`wjulnhymi=7uX7QR`_kxpl>|45cqFv?J zyXE&ki3t6hkY5#5Xi|7AcJGm?+H1>fMSZ;dGmk&CJmGb-jkVhD)W1EMFO6RxjCo|T zA|`2j?&;L(^UBg(-boc*<6;tv$kKCBAN>v6yS!A6<5_8MnJL zbd(rp_LOVia@94t@TW82^{qnt_I0Vtj8pA@|J6U~syoxR`q`BYx0mOCZI5p`YyXG0 zKU?&rvd8ORJbvpxho5xkZC=5DZ~Ol#YN`zrB5(Uy)OTj}=5Cf{^gle|eYmHtarT^; z{`D)?DW1rhH~aERcE*|hYr~!zf6e^Xx0qx0m(W+I8K>lNEuAFi;TmZCxH8!FHcya% zVjC3JzRvDGw%e_?PWkNt8J$9A+dYBDgwqawh~?P1T3;}$D`#n< zXjaRasG8I}tiq=X{jw_~6wjUtEiMk?%6C6$T(sG1lb0mNzgb7iEmA{nthui7QO33V zk`;IEqHQHLj|{RUTxK3u;98v~xjJH_LGy)GYW^*2YhuiWkG7_l@k`3wf!4#HX}?3~^&ag?(LSzWxa#?{9U^MdjDdzB z|0XMJg# zudpDOGsEPIp+}|!&)RwK%amuCC%$-`f4$^*@AZSx0?$uwzRQ(!YxdFYbM7$xU2(L& ze#-L|ULjMwOsbiGF8i}m|KFqiThf$ROs|EuMa+$^K z=Z-wLS4}HhV^OW9*V@DtC@r8jMOjbJe%j~!Ra>X9F4C!=rgu%tV*WGj-X6O`KS8HI zS2fO>yl%Hh=-CsnG>89SV^{MNjpv*zRr0DQ=|@bp@jh7WxXA$9=MQ84HyT9uD$56{``O+`D z&RpNT_1he;+T<-iZiUT%y?Dp|3HNlC``VgT2hBZnaod~TBid(z@-s$x&&t@C>J|KD=A$f&Sq-+8dd_bc z7kv{tm%Db~%lU<|_w_$)n?0HHbHV2GIxAbY&R)7>+q1Y1esNp2mAQu}FAmK8zUqbh z(_CG6!AL9iKsIbGK=%pDxKitI=_y;^ za-3ydeDp=YW21*fQN@pYHg&h33!bHYy=_U{OP!s%d9m5??h8+Sy?!a%bNBmYZ}cR% zbE?eQ&wN-`7xLZb=DDZVTg5I$^Scx;Ev+^5neIK)?fYW3oNv54cdDPdoFUTxRdc6D zyn2+()Zc;rG2$h&)a;kcU(KV;%j7I&s`1rJ!!x9*}UaK zk-`7vp1zM3%4xM+`fS`^w9Yrt=C0?2^%2VIXEUPjtx@cX+VR`cQ0D$w#m|A>7vn#= zTmCr~FF(^wk>|$Mt(MCTBdRMjw;JBu@|m%>Dwt{ayl1Q5yt!0yMnIMS*1=^n)K6@l zS5)+CVv42dzXXNv;)HR;To74pyhuObTJG z)Mb)Roz)$(bHkZgIn%##W))9ecuMbzNaEYd{M>Cu8CTnL)4SI0Gc-RYrLt>n-9}Sp z3BGP6$C|Z0?aXUVE?;*|GcxW-Hrq8{d%4$(f37%R_dmbhi~XBvwp!TYCCa=PrEYJ! zBd2@xZ|k=Y*LoiOxBe@Up=LA#s}=Pjbf3R*MMzTddjd zx{mpiV&v&#QIkKn8FWYRvzqUpe)h;M$In-0Pc7MEar|XkhWmYQrP~K~Enw?g8e{wa z!gmn^dC`x)O#A;o{e1f9{O^W({+Dh3MBVv)Pejjheg0O*HQU$kv-&l?FRgCY{wgiT zl68kU@1Bw8KIi4%k{o>O#O2jnZ%%k>Rv~{gX42H0bLTFyOw4~4b!PRGE6ZMA3VM?D zV#};WqMM_P?+b_RJ{flWaZN~+@yE>H|5n7!F1nxkt#-oF-Z1Z=Yd#SSCuYh0%h7u) zk#=0ii{C4_`8)F$;hS!|y92lzn^&tG_k8~-bIMJ}<*mlsbKf#oyeO2^E zPg=S!q8--1`mR;vZ;(%AUEOcRs%x)L*)=>gwyq37T%%x8Lrm zTM?@q=6mz$lnJ$$6AE`PySh%>-qm~RQW@Q8a&@&?xl6NlUR?Z>Lr<4?@2%XzL;3g4 ze*C=r|J8Y#uMK}cp0aBGac}1IQ`eqVt`1kwpJNqQ^wDxcP)nw&4%=rlTG@#?D$Q&t!DCX@5`N&dnUI|uK#mo zt;x0RTW)Mo$~jQDu5OL4|I@8!Uhk|tzVPg?=Fb7g4YnMr-g@=2fc&bZ?!V`(zWjaZ z>E~WGj+POUF!Ac^G=_*cDcvqG^ZZE_|lB! zvgX;}YxiA!>Gjs2X#UmX!GBUeytAm!q!r?hN#&}xNlHtu!K6SE_$=4`oK zohsW}C)1|N>29#qS;y{6(XSu3FJ05Fl#l10y-m#4Gj5h~>gpr90^SaPZ-kZp(tNG` zb@8tE4?`oXKL^+?(+&PsxYxYD-C3LCyQB4__Yz;-Uwf_67p+&>`t(Nk<|E74mpc?hE|pJ>T(gzK`c|uzQjeJEG%J~v$CR(W zDcl@?(EaL>MN7{AueEtobx+vuym&=jdcTqU<9R)D4{O$6s|n_K{VStB#4i2NxAHnp zyLq)U-+X4=SGZ>V$3QXN?Yp$EE?M(+*|K<8@ zJvXe__;Bi#U$b_p3%f6<-tso_?zH^rZ?4xzT^Ij%{rs^=kFa-APX4=YMSWL2uFo2F zO0GWq&)TBEeN6YuzfOIn&;4J2{%ig2*Y(%8_NVH*`mg*~{wVtE;vaK3y_u`_SKqp< zyz^}25|8)KI=g`P|Y|zaM<{nKJc$+9LMFeu=^F zLp}HV%r0AAWF7PV<6-T!=O0gdRomg2;QuAB&%Zvt=j%=3V=-bc7_8sA)2~*geEv4MeZRk* zIOMu?O7Z!n@>{1bX5N|a{_W|hMJ9V63w(3`n7O3d{`1Ev?r-{Iuh*TjExz*VwW0IY z@OhzqtbbS3+$f55zCYbBp6gdsR`C7n4S%CvCtrHL@o4uq^S$lmztW%k+_ZaT+x&9j zj`+8xGhfQKZ~0~;``_%a=fS)4OOGwDG;faISi9}lvt{~vc5i;Kv;Dl2y*i%b_tx*P zH`q6w6->R|oN{>g{QP-NRpM)2pZ*-!f7WyI?P_pp-X zu-zWJXJ+P6dEc||pP&0LagF|Y_t-0Y`dyctXIn4TFOa@;;_g>EOJ@3Cdvy8Mx}z7% zerP{W*1l15Ec(=fPhVY^yBBIpY%|TCdH?a0^+&dydiO9(+W3CQ&(s?;zE@s1_B1*Z`T>7aX4%W{sd9@r# zg#j0$js@0KznPNDUM-r;>3Dk1Z`M_5?fDn_H2Qq!>qmWCAD&xx^zF)y^LKw|Sjk;K zd|`cmt#js)1J-;m_t@=CJH+;M^PaPh74M55W4lRyZ*BO%4Geb+PsKKg(_=wclUl&InlP=-|=+d`H&x$ zw|6}akbM2SKJIVOJmZc2D`UOQp4YzJ^6qnS9sl}Eix%-rFMK6&f6mJ4k|*u1%OGgkv_Ir9v+Ze8gaDj;-c>@6F34|4ME6a(&%I zJDc-nTScmW{4#y_GH6#q+w?M-f7kcd?z{5(*Pi>zvo4-aj^_C6_4?PjuREU~&&rKfiI44 z-+D&zmu!1|dF7StJ+)!KpDphH5$Dx?_cZ6Vue!SzyxSkO`$gf!$KL~QzCFEZ{<`?~ zz4xu&&fB{6(!1z+c6_!LcJkkMY&-t<_m@@at?zX0Z68O-uYLXd_W9}EduA_w>K0%1 zZO6l_3H?b24CXdSCO=+WW%}N;Y3U~2>+dH{HM_EXU3J-qj=)z}>*s$C^Zm8u_MJQ1 z<8AkDJpIDEwzpdU{MpWrx)<%_`>w|QoD)_1aQpv+efF!|mxh{edz-bh(D>4>t+k%j z702ILzwRmDV{}FJ%=$8W-}sY#(mUdrpU+ryyRxrn(Q(OWo$rO8KHdqBjecR<;ck)S z{B6Un)#esUE%)1>vPgfVk@lPI+Tuft<@M!eez>={V!hkdpaf6Xwcqw}zIgiO;a8`% z1@hwZo4(#&y|!BA>axYtPhXo-yY6Sqx0GYgoX+#fEZ_fhM&Pm3zpFRa)lZpxC3Wig zve}AulXOFBCLf4+|L`oQ-8uK0e{MQodiFW)+&&xmUdvhArrq85=EfHJ>6x>Ir?LIK z_JTvS%yZtnA2#n_Ce7E1_c|5yP`17P#QXlD<5&J<-B|5rUC(*kEU{qe#(e^FD>vQ# zQ_}BdYufsC%fl64DlEUB&Q#qlUMJtP_|oIcw^uu9r|JKzyY=Qyb*0VYJCD!E)vwuA z!usvL^PjbIG;c>&-&?=1Zb$jojH9oavd>TMH=6o^clGH7A?XJB^_%}RW<^zy zMN{VQC5Km;H&@yT2Z!-Ltm5CaURvyqSn2D1&syj27d^GDB}#D5ay{>MKe2wF=J0Ik zM5WkQezVUma6aq4bn2#KvpQ$BPFwbqXWNX+U4iYb(|6XGyN7OG)?Z|&%b>SA<>$O} zx4&119o|}C*1XzhyG+39mFpjwY2|k4zMgmUgVyfp|Bh`5DY=uQ^*5!D z;%^t8jXk8{xnk2)0nLJ9#tJ62bu)KJywChJ?_0%#s2h-3Z>dJdjBuNstk=F?jF_+f z?BCPhZ{oZUH3u(0{M}u5x*2cHe#WJeE^F%!pI;Pi`6M$f&~tXh#KHq}zZj&ac^#JF zTf2g#t2w01leM5-QjWcg<*})UWXa^uL0uu`Jf)!$XM`B|KkR2Zby&;fOh^HrB-f3g z2+u~&E)c>2vu( z{p#Z0d~CylYK>Fjme(Sg9|sj5?BUusTlvw8oqOz8sXzSn(!=|}>GIbHv_9)E&x(zo z`9(YLUFW|S|3AI#pWzznT($14J{264tG+RNh#gs1@Y$GRiL0>1*Gmx#RVM69;;- z-TDF|!j(ME?A~?tMY>wSnO`BZb_8ubzlhrHcoCyw!61(yBzIt7K$Y;5GK}Y((xxTgAw%lmi^-C+ah25WW&UU-o$xGW` zF0Q-$W5p)ac(FBc&zQE4l2~ z&iemhuhGq0SwY)!0yW;RxtH^I=HGP{yDz5S|L&&xZC3BJT?eM#lb?ESN~zJ)x{!ro zt!|zi+>5U@FWR|R?PbW>X^vSM<#IoGBzPv7U9_6NrQeE|r&{=m?+LX zGx}ZB#ns zVxn?_?WK#xddnDQ&ll$-%h`M1hDvUUoT-$U`f^(PlA2X&ZLi!`sC!#1;Pia*Ip0w^ z{W;fCujF>)2~KmTv^qUA@@Kr_SyI&&CO^k`V$GGLbu%+$-S2XK+On`LY+hK^Ty2G- zn^Cn3W2?_)?mLxS8`-@oY<|n0hgs*64sA7iVs~1hndNY2Ui;T;+Y^mqnp=hi=KSxo&$zLe<-P&5i!;IH!75qJKqP z=<5)#*qM5c5k=YZN0&YgdA){>kzI26L8bI-m3daYtDIbBwuLq~pIB|Nn^9W$#FfZ$ zZRuBn97bh&4qhh7I_h@kQfk^9HG&_kSAV9t+jPzSFU;9$pK3(*wQmnw_AldpUHS^~ z?dFpz9&VlxlC`wTNWS!e@-e^0<@2@gB?-t2G4rl6a`vjqDq8<_qqp&l4RhWcxxY)| z-^5ElcX4qwT`W`7a@9IkY!~XXaq{d?sk2vj+8emEt}Hqnv|jxx%RRZZ`_}xL73>@$ zuG+p=wP{_?tvN4!r-U8J-jn8}bvyj1#L?X8zp^L(h?4V}9$D~6#C56XoK=tBT5(50*Qu9Z6dtLGW?vVYQ+lDd@=W`# z3DHuOX^whJS}rlBv5Gy7|2)^N_QaL-*|D{y=PKu>pKV|G%yIGSIhm$28tpfwH68n< zckE~M+s_jf+v8@;J(MMVX!hEh?vlyM-+!#g+3?+9(fox^lDjwatrseoyuMRoMZXE%MELa$gs-*?nu*7ZSY79^4Hu5vdKy z=bBXDTcB5wuxat%L-)Pw>P33K>Mp+(XO&#Ov?O}t?^8Rj|ME_ZX3tu4@9=6y+rJ;r zUOXQz%I$qG!e{b?w)|XH(*rv9UT+ZN?lf(=&yv@A>qKSb!);eWVkLbg*-DSEUo~M8 znzUQt=rAM|GoBbquKoF%G-ZE*|Sed zu z2TE3LeNi6~SpBQ0fo=Y(XzpXq7dk&)+;S*4>6VF{(BHQ6hFkU)RU1TcMNQ08Wvair z^ZCm;ol9>X-fbqSYw|6pjDKNV=9YHx^S19rOOCj{m28%~B&KY0?$p&F&HZ-DRi&Pi z{a3p6UEF@=I!!-c_cq$lPE73K?=M?8Y5SI{ zre_y7q__N9+S&hUhU@*;xBglm`B=Tni7G@;PjDUj0Jq-MogGPrv6bU;e}N zdCuAmrl++JPTLqZDeCF_;5qoRd zr{y#J4!qf8%%YNe+_lo|)VgBtD4ouYuMVzWthCJS`07P$p8e6be$qeQZBCANymdO5 zf&Z%Vb-@|O&ptHlPUhY$9^7_z`sL?e*8Q;mze(qsrSQBjKUk}G6}7xrrlkM5v`6rq z?fYB3dmHx|9WD&%TmEV3l?S`m7VZ->lhpNkqqQOB(xVdQ73r$4cYT<7Iclj{J->Lr z#p*A0m0_pm{i;|PHj5|!WVTw@_Yb$0Eeubs+vB@2*1PoImUZtdmlUg2rF^xUH+S>X zbL)Qn*1o6p*5hmBRh92{_rF!d+f+||!+H9n*WJw#^X{(PuWR_R^X>HKSNE@-W5>64 z&X$;F+4d{_zf^hWz27%Gx!>Pi^=$ZZBh@(#nco&`d4>PKmHJbztL*B}MG@_9G$*AR zzWvkQxnXm$qiwEn=;3Gcd5&%_>6zOM=_h~EF zefz7_zhc%|3;iSdSEnspT)x-qP2kN<=e(1j?6~kU>Ayq%wtZWeGQubJFF&3?Tf2JB zifdm}V>33r`?{!V>5rmI;x}yn$#n1Rzh8ah>(@hC$0tpGED|~E+VNi=oxiIdUc7hN zM_#&Hy>{-p(}#9j?tlE@`?1Pe_ZzD)^1&O<+|2<_v%?0&bOEE+xK}*&-v>3A|JV!7dlHm{S7pK zyx(QHsgLgJ@0TL42L4x*33%*&S>`E&QX^*z`&{nYfSR&Dbi`rQ2VH&E`z-cuWchHreGfFpTP7Pi)B5yJueYoJ=hofa75{9r;?LBIZw~fT&;Q*CtOjQ&~G@>38>ByH^`u ztpD*RW9949!QQLCW_#W|W4CJmo0Z`;fnk2d-WZwcWn^A+N-kQGl*PUCF*Kgs{Jhbz9%^cG?v;R)1 zo0ld!L+H7@U*x|fHSa%Oxp>)N`-z{AD&#-eo&25XzToGywfu|ai{^NBXU_}zIxkly zr+8EU$B7}oYd-WGv1_f+Em`*F{QOfhH|1`dX0TrB?T%mfHvh=w{IG3y@vXugry_5J z+XRT5zd!rxL-VtW5hY8$O@0zAdB%B9@kJ@t)$dN5*m-9~RR7H7(Fuzxx_;<|1R6S-_ydE66>RL zW}D0|_R>zB{%XUYt$#H2|D1eW>-NMhulDDs&%ZSLypm_HOTYA;R|vKiV4jU%)l(VH zx0#;`Gs4!s%ii!c<)-rNY}2>D|5!LB>ZkYGudxk(|Lnr&z-cC1XWZ+lIPZ1C-`4KY z?6rxp@vffj9{VOfmu-_t{%QCu`pm26ceP8;Kao59XGZYN@ax~Mo4q~0V%PJR8E@|# zXOB>(BRvTdsWDaqU)qzgGWp+c!4FOn+CL zuhVKl9H&jrD9#FY*6gDQi=`v6jo0bL-Aj=Qp31hL=g_MX%eY z!`;Pub5eM8TkXpCFKgoYf7R@8w|@69BwD$w_qq2ysb85pzunm!HSg@J#FySnM1!CD z=kwZHKc6>!dfg50Y~!O&>(=M&*Sjybr}o&^^VOnt@fr5_#JBFfbKK{~@q`L}*?k)K zgPSdLql^vzDel*!J-XQuDURGI9h z?|H?3CWg(7J16$qYH4rf>7dzO)~@}+b^oS$>+Y|fvu)MA<0<{wX8Y>=xVgK}w^vNM zceZhPcj)K9X)nHQ_%3?5DfQ#+eL<`9b$$nm9W=Ahe-m-Bc2jk#%;6`=!FT6hJOAGC zrQ`e0i+TQjEqU+!GkZ`HuZC5b8lGoYkc0v6FnyYUx}qAgyZqkpktr^UzW|^_RK#%GfM4i&mp(@>FG$TrExVl(2 zFVsA=U8FWJ@8V|NMN|9dRm95wT=8kjvw3%47++ss5FPS&bxnQ9|e0 ze5&=loc&bxSTm{b4DV;IIe1ci_RR0A^qUh)`b6h(Z}W+d&f_f2U{sq>yv^ZjsOTHx z8`Jzw$H*Davo-qQ%k*S%!k0at=c!2_UANbU<)pE6!SDBMROYInO_94dOXT$iXUo`@?oPcBwkhgK_P6Zko(WPBxvi%z-&>aP+Prva z*;>hz&TWdmYL~O-U*BJ~YK#2x!{WCNduN}YZ7QrQ|1IRsw02v`uRKO`uTTFSn40#& zotOF5`D+div0nS{yppzvxb)O%rDNl6k%#pXE?bJa+b2IfJE4q&pE*x%-^v$rxP+hR zOyb%c_%E7SswFu=h9z%W@7rryJkFc$J=w6(W9msIlP}3?S*h#JSRD-rtky0H>g!rK zWp-XZmy}p}vdLvdwpn6Hx8^)7a_mw+#I;W_sa4{B)s3{RqVDg{i6z`RoW0&Qzva5- zrsa+M!hUA1Ue5h}an>TkqrxxFPWaj`cS@bFvE4lWtWH(&w#Mcwoc0BCdFM3EOUvmz zqbkB^_F-PN#W^K!vE@zzN>!6QTUP4CeHUbFZPD^+7vK=^?3)s@Ye!d3&f~K?RZWe} zxj3>tb(u~bSsU5=Y3;$ZqaI0pfo^??Jv&*F>;xk}wM6uP$UXV$zmjBCm$4xN4K`y2eePnYp+oNB@|)br<7=J2AqpXD*zy6js@i`o9yhr*528zc%RWohjjR3LNkIv(8U>YP~e@uz}1) zjd$*vj)(PEwy4;y2o4o>o$)F|bis`W8fo$u(hvtkCpN9SJ){nE|FRuJx(p%AVV z@zf~ls?v|ot7M!Equf_MoBFWZe#M$b3r#H*=LPkeeNQSw{ZH8yxUpw98>I0z9A3=R z_L}o%^{J!hZl0Eu$uL=^eq!&vvvKE-1T$E0zl=|LYq|FI=ik<~b8NPLl3G=(&#jng z?*6yWdFn&ol}6=1HQqX060C1sEpcLzcW|BRT}Rgomkw|~bIRMcKKR`1b6aoxYg0c{ zB(znhcFLsHC3%;%wn@~p-iqPSG+k&E`)G^bQjK^~&up{zlBaiZu_?ZKIVIFyv|Kda zrugBLa`vY$v`f6$Lw+P}QoZsm(X^S#^sXur{~z-?|%OH34(&QdvPFpq1qSa&F!Yd@)M{t)^?`TW|9i*Fr&)lQmG zsr%M*mG!foO;=~N-|C7E+kgL?^`*8wQ_>YJ-*;`dxfH+X;`a4_Ui#d8nR+B_{=%nM zBjo!(MM@ogIps&vQ|IgzC8D2~B`j}T<VSaRHAx%Ic7 zD{^==VfkvmOE+geZ|ZzGdo9C~q>RtA+`o0qe8cV?bi^}u`P-eW_jjK=>t=S*0%p0~$$<&!tufA>yne5UvBHRo@E8#8tm3Nj}LE}ogc zj!7&b;D_nssN8b7bv@Os3%Ra-N$*cHT&Y;a%M-Y3Uij3sUdXF zWT~3;hrh>iyDY!QKa;w?^}z$v$05^$iamdvG-UJL%oi|0cj0GQxBc6L?QS1hdr$O# z{M^#oztd*D4b$C!#qO=u<+bvueP0dz-+k~mxf;Fp_2KoaB7T>Jw(aEG;H?&N-hx#X$dc{K0=K=I>5dygH$V|JD7i{?)d+1|=m-%i6DBo?UHUUt&2w z|K-Y_*&99cB@SE_m|%I`(mlOn^ZInxMQZ=9sJs+PW-+SdYFltN3)XGrri(Pr#)}6 z#l^DP(%-KR-2XF$uk7Eem)gyXWbb_zx05=#HfCpUkoq*AINO~{QFdkz`J(dV{mI_nS69}R z{Y~2W?G9V@lg;PiMS~uSW|;HZyh&S?@q5$TCHg|L4R!C=F;p8b$oLb@v)kbN2Ce+t z2UZE(b}rT3*4om)i0$5i`!C}vB<{@Ie?xw2$ou|RjTu|Ft@mB3_I_*Z)J-|ED=aqk z7a3T6Fzo(W8m_kJc!GAu-scVn7l&s~4ZXQHMlP1!@=9{=#2o#(g836}DtasqIkY~y zsBC}6{{5TlpBA6LTdZc2{`vKKJDZ-pYpzz-PP3CM49uSV`tiw?d-B?ql(*kLXVui- zf5FPS=}+MUyDnkthjBuu4^;Ke)N^E?kSqAw^m|U|7pd9{6Cy5ER}`*!Ki%H+`MmG9 z`o(^_-W1s?)UGSkA-G8a(=hlre@y^tFxAz zP*`_GR?&Ukv}IOT+FpmYoUECxYb(@us>pu(z6Z8@_P?ELd~x!TF!8DzZ%)UbW{jz} zi_?49H2+KA>iRu8A9lysecBxIzjTgX!u|n8&|X5 zS-O=qxovH(!PR#sS9e*x){+~acMfqG_uVcIJqy>a}y|F zuL*tkQUAls**5#mt8FmZ@nhW&i9=gr8S6hhn!sTHw|=VVdnG0T1535T{fc3kO@623 z8AVP#nsa{1LmyVH(!$AAPa=fpEx03=lDcB$+LJ~hAKl+~KyJMfHwG zMabh-3un4|{8(bB`7rcNhJ^i8hgF-L8kd~f`r!o2y4SlG^q)HR@Z;6;`?cR!{aHQ# z;rprO-|s#y|55pM?zz8n+mtoqYQ?#{i@Btok~yXuI_1uDcA2D9RQJ0pI^o4X=X-Cn zTjo61^==Y+>NQ_*u|f=&MYmt?43@?NzD}(Fm6SK%?T=6qtJ2#y@nQNJ0j(Vl%1%y> zno7GS%6AHA2zM;gZ!K0_J0bqDr=`-;<7a##v^|c~!Ts;*Xxpzn+Ji#Qa`tdhmO( z*{MsS4cpU&E}xLG`Tf7Jsw2YIP^iPauu3>QvuME?2&m0tFEj>Ccli zot?JZ9|}oS&GO@zmb2R92Gfpd7XMr&e*m2sH-B{f!ION@wtskV+2&lzd2??uP5 zj%ig(awh8Rc#x~*_|ABG(ObLEb2*w-j$WE6rBb9F_+t5^%cYV3MNS*1I&XV^`~2h8 z@0b6m{Zm)n@LuKRZCQ)-Uw#YkAC~{OWOj}C{`x=RSNb>pSv~)Sx}t#RZl|iHUp4nW z{_yF5Ply;#%aeug7awa;ymIESi{!<-Py03aR!X<$St@bgDC1`1t-0vYKcids*AE}9 zo_X&Wv-7)c_xr@KPmIyMR^t^SQCXJAksy?nEO1jf-lOf4j?Dp+0`VW!P4%Y~ZZgQG zu}pP3<<-fmbSjYP(7u;3hJ4(K;RjNBn@o#4f9z7Nm-7}4d>|CQv}>u`xh5B`VeO2n{WucN<##l=bzZ!X+z;Eps-z<-myT8lOxt;m*(>})zz&JJ- z@-kOgbNv0iJ$0Y|o&9aU@A!NBeR}JUU+;e}e?M5|&w<`Md+YvJeGc3?SE{Hv#?+zs z!LmmVhYS|Qdgyohcg>GE%kjHbZW1HQPo`K;8M#gVv*g%z`u|g|)c7D0?Q}|`P9ggL z5v5P55^VF>wfLKor&&*M4)B{c+v8{tBkybOv}0WLZm(VLWhzB?nV(ckjQh#Gs)Wgw zD=1?1lamUy0&)S{Iu8i_lAhqXWKMBU1P80qtQSg5LaddN@(Olb`l9zk6z4>#_{|Y1 z?6kcl(j?%0chZ}8Y6<5yPw826Jmm5hou`V|ZnW7YFLghp9&pzsW#V|e?zUv>Gl&>j&1+sbMyG=qOJv1o<+h9$HQ+dt(=v=q4(2D zskPNDuQ}bG&8t}PuG3%oR*-#e?8XDS!FgWlndyT=H#i)XEpBO+ZxESwrAJweVVN+uT$j+#c?ZnwC)b4K zwR~#&7NE=Yx-%cMoyzkgoN|Nrg%r3<%2tr}h5?QB1<0WezvbW!!c%*?#k%pGdo+ezL%HgQTNLPK8O0 zOA=MY4Ifr;p0t_HQn6sZ*!t&K=e?grEjiVrFkSN{x7q!b|7Wh<|3P|o&Yho!^WvCJ&essX(3_)l&o!*< z)igJ`XEih8c1)i0g3N{l9eQYtAk!R;l$B;&3pRH?4c{y8LSXF0Tv8|$(@QJd~HOT!e+cTcTU`{sYgpuKQo$J!Lbs5x&M&!#0jOe*f&uY6Liv zO)Y!bxFs(uYrg){bRpwP)1`i%->o^?)_SRHns@a5XxLD3rr(R>P3+`=h|?W*vA(IMIK2W#_xA#A5qr6qF<$u zdYp|%QEr8|*iDIIX|=xS)%~?0R>9vU#kkA}TFias@af0<>neUX{(E)*%k(cV3y&?| zE7c3IGuU;;6TD5M*6tB0Pf@>aeEKbPT7g{W+HTA6F-=r7J6@p39)0hwU8a@d$ z{vds)TjBbQ=NmT66u!Y5Y_0eqK*~zu&31>wOmn5BzbM?*F!EH;zjUmbDel10z|`ft zuM3;qOsptSIjt;SB*xI+vXp1f#7FFFBvvsBtuXwbTk;36&tNUMy zMb&24g%!px+5h(SM^Ud?CZ85QQYw{@+qAdU?a-!W%YBy~54rwQU`h5XzeY{@WBX@b zU|s6}%e9rEoaLc3#~0rVf;ArBPj;&6yX|AiE;%I0@$T#bRi)VyJEr=dRpgqMa?{zv z-K+fNrl-dYS8g`DWO3E-*^d{M>{7C6n{{C!($Bajbg$!JqUpol1C0|wS zX89@niX(74r_Q#DV>zvzsW&W-@JUuhB*;#kXP3yT>)QiPCRz!;W4&^CHIv5VmCO3iuUEQ&H6W?QE^Fy zkpAkbo(ZKXf_D1G?;k$>sj=m9z3~H;ua8%6|Mpz^Ph;5qm)^#GcA0DXtGQK7J;Ud{ ztXs5EBr81L&*5If-L*6L1b8yfx)?pZP=3oKQ%WxAYU69qvb4`mo~yU9tUPbhRDbJ} zy)%oI_9x~$f2KaOFlU>rDs@wBQDN6}1?NOz$$Ggv+?gRBmO^g-TV2_7O`^k0Un?z+ zjwpELmnfOTwcMuWq%4z>(U!9kQ*Vy(J1+nwD{ZLD^GG|<3qSLrbF!Ggrg+uP6 ze{nn}t**BH9g~X;I=)vWT|X|{e?nIy=Tp)A_cLdEr2p()!LP74vM4!$!Q_AdbN|o1 z8!8=}RVNGGJW^2G_&m|gWfi4xu6=b}?f)vz``?edtL689S+8Gj^LNKTi~66;tbZ;n`&pR% zb+1p-ab`2+NwytNreyLltj6l}Zvo>W?WaQL!YlyTbOvjAidOJo+Gii*>~!@s*iJH6Dc-vD!?YahvtZQs+*Il{-H= z>!T-@D{5m1lkJZM?nt4Lei6 zl&Z^(+@*b&MVGKkpDcV*TKnRV^ST0qKNfO4&(aPQY8a_1^D16Eae((_+x%{X7GcEI3k=r0^I7_D~a(%k3nuG#}HcRSnp4Z+fUP?*gY!Px3btiJxDO`7! zVUD-!jamLC>AZ*a!iF;a*|R77JWzXHbA8ImiccrB`E!=J+8?c~?Vo<)_x=Q5A)R?s z&oAB6`k(vX>x@%#C!f5x%k`h$^gWTen&tOXImGX5FkNOUY$7G5WG(W_Y=NS5aQ;ix zemS;}PbRj%`!T7^L__Wnx6QL-duMj|wH}+4`KUf=w)UaZ&1G-+FMJ42SDtrs*~EuW zCR+VWV|}!Kk4n_FWC0#I>DmKwJU5w((!U(};S$%}z104*!4nVW6rJ~X7$>isqj2pf zqj>7`f5$ZT@?{uz8cTR?bo#ciaEhLy>qg!sRh<)8F7M&rpjLe*w0zmBhwntgt$7z3 zP0K00@b_R8ztRlpS6(toVauhaGPmu0cF{$1$DRxe)9)$g4VG9rE$>qgx>?AiRe6?W zUaN@z>RoL_})6ZF*)xp`ULH9<1TsURM6pP z(@ux4%-H+U(){_(S*gbws#|nI zqMui-`Tk*E*Wz_Q-Q{Oz%bq>$dHvHJ>CVXR$>o~+ZkU`r(0ys+hDzsm+5grtFeos1 zx;TbZd=9z&{7AL^_V_=upJ!VoMHLX`J5GFQ-JPZ?(6=!{oyxFO;jEX=pcQThHV_eUDK5f~F7ha%oAz3g;g9De0fF zP@DN(i=UM7gdRR80jztmJ%z09)G-sC-BTyexoudAE+w9a+S_K(}A zRLse4ps?z7dGzF8TKY4;8$C8&eOAlw%NDWLr@iNwoKOT1Je8BcYU|>+%Im`Yyy;W@4zzs#(6qa|(Omtw##wTjA>0HA<4-J-!?02qp(BrF4Ec7_uvUvam8A<1z<>i#Hfn zIX<55$6!B;O=qfx&Z$!e+_Y95t+^!nRONyRhsJ&>jgu#SeDGNM=udHUmw>sL2g|yB zCqfsT?hUOy;jbg_`^)G!&pPodPyc5uId|Roy0gxvXG$~lRZG>%rvF*@BYqmI^kiin z=cCdRt<$EJC}@0X4-zhRxL0}frKMVrR^&Tfx2bcVaa1O9tvh})H}9nlrwiNpwf8hn ztP|8~{r>&ff!x%*N5zs8Q+mU!`ghFhUw&cfSDs>hlTSLzTXyBVywkUf;TF@8PA0<% zAKPLKeyZz!_lOW^-03ay#QFE(oe%5JSxlYVVBG(Pt#f_|mz?~BF3aax)|anIyDnin zpfhbz$BUkFiOiH~);>G8N!akO_qfU_-O}52nzcPe&hhM=;$H66nXat=jaM&LnLec> zYr;#8cWock4$BW zARDLh!4wA8>&gGZ+!-#MQ+(p$_;BX2y-IJVK7YGEz4RW##>wm+u5yCeE9*-FB@RY! zD45@W;fBGE73MNty-_D_EGy)gnIW`f!p)c`j%hZJe`V^mU9!{O8P36>5N5me(Nh_x zy6~D;?iV{Od%7;)Fyn8ZetlB=uF!_6Els8iTzj{y7LjU}sl0f=q(dyMGtV$Ce!&vs zU_mZBU(T3{rUSdK^f)&9>n-qF^K;>HcC8xkTUpbt_p6qjUYc-iXj70--&f2lL zV*QmFYW?noEQvDS!GSUSzfO8;m~A%W(cR+tU&KIOVGqlq%PYM_o4R=u4p}FCYUiB3 z^(sq31z$tcvON)rlMZE`y5oE=(cz;;gGzQ=cbUxeEw3F8ILtHnu{-pihJ-#`0Z(9WXS6e zwOU!JDmZtw-qf8{YEsfuN`CiBac)R^w0%=r)3S{#=2|Yyf3{4$=EsVrlGDcgm$po2 zG0~r}V1;Seufw@1QD0>%I8UjZ4L#@hm}%8bxfLv@)+V|hV@TI#I=s-RC+%LbL?GNSf(@dl%QI&Y7p3 zUM^LO;^ZivwaGkg;biIO98%@4($y5@IDIBu-v6QTbH+C=vEXM{SvKiM_e-1=Xw`2_ zZ|YuqB>gOlZ`_%~rdJ+2X&z*pFSSu(XSK6Oa;h+gmeKEdVQC`UcQ{q#uIM=9vU)<& zf?wQsuA0aADmw5B3mdqtlh~>vKVj)*?@enyY?@{m^Ci;bH0#>SE?sh;cg)*&;6%f- z=2^>F3tJ!Z?f9%=dr>SxPI%>kl*8_taUQm*J4K};qS)k?uzacrJhn0iqap5iP0IZNL-bsY+ZmOjXJ=mQa#Bt7H8RX>+2P=*AIyH$ySlKTG~~h3 ze!*!HAN<1Zt#I+?VOsX&uj53qwBmVhc$DPkG3+$9R_1qX=dt>5ZuJRn{ffT=%sd&6 zGdUmXuogbu_{`3r+HF!@in_8Z`fp(I9u5L(#mx6Fm17c>0)kYTa0F6aP+XqEGQxr&^!N2~#v3nh!>^ zsi^;M-dv!u!T#CipImyZnr7E!VXh3{O(Z$SA5H|8Q14_`#;`%DC4Yr zzuKom$0d$b_Gj&U;?nD`rdrM9;`Q^lj8vhcg|Mjd`pxr~%y95|y6WLkmq$8xbGhfKe z4J^vgND@j>dvxY)0ZKUHlxaZx$f*Yx48_F0NDnI!0u6=l6 zrquLBAptpZ371(z50?u0EKZ3rD6nXc|HLuNORxRfa`giHoh+^{adK;qX|_&zBkIKQ zb6PF?DZO3h-+0sSRmiB>DK|??guGmGMMG-+&Z{D&qM0+FsI{)iU}IN&?RoxDi?XR= zQ{0UC=cg?F8@M8Cr>W;;%T3XNH}5t~=D1MilDzu+Cl(PeyU^KF&TQf;dc)*+?CkE8 z{)>!P_4<}OIwc-7%33w^Y@)?1rhEOyiz^?t-O|X-&6}8Ben8l4;@O=t0R>`LpT;^a ze93fV!bQ%)5J^4z-p4cky_~(z;LGy)_nu1hMNHZ{ciMb~h$IdFiL-+KY;oAxz2rxy z-j6-nhhJ2&$2SSi`B)fN7xYv^An4UJ<-bdRv)#&9S)A z!D1x8c#b^Rg=OM-2ZN@a*t_CTlk2DOON$?5WSmt{tNK4jr*_)hBgs#$-EO&^UbNWy zSo@x+*d2tx@MxBv%@&n`0>!lm^kRUT?y>G3%*rTd;yJk!me zA<27=^GEAUthF!6D9rRf@X!5$?(d1`7d$v7aqdEUi z81!nTKq<@g+UP647hj6>sI+Bv>ZtkE&r@A+U9Dxo@yKPG{pP)aU!9&fEcmj1ZBq~1 zsVCchtT~ZBUuf})nmq5v9}?syP7>ZT_44eL^0WoUhgT>cYW8p8tCp17eDIF`qTi=3 z`|O+;SK^(qAn8e;yIDa~bV7*}pJ(-k>6yQNRR-T(pZx2-RnBeZKRN$z=l_wKzyIF6 z?JuT$Vww}N@0iQ^=nrBuCp|vwazR02(h=^C>x+Z~?y;CJyEDgRs{hjb_=%TeF1XkF zMmYNXQpsqrT5KJ7#`sCc>6wm7yysmw#U&p$*|2<5di2@h@T(wQ&!`pKJo*ZYO)HHi z9RJKM`D4$rq(xRw-f7G!H~cuWn$b;X%KS-7uEageO`KTX-WuT1Xfo}bQjg*KnFs1b z^saJW`SV0@+h&u3r8g~4-4l3s&RN=&i}w!q!$Kh&6^-Tua_M)j9pc<-HgP-N z`Y+dJQxe=(q1NnKCsLCC+4S;j-#Kyl*VX2}-_HH+-trA!wz$^W?)_&KRMHjWVXtI! z>Hf4V?>(83zv}mEDtXmZ-6~qZm&dTbZN~Kp-)$TG;$P-h`DZvB{PFcywvLgbhlc)3 z#)6jj-$M-Q_PVp&Q@$799DaL)%cP)f*JntbY}HvG@7%fmzIIfh)fdU*p_#0CbCgO0 z3S9(dSsk#yBh*hiET+rnzk5(Wb59>`Ki1k2i=UBzua@ zZ!%c&{lh=U^X?xTcwVkv!t?WnwoIYm-u^dhnRpMe+-g3xSU&KU`;LEMHJ)}^>5tBF z&dC*Ut9j_gwJ^|do=2C-VFy_`sa2Ei1-^UuGIFlOl8J2Y$1WF%ly?;x(w$5poyS^rvU1!3_Py0N2FRs7; zq$NM?q`TFReL5YE&fo0ARGs)cqIGo}5*bvD%eb({L*xRO$O{02jJ z=8`9F59UOe)S6g`yqweC(cEDZedPHO7MaSPJL?_@`dF$soi(^<=&?#s>F!;DBA)}Y zXH5juKIfMh2=#FkX}>7?b@~30KXUhMcCg<5c#^L_a*2oGqMY03tD5aSl+XTIaa}4v z_(kj2;F-nq?me=r)+(!cXzVL!Vsh^ZPqq<{&GAKSH$Hjmoml>n&Aaf8MeV;?eotmT z`RmN^s`bDrOA90IsdGzGRHsd|*gW@5%#-OcEOHaX4TKlYsJr}eac1-9KXL2czC2sz zdE@2YzM5hy-3L74e(jB4Rx8ZCSA5|m)10V#bMASFojIer^v|5#8n#P46AhwvJY40# zvF)=b>(b~WLM-_w12t>HRErG6{27zn+>dxw5)Sw!%k=F`L$w z%wk_RwQ^zctfh+^l+IOVoC?_!$ivbmEu?r_>W{$}n@0^@eC{XJ*XUih_x*WSX1Yy^ z;Koay)19we7G&X3R}b{qR2u&I`kO-$an3xKCLd@n=U7^yCO+r*v8FRVu2rx774n*WY4~3{Wf*Q(g|9d%*2EJ73E#Tr-YvNo5eGA%aKmKS?kid z+j1ICntVKPMXtq4a{hG5__Cs>_I006UjC+X`{9$k-@6YqJ`umUmE*dwo88JQmfxA? z>{{`*)L-lRw+~-j6#cLEo%@m`+R$Lv^<9u_--MZmD#T5bXIgB$V0TzM`Lyaff62)q zZ@PZit@WOl@`z99-@+T8zr;AaS2FG}knO5@#>d`q+C{Iw>R8Cx^LuO*pLCw<vvO^ zNVgrB_BEnS<&?NY*Um2o&7>1PAG^luq$FAR)Wvrl(;?1#ON6FXmOZ%6D!6JncX=SQ zw($IEDzXw+-!Hf(v2%t4d#ddQn>m`rSz5lqQyw!K%34qJX#XByFLlOHzN+=^7X|iX z&-S^7sQU%}nmD`tlUn0h_lq?l6W%eEPFiN;F8skD!X{r$vNzr8Y@W*J^Xqpc7(2Ot z`DoBG%V|>Cr6mzZq9ij;@QJ*MbWjL-v*t+lhm6<<*Tgr^_tFyYyYR(w_q6GnCp^yW zJhk#w-)zPPTlw3*szg% z|C%;0kFxMy?a@|xv7~9|vuWPE#P1TvPWv z{&3lTxn$f`gIdAa0v>NGcgeRW7MxdqbF3!uf$;0XGqL8=TuN2SJx|HIyuiWcXypZ^(b3@b~n(&c055m8UO@uRJ+%JMi-Z+23J5Crt7y znjd{B!+*tP@lCV4Qc@jj)$P{v9o%~%?dI9*4)IM^DlhXa_SWyO4NOma@UE*QX2Ej7 zWlxvvvR##3EOjsVc#pMnG+)7t)0*N<|5q+}YhPM#vFMHJUUiF=@>B0UC_OdT?%4ZY zhsQD(+^r7EM4VE*YqqFx!Mw|1UtUIDX8*4)Q!Y4vVb!T84L5EqwG*+dvRFCANBmat zM7LQyN3)g*KMJ*qt8w&Q<-ixzH!bZp*W=d4^A)E~FRzSXbeG=oocDeIujl>?<-eZ3 zAFG#TF)zNixpwiJ(xwuhBI8M_zQ^{h*#23@WtXSG=7oJ0haKwP&XKjMl(Crq$Ms2Z z(${0#jrX6h>K3mm_1VP`VEvCdNgMp7)!!I=obW)TVu|@CFFT(-k+XB-#Po8C_H3v&l`~C+?8yxPw^{|@IzT4$H^P23r6(^qhI2-RN%TJkq zBv#DsVPD%5f#n*j+=U$*#RZ)XHh!-vHs{;PncnVK^Fk_}!Hw&qV0hJ>&r0nkZR)Qz z6FFWqibPrkR$3---0?l6U4A{zyL{5`*+yzA+Ut()JUX%c=dqj*PU|M}K4ndBJe7Um zK%&7TH3?U1{Vx)yd(!wSK8HozlF;ll=8KzYkg_Er@NfW|%N&L1hI`#}nr2CJJhnMiRG$??gUh6F+=N`OV6HTQQ}Bf7=9p z%J6B*JxYAc`oMLun87viCv!Tv-xm5>rruHQ58n7LSny`)g1)3=@%E>Mu5M2@3d=E7 zuX|RW;n2q}QhHzYnPs!X<4zVX_VOeB2TEj?v_1L2r)&^@!|~K3|K@g!b_HS2OD{X` z)IZr&$y+qf;5l2l1$Who6GtbmnaNak=IE)TZw^meue?TDppj*#-!U`K>Nyr>_m{dI z`T5i+^wbxt=M`)JT{d5P>a?ZN0mjKWl9LOTUw3-s%le$j_+7{{H#5_l?M$vc{_{)% z!alA|7YkUm2Id&T{n*H?Qi3o1w-_RCw=b za{t++^kL7jo1x}Ys>AA_=t!$^S ztebcG`i9!Mmv3)Qc{qFDG44GX1)0fvWYTB&a=G>C_D|v1epn+>x8-9JgU9MmZD#IK z*USCVuSQD>trDId7CgPSVp`@jo0t9K>wnypI6wQ4+Nq<9w^hCi>kUnxcw!Zo^;J)n zPj?oY)p4rKe|GwU(o@xT!3@rvIOC6!XWRpS+xP3+oZwTp{n9?MvD&k7clyK{-hZE1 zcpMuKoVZ-kp1~RQo$KZYuJ)~Cod3nJX>+N6M2~nG{ zA>e`apWpMsPUY=%p3FL}{nV?NT@y~szn5!y&-3Ba`;*F#ewv@B>Y$yRRD5D?@*Bmu z&0lg(2%g-r>qJhQ_Ts~PwtJ@?@DPwI>St2bF8Ch4EtV}LMe1VJ3?<#%y%YMI{svBO zoig<-(~m}RIcv4-bFnju>q_~1)~|Xe;(ubp&cv^Z=1Y2h&t!{9X=zn&J#qZg?vRHq zhYWp$cjr{GzHTY&ntf}}F^QUM%{z80l(4b|SS>#Ay4`s}s94Rtt$I2WPAdu@*DE`f zUK=cWK|sms3+LRNxMq*A=ZbprbyeRVF6Wo8^Lnr2xBdM#?YlYu4{x~ZX>ccp(Lky! zPJwOm|30IoG7R4T1Wdl{IW(zZX~~zyAB+ol-fw%alE7=rop3|053c=-UhOg`{XbKRhj&CF)-0sTcna2{(TV-y)P@@m40K{}Klu zoBWP+;lh=EDL*IevP$2fyu8)zq)T1Fll*HDuMR(s;3q}`n2s#XZ2$fv&qw=K3oyt-I6fP!T8*ri4R>R8+E-G zS-B>jnDMrAN$13G4~rgKyVwOZ^zwyz=kXd$*!V{J>CM&bTeD4sP6bGQ`o*60mMt@Z zB`&J(?4A?vrPZz+@miKOa~i*V-S?xr|Nr^$uDks9|M&ZToag^_oF0^u7~S-R_nN)VhaIktN8SgWyC2xc!o5HE*xT9H^c{YPeX>3?Yf_EJ$^Abj z)J>AheZ?rSZAMEV6L;qR1Hm%FE&o$ef+j|v`QTdhM|SG;B*u&SViVSSFXC)4{KolD zoRdf3SKsBs`An4)+a%98xI{vnW22rs!`taiT&rdzEl}a=(`u z>tXo?TMu-1ef?T?;C}rtrMufNe(0O@F{u6U(`O#PE-d@6?(x@O^E!jRuiT~HBmXDg zS#*5oo~r?j2R@kDi=@Ua=<6|R-~MV_Z`_7vxxzJ_@qLr5uVnm4s`Ioi_~Mghwtj=n z<`1hX&ureZ?85917ACXeXWc&ac<+t>lLBuUR~icy-&)u3_%4ULT54j7)47=uOD?cq z^pm-tF6_@Fb|T#F!zQPBySOIK6~6uC4abSVwl_yt>=j+2lM^}7{p4QV&L(r#McxuO zdlmXKjI?$$mQ}8aHaQ~2T)H}G$s`GSe3#BeL=Uwy8^DbE3qH9w+Nn?)f zEDsw|qfg7&-u>a8q{5xB=b63l!}?PZ@|D)NO0{wozj3_T=QfQm%kGrXCyA5q_nerM zmteb`wak$%YSUki^t{__v-XHho^rZLW7ej=gw_+wS4^CL!r699q_)>* zT+n_(H>YHU%`YY6qQzU}&+UBbQG4b@bVn+$!g=w4lbf!ZOtSUfSO0K&eZA-ZpPIF` zp5piS*Lq*tyQenVCGelj6#08j+&YyKjH|qVPkO)Y$YFji_NiZ(YEQLZ{I%)K(G{6O z8?5*3sa?HNt4q7s+wPU%$KA_3;sVayNdEYUCF{E<_fwgQAHC6G8i)3*6K-XHYxuRb zsJin^5#RJ%wyy&lJ+JhL=RB*_eU&Bh-Xi9Oj!Mk2ld3isp6#A~;H_n(<8d+D1Ab+% zvO4bvF1NM$uqyBipH0L0WlvjenPxAYo--+_tU=|m<`YGJ0}h+Kg3FvNo8HW2JCT=3QNzVqN#>?oF9@kZn`Il2HCl%9c-VEv%fX5$(%-d-Ik)HJ$r={wDrT ze&{9i_i*&D=6bQi@*lpp=Zi&L+w%0X5SL`#1;_YPhs}TZeb7BVo#zF+SBvZaAJYmY z_BBR}6drthd^>l@an@wcjrvPHekqwWEXdE;`pevMg$bX%+6K$=bM2o4b51Co?*8_6 z!+u}4>SAu!H%SiGc83bYs!SvQOFFGn%X9Wj_WH)f!PmH5<&y~acE<}!ljT0`5vw%3 zdHA<|Vyt}s*51hK&l48;+?|lhUunw7yVvF5T$47P|1R_NvsRzaO}o{hdDx;+Y{r4v zS3>`L`4>IESuiDVlX2jzt(6zM=In5dcztuF!rZ0Bb~o6vRh_1ul-Ku6j<<)c1$eYT zwYTWv&Ba?xW6AHG?=xaavqVa0xR z*|i;;@0rM)h*NFTaKGud$3m$(RA%>S;buwOPeBvU$+;RR&;9Px;rQ3a=LUQCn`0*; z^IlHRultiGyi)&i`J}a9CN$aoeCEFAcOv&s74@HiYwVZ&XQ@|EjkD}|Z?|(o|F0m? zkIZ-fE48p8gb=!hzAwJ$|Q+_f!H|{K$tDWNP zc+N|a$7Onmm-bh2BMynB?j8$ULuQ4^$Z7AmWRn}=k@`%$B6}|Xq(HHEyXNW}n_EAh zareX<*@`_MI(F2ZJ=-_;ee!+18v(Y_b;lpZfAqO|r{V0e-W``$uh<|sW2$-d(V5pT zT|AWVYRZ`#kDhk8u@qZOcp#k0q`)#Oep2A!H=Bx>r|&({sVri?ypz)=DB_6esu(9- z!IKs&?}XUqd2`>KI)_zb;c?$GBe_Q|bqA80Jyp*cP40Jc=!`8Z{lj4O^P%((@9pn3 zT`y_+@A}R5P3!H)M~B&cTIP#PdeDDqpJrZMe#7r$k=;d{_p&|xH!9ixQ#3Ln7H8K~Pem`_{@8=(K)-|ts&z|S*eR1)RuZG** zMJO&@{Kmtu_3rbXIXC8}igY$8RdsZ% zS=v+C>XDGIsI8(oA+5YYBjVJnv7;ilBX~mw+qE{xyE$T216lnUvVZF#+&nUQHnR9S*<~@@)O2(`r z|2|DTw_M|yn{_*9@VxC^irT41Ua0L};9qk`ZnyEA2B-Z_RXrA-9EU18@3F;KO1|K^ zqdxDk=(fbtP?Ixnn>CCh9pkd?nE7s`J_$JS;X-C?*WyV2`R(QkviJ6}oY^IkZ**$? z##7JF2T3tCZ=ChW;pU^Op2y4WranLN%sKmee8R77Q>Vrj{apLw*!%+%d6eX(q7@4? zyO#Z5DDc5j#CAe!ZON3)ZxKXfFCTCH>lr0k&8yo#2ML+Wy zyb=0gJ>!sM|CWaaVOzX3rG+NmKL5lzgO^p3bxjG!qxJJX&geS9*fHmx+>sL#=Vq!H z^`CX+b2WZ@!0Myp)0`dwv!5|ed^H*yl43o)lw#&FP4q7QePM}!+BuUF4gCVwqcamZ zTIzoCZm`gr^xWp-#f>tJGb`OS?3V3_3@bSo+BWl+{8Q`9#5u;w2h%ssTix_UeWmN# z%9xHKwwS|PL%yasxK!DEUdY>c%Z0^F&D!z8oxNutC+xXymVMomZO$T-&WaC`Tc`5& zJZ1CMx_3dhVZ+YD6%!s!bSf0+t!z*#?fWhvS{FV~^Rx@gGme$XOG^1a^|XiV*eZTt z#lzc{MTbQ`yOpu0ywqenbKdy4#>?^vmTgHYvRn9_WZPC7clR8#)0lF|DD2X@18Z+B zl4kvx_O8~gYk$%~5kKaB!INy7m0Lq}+-57C@6p{Nv^PRwhV0`r%YQX2So!$mYL4Uy z-}~K;O}%0Iy!d4Wr#H`0RpzCSVx8sgwoVp}`14|w*c&sJyw>(N_X^%VlDvJv=+GRo zkjL}FXYR6|T({^+x|o&J0iWQtJua7m-sQWooqF)%4BMQAj&CcS%Ipqil)pQ;p|DFr zng7V4^TyjRGOhnTx#iB;lfEi5{1#1bV43#J=dR|w7ZSIhQ0JZYL8w-s!AIoR*VhGoc`tK z#EK`mePOb!?R5L&-rUog{A8a>oBKlVGmYY2;<;R3E-m@_LoK56(7Be0$Is^YAJYA# zZt{)e&f{b2&ggNiaM;&V^*HBVj;YNC7u(+jk3OFezVQ6h+x8_=J4JbHzbu`={j+7~ zpXPO12NzDyIKTAh5vwyB{GPcf@?I*;x9&(Q+G}XObfTvg>deCdHnUp`O}jf z6q>ry^s{Bdq$KJVR2ErgS#9{X>A!{OjSK9&`vOn@67l9V@O#7{A*MRTTkVOp-_nZ@ zSp%<$95Z@#F7R68oYSm7zr0fVviM;_?xv)PZFMVM<(XLZuVtADoBcU(&C5{#=%MF6 zy6eKK#q6B5BCUH{4K;%PO*VO$+Be}%@6!2O8!8-xl0t5@EaSU{WrWdv39L%JdFt1t#s) zD{>b)c^fAADspW#dtkMUMdF_P)bH*mr9K{T&Uy3ihjxCXBIEP6B{xnhoqoULx0@rY zc)BC|qZVnA*@_3Y*iQc~_59AX6Sq5dPIR7da-xgjWR25CX?E$or5$Fa9?RJm-}MZe z<}%NOi>YtrqlHTy;*9e@HVOH6a8F&zyW~mKiK~~p-zM`laT|+1JN7Q+gQ0Ax!@HRk z(`LWomRl696UU-?LRyIYCAuHKcRduOT9RfF^*}~w&J8a|)8Bq}XKN-JKD!*`^Ga}fftc9e6 z5PJAw!P3?>)9(t$P84m}CAubm;+5D(0Vkf{Z*H~Gzx2=dGpMO{Prmiv&zXBHxAPx( ze)8blC7~jVb{ua!t}s`rEHtg`+Ju=h7JBj=JN%e@JK|G4;-s#2TjlI@lAPPtu;)9vSRr@OqHzMW4!x8_vbl=AqKjh=7*&v>4$n0?Sp(n{mgt)oqU z3_kzbq;%o(u6~Wnv3JfKl1!hc$h}1?b>h^{E6W$Bxd{kN(A}N;?O27-aUI1?0*({R z8cZyn{Oxb#Y?e@}c_`6x(CE1GL_MK`MaHk2FLXTF*pjMjR_-f)MRdWO`zCI($#yGP zrZ+wO@N?2`o5nq7n-bO2l+PDwNpSHnGAo{$xXtL>6OJt(POBC#*YUXW#KPs3#M0%{ zZ$+PxtK-*y*MI1{yQr=ImlGQ4U&K2!G~ao)Js0D%+`Q!oQ@gR;pClIxw>g{|U9m=q z{T+8$PV&j{%(M0V@ zP(MvnZ({etO&206Zyx5l65r9@EG)*E(6Vn&d4<^Y*}5~A9d>A*pYhGkwSA4y&YM$y z-)gb#&pP_%QLBFAu@VjS89$Bv4=Zpj`TaC-^`~2olTI{c9d15SX_a1n>+<>js6cY#CkgoDi2aE$z?P{*z~KoM3#Yb2xG0E#(_QsfW9dCY*_sd7`8yCSmw8JaM*6clT_jbq}apVfT)t?wpPuGdqq85tY5ubiawuRB6`*OQqRWp!#(DzI~I|Idj+Vsp;r&755;$gcN1X=_5<@|aKg3&Yo5;8vFuDVnnXr0MEmx~mk5%=^ChJ_~&?Y2&`6*!dP} zFGT|;mnhnCx7=C9^RuMe;jNgQWdbi_qt_jm6`M>Rol%+S&Rz8FchBGLk1u*pWKU62 zo^cxL~^vtQ?JeD-tYhiOk+!?f26FW!5*aXR~{1n!k$5B1hE zW>lXskPqGWc!GN>)9;N*8`x(pyiw-1K7!}(MV{|xR_mN_`oOl_M#=1Zz*@h`&Dy;a z3e~lYDzCgaw0E~cW2;GYTG5H6&d=L+>%6d^m#NimY;^hqLynpEmt{6-hYhtB=syx% zQ!@9{1j(05q4GU71J;i2?bG|G{k@eYExl1`lYE*f*Pg>tp2x%&1Trl7s-;p8_4vR##b+}l(-Y-W zjw&4c`*?yYhiHrN*KLauY?9miMD&icPkL>vXK?VT{={jQ9ro_f?>Da3j7n21*ez<7 zI!T%}{j@fZ$NHPLpEE=j9n2EC^x8x0lb1+mnx5E!+|AvNTa{9$w&}IbmWjSNHOP5O zj<$Vzy7}{)h6j6@=Opwtw+UD|rK}a)dtTQ-?t65Lrp;?b-#3q9k2d}mYGi*MA$8@^ z^J~ndc?>7h^HiF1mZXc^&`5d`aQ5iRK+QOrR?q5(8o_67hXigjc;lAOpd!Fyd`2fO zQ{}@6H;r3dOFHlTRn} zyXtC)a6BqYI&*55l05Ip!;_4>X9#Wky>>?btrgxK!3>Sj=WhHtq3>*QIqt+E#p3e` z4@1R_WEuKYK2+8}Q9ZGRpUuDfbaJ4S>cKdj6K{Gfe#)>3hVXGVwmtf})m|d+S$a?A zM0JsQmTxvrlxf@XD9Gdub9v_{ucnfZhLR#@j`lNhdN4i}P_I?1D~gWYr9Y|1aoY2? z2UX{^J>zKYsem`u$`Uu0@-7mWsMzuLfE=fy>f5Jz*EPTQ-(=cx_t2BMtdliD3QxCA zexmeq(mlK6`}XqAI*tNiIjnhx4d-0a4oylH>H8Y{K_?=jp)dc)(Paj2IXY9e?s1vQ zU(6xlceHS_s!Nzb-?szWGOpYvUGkOhRjRbtJ@`52^3G)D-k&FIm+pzw43O`h^+Lo? zd3VVNg>+8yI~K>TRYe?1)IOs*EjZ;;vciQ;w{ivNyYhOinxLhsY|mn!IcLePr@plw zEG#pOTjgt<#lM*uY+B5A{?1QFm&>n{7=(8GEAd~)_+Q+1v4QUj{VVaE)sdNZn`$34 zRp-S#Nxb9nwIg)t`WB`{t4cD5=9}jmnXNxxa@zE>HGWR@vaNS6 zS#%#dccR<7a)n5Tvw}?-*NKFK#T`cP)P1E~w%dizZZrCP&hpBMPfvAil0+geirwo_ zT=(VEhLaKTR>5K)tB;**-TT`~-N9yZW3apFg$>5vJdVUa5C53*J>-mTa`TLvDvN&{ zNj98g@pwhZgFKHT2W2cCT5VeYXkvI&gxfv+PaC#W$V8nISDL@K{heEmP1p7$cg4#- ztf_B)eNKx17Af?WXnzI; z6xnBN*O2(d`>+j(Yx@OSq#E(vG50yi_!V;bsq8+UBjdWtuT%i)Yv-jhWKQoh%f z9ZfGgzWh+!1!LJiBB#6$JWRB1+*R%PVjABz7i+1P+%|lo;*#&Iy^r*~IiRYwS()YX zw6*&ykE(a;Sy!K#Vj{&9!WF7nq9d5+98~s4@mUL}QSz3?FAlB>r~l>uKl=2ow^y~F zfqzKN{-YYZ>X-eP!l!%uwk>mwK*!}T&;LgMYF>A(b4}1W?=N*ZA68dK&&rQE>d?Ci+K$<##t7m!3 zvKEcDVjB%xp`ZOpHx!GcCFeBvl-WMrewO`HVYg3Ig7}Lg>M<^PQ|DH6&8ZEkGO$ma z-hZ&rdLakH!UrC4e_Zd*6qt6#S?b+s_4!^`oNE`=Us=zP8NBAHAItaP6C#E;7JQvE z&AP+2e%>U_2H8KA*PnlRz{2?=>UoNhvCCGGJT;D};uG}=b^*RsJMPa9cJ5y!x9#Tw zk0Zx5tJ|D2KMPM|{A~05ppMdPSFfT82ZGDq%vfr%wNp#T`OHGGnXV6~=<=q2>dNyG zdCV!IvU0v`<&P~h9J!O$CDhC4W*SB9I=ATEox{(zWiR=x8M)?Vy%qP%?O*y1zt_L5 zls`p*+vc3~=G%)OIQs^_)X;rWlC(gz@Y2zUiadp`)%NU#;;e3azOCA@Xijq!+l5n) z+u{=f9y}9&XZx{+({Cw*zL-=@myv?2t!198c=r*Ff39&CgpNFC&3ah;zW2K-GZS}i zmX?&0VX?q<)lW$VHUATze7+j_BK=*5%Er^X4%skx?tLPo8pJZoFzPvbNkY{NLsWT`Cuzp&v5i-`h-oPNV6Ey9(KKPedw{B^7N#w8~vJ-&BcDdm{cuA)CZI@^_1DrabU^rV$Xe0f%I*Y@kP1+QD4 ze`Q&;P=@R2wdy!Y&vni2H=9Z{1P@!TZxwsH4)6CEB(K&)<25$FkxWUQS1+7yTc;gw)sHb1N9)5!|0-u>?LX0eM@R15vC%o1_WOV$1JtyHH=%*l`cF^lXWk<=Nz(oGYq z;*$K2nn`l@6;AtiQ)#a0sgBpemFs^Ta$q_x^v+n%JIzyrZF15Q=fDNqA~P1G^4M&1 z(N%t#;N`N!@IcZtwzR6GxY&7ayEe$X{#_}esB~xE!l`C+{V)8zsml>$Sw?%pL*rYZt>-(a^E1Rds z%2%MiM7>|orEG7>6W@D>yWe-+_psgI-J2$1vG2o?ooA#Q@3P0;JMO6QfoIN|z1Hj> zWsGjA-kyAlVY;MDih}=zz8%xMwzof1T%xc}d&6?&eMvfvnTlM(dp23K9c%Y~meK6{ zYC}MzWu5J*1f^x{Axs>SLUu~lmYj%B(Nw@tdK>D+2&%8mkoE`o?SBL z%4c`9B=DKcnw9s`MBQt;8ROFPGv>v8<227~(pG)6NBf*p&^(9FYU)1TyS~S+GN}E} zXE0~yB-=zk+sS)hPFi(LjhTf(rb&;lh2JFSz-g&PI?ajxC-YOB<}nm6nBK#s65GD# z-;{;=i}K$vY~B$Hi|{7 zr}1c9*p$^%wsX4EUb`F46OVsO+Gz8B!*~7JEG*|+#iz2yJpOZLv(Sz9sDRrAcUt-` ziXK04S!KtGrdH=2$AcqfkAI%9d@F}evh<0g#;1!WxK7{mM5M&;$hs5S=O>E1vbx}r zqVO!xT;_~w%N;%ib}`S6Db>f!{5jrC)ofc7zdW-eMDgqy-N0pn6Zl`OJyLse+s+fK z^*5|{sXlu2J*!xiWiN}%W~oU`x;7hT%)Y)PCneM8WC$;A>M{3sF+Sq(NAo{j%;zeVrPi<8R zn|+ta&bQfmw1Hn((pzAM5aY+`Y#W)s|9+yt&DHzyOd7|8&ntK49C@-*?9IcIZK+u@ zOlM}kNWXSua{j|$ya&$IehM5s+DR@-ofg(dC^v#onxc#?TvSVo8Si8b1{ zJRWJZ6bo!-mRen6@M)v{jOpJ38y_USJF}@)aq`J6>33%6+?)C>zwN+ZC!N{mzb1V> z^~qhxxKQGFZ=fTSX7o-Dl{q`3kKSHB?abB5ANplglWWwHJ4Id_zPa=C?ZutD50uI5 z@OH1u;Il065ivXXyjUdVb^DY(X-az^7cBmjnlbsfgjnT9#a6yA8zowegAYc%_^_D6 zCnDwIcpE=WC0K?Y>XuNpVezn-#K_ zO~v)tIbrUW_#cIOK^;MQr-iSVq&3X>ChbyOEZx=9;>UGHxo_gN)1LLubSy6abZNXT zapkRw*z-*%-X|T;dBVnBFFJQoo8bAz`=9PVgslZQH7jr%|2HFUPy6g6PTa!DJ0BVK zADx>SYM@uxdu8i#=WRtMOYVpm&-}Zlb4x@)n*LFJkH-hSI_Ka1x?>%`&V-hOvJ*XO zXQW$tDY0cT1TR&WIqGO5-o>VPN@5$&zeS4$MSDzM`(`{pbEWvX?vadj6Qi%L*?;pc zn`E74jmZfPS(}|@o7nm!TEvCUoSQ0saI3VI+ovB^Z^>Ga z>%;e3=A6vNgDLZunrh_7F7Gq^Vqa|g=49GJU6w%gUqXI&;*Vbtm>Isn@eMfT_MFWB(8D?v^0w-)zKDaoa2p$8A1nJlwpR%2W8F%8*y zGS(k=y7V8(vt#yTFl0Zene@DK&m*Vx4FXaYhZ;;>o|T)a{CY6$snX#YHzH3Q|94@M zU*5;26Z2I34qi_WTluDn+1gqr?Tk$4r(;Xi=b7-dXnpqVvph1>f$zWqwWANTs&pp> zF8JtwZ(Yl>6J}ngT$4K9*eF|z8PzB>O55DY;rzq(lHu+r*CrviUBb^(eb4UF?`_iP zU88VnlBneGzUi;yr#bg@eNtMnhn*wIS)ll7q1{Kn8?z1yuzfq^lpoJ2S+NgGCvrUQixremXlJmSEBpc-C{r zUg_!+2j@+RciS)Cwk)uTUSh1V&~A$HI!(9M`xoTyou2l$P-L}z`x{f`uOGcXUb;9- zQU9W=cb}mD1+}ZSddK=#JU#QQS6_DOHP1Bbt3n(xGc50Twoiy(>?oT4W%BunOHT`V zEza5B^QKu-k73=8=;u9U2l$p+Ec3I`W_tWpFo!`gK;Gd5)9oh{gi^gHvS@cGtSG-z zX8(nm>2jO3_k4{Fq6^hdRA|51B*@KiY0@#>ybY5YAF-6yFD;!|nEKA^^^AWT?H6ja zBq}TIb+lS}We=yLM#q`+2PO$GE7E*fcDiBtmuAEDJQq(ku$`Wf(f*Us;_dbq_D?4| z&AHve$2qlc$2QgW>%}Kl9cQ0yApi5r?V0A;!a;ZH9;vRrQ*`T7b;bXv{S{A@-YY%~ zUlB89^G@5q_n6R=b?+VSMZ6y}{3oBbpI9N5y;{^9g{i$B}* z|KETAzixNT`@h})KVCQ5xhJxC-|yebEEP2xwR_{Q$LwR7Z-0&F{VJ94sWJj~Hc|XX zwXaCr`TFl+M8tFE%MKiG?D@q`hbUwPCAIyL;k?kb(q-C?wcnjS?ONxhr?Kyzyh89t zb{5C^tr@`#VdK+!HD|ShB{~y-;C(M`Lb)Vn5}Q;iq|Xb63YyA~O+0>SgyOU&hLtOx zeOq{ME92o;k*i%-T8gq}AH4bMrQnCEHGdl}ZM}84`r)B3(RVKX*RFkN^=`ecWqY;e zan|cv$us}Qaf!BgG{*c}bw^e}cc0k&(5<1Sl1GJZhIYmF&yWwWa(X87bD7GjNdc3u zEGVvsyL98jQ;v`zZM(~7_lA9Me9ivN?EBUQuDa1t0UIKo?R$7`;)|~lrQRAf_r#}U zU6D0-uuJr0Mv`q!xN7M28I`s3ug!bDao^kb@@urDHivDJ&9YRe*<<1+*SY%a+gX>3 zXZ4;Fe4pLDul+sa^%&oo8;`z-_}zF#Xj;N0gOyLG9^A>?W3=>aoo&kcuLrKq`Q+9d zkyx4FF*ijx?dpn&aoo#)={{W=a=~beipRl-mHRccL#8%-xVf!v{`1A(>cZbn%I3ND z`c~MrD~po~C)6ole!Z|DbXn@+NM6ODx|aqk>cXxEUaK?BIb*2NYR^_ZMM?Mfs^d-b zBNyx}dbjNz^Fyw4WwFP^NcUy1!y{R8Jebg0V;pC5O)qgwv)o#}b$7kfpO^=waY96ok@wMsx#{%~bR|^*P zUz@asGskIN=bEfPv-sril|DK1FibINM$y`NdJ6x4E}S;|)wP9to;-T@F{4rZ+UHMa z9y9Fk5xn-*Jh`(f_jUZK;`6C%)^D2D+0IjRs!Eo_{HbYXgRWSOtI*x5b@9i})o3@! zy?oDhBi_yJ?Kb(|p8hZYPiJi|Sdm>Rcs0J`n8#XuZBstW$SX|QY8h+vmpVGkT6bCH zRQ$22oco`I$)`oD{+`!(rk6XZy3onHvHxUm$o2hGx38MvY*P_hE*^Z^p1Z6IjPBayMdFS)~{V|SDmtV=>b$(il z8S{SOWs5GZnI!v2v`(FSQM)VOuY=E$GK0462oE}{thv3z`TG=8<&TdqYF@lnbVMb+ z(#0WE)T~T5^xk&ERrzO^uk22%dt4wt`}ZurXd`6<_u`(D8;`BO#=`5xKRfiA&mSqj z19whvtotrJlRqZGIV0f9*I8>hdOS8QeJ{{{;oXHT>m!^0_~5>06xkp;qs4Y~5srJri@^y9e4ldckyGV?oTxie)m36L<=|m>nhR*4;R; zTWqb}iHS^d-;OSudb%QN>82ZLTXp4PIX@iIHxt^n$u^DS%hOYF4<-bPZ%*Aa>sJrw z%|!vtDZ#7nf3<;TCJB7yTG_Wt4cyxz6v z(#`a4pLfLvzuu~1G|fB{-oIk?w<}GLe!jXl_muV4V}W|Fgt8NFNnN;>{B+Zb?+;%{ znH*Yg>*gAHeS7p3+iz2fh0#$1#sXA_$Dfg|QZ2vUp3jQAnM+@0If;pZtsYRdP^C5FFZzCQeIx_uY>=fM3(%VqwV=5|lNdh`1n=Klxd zCkDlBVk&v6s&^wbO1`M=@BhP5I!*~1+fI}?U;Nx>czK78?}e0@`e*B}S0$W37Joi* z^`jYD8Q1ckZ#%WmrPOwfdqM@@iAR%{UP)#%@M@mF?)jdW|9P7C4)4BtzCT`s;iddN z+lIS|9J`)9d97v5b*f33<@T9ZhVlC0)%TCja=Go+d;Zim9hdCucB>YbuDHN?^<-A8 z?JL$M zvi6ogE!A`-V#k;y-DrL>gaQo@zVmWU1|+d&SxQH%lh$mpBmp_|wS? zcg}ZcJ@@~-@a^6_$4j5K>`Hy{q{3{O^L5GJLOrFvUlO;^xm>fTeezj--^JYVymbqe_@^Wnv&vev#-c5$@?=;wnA#b->)%CkIBkA z&*k42ciU+5&IgH^kv)6|mt~1W`?pz{Zrl5~R_^uUtiMm6W~|gcx#IGouFS0!3A-6|)91ch zy0zxJ*Y*|FTkkB=)zz*2wcht%ShT$FACq^PUtiT^y#D&~-SaD|m;P-}F*%jE{@BFR zk7u_>n_dfl_t4g1W{SVa;fHgjr!098oqg72x8pLUwM)Nfw9kv*(P}@fW^L4-ny+*F zH%`mDIVqP@tUUi=AKS%M3;WaW=lw3I`ME{4q}Is%@NNHm|*xCTnW{%4&_t?DzAwRz;aDE1!4l^@ZHJimsiNi!)%ZAU3ytinPZQoEO^Z5Lf?dvZ0Icv-= zKf3YG&S$gq{LN8+r=7pD<>;X!Z3&n2F5j6NT6Np^mVE2`hpiH2H$eysAGi;W+b9`OY-rDn74DQ#du}QTJNE0x1@UCH)8V|aqBdV8cK+Ej%leXc)Q;C}SC z+9oean?tJk%Z~TTt~_#h%d@t}&X!X4?>5NAwqJD0iH+FbqdHZnZ`$s&tAmpcXUMKP zCcL)i*|O4GI=|d??_GL5ZCPPm#HWjuk19E1C;b!dmb(4SByP#?!;v0GBjn{nW?r8? zefOiw&%aDqbe?~LY;H@@noQ$AT`#{2&wFL$dtG}gx4eYWR*~7YL1LV7uYNqW-1N9S zy7kwZzeaO%kG{QI%Nt{I_=`+a__@=M55Ihzom|0vblS;`3)y=w%nh{S=DerU@K<9_ z|Ebemr@Z*8jZc-&ez@kt-@|{I^Xi^Im^}afWxtibtBy|EWxcOdILtz#c-O9NKd)uK zUY3_{waiL&+qG?5qxv>2&1Uh|_x+!Cb4}aU+Q>a}8$G<|>%QA!v%NB5`h}(TN!x`M z*Ue47vi0u6lGxAEzxF&#qzY40o;E@Auw(bWvjU)C&nOx!xP^XumDN zvfnM1)28&TzNLyAN=I9_(-%t?zHb`vVCM~nQgA!=;o3-D>eNX@4>2d(kDLdj`La_ z-OXbMbmlsKyoIV=q7ymma`&&#-@8a0qYoqN%%RDY@-G97teN6l& zx$sv}xvRIOJbith<9uyp<^`3fhmvcr^jCS_(AXbv>Q=XXRgrdIoLuk8d&04T@ok;? ze#$rYvP_>P#=p#W?K?iVjH@3d8VjVazMZ_$>e$Y;g-KiLWaod`AA5bd$m<2mRQUvp zUCyYTO1iY;)bv2*4Vz?`sK)_2E)wk|GGMR)fboEDq9q};NOwQ3yuc=o!#2F zG+(a7w`^NVRmH0>Kc}sKym0!pS06WMzyBODf6eQ~uXkMDc2874`;SiX^_l-Q8a_`t zC}`Gu>y5WQf1NzDzpeW#+4Z$|I`-aqJmc;;b^Z6cb6z^jHD9_`xm)jU*rLem$NiTv zZz%g2+ZXuwqa%a;rCp9^eQ&P2_NYJY>Q?7V^JRj+EHC{l_2k;(F9i}uPcDo5Zeg{g zPS-4bt5lRtNnXZ;?4MD4u2^JD|CaLbXZx(~wR=ilW>>Y(zg;z_-|J;%xXod$@2sEv zVm#07eq`zVdtJr3jdICTexCXuuG<`@=5K#y zmiTkskD~v7w4w#VZ}QjJ#}=z>7Fn9^v&$g&SoO18;+?5aW<}j?YF;jryE1I;Z>_a~ zsk_yC!&bAcZt&4r7UAB8(&XNnele&Alc2w=t zmx9;#Jg=Q9x@mHb{gd2)%PQ6@SepKxs_=bWTD!?2*?F_YqT=J1SBA~9y}M;e?#te` z*=u{ZF6*7L(PU-*{B3h@My>k1c_T;V=CW+1$7hK;y{hqOR+PveNDl)GwUiu|x?Nkr> zdCR4z@qPRGGW(K8q6>4@yq(d%Snhpp#BqPgnHtX)tNn|8dLg1Re9xEK zbv1HAInQE0|MZZk3A0LSVivukdfZQ7P5a6l@~OA?*S-Ao!K-3IZd}y0E61-KUz%>Y zOXs#o|D=EB=Z{sJtw_##Yu?J}OMHCh?E&uCwN#_NizH`0Y?q_TBa%)9jS+=22B zVI3C>H?!P%d~(O)SGMa{emMJ9%sBJ1``yLi+3)wscl{EwsoVb{(xd3yk=nhlAI<95 zIaL2MW$_pPMQ51buRRp|arGXXe^vbge9~g_8r|n2ymQxX5xi>0<+VOAed#>s@W+B1 zU+z3^@nB`r{hpHg`_sPf%nvN?Q7FsVnDFgxuiARCy3@6Dv-fSO{_@%;=-Fb6_`n(4 zQ#JTcaj#K%-*vyfV)>P+`=+O!xV2>>XY{Gs)4N-*-@7cu?!8<`dzeidXv8UPJ=AN4& zRbR8Nd-`?dI+gnw|Mb^i)JwNESUu%!miq^(v)@bgZwvm&J63&Z@*;VWnz{eb<7D*It4dCP(~XavyV)%(W?kB`D}CMkdriA# z1*76uxz3WCS1R{*w*TK7OCKgCTO1SIy(aCERF1dMv~7`hzLzZ3i{I0}y(5t8!htY5FZ@e@X49dDW>l-di4g*|SWq{=VMdJKG($WN+Mh>oZ%}-LT01*L$t1f?i*Y z`5f}yc|+Qx4eQoxeS4Ix65Q@9C22eHhNb(|b?m;uYvazA{gm^QYMqs_w(5@+Tg_A6 z>1*fhd-UtZi@f8{mblO7eJ!^3)5d)=-`qtFvqTn@_C83wzQ}mpw>$gVH{JNY;?S3Z z4fCr{SqI&Fwk3bx-;RXD7tb$euP9u(_j3nRl*yLT*P7eo#r_!XDUm73)!e`K&a2n+ zj1#l(tqplS>sj%(|0!2q{;ueI5w(8F`usSr-?=U2R!?g=Bj+u9uDNGZ@|WtORo<_r zt(`7+ap|^y^Pc2r2ff@G^ZN6z7cWa#3N5t6=3Sn@zW7#f-Nh+OIk(wuy>(Cj{|(Q} z4>K$xq|$G1SUd5toX7O98SkbA$rkqu*-!87Kga2BwyUOO#x%F;pf}I2YJU5$F8I>A ziVFUGWBJk;Ig^V<`<0fS436$!Sh~TkOzWO+sm|^8gwGcz?Om%s?b?^6m+Y>8zG3ws zb7JdU-P?s+IuZZ28}5rR%GoHh+vfN8m7iA1)Tdoewwbtj!mGL~AMg6@;8-N{T5sCK z-=bGn?#bI$!MuL0;qm-^K2@`li__28{XXxWaY5td?ft3!ae1@X&-yR5d39Z+ZR3j$nJkG$=Iw^Ni@)71Iw|#CS1S7YiojJ@&72}%Z~MCIc8pk@)qP#RhzrqOHuGL> z&AjvV>w#m}oAN*2T=XUAynAfrcGq7M%8wq-UaInR$KwxGXA|3vWs2gu#Xl>(c_h>I zCoH~oxmA2^{>y6VShj6quZp(63D;g+fBlu*MjrWaS$o~}=T+bD3=i7ez0Ga@ZryiL zFXguD%>1hH;^g7WHhW%u{&mWB+XhChR6W1Ele>AZXV(ea*c=RRc*d~pQ>MuA*pCRe#YbAQG-Pyj%KX2ltn8K_Vcf|$PnKtTP>i1oBm+yseUbWlZ z=B(V7I9=T>?oa)fA6evke6hT=+mFo0q1RI$W?g<%c)m~F>R8-L!(1rs zxxQsDLNU1QQm(b+My>nD zGe2!CU9vn~ZkZj=?mXH5*R;1S)sfMW&wY65_Z3a~qt~}5d5djJzij#XHD9x89_Pb z+1Bj$Pvm&mI$wI{E;H*ngPT*+{M+@Hf^S4yTv`>~zb)>pZMf01Fx$u;tF->hw(lh0 z@qGIb_IvRvH;LGn@%v7%?~Cu2?F`SmGS&ZDmEtdF-rcuk;)NrAx5-U5Vchm_saV&u zm!;ocIj#L~;AfUO0n%F6G~T(YcgW!x&=u(@)# zV~*`e`0Q%TcwXXo$o0iXjg7Rgmbpu%^uMd)>%Uy)yG>c=`-f@o`-4u}-FvoV>$bh^ zUoWJsnddz#ti+{c+WSkQr@s}{TEy);{`JHScjdRQIr2hkUkPpB(IDqq^nUo*yiO@M)a>Z`OxU zGHtDk=-cw%A?sJ^-_2XjHruaStbFTPVv_ylt&Z0{ZnNq5KfM0vqEXl0K=Icu*L-o-nLBOQl=Q!>44x~tI!<<;sN$_Jf>x%U86n?g zw)h6?FREN>!eO>Nx>o8itNnM0ud$WqT2v>`JG|Kc@4~YttBuxI#d5k&*mAk#*zL+1 zuAJbnSAT@5ekyqX^vc72t%?2R_D@eJoq-?Otut)=(X~%v|`)0eR z|Mk}mWv2RRwzmrQn%Xg+%kMO@NY9-5R4b>e^zT*~-|ptMuBJ7z%HHxNoL9bPR9$ON zd);$RG+zI>iKqYOoympQH!X>Jwu|qJYR=Lslc+hLy|PSWyKVP;t*mXI&i}~o+c#UO zU$afS9$7Z8<=nRS`{`Fz532=Nr}?tYb9r@Tp30U#xt{#e-9gsd&rP2A$!txbZtl*+ zlPi|*toygGd_(H(#oxu&dT5r~zp6OLGQDx@x~FcHCsT?hcU^bQxs|*2Rk3gTddII@ z&Q6*)Ep7VNuU|X--}>ghs+tm2aqm%j?Jf6DRdc>=yzujB_9+P;`Dp1wGgx}|7+nkh zvbZ2Nd$0Dq^1=^BUoy3}mpXh>w$bM+wcI0k?^F5OFQv6BK5zT!wx{?1nsi<<8SCk4 z*0(Q5)m>hE4*)AT`4gTnqeesPj2bUsxKQ=k0lz6MWYrML9Pg}I4cAYpCp`P9A-D7~Z)5ncCH*oLVK=;Y zh&}9#uc4&=WUR0$P-kH4Ncx1Gb)cz9BjDkIT%%05Kyw>o#N%Z5Jx;7h6 zRhM1a9(ubx)1W5%yRP^2_OEv)HypK|t*xu`E9~pyZLdSuq}xVKnRC3zKKAA@gMTt* z2jW%R)|SjWvMTSw*OJ#^l{f#qoW9<6QGUPK{@mW}dtKk}JjZ+b_Lcdw{Gy|tM&9AL zpX+t2dT*KT`qt&W^W&zc7t4izJ-zKr$@Kf8{eM^Nuir7f{Am2oId*1KwiuUJO;Db2 z?Nh)K?c?e#Pvu*#+Y45y`Es9!PdM5gg(`DVA zzpAXb7SDf|+3Uad>yc}w=aaMIymTY?*}wX|_iFp^d+U!rOt?Pvn54p$JC}1)1H(`H zL_h4_xbOF)BVP>f{rvOhx8CplfA_8p{hn?nH!WT6r_AP~hOa*tN5oZ`_@954-+1xa zXWO><_t$Sf{#I^(^u5;?F3sGu$Nts#`sr@x*T1~`?)U!Rhr1Sik^8}ZYvS(vm;Wti z@+;)d@2Wq+-<;v zfy(A8}*H>>c%$Vctci_mzeQRs$L-zeR9G&1-{pfgEb^TH7 z$Lzk~uT%etem|~WA#iEeE6I}C*ROsI-1&O*{`Z!pjZdO%?8|bCss-G8moHua?O516 zyFM%bKcBu{-gkJX=w`X;y0?CdWEt2fzYTuidGEojIo1DGfBgR8T0Gy$>s8+Fu@27H z!ZT*iwSBbp|2B&+mrO6~Y`$9fvigjhie78k+_j&6u6pB~{oXYB{l`PoHXikiX3m-S zLbZD5F^iS6x1_H!lK=YJKI8qvw-aZq`?KEC->LEH_wA+^bMs>Fh;5wbp8N2X-AA#) zt)^GJt{D5=7cqH}e9RzhFXI;(J;3x4N`p>SdJr`DLe#`h7sCT>M+rq1JKKw9^dO!Wc*K7~F z{q|kwoerg6p18p7^4D~;iDDtQ-FpnezK5-?-}LFbMyBB>+qnH=cb|XXo3%DCIc@3T z{GFE{FMPgK*Q;cYZjWj5=BF8lKgcw*-PL>e(tqZ${M{3`KA&M{s!%HU?QhdMiD^4* zCz(|2YKZ2LGPX5O)SRL3##^^uZ1$yzR$rprWnB5q-`@-R5@=Pm>{rmNQi)lC*;UJ@ zUo76T@{jJ(6+gG{*E=`m=#!OaQf7yqo@DrRGmnFNka*MC2ltHchTqi+Im=n`qjKvD znY_@@)&9jHe`D4Lewj1rczo}_+ZB%vZxPus{n^en^9o;`H(7DKq%-h%`BDG3n-&Vz zUQ2yCeftmlLl>>q|8v>=W!}@*JAeJU@pzZ6=Gmf>mA#3%vC0B#qH=$J&EBMY?a_3# zNN+KzJ#lf|=Dz=SZ86D|zb{&U^V%N8!)iDGKkMB2UZd*zj(~k4uVyeyHr_nGH$F+F zeC8_7-(eEp_CB@9dw%uwPiwBnVzIf!zxWpKy|yLjTY;F+KC^P8ge`m8QB9=VYN>=`DXS{#+Yu#^`vYbx~dwaY6SXzJm zi}T{e%e9YJd;gP*?|MG{@a{*KXLV-oebyT|?Ot`vx16JwuG+l`>snlqQFZ^+*|yce zW`}b5`vw2qx)M3xZkn0>@vODkUzTQH%)OX7{jm*quQ+}bQxvcHGjv;4D}ubm5b@Om*@-_=(auYEfI ze0ulezgDFZYnR=e@l_@7W44HN^f~4Feb*v?O`iYpvdQ7{=@btw{PyU_eB3E=vS>> z_=4|UmB-e~WsYBEA1$7=e*OGe)mu#OPR}{-m$l0D`m*B7-xBOh?at@KW%=jo^;}(D z`0MnK?5mFsZmCTF?EU}Bj^~~hXWg%+pNgA$oiD3uZRXBzA&cE6_qV41t_?Z7R>XI6 z)vRU3hn_Wtc7I#)G`v4QtShwLZ}sxsalBIh^p^&1XPM8uJu%w;qr$Ck&p&=FU{9{y zKe=+tXJ+R~F>e#N@$h7@4s*9tMjYoin&?6larC|N;TZ}HLJiz zr+THG&g+%!y{Xx?9?3I$AHAFY;`Fm`bGFHT-kSG%{JAM^=}q?yZ!ZtjZ2?-kp4&!|!oe=xLAX z&hf&cHYxo17yCc8EL?qj#>1OzmR;Yx*KNzY&->zO&Eq|y_oL@LlCb}MBO+^o^B<$_ zUnbqz?)a)O_sz{2+wQg;to@qTw{~;;b@tm)b#JG~FY?*ye@*c>-vZsozc&}o(Uqyv zT6Mj?MAxjg?r)jo*{wJ4+er3mEY@2qsQ&cum9IX>chx2Bmg=7@rOQ_Ss$53PG`qrP zmVb@s%^TZ)rF^dHvGVW#H7#uV=Ot?&z6(w(K30Egdh^=cU(0iKZ6#lBaNBcohUrhK z#D~kgx77tXUrGG2<;9$p_s?FObA9>Dqq+Wj_Q)mY?=RUZUF zzCZjX#?1S--G%*^GpbCAZ<>5N{l&NNh<1OW_w&tRe&rjc&AWPD$9IFurRy)}JuKPs zv8X28W?t))%=N9Fy?f_{eJ+f-uk-KggT4bB_2#n2Mf&ec{+FLYSwDQ; zuyOvYS2fi?3+Md)a#Lyh+()@v>ra|8CHAcTUmv4?I3ap<@%i;nt4n{zeoQ`h>EGq0 z=8w2)w_hx7T3oQk{`}p$VgI&OMZ0H5w#2#pzam?FTDO09>MpmHagRG>a=h{$Ut7VV z+k46K#^l0%x1(!67usd*6+We(~Ck|Z$*?>dCg}{E~uGPyT|=h^^6+H`z96l zjHPEsSKK{Z6k}a;?#?mYwPE)SD}K5guAG11-wJ!V=Zn>HzWL^A-rjn(;`gRinP1-7 zuwQz1A!ZKm@m0q!FP&$6`PBu(jh3koS54n)y7KJPk7uV%e|E}!?XsucvG*;)OY*+g zG^krg7n|1IE;{fxu)Xfelx-iKPOo2ib=qTzdHdef)-Szo@yNPFdee>{{Bic-nkz16?WA5;ulZ**?rlFhF>d{m(744>%@?)Tzx4Zk zcG1rB=Dbfji|{_1oIp z|8DI3ziV~s!Q2_&y!Ocy{q@~Anilrl$capX4 zReur+mGrFT+%nzcfKirrWo}Gvd9k$IzT(}jLj3;o#q_tH=ilsi<8bu6>UHwxa~?nV zZ@aGc-PB99YxZ4#c=piQ({Ed+TkS7hpZxl?U-Q*Nbs>pgKCF1T(lR}|%Wvw}E7Ka> z0^^lSG9&K1asFt!#C?9)dR10lX5HzZ{%ORvMj3wN_^=@3R0+3CbZ`FAv@bhTr~NXH zb%?twSJRt+>$$}7W0qfx?%j(!?{Q1_ylGve-b?Ql*Y5Vbd8m8;aP{m{75mO=U3NbA z&1bRd8XL3Ox$-%Q?>bLvzvisIl3V#KS9{|7r`4rjQ|?ap)aIS7Z>L^r`F&+(=F9Bs z66+02d%ynm*7@#UdUC_6t-(2k-+7m|KAE{YF8{SaPT|k5*Zq=w0&QA1Z@g6asc`ki zjc1Bvy!hR_XBp~MWZjyc-T!&o!bq!?_Mf)|Hou&AeYx`e@I_|J)n-IL%t+mGX)pCpZP8ji=zj!0dSdag<;ERaY60d$OIeqg`;gYhuQ-93K z{gn4wY}V&rCUw6mGS{s=F8TN6jB770Y`LSXcj9_fG}pE(Hm@&iz3@p*+31>L^q=n* zZ?0avwDjVFLf_TV$ID!*ZR9ei{3?yu6?^#N=j{?tOofjZtL12J-%)k%z_iJ_M+JXH z`Sre7*E`v-J#TYWSLo{2&oiFfDvwX0v>eyqEv z$YRd9nH@jxeC{@qH%(Ko-Th(9o$b@)-1kOB&+B#Ae|MEhN9}5<=iAyR^G6;&@%W&| zdiPha1GA^fU6ng;zK6y9?(92@ayLBQ@XEb%$LlGtuDyHu;ZyXaFF#hi-14@(rtapX z7njqDt9-(gEqZ@S-EEGjxRRA-p``m4`0f@l6@g-)4RV?rjpfHZiiUz*>y+${7i!lm%O)2ys-E!=Xm+bwe2_NxvtMX zBL8LU+3la^>6FTDDz31~PkeOw@$2f-5AQ9FEd9G={l&dfrT3o{-#K*l*ul$szgIpN zzclr{)2j2YH+$WE_PIvF_J7*dSIJ40X0O*xzrCqs?G#<_+iACI#J=1*-;=p&y}6kA z+Fd1l-*azXD~--Cm8i<=*897u|OdmsY(Cd_0r?zTd{VwR$MXMP{3&97 zo}AsoD%0BLoML;k`#Sw0t5-g^*Ex9O*uvyzpI?a0u$zDUNY-hW@P=up?cSG2-rSHo zZ>!$Y=fB<0EDc|r>tLoP6`xydQ?vTo*VwSl8`gG7CC$1O?NK3jLj7{mwBj`8uNF)8@G@{MP3sa+trTBtN{J^yuK#)QZUeA@hwN zHowsBd|Phvb<32?K|k$2SNljb7ir(tJ$g0d{^Fa5R=qFEvb%ZifN^4X_OyvNr`!m+ z*|+lOJCD;6?NOT1rcqyC9Wz=q_4T&8{eM2z%blBPkh{}uN4ih#qgtm@)vNPgCT+eF zp1kjEWn2=|E#cq0|GCt!`*^Ng$c(+@Rc_snm`gwIKA)~WU+{a<$3@Q`TaRa+h4Nq-$oiDpfsXFQVnRFi+G2z^2FOHez`Rsa;^CmZA-vyoN3zDA{A2@#D_&WEs zc{Xvm!yEL^$G$MoRoqfpJ7@1K8>=-%^D6Ql9(eoZdrJE3WcmAcqE_c~?;Lv? zzN}B;>Dr=d&MDuTey;d5r}NtSt#T2ov#x0OPrsy4aqmRh^w6RhR^6ICQ^eZd-OZWz zGiKwb?-u5V9)|5auJWRAonGkc$o_4HJ+(4hMY^5WwtfBjIckmV`sa&F-jv+=wL_+O zTh!CfC!5zFycYawdDN`6@27?S-ums$p-o=4cMp9LlihCkrSOvG_Z8pgRp0uwV#)0< z+bVwk&z3RKUG*^Y&*qXHw&{mb)~@II`)7N+?eP!sjhA(|_DM{f?tJ>?(wAKiu0AaO z;r;RZ&d;A-zdmv0_@y$#y{BWYFON<+&s@Fl@2x2|(=O`7oqzgMMz*bgdaq-3dh*S1 z2i{}4A>UbZF4{htQ_~swXNTxEeP7;XM`femzxi*qJ#X@yxF*9B?=4#DuA~-MCcS*m z5hwMxG;020x#ho$K4xuvn)#J#OY4}7!PrM~U&^tEfsY^C<+)a0Ja z5V~l$_VoJVJ!Slh&Oe;iJS{Fm=8D0^g+G3+d|f*~dUf@=mUGPBZu59@`o8G~UXPi( zKddWPeA=_j?{Z(axxM(65ZSvfRZQGwXT&wrRU3D;e2H3XRr{_dW5%@o`o44he5G~% z$}HXASebc#=7%q*E~&j;w|-+>?5?X35--YDdS5*hF!>3`-)Vn-*IYIXe!67Zhc8zj z&+lLQ?aXy{>3VN9vy$C*-0HmZ4c8k6ojwuz%x~?!SGIe!^mB4IY}oYj&F6sXv|uZ? z)0h4k#(n+teao8Zo86mpAJ2>1x~0ED<8)T--`5v!uCCnE;#WG~jeFbjsoU0@>BgL! zvh`P>)jv72T+djywR3H>R!;NXZg>1!?YuQn8D=S~%eo&KdcBQV{OS9=*ESnAyot>4 z*RGk_dopj%ZL5;*LxMH8t&V4%v3&41aO1pwt<$&5UKcLbUHQ68edWCEmd`$yMx0L! zTzGN)>0QTH7ruLWK_~9Ut%p|=JdZZrdNnPyf76dq?y#=J z>))p5-DR)&MBK`ly>F@GJl9v#*NM-%ck9!3(?gqNPk$?2`Lg8Ywx^eu9+tYOr@Qvr z*=b4q`gdm?PkHS4>CM4I?%$Qg#C29*-+J+}Z-3Hz&NZ*KpDpIgR(o@3+vN@Vb4~YY z)SP(CR>i#~a7FS@+v2aMzKfhazUX+iY?%MlU&qWo9jSXab?4m+`BzVWl&U%Gz4-ar znkyGK<@y(~Jo~%V^7lUH??zTTbJtB{Tl;TcMM+l4w`!$~_qlVbw)9?3e0tGm>9K&r z>!(gpTUz+;<*b0@8^?W)Uwt-xd8kzEHp{CM63)6@?Z0H|{rptN*2q~&*^TFg=bA76 zwa7E*@jTy~9k~_T(jR7>%$gFtEB1z}`-dxv853?*%dT5Gvnp4tt~RIC^VZWGo0>VZ zUl;vXe>;aW_L|&!6VGj1dg`-xURr+a+PQ6V-u)#KR?DjX1)i&rxth53&x^u>DOu8o z_vPfoU72#0`zb9?52zz|<(WboX?+@qi{rt0T4(}NeALY^`_|N8gY z{1iK_n0>d-hyB^=|L^H}a_}|MLD~_6rJ(2#k=hgiuzc+?d zUtG`idcu^?a<8q_%)Z|KxxVV;u76U~xzt6Uo2@>@&$=RTm6z?NMJMCyvo4fenSDh} zomaE<%rdjR4F`qi9tx8!dGRxR;m)%&%Z{?&IsE(g`<-XE$L&Al@4NBy3ZYp}wTBJX z_b9FF+Ha+wb<|Mn;)jj$);p{n_8769Sv_gD?$eNjmuc(gbk1Wtv?$m;a{0}~X-6l= z&HekH%TkN`-S@Ej`!CGu{QvpAo?=Vt{!8!wr0!>F`=_gVWa*Ai?jIxn>K)fVRld|= zdCkQ4Gw$nMX}|tINhv1%>nRBXan|D82;Ru0b&v2V}5Z#%T{*0BZQ zzg`(n30M4kd4JvS>+iQ0TfBD@O_!ZLD>`iJ7o8(tX6yaXoPUD9?q>0ls>}92d{f2# zS$Vg$gwIf}i~mur$EGUz$5OnpUsg@z=q#pWRr}x0OlJ+I@hFCUFfcw8EpbnV`$4fz zM{>;1`4gDG7qb;DTg1Be!}rBzZzTbC3mGA)o~T(tDl<{A1wn~J(W8)wK*W4`r#xstODJ6p&3@9$&U zyu5O&xn4YrELwK_ZYl(3Bt+Pt;Q)tz)Z&}FkXHWXltQWuMEGc>L@pFt#w`w?FsIczRkiL$$Pg$Lr zCcl@MA7f+hUZcRG4Of^Tafb$mi)SI}BF7c^YV*zDi$Z3+aRi4FBi_InkY9)0AxkS=(rPr9&e-n^&xg*GLeXKG-&)APe6<;u=A z4M)D}d~3Pj$GW&vT;tMDjpj+}OH&?ARR0wk(00f2MD%LilNPtLzBNty+|zR-`O3Zi zCW)`}_y6C0dXmw5UgK{P4=yw6s4m!Ur~5T{QI%Lcv+JZ=9gEet`&U~0ZL8rAJ6~k4 z>+gL~$*4P|p@4fqtML-myUc;_!=}FW_G`4^Qk?H~_^=1Z*_9;^XR`X9VteDaM6GS& zX4i^z5ylyQECwP+FVryvRvzn`xkq=F@1|P<0&{2Vn;Ws?gKhvz2lrpq{#m(9ui`mO zFS#93+InpzPnGYX>0e{tNFPpf*mv3aAY-$Zq&uw{hq)pPasmnFUH=)L5 z(YFOVS@Pr!I8p>ZzTGlmy~ExbwIj}A0>1^PISS-D-7DI5nJI93Mbe*5MoQNi*)&p) z8E&#!`pfdlR;D!`HfT-7}^Cf~u{;$w{kc z37;3cCb}d3+y0r|Y#xr+OP(zdHqSss7uFUwjI%{IcK1chwN4h<`OnxZqZ`<`u`R*ab zN9WervL=7M-z{?XPOfK%z!g=OBRLNg)8$e8iLZ;NJD;9$aZhlH=QYOCqKYRw8kdTF3wTiD$8Eoi zP4H(-hDNG*i(ZAhiI@DlJ+*V5_y2zSx8_NIfAPf6%4&Om|0sO6TPWz%Z@$L*8uR)! zTAugKI97=_O=g^GV0UTpqvlEW^?y7*JlFkLv-8iV)B5-SDcRqb+t>TQCi>6)`WE|^ z)4N;Bxs0R*zZeGp{P?)hbEkyxfq3K2-{um3m0~4hT zu5>Y6VJy!HIxDgH+>NWZ57|7{|J(9ty{A>mvL_Dar|Ulct<%=5UcB>!`_k|F^7kpA{x^6$xP&Y*Kuy)9jqU6+S^%sl;6I5Hz%@RMlYgWVj9O;afyPPMURpq zt}tHQsp2_dSHWTHAa3)3?4IAdE#g$EE)F`OEjR{%9_{GUHK=SHuUkQ-A#h zg~aqWHn$%??a!q9H^<8XqLb1ynVEs zw+qxqdA;e} zdb+Rn(z??-pGemJ6Un}{@Xcla6Ni^a3e7B?(7!}*a>Vrc+gy%+ZvF9(<-BtDwmn`h zo!|YN^t$p7FRaeVE@Yp(MYOt8{hiXJ!p7_SmX{YVsk_p~$UZwj@x%&ux%$Tr2h_Z$ zZ8+W{GRq+-Y5RGjN!txrdip0GQrKd@lD(~V{Rvy06;esOM>YJ;G+&fZI(W#h!nt<2 zWIGdcmGF_zJi5m}Z!^yN$s$#}{eI)KJB-ZV|Ifd4`0syN+y7I79%!p9PpV{F3_rw@Ce|BlS*Y0aA&4Z~nd9!^kCVAbRTEOaZq&$&20_Wt>r-Uw$H8 z#OsesQbLGW0mDk`y`GX&q>Og_*?am8>jj_KU$^gOD?Q$m7;dApCPVS-&5e%J+)_Oq zr#oy+N&j~?ae27(Y?Rg3c`k(*n2gZR!{K74m}x%El~=9>u{(stKxUS(R~r>AAW=drX(KXZxkyS4iy zB}$fE^p|sC?yrpUV4q-Zw2*mi;X7?+|BNDT*WYi;>i<8h+k3x0e8W=bFW#DKE%P<=hwvP+U12;PA0%e8T9j^fe-*#&>;Cojdww35 zzxU_Ev;FJ;&)By{WbureLwk>Gesp#6hJ_DI7R|fCaOs9XnB)6-AKYdf6&IcS=)1P@ zZ(qgZlLEhscO1SQwfO7He{yx->kqt+dBJTRo3lwL{@} zy4_OCqbsiTAL?Y5+1kO)zEYC?XX=fAe{8&WEYuX`a5rN!h7e7?-L$(`Fm@)%Fg(ic(-BI+gXgu*+Z)SGI}K|M*03}*gxf= z3cg7kUA*x~+{~n-)81QlZ1_>7c74|qH49V2j+gsmZuL4}=;6A(HN`)P! zUn}ol@#QPiu8pyRZbvt1JJo1N=<~GwpQ6^2G)GS3zq3<$|B2gyG6jDRT<5npaF;hK z3s>vjc)wnMXXY_oB_8J^B|DVe)%HriaQ{2)-0R0*c`ec7@pEF7!b+aD7Jfy%ped#o=D>jp7KG73BGS5bZQ=4I0tNNqv9il7T zr*hnyP=9>sk>f`{L~?6QG}-PoY3_zRhb!B%CS2RoC25z!?6YukQ8}a9vWc83u`G>q z!)N{Kzp`rqgR8HIk7~Gjajh|@&e0Y1G5` zu`=|m=Ft`QM+1&&WJ zS#nYE`O7QI5{sW)S`xfAYU#_Dg0sKmGs`WJFctj2{6NxD0l8&grdRAaY?rA2dCP|U zvyO5zH=mF>vR(T7JiEZv!oLGo{$D=9Qqe8A^VpjiikfZRv71{M{;o)t{`K#&N$surWnV9s%+H&3?{w|O?o+i3et*5N-}0Nzy*vJk zX8tiLRoI|hUSFT_H~H(8y-Ynu2U@Po-ZXhz{l5~%xSabfm9rGg{Dn{UG+p~w;`Mq_ z*?Fs_js9KNCO$1a$HOaf>%y{W@p?x$9FYB&*mG+Gcj=1=wPlQbsmoJO?U_99(d=r? z^7_Wi*}XFrY~3FGJ5nNlbN7A!OSi2!l*^yKcvKg4x!37}b=CKsx4Aj#nAO+JrW;KWmnKC&GIDiYeWgjK z;z3!uMtI+27cte(S%!IwAFSZ?nv-;=SWZyWs!j2B)r5<-QpGm9jq2;t=J_^n+_!s; z?#urr<=ONGsQ zqTcHmZ{SwD>f#N_ZJ+rHdS;6H2cMql|J0VZvhGyQQFdXme_zy!cefa&&YQB-sKT$k z?$+n0!Mbx^ewcXLXa1=vhvgrfnp-mKxwZG>7cGqQ+FsnazWf^VdH28CYi2HxTyWy- z>pRMew4Y5qax^P1uZdOWeDplkCYQYOpeYlUDc`PjxqgcOQp+``zX}oEy`3wxrf4k= zGug_zms7^w=H#NKES3cao-(d`%eQ>ehc3_BC$~dvJhMuFcx18dIu@_A>_YpK15>!J z$!4V~Jvk)2e3ISMU5vXJ_8Bwe9=Ne3Eos*OJ z=XbJ2re|?|P*aL=?zGG758QC9ftM>xCE!25fK^}QsfiFO~-Pq*DYnD6^*N@bwo zmIuvhy=~Uk%h+nxEM%P%ac@%j_8h|#lb)*2dcIh0|Ca#e^&bviwatt?lX&(>%sTf8 zGbT?z@787Ac>RU0Nkrf5lqI5WYGS9hR$1tk=hz+E*WB^#P+vogMu^tp-Y3c8@A@9j zakwbwYW{nUxY5OPwkxw5C!S?BY5xE1zwq(}*~dD+%suMK_DS$^Gwc7S`ih;*_Dc49 zyft5X>n`+YjyZid_E&olaQLp@1Dsb$e?(PX>Y^)9XjkW6K9qmNoK1l zXQ{caP@Txiy=RrY)yHm@m6Ln)l*<>M-0*R?WkP+(6WJw=;g?;%RZdIlJzMG;{R-bE}1W zzfJt45GPZq|Df!2w${5#{dd^^&G_W|Yx@2(FS%>BMD|a8bB|5D^JwnOY?dH{84DGr z9`^qcw?KV^*^Ftv*=j)|Ow6||r-h{Ohb{k-x_wjZgOhEOde2tBxg~#kmBAy$j~&;- z9^dMW*PCx&KgYhlX7+@tuaej12lZHK&rz;XPm@cEope#eD_d=v$fvAT6L?*BHZ4rF zE10IWSStI6=kGLDJH@q3c3MuI+FIf_P7ANInY;6Tr}LUCtDdzwBO%Im+%wL2N&x3lr)NN-xc((-5uhxiVKFTPCcQ~t77vgJ6m3H*G2=y?5% zXHEPm9*Upkw5=4Txe1>;KYgcP`<(Yp9r^CscNHGAJaai=u&P7*?AM7^A9Dm;ml>PS zH7s=dzVG;o_fPJ8)?IJ(;HgIvcZ#0PtRumncHH6!yB4_P#&1XNt$!w|x!>GarnE!k zu?Ew!ef|$zCGT`SeztE5)5R6@Q=h~?WBIfvB2Marhg;-g!HsvtxAn{4ue~Sx{`p__ z_xF51Sl0frS^DHl&c8pEvlP$I+hyN0drI*?p8v}}TYLEaw|loVZt0{cJMP!qIlZij z!8TXoz-(TQ`!89-@g7HW{r;)-ZOT|eB&DsC{+&5GB^69PIq@WLt3{!5^ zao1NaQrAq-U8!x=YJd41Lys%>x=DRDpTw278r1FFQ~R51-SwK!V!Lt+7yo*xWYU=Q zKw-18>Uj@8rN{0M52Y_kYUVr1dh^dm_e!&kI%;fFw3I#^QdsrDnCnq;lK&*-4;*#> zq%GD}{^oe}cTTjSGYHU3K~r4!2#6SjVQbZOgm@TPe2*dlvOy>n`rr z^-|yxxzi%^YWB%ZnYZ+1DhfWGd3!L4!)U8n+}>XwKkq*O|D)dD-+vyzYl&a_?5y7L z@bzjR&e`wtIv?k|{@z>9AB_F=HCz8zPye^{{{I`Q2bX?eRC{OsGSADL^It!w+K<2I zrFGWbUh!z}m(?ZgH}4B}Y@feT>PPi-2j-&xjFsQ_hkxj-=GhkiZNijW?T<=<+8AKYcsOtOEvb?$-OO!Jy*MeC}sefjqeMcmJ0TK{S5;=Px5 z3GY+x(z&VWr^B%1yUg#++lzn2Bk%dtE z6{ebm%ssVJE8|c0Jbcd*yXr~3TFt$Ex(xfB*dA}5+vY4-qIT)Cj#R!;bvf6}_8Tt_ z{pH;$|1~_yn9*6xz(w6Qa!Zp3yYiA5AI@mcuPhd7TXo=Y?~WkFPZo2(Ott86>6`(9cd=l1)D&hOr? z^ey})_mU<4CcDcc-pD>zWqeeA!f~3HXRqRcV+&*(&wpiJC6KtkS%f9vs;VRNvVTGL zT-J-ZTRvQwaN0L5;d0MzZY7@Ysewx8Gqc^7=xN&hExSFt`hD=^_qurp&jN-xk;X|J(LPmp{;P^%Lcif?ZtKwb-M&%bix( zEKpm-ZL~zic7B8Ut0}XqJ{^<0#ecL~Sn2At^Yahf5H7HP@ASAm(-ytJbV5%Q(0h}8JnoUr~9v&&Q<>^Z;1&h zV^pvFY36Z#$~P-_fft*5jwJ<6`qv_4+gg0^v&UM-C#93_{W<;g>+kC?pV$66n(e(Q zdYkeoR`HL;RrigWPH0$6yurY=iSwrJ>4~iCS95JP;Pd1?u3u0RF|D|>=Z=*o-f(*6hQH!B64K4CT$VLI zl+G1yw5K6R?-6Ue>C6k0{_(O+GT{{cp<-h5v*Y4(PJ1Tcr760(?i~QWVhVJ%}!@XU(uZ@+zheO>-u-HqH=htIG7_?&6?4WY+z+_xN_vH#*q@wY$x z{kzNI_DS2|;iUDmVG+q;p>4PECO?K8Nl4|6NFsh4rV${QT}UpT3xG$-cys|6r%8RLP0M zD~{+`xC^#AaGMpLmzsM-@trW&vfc4|@^*Wc-T!;PJwLAg$1^6`8>fE@Ij68J?)~nN zdd#MFpKXAbBL9(c&zeK~uOEs}IUcR|-?*Xn?1QJ1Q$GD`W~y!H_kDQ!w{nEu-~U^` ze_2o}7d@-s_UTQ9iuaR_+UYxOOPHy3tm~CY_w>R-{qUQ2R9s#q3G8_%*)of}ZO5%c zk&Uww9x3tbWrn=DzQdqp!MWbZf~`l*=1U1bb)9jva+h`Szw>9xRV_U~ihZj6UT1Hd zer`^2+P#LZ9%DdY1l&DY|DD^;9URb;VhIJigF-kIed4 z%d%r>T~N;V?GgeTQg*EU;(lRmbkD5r3Wk&03*{c(k(W+yaLI}OanAJcnPX=UJh5(W zJF-Id0)vL`r57hpteExc#X*IgCcYJiR2CH6R6e!l?!PT_U#hppU)7C~x@Tm6CL*m! zd;gd1GagG8ZC<+Gjpxi~iAy3E5xb5-|NoZHvc+NgvZE-^P%$f0E_3M3zM%V z?~+>iZN)|DleeUF-}mZ@tPc3`OlX_M=HU7NN*=xCoN^;1YqInGrn{Gl?y@vA7xpk~ z%z2t5U&qtk@nQ``sfCu5qpF$W!|}?NiQ?o5#~vtV{oPV$o8oth5N# z#`7*)n!1ITbUc{WdGA6?Qk&knie-wXoDwVEGks$Xk5^D&%unQ=bo}S0dG@?tCVtX1 z@2XhF&(0pT?fUkXZ@)5XqNVQHu(UHjKYi!)!?xCS&qR5<7bLrPaPhj&5PW~&_4m1A zidQ4nY(L3%a>p@6Rg-y)2hOi~xNvV<>E-=7J4}y+Wp)Z{oIC!v#=-C9=~M^x-#^qp zH7=i7arv;r1Gd`gWR1sHf|Ad&g~rHTOVD`anSRcA?=i_)I&V@}WuEXW-xwLmz^$~6 zzcVkOWb4)vu1L*RV`YN-p#H!XOjvvgaQ-&KjQ+^Zb9+V{@=SkbgiZ2heeR{4zb-r6Zmt8=|| z%;dKI^P1*Y%&n*`$F@o2MMz7K;AGpLLjlG~#br~)#1b11eqXk*UBP_bKk4opcf@m2 zRMp~tUW>Xn#X08rtILl2vRF%8T{Y!J_xm6C(>%qzC_h^DwrWPE*Y&52B}eWYtu1-8 zt3PM0$T#0;F6oG@_3wX~n}E8^@!na!md0{MJ<-dBnF?ir2>BpsCvv zNu7=Dp3POx-<|~Wgfcz(v~c1+#!#=oE1DGxCWftyYTmK&p&wI_(V=Gv%{-qhdCoQo zFW)bs)3@ijM?h3fY(<4s9}{cu7Usm>oFgKuPjPoo_ddJgt6kg@i>)seCfHm)&aQ2k zeChzJ@6SR*_p|JxH!pByM0|2sCSM$F?iQxWYqGG1Rc%d)f{elxR?i1P2bVXrsu)#l z2xgJ&KH~OBDXp-JX~t)kg3Bu(=4g3qh5Tm;&kX$YiGe}nfv1aOh~IF~E<}NqW8K-R9?=gU7Faqg_H>gAI_N1H zbaL`f(Je(+dYm4pt@(Cg5eLU5fmJ$TyAIrJQkeT$!E|xhBpYGh+q#8@Lb2s>*)=yF zscS1Q=8QeJUT4J#-SZg&A5+*g4BfRfd=g$cnKhX8$jIL8$>V7>&*|8e&HcSJHPCn~ z#}>=8HJ9g#1hs`U%mybW0^w3c&>~TPlYR0vNF`n@!I;QHmg?K%V5sf%3J4vmv z#&zQ6+P~%7TAr{3xi$92DeN}#Y`Dg*bj`c${K|zbFFs01cgtq4bFl8ykeYPe3b~x?YNu#@Xs&AJj=QpVioWtCBXc3i+K`kR%3SqM2G{reaP=yb*!bKxx^SU? z&yjNzq$j!U2~4-@d@8Xt-azO9gQdy@LE&2r+4HA)*JwVKpRO4HD$QMGSH`!Cmjv@W z#oy2BadexW=`f|pPF%$Kp1<3^6b|dO>e}nU_E~4nZdxX2czMs{6fTJlaaWEa&Jz+> zr9}9%oB36{U$Jz3X?3X_C3mG!0b36s!(l>w11ueFP3W=$&;d~0~Cb$a6& zf0k(Xo%?T`_tcM#z>-^P0=!v&;^&#izK0 zUbK2XRV`rs`CCz!SY0+rc8Fx!yc5clUT=`1>b7mFGq2<}>yDQ~m9z9`R7p+^i%pb# z!JW9oq{BHh>KU*0+XbTbNjynfVs;1a6-~K%W>&zR%Wo#`(ovg{>-<4Mcd1t1Vb-hB z{${aVyCl{bW^WIibH`|56N|C0S&C!g3X9$~@~`AlHJwyc^KWskO0PP+W2su*tt}fR zU+MPDm>SsEJhOh(SuevI&n|WFbk&@DdU}le z!qSa4*RIbx+ka`}zuzB!e>AUpk+GWZYxXtMWmqO@eWiE1 z%Ds(E7izA2`yAuGcFmc$JNssH+b;O&w8Q3w{R#2Ejh|P)Z02$A`(x+&|IN8N=3B2k z6d1h>`GPJmCcaT#)A@!``S1>w&)RpHI~@x7glm>}a5_I(@%ePaqq#vo5?39{l9X0; zR3G@L)$C_lwnW}B&ewF`z6Ga+8of6D7$(WUn{yIy=vlr??6RQQHU zWc}3ZM)USvNbT*9dvf;RgYvHM1`E~j!j|+OPXmti^B+9mc(hY2WnV(Z9Ln}h53d`Q_Vu#Ly-qwuMtvo9R9x>OVBdE>*kXSRN_ zXOur`r<~6d6F+@6Q8=;txw8D!hy7vls~2cY)p})U=08RJ47XFrr?&T1S$0NOI+}gO zmL=rYUf38f=Ck?Z=@V5SU67|bK~^^r84y$G7OC@yb)7kYO)G?J}XSh-evOYV6gK<4=#_bi#R0sVQZGsm0=d}$^q@u_CbQjV!_+>(-i#a2w4{deIHsZTZsrto-KR0qvEG(q8# zAm@p|^)B9@f+lfRc6e-R7dp`?{buUrXADNi7_A-dvs_j)>rG6r{lzZz{*dTXt8E99 zr`fD&J6xAhFykv{#uA3zE)(Ovr`|Afxfd>QxL3sbsOhcc?K$$-C7yOI6y3XTjj`c8 z;oR~d{km>QCJF zPZs7md5}XmKjhFgE`Pr(js`1RUGBQGo)qoksbu^0#N~(R>1pahr;RRV3kEQx&->`& zGBNJ@^v{)xZcOX<^6oqBm3^orrL4~In~Z-31ru?YBaxU=|_gSU1Qh`l+)2@Gb zX2oTfMcqPKn)-Ew>|+@}68d7-V(*;g@~&F+Lxi7U@q}Gx>t-ozsUZ{&XvDK2q9# zj@724!#lJ5fUe5Ney*zr7w^##Q|T;rNbXvpFPw5LxJ~7z#YDazr#QCy@b~SQ+?>3L z*FWQw$b=cQmUMCT<^_IbJKP}{Rm+%@n!YEox1y!7S7uiDyNJLD2yhE6$PdBn5PjnQh&TQMDuNy>e@xNo%tYaGvA zuF*HG->W<+Y-RZ;J#Vd}^@fR}wL5rkbQspnI+@(9 z5~vncxok>$@8+~~9y#lIBD?v*W}Cj1QQP{-ee(X9h1T|d_b;8+zW=`N@5jPb2NtyL zs@{J5?~3LbewRv`o|oK8|8|(~1mnNYrcxZAmtEKzU;6B0E#pItMg6-JR;sYZ@XgTh z-f{HNje?Y&0k^LH20w3_wV1d_v4GNg{ux6SaB}a#Am{* z6_+nAJ?|f1bLxM|*LTlbE#+4;uRLg9Tga&SYLmh$z4@*irZc=OIv+S^+54BDzgDsa zy7%kJuH&9*yzb|#$7?%QPMABNL5%CY?}*>xG^-m^@ZqS%1lC&w*M6 z!+q<6H%~16l(c~J#Tr$qt>;~*O3w|Nxsa>##h(u*`aEA#cMAm^KN#MeT>IYU=lkC2 z;oI)l|NmMjXWO5kCVJ-OlBR^$C9l7%t*iRz*ZuJP@e0EesVgI*I~E*%p0w}2pGNf0 z?x@K6vXwK09A)LAm#1EdzBk(`uJ7gc2Vd^YxbMa@oug24(gUATky?g54{SCplFo2# z(z4K=6JW2o$uF+Ir|y_Taz&Z;!Z%UWui#4!M`(!I;VHiY*T={E z{#|kX{rh`z=NIn쥊?SZ!CAT(xTQ_H`dP$`4c~kaShH9H^?!P~FU3;48RFW*3 z9G`t{WltwhNT|xSgsF>JHu9TlF&?N3d3jw?-pF8Em{Pp)zwFW-rh%wNC0 zh_nJRKSWx8l%5ag>YmWygihg-l zDb=;M@Z$I8$(s)=++BTdQ?}NpNgT~4i@4-9R~#yc%X#-GXzz?yE3W>p`ab(g|E=2Z zuge$oO?vn(#=X(9RsH+#gr808Yc^T$eYW%`i}B_M#*Az$e%Chaa!s5wKZ4z$z}V5B z&y2+?H_*jv-bUjGF*eFBf7WoXJoHPwcG?B6j$@1dJz-tDZ)Y3Z!@>}W&ByFN-w~7e z?W)3dz{5G#L@{lKmFerab*7en2FAx%_$M8FAG5|_%?uyDBB8Kn>1QVIYdBste@)!O z8_c2JHU}K0dOY~*dqwn-RoB*|i~^y*Dp{M~Y&+Sz+s$OJ;Is(^t}}iI-h9r_JM+-# zdJ`p6|A3mXTBQmg{T$)6KG@ZcE-(pM7En!Zie%MoHl1J|9o@uwo9odmzB&xP@z+S-ZAqMq|qryTc8$o^R1;tPcHY`DxvJTN$M@hDoxfxAHeQo%y?> z{@3^ZVEb3+<=@NpKc6UG^TgCF@$Sth8ufo)RVvQezUScsZfDtZ3hm}AANDTd(c-Zy zNo76ilAkd5?G&MVmKAfR30G?`RoKY$>+&H9PuUypF{e)&=ek6@-qoy}uGaU}k=07$ zaOI_(ThsiT{q7s>jaf8p&6JH5JD+>Y*-kGFODXC;CK#}sW1r}jrykDL7Zxv4i&tTv zdE`)dFOd!IC#hWjV~t{F)Z{xgES<)j##|Qrio!ch^0xFq!}Rsf_mdCo}A$ z8{?}Egzs9kcn8M| zz1cl|>3i3n@l`l~a1T!ytC`@MGuq43=dtTYsh;~7vtet}9@*EQxk~clZQip@t^XvF zrSrL~WV&%og+9O6c~RffqK8v!Hzhv}w!0#?G@AVv>k4nLd9wdsfBx?if2Fs6cVSJ< z9l6IBXFb2)f4~2~eEZq0Ym3*)dvE_%qu#y8TI#FKo{zcz7S;WD^?d2l{O|kjMjsN+ z|LJ~w($BXuvmXXEty<0PdVT33@54H!O}cNV=6iQLS?fHjJjocg<$B@G-$8;&nd|q2 zZt>2rJI|S;6tQZqjbz*wZp+U(J53BDrfFSRYBWcE?SbHBwe9Pb@3v|dd3wewhMrEX z{WZII|C#kHu`P#oF8}}P{OZ;A^^^Yn{PU{4{>Q_oQ{R5swTo-|)yF04*5y5U{A%%X z>F~=xP3BrlOIyFRy}Rz+oQI}6Q#*JY7^ZWXRL)=eSW~evfNQ_wjnBgEEe6)oEIs_3 z906|*#5cWJz^!2RG0z}RNufH1)y4YFpOWUr8Pj-GH>!997#p^z?m^{J!t=XZ8P|@4m7=e*Aq* z>ti3kKL;nrJPk-^dm8;RRaW%rP059VHDc@4T`r0~Iq4fPC)1Ye|DN1%dzD~q;!3~Z@N{GY-z>s4`yn|*8F?U zwT@x$k&UmJ?ri2LyUKgNY;QZ;owt48AAwVhU4;g z?3U!K*L$?Luk8Ev;lr(mZ~5hye=gf+V|VAy(cr%JKO1JwH-EX2At-s1hr)rYIrn4;pFK*UooS)qgZgKm{ z0hepeOAi+xV&qxOUw*W+*6KuvoYoVc>;50~pZ=Y^RB--`vck$8oQ>ICoBO9bsdi7Y z?aP?#x;tC0O#73?=8&HZOpaW?XL#Mbvqtmg8?W?FJ2k`o5Bn+$PT&0IWrmK0;F77; zbqCk0)jIXt{}I@?D8zkl<@>YgFKa&E-1`0Ap2|PVkJr!g`8MzWisvo=Ue0-=y8h(n zFVplUceXm6V40v;S7VoW{A4L-bkp);{($ESFWYY@PUErhbUdh;eC&Y3sjr-iQfnkV zJeIr=Qtf!{?i#ttb;5OCttCa1PMj*dEIp}_W4&|CEIw!Jw?RQ)eRU_p#^gm)>SqLglhC!A%ze>r;T5qojqP#MZL)%d z=XeNJ>)0kWPiVe#e@|uc+r7u%*OuwlJHGt9b6ahywY>iR`^&1WF2B7atk1CT#P{iQ z_KO_O=l{Vic(q^loH*ORtvq{NSN+-cM!)Zm`Ln0j=TB$dBh&kf^=bd}r~erZZwg;J U{9~~W0|Nttr>mdKI;Vst04~<1>;M1& literal 0 HcmV?d00001 diff --git a/doc/tutorial/Makefile b/doc/tutorial/Makefile new file mode 100644 index 000000000..d226e7348 --- /dev/null +++ b/doc/tutorial/Makefile @@ -0,0 +1,6 @@ +html: + txt2tags -thtml --toc gf-tutorial2.txt +tex: + txt2tags -ttex --toc gf-tutorial2.txt + pdflatex gf-tutorial2.tex + pdflatex gf-tutorial2.tex diff --git a/doc/tutorial/gf-tutorial2.html b/doc/tutorial/gf-tutorial2.html index 804ed1969..5576428b5 100644 --- a/doc/tutorial/gf-tutorial2.html +++ b/doc/tutorial/gf-tutorial2.html @@ -2,12 +2,13 @@ + Grammatical Framework Tutorial

Grammatical Framework Tutorial

-Author: Aarne Ranta <aarne (at) cs.chalmers.se>
-Last update: Fri Jun 16 17:28:39 2006 +Author: Aarne Ranta aarne (at) cs.chalmers.se
+Last update: Wed May 30 21:26:11 2007

@@ -31,108 +32,106 @@ Last update: Fri Jun 16 17:28:39 2006
  • Systematic generation
  • More on pipes; tracing
  • Writing and reading files -
  • Labelled context-free grammars -
  • The labelled context-free format -
  • The .gf grammar format +
  • The .gf grammar format -
  • Multilingual grammars and translation +
  • Multilingual grammars and translation -
  • Grammar architecture +
  • Grammar architecture -
  • System commands -
  • Resource modules +
  • Resource modules -
  • Morphology +
  • Morphology -
  • Using morphology in concrete syntax +
  • Using parameters in concrete syntax -
  • More constructs for concrete syntax +
  • Using the resource grammar library TODO -
  • More concepts of abstract syntax +
  • More constructs for concrete syntax -
  • More features of the module system +
  • More concepts of abstract syntax -
  • Using the standard resource library +
  • Transfer modules TODO +
  • Practical issues TODO -
  • Transfer modules -
  • Practical issues +
  • Larger case studies TODO -
  • Case studies - @@ -140,7 +139,7 @@ Last update: Fri Jun 16 17:28:39 2006

    - +

    Introduction

    @@ -199,7 +198,7 @@ A typical GF application is based on a multilingual grammar involving translation on a special domain. Existing applications of this idea include

      -
    • Alfa:: +
    • Alfa:: a natural-language interface to a proof editor (languages: English, French, Swedish)
    • KeY: @@ -207,6 +206,7 @@ translation on a special domain. Existing applications of this idea include (languages: OCL, English, German)
    • TALK: multilingual and multimodal dialogue systems + (languages: English, Finnish, French, German, Italian, Spanish, Swedish)
    • WebALT: a multilingual translator of mathematical exercises (languages: Catalan, English, Finnish, French, Spanish, Swedish) @@ -255,7 +255,7 @@ We start by building a small grammar for the domain of food: in this grammar, you can say things like

      -  this Italian cheese is delicious
      +    this Italian cheese is delicious
       

      in English and Italian. @@ -274,7 +274,7 @@ language, proper translation usually involves more. For instance, the order of words may have to be changed:

      -  Italian cheese ===> formaggio italiano
      +    Italian cheese ===> formaggio italiano
       

      The full GF grammar format is designed to support such @@ -299,7 +299,7 @@ forms of its words. While the complete description of morphology belongs to resource grammars, this tutorial will explain the programming concepts involved in morphology. This will moreover make it possible to grow the fragment covered by the food example. -The tutorial will in fact build a toy resource grammar in order +The tutorial will in fact build a miniature resource grammar in order to illustrate the module structure of library-based application grammar writing.

      @@ -318,14 +318,14 @@ quiz systems, can be built simply by writing scripts for the system. More complicated applications, such as natural-language interfaces and dialogue systems, also require programming in some general-purpose language. We will briefly explain how -GF grammars are used as components of Haskell, Java, and -Prolog grammars. The tutorial concludes with a couple of +GF grammars are used as components of Haskell, Java, Javascript, +and Prolog grammars. The tutorial concludes with a couple of case studies showing how such complete systems can be built.

      Getting the GF program

      -The program is open-source free software, which you can download via the +The GF program is open-source free software, which you can download via the GF Homepage: http://www.cs.chalmers.se/~aarne/GF

      @@ -375,42 +375,67 @@ follow them.

      The .cf grammar format

      Now you are ready to try out your first grammar. -We start with one that is not written in GF language, but -in the ubiquitous BNF notation (Backus Naur Form), which GF can also -understand. Type (or copy) the following lines in a file named +We start with one that is not written in the GF language, but +in the much more common BNF notation (Backus Naur Form). The GF +program understands a variant of this notation and translates it +internally to GF's own representation. +

      +

      +To get started, type (or copy) the following lines into a file named food.cf:

      -    S       ::= Item "is" Quality ;
      -    Item    ::= "this" Kind | "that" Kind ;
      -    Kind    ::= Quality Kind ;
      -    Kind    ::= "wine" | "cheese" | "fish" ;
      -    Quality ::= "very" Quality ;
      -    Quality ::= "fresh" | "warm" | "Italian" | "expensive" | "delicious" | "boring" ;
      +  Is.        S       ::= Item "is" Quality ;
      +  That.      Item    ::= "that" Kind ;
      +  This.      Item    ::= "this" Kind ;
      +  QKind.     Kind    ::= Quality Kind ;
      +  Cheese.    Kind    ::= "cheese" ;
      +  Fish.      Kind    ::= "fish" ;
      +  Wine.      Kind    ::= "wine" ;
      +  Italian.   Quality ::= "Italian" ;
      +  Boring.    Quality ::= "boring" ;
      +  Delicious. Quality ::= "delicious" ;
      +  Expensive. Quality ::= "expensive" ;
      +  Fresh.     Quality ::= "fresh" ;
      +  Very.      Quality ::= "very" Quality ;
      +  Warm.      Quality ::= "warm" ;
       

      -This grammar defines a set of phrases usable to speak about food. -It builds sentences (S) by assigning Qualities to -Items. The grammar shows a typical character of GF grammars: -they are small grammars describing some more or less well-defined -domain, such as in this case food. +For those who know ordinary BNF, the +notation we use includes one extra element: a label appearing +as the first element of each rule and terminated by a full stop.

      +

      +The grammar we wrote defines a set of phrases usable for speaking about food. +It builds sentences (S) by assigning Qualitys to +Items. Items are build from Kinds by prepending the +word "this" or "that". Kinds are either atomic, such as +"cheese" and "wine", or formed by prepending a Quality to a +Kind. A Quality is either atomic, such as "Italian" and "boring", +or built by another Quality by prepending "very". Those familiar with +the context-free grammar notation will notice that, for instance, the +following sentence can be built using this grammar: +

      +
      +    this delicious Italian wine is very very expensive
      +
      +

      Importing grammars and parsing strings

      -The first GF command when using a grammar is to import it. +The first GF command needed when using a grammar is to import it. The command has a long name, import, and a short name, i. You can type either

      -

      -```> import food.cf -

      +
      +    > import food.cf
      +

      or

      -

      -```> i food.cf -

      +
      +    > i food.cf
      +

      to get the same effect. The effect is that the GF program compiles your grammar into an internal @@ -421,18 +446,18 @@ You can now use GF for parsing:

           > parse "this cheese is delicious"
      -    S_Item_is_Quality (Item_this_Kind Kind_cheese) Quality_delicious
      +    Is (This Cheese) Delicious
         
           > p "that wine is very very Italian"
      -    S_Item_is_Quality (Item_that_Kind Kind_wine) 
      -      (Quality_very_Quality (Quality_very_Quality Quality_Italian))
      +    Is (That Wine) (Very (Very Italian))
       

      The parse (= p) command takes a string (in double quotes) and returns an abstract syntax tree - the thing -beginning with S_Item_Is_Quality. We will see soon how to make sense -of the abstract syntax trees - now you should just notice that the tree -is different for the two strings. +beginning with Is. Trees are built from the rule labels given in the +grammar, and record the ways in which the rules are used to produce the +strings. A tree is, in general, something easier than a string +for a machine to understand and to process further.

      Strings that return a tree when parsed do so in virtue of the grammar @@ -452,7 +477,7 @@ You can also use GF for linearizing parsing, taking trees into strings:

      -    > linearize S_Item_is_Quality (Item_that_Kind Kind_wine) Quality_warm
      +    > linearize Is (That Wine) Warm
           that wine is warm
       

      @@ -463,40 +488,42 @@ you can obtain a tree from somewhere else. One way to do so is

           > generate_random
      -    S_Item_is_Quality (Item_this_Kind Kind_wine) Quality_delicious
      +    Is (This (QKind Italian Fish)) Fresh
       

      Now you can copy the tree and paste it to the linearize command. -Or, more efficiently, feed random generation into linearization by using +Or, more conveniently, feed random generation into linearization by using a pipe.

           > gr | l
      -    this fresh cheese is delicious
      +    this Italian fish is fresh
       

      Visualizing trees

      The gibberish code with parentheses returned by the parser does not -look like trees. Why is it called so? Trees are a data structure that -represent nesting: trees are branching entities, and the branches +look like trees. Why is it called so? From the abstract mathematical +point of view, trees are a data structure that +represents nesting: trees are branching entities, and the branches are themselves trees. Parentheses give a linear representation of trees, useful for the computer. But the human eye may prefer to see a visualization; for this purpose, GF provides the command visualizre_tree = vt, to which parsing (and any other tree-producing command) can be piped:

      -  parse "this delicious cheese is very Italian" | vt
      +    parse "this delicious cheese is very Italian" | vt
       

      - +

      Some random-generated sentences

      -Random generation can be quite amusing. So you may want to +Random generation is a good way to test a grammar; it can also +be quite amusing. So you may want to generate ten strings with one and the same command:

      @@ -559,9 +586,9 @@ want to see:
       
           > gr -tr | l -tr | p
         
      -    S_Item_is_Quality (Item_this_Kind Kind_cheese) Quality_boring
      +    Is (This Cheese) Boring
           this cheese is boring
      -    S_Item_is_Quality (Item_this_Kind Kind_cheese) Quality_boring
      +    Is (This Cheese) Boring  
       

      This facility is good for test purposes: for instance, you @@ -592,91 +619,11 @@ not recognize the string in the file, because it is not a sentence but a sequence of ten sentences.

      -

      Labelled context-free grammars

      -

      -The syntax trees returned by GF's parser in the previous examples -are not so nice to look at. The identifiers that form the tree -are labels of the BNF rules. To see which label corresponds to -which rule, you can use the print_grammar = pg command -with the printer flag set to cf (which means context-free): -

      -
      -    > print_grammar -printer=cf
      -  
      -    S_Item_is_Quality. S ::= Item "is" Quality ;
      -    Quality_Italian. Quality ::= "Italian" ;
      -    Quality_boring. Quality ::= "boring" ;
      -    Quality_delicious. Quality ::= "delicious" ;
      -    Quality_expensive. Quality ::= "expensive" ;
      -    Quality_fresh. Quality ::= "fresh" ;
      -    Quality_very_Quality. Quality ::= "very" Quality ;
      -    Quality_warm. Quality ::= "warm" ;
      -    Kind_Quality_Kind. Kind ::= Quality Kind ;
      -    Kind_cheese. Kind ::= "cheese" ;
      -    Kind_fish. Kind ::= "fish" ;
      -    Kind_wine. Kind ::= "wine" ;
      -    Item_that_Kind. Item ::= "that" Kind ;
      -    Item_this_Kind. Item ::= "this" Kind ;
      -
      -

      -A syntax tree such as -

      -
      -    S_Item_is_Quality (Item_this_Kind Kind_wine) Quality_delicious
      -
      -

      -encodes the sequence of grammar rules used for building the -tree. If you look at this tree, you will notice that Item_this_Kind -is the label of the rule prefixing this to a Kind, -thereby forming an Item. -Kind_wine is the label of the kind "wine", -and so on. These labels are formed automatically when the grammar -is compiled by GF, in a way that guarantees that different rules -get different labels. -

      - -

      The labelled context-free format

      -

      -The labelled context-free grammar format permits user-defined -labels to each rule. -In files with the suffix .cf, you can prefix rules with -labels that you provide yourself - these may be more useful -than the automatically generated ones. The following is a possible -labelling of food.cf with nicer-looking labels. -

      -
      -    Is.        S       ::= Item "is" Quality ;
      -    That.      Item    ::= "that" Kind ;
      -    This.      Item    ::= "this" Kind ;
      -    QKind.     Kind    ::= Quality Kind ;
      -    Cheese.    Kind    ::= "cheese" ;
      -    Fish.      Kind    ::= "fish" ;
      -    Wine.      Kind    ::= "wine" ;
      -    Italian.   Quality ::= "Italian" ;
      -    Boring.    Quality ::= "boring" ;
      -    Delicious. Quality ::= "delicious" ;
      -    Expensive. Quality ::= "expensive" ;
      -    Fresh.     Quality ::= "fresh" ;
      -    Very.      Quality ::= "very" Quality ;
      -    Warm.      Quality ::= "warm" ;
      -
      -

      -With this grammar, the trees look as follows: -

      -
      -    > parse -tr "this delicious cheese is very Italian" | vt
      -    Is (This (QKind Delicious Cheese)) (Very Italian)
      -
      -

      -

      - -

      -

      The .gf grammar format

      -To see what there is in GF's shell state when a grammar -has been imported, you can give the plain command -print_grammar = pg. +To see GF's internal representation of a grammar +that you have imported, you can give the command +print_grammar = pg,

           > print_grammar
      @@ -691,12 +638,12 @@ However, we will now start the demonstration
       how GF's own notation gives you
       much more expressive power than the .cf
       format. We will introduce the .gf format by presenting
      -one more way of defining the same grammar as in
      +another way of defining the same grammar as in
       food.cf.
       Then we will show how the full GF grammar format enables you
      -to do things that are not possible in the weaker formats.
      +to do things that are not possible in the context-free format.
       

      - +

      Abstract and concrete syntax

      A GF grammar consists of two main parts: @@ -707,14 +654,14 @@ A GF grammar consists of two main parts:

    -The CF format fuses these two things together, but it is possible -to take them apart. For instance, the sentence formation rule +The context-free format fuses these two things together, but it is always +possible to take them apart. For instance, the sentence formation rule

         Is. S ::= Item "is" Quality ;
     

    -is interpreted as the following pair of rules: +is interpreted as the following pair of GF rules:

         fun Is : Item -> Quality -> S ;
    @@ -731,7 +678,7 @@ The latter rule, with the keyword lin, belongs to the concrete synt
     It defines the linearization function for
     syntax trees of form (Is item quality). 
     

    - +

    Judgement forms

    Rules in a GF grammar are called judgements, and the keywords @@ -759,7 +706,6 @@ judgement forms: -

    • concrete syntax

      @@ -780,14 +726,13 @@ judgement forms: -

      We return to the precise meanings of these judgement forms later. First we will look at how judgements are grouped into modules, and show how the food grammar is expressed by using modules and judgements.

      - +

      Module types

      A GF grammar consists of modules, @@ -801,8 +746,8 @@ module forms are abstract syntax A, with judgements in the module body M.

    - -

    Record types, records, and ``Str``s

    + +

    Records and strings

    The linearization type of a category is a record type, with zero of more fields of different types. The simplest record @@ -861,7 +806,7 @@ can be used for lists of tokens. The expression

    denotes the empty token list.

    - +

    An abstract syntax example

    To express the abstract syntax of food.cf in @@ -874,7 +819,7 @@ a file Food.gf, we write two kinds of judgements:

    -  abstract Food = {
    +    abstract Food = {
       
         cat
           S ; Item ; Kind ; Quality ;
    @@ -886,14 +831,27 @@ a file Food.gf, we write two kinds of judgements:
           Wine, Cheese, Fish : Kind ;
           Very : Quality -> Quality ;
           Fresh, Warm, Italian, Expensive, Delicious, Boring : Quality ;
    -  }
    +    }
     

    Notice the use of shorthands permitting the sharing of -the keyword in subsequent judgements, and of the type -in subsequent fun judgements. +the keyword in subsequent judgements,

    - +
    +    cat S ; Item ;   ===   cat S ; cat Item ; 
    +
    +

    +and of the type in subsequent fun judgements, +

    +
    +    fun Wine, Fish : Kind ;            ===
    +    fun Wine : Kind ; Fish : Kind ;    ===
    +    fun Wine : Kind ; fun Fish : Kind ;
    +
    +

    +The order of judgements in a module is free. +

    +

    A concrete syntax example

    Each category introduced in Food.gf is @@ -902,7 +860,7 @@ function is given a lin rule. Similar shorthands apply as in abstract modules.

    -  concrete FoodEng of Food = {
    +    concrete FoodEng of Food = {
       
         lincat
           S, Item, Kind, Quality = {s : Str} ;
    @@ -922,16 +880,16 @@ apply as in abstract modules.
           Expensive = {s = "expensive"} ;
           Delicious = {s = "delicious"} ;
           Boring = {s = "boring"} ;
    -  }
    +    }
     

    - +

    Modules and files

    -Module name + .gf = file name +Source files: Module name + .gf = file name

    -Each module is compiled into a .gfc file. +Target files: each module is compiled into a .gfc file.

    Import FoodEng.gf and see what happens @@ -952,7 +910,7 @@ GF source files. When reading a module, GF decides whether to use an existing .gfc file or to generate a new one, by looking at modification times.

    - +

    Multilingual grammars and translation

    The main advantage of separating abstract from concrete syntax is that @@ -965,7 +923,7 @@ translation. Let us build an Italian concrete syntax for Food and then test the resulting multilingual grammar.

    - +

    An Italian concrete syntax

       concrete FoodIta of Food = {
    @@ -993,7 +951,7 @@ multilingual grammar.
       
     

    - +

    Using a multilingual grammar

    Import the two grammars in the same GF session. @@ -1032,7 +990,7 @@ To see what grammars are in scope and which is the main one, use the command actual concretes : FoodIta FoodEng

    - +

    Translation session

    If translation is what you want to do with a set of grammars, a convenient @@ -1055,7 +1013,7 @@ A dot . terminates the translation session. >

    - +

    Translation quiz

    This is a simple language exercise that can be automatically @@ -1095,9 +1053,9 @@ file for later use, by the command translation_list = tl

    The number flag gives the number of sentences generated.

    - +

    Grammar architecture

    - +

    Extending a grammar

    The module system of GF makes it possible to extend a @@ -1132,7 +1090,7 @@ be built for concrete syntaxes: The effect of extension is that all of the contents of the extended and extending module are put together.

    - +

    Multiple inheritance

    Specialized vocabularies can be represented as small grammars that @@ -1167,7 +1125,7 @@ At this point, you would perhaps like to go back to Food and take apart Wine to build a special Drink module.

    - +

    Visualizing module structure

    When you have created all the abstract syntaxes and @@ -1195,8 +1153,8 @@ The graph uses

    - -

    System commands

    + +

    System commands

    To document your grammar, you may want to print the graph into a file, e.g. a .png file that @@ -1223,9 +1181,9 @@ are available: > help -printer

    - +

    Resource modules

    - +

    The golden rule of functional programming

    In comparison to the .cf format, the .gf format looks rather @@ -1247,7 +1205,7 @@ changing parts, parameters. In functional programming languages, such as Haskell, it is possible to share much more than in languages such as C and Java.

    - +

    Operation definitions

    GF is a functional programming language, not only in the sense that @@ -1277,7 +1235,7 @@ its type, and an expression defining it. As for the syntax of the defining expression, notice the lambda abstraction form \x -> t of the function.

    - +

    The ``resource`` module type

    Operator definitions can be included in a concrete syntax. @@ -1305,7 +1263,7 @@ Resource modules can extend other resource modules, in the same way as modules of other types can extend modules of the same type. Thus it is possible to build resource hierarchies.

    - +

    Opening a ``resource``

    Any number of resource modules can be @@ -1340,22 +1298,22 @@ opened in a new version of FoodEng. }

    -The same string operations could be use to write FoodIta +The same string operations could be used to write FoodIta more concisely.

    - +

    Division of labour

    Using operations defined in resource modules is a way to avoid repetitive code. In addition, it enables a new kind of modularity and division of labour in grammar writing: grammarians familiar with -the linguistic details of a language can put this knowledge +the linguistic details of a language can make this knowledge available through resource grammar modules, whose users only need to pick the right operations and not to know their implementation details.

    - +

    Morphology

    Suppose we want to say, with the vocabulary included in @@ -1373,9 +1331,9 @@ singular forms. The introduction of plural forms requires two things:

      -
    • to inflect nouns and verbs in singular and plural number -
    • to describe the agreement of the verb to subject: the - rule that the verb must have the same number as the subject +
    • the inflection of nouns and verbs in singular and plural +
    • the agreement of the verb to subject: + the verb must have the same number as the subject

    @@ -1390,7 +1348,7 @@ and many new expression forms. We also need to generalize linearization types from strings to more complex types.

    - +

    Parameters and tables

    We define the parameter type of number in Englisn by @@ -1422,6 +1380,10 @@ example shows such a table: } ;

    +The table consists of branches, where a pattern on the +left of the arrow => is assigned a value on the right. +

    +

    The application of a table to a parameter is done by the selection operator !. For instance,

    @@ -1429,19 +1391,22 @@ operator !. For instance, table {Sg => "cheese" ; Pl => "cheeses"} ! Pl

    -is a selection, whose value is "cheeses". +is a selection that computes into the value "cheeses". +This computation is performed by pattern matching: return +the value from the first branch whose pattern matches the +selection argument.

    - +

    Inflection tables, paradigms, and ``oper`` definitions

    All English common nouns are inflected in number, most of them in the -same way: the plural form is formed from the singular form by adding the +same way: the plural form is obtained from the singular by adding the ending s. This rule is an example of a paradigm - a formula telling how the inflection forms of a word are formed.

    -From GF point of view, a paradigm is a function that takes a lemma - +From the GF point of view, a paradigm is a function that takes a lemma - also known as a dictionary form - and returns an inflection table of desired type. Paradigms are not functions in the sense of the fun judgements of abstract syntax (which operate on trees and not @@ -1465,7 +1430,7 @@ are written together to form one token. Thus, for instance, (regNoun "cheese").s ! Pl ---> "cheese" + "s" ---> "cheeses"

    - +

    Worst-case functions and data abstraction

    Some English nouns, such as mouse, are so irregular that @@ -1506,7 +1471,7 @@ interface (i.e. the system of type signatures) that makes it correct to use these functions in concrete modules. In programming terms, Noun is then treated as an abstract datatype.

    - +

    A system of paradigms using Prelude operations

    In addition to the completely regular noun paradigm regNoun, @@ -1534,11 +1499,11 @@ all characters but the last) of a string: yNoun : Str -> Noun = \fly -> mkNoun fly (init fly + "ies") ;

    -The operator init belongs to a set of operations in the +The operation init belongs to a set of operations in the resource module Prelude, which therefore has to be opened so that init can be used.

    - +

    An intelligent noun paradigm using ``case`` expressions

    It may be hard for the user of a resource morphology to pick the right @@ -1568,15 +1533,13 @@ this, either use mkNoun or modify regNoun so that the "y" case does not apply if the second-last character is a vowel.

    - +

    Pattern matching

    -Expressions of the table form are built from lists of -argument-value pairs. These pairs are called the branches -of the table. In addition to constants introduced in -param definitions, the left-hand side of a branch can more -generally be a pattern, and the computation of selection is -then performed by pattern matching: +We have so far built all expressions of the table form +from branches whose patterns are constants introduced in +param definitions, as well as constant strings. +But there are more expressive patterns. Here is a summary of the possible forms:

    • a variable pattern (identifier other than constant parameter) matches anything @@ -1604,8 +1567,8 @@ programming languages are syntactic sugar for table selections: case e of {...} === table {...} ! e

      - -

      Morphological ``resource`` modules

      + +

      Morphological resource modules

      A common idiom is to gather the oper and param definitions @@ -1655,19 +1618,18 @@ module depends on. The directory prelude is a subdirectory of set the environment variable GF_LIB_PATH to point to this directory.

      - -

      Testing ``resource`` modules

      + +

      Testing resource modules

      -To test a resource module independently, you can import it -with a flag that tells GF to retain the oper definitions +To test a resource module independently, you must import it +with the flag -retain, which tells GF to retain oper definitions in the memory; the usual behaviour is that oper definitions are just applied to compile linearization rules (this is called inlining) and then thrown away.

      -   > i -retain MorphoEng.gf
      +    > i -retain MorphoEng.gf
       
      -

      The command compute_concrete = cc computes any expression formed by operations and other GF constructs. For example, @@ -1698,8 +1660,8 @@ Why does the command also show the operations that form Verb is first computed, and its value happens to be the same as the value of Noun.

      - -

      Using morphology in concrete syntax

      + +

      Using parameters in concrete syntax

      We can now enrich the concrete syntax definitions to comprise morphology. This will involve a more radical @@ -1709,7 +1671,7 @@ parameters and linearization types are different in different languages - but this does not prevent the use of a common abstract syntax.

      - +

      Parametric vs. inherent features, agreement

      The rule of subject-verb agreement in English says that the verb @@ -1731,7 +1693,7 @@ whereas the number of NP is a variable feature (or a

      The agreement rule itself is expressed in the linearization rule of -the predication structure: +the predication function:

           lin PredVP np vp = {s = np.s ++ vp.s ! np.n} ;
      @@ -1744,7 +1706,7 @@ plural determiners These and Those.
       The reader is invited to inspect the way in which agreement works in
       the formation of sentences.
       

      - +

      English concrete syntax with parameters

      The grammar uses both @@ -1791,7 +1753,7 @@ and parametrized modules. }

      - +

      Hierarchic parameter types

      The reader familiar with a functional programming language such as @@ -1844,7 +1806,7 @@ can be defined }

      - +

      Morphological analysis and morphology quiz

      Even though morphology is in GF @@ -1876,7 +1838,7 @@ the category is set to be something else than S. For instance,

      Finally, a list of morphological exercises can be generated -off-line saved in a +off-line and saved in a file for later use, by the command morpho_list = ml

      @@ -1885,7 +1847,7 @@ file for later use, by the command morpho_list = ml
       

      The number flag gives the number of exercises generated.

      - +

      Discontinuous constituents

      A linearization type may contain more strings than one. @@ -1926,31 +1888,7 @@ valued field labelled s. Therefore, discontinuous constituents are not a good idea in top-level categories accessed by the users of a grammar application.

      - -

      More constructs for concrete syntax

      - -

      Local definitions

      -

      -Local definitions ("let expressions") are used in functional -programming for two reasons: to structure the code into smaller -expressions, and to avoid repeated computation of one and -the same expression. Here is an example, from -``MorphoIta: -

      -
      -    oper regNoun : Str -> Noun = \vino -> 
      -          let 
      -            vin = init vino ;
      -            o   = last vino
      -          in
      -          case o of {
      -            "a"       => mkNoun Fem  vino (vin + "e") ;
      -            "o" | "e" => mkNoun Masc vino (vin + "i") ;
      -            _         => mkNoun Masc vino vino         
      -            } ;
      -
      -

      - +

      Free variation

      Sometimes there are many alternative ways to define a concrete syntax. @@ -1975,27 +1913,259 @@ can be used e.g. if a word lacks a certain form. In general, variants should be used cautiously. It is not recommended for modules aimed to be libraries, because the user of the library has no way to choose among the variants. -Moreover, variants is only defined for basic types (Str -and parameter types). The grammar compiler will admit -variants for any types, but it will push it to the -level of basic types in a way that may be unwanted. -For instance, German has two words meaning "car", -Wagen, which is Masculine, and Auto, which is Neuter. -However, if one writes +

      + +

      Overloading of operations

      +

      +Large libraries, such as the GF Resource Grammar Library, may define +hundreds of names, which can be unpractical +for both the library writer and the user. The writer has to invent longer +and longer names which are not always intuitive, +and the user has to learn or at least be able to find all these names. +A solution to this problem, adopted by languages such as C++, is overloading: +the same name can be used for several functions. When such a name is used, the +compiler performs overload resolution to find out which of the possible functions +is meant. The resolution is based on the types of the functions: all functions that +have the same name must have different types. +

      +

      +In C++, functions with the same name can be scattered everywhere in the program. +In GF, they must be grouped together in overload groups. Here is an example +of an overload group, defining four ways to define nouns in Italian:

      -    variants {{s = "Wagen" ; g = Masc} ; {s = "Auto" ; g = Neutr}}
      +    oper mkN = overload {
      +      mkN : Str -> N                  = -- regular nouns
      +      mkN : Str -> Gender -> N        = -- regular nouns with unexpected gender
      +      mkN : Str -> Str -> N           = -- irregular nouns
      +      mkN : Str -> Str -> Gender -> N = -- irregular nouns with unexpected gender
      +    }
       

      -this will compute to +All of the following uses of mkN are easy to resolve:

      -    {s = variants {"Wagen" ; "Auto"} ; g = variants {Masc ; Neutr}}
      +    lin Pizza = mkN "pizza" ;         -- Str -> N
      +    lin Hand  = mkN "mano" Fem ;      -- Str -> Gender -> N
      +    lin Man   = mkN "uomo" "uomini" ; -- Str -> Str -> N
      +
      +

      + +

      Using the resource grammar library TODO

      +

      +A resource grammar is a grammar built on linguistic grounds, +to describe a language rather than a domain. +The GF resource grammar library, which contains resource grammars for +10 languages, is described more closely in the following +documents: +

      + + + +

      Interfaces, instances, and functors

      + +

      The simplest way

      +

      +The simplest way is to open a top-level Lang module +and a Paradigms module: +

      +
      +    abstract Foo = ...
      +  
      +    concrete FooEng = open LangEng, ParadigmsEng in ...
      +    concrete FooSwe = open LangSwe, ParadigmsSwe in ...
       

      -which will also accept erroneous combinations of strings and genders. +Here is an example.

      +
      +  abstract Arithm = {
      +    cat
      +      Prop ;
      +      Nat ;
      +    fun
      +      Zero : Nat ;
      +      Succ : Nat -> Nat ;
      +      Even : Nat -> Prop ;
      +      And  : Prop -> Prop -> Prop ;
      +  }
      +  
      +  --# -path=.:alltenses:prelude
      +  
      +  concrete ArithmEng of Arithm = open LangEng, ParadigmsEng in {
      +    lincat
      +      Prop = S ;
      +      Nat  = NP ;
      +    lin
      +      Zero = 
      +        UsePN (regPN "zero" nonhuman) ;
      +      Succ n = 
      +        DetCN (DetSg (SgQuant DefArt) NoOrd) (ComplN2 (regN2 "successor") n) ;
      +      Even n = 
      +        UseCl TPres ASimul PPos 
      +          (PredVP n (UseComp (CompAP (PositA (regA "even"))))) ;
      +      And x y = 
      +        ConjS and_Conj (BaseS x y) ;
      +  
      +  }
      +  
      +  --# -path=.:alltenses:prelude
      +  
      +  concrete ArithmSwe of Arithm = open LangSwe, ParadigmsSwe in {
      +    lincat
      +      Prop = S ;
      +      Nat  = NP ;
      +    lin
      +      Zero = 
      +        UsePN (regPN "noll" neutrum) ;
      +      Succ n = 
      +        DetCN (DetSg (SgQuant DefArt) NoOrd) 
      +          (ComplN2 (mkN2 (mk2N "efterföljare" "efterföljare") 
      +             (mkPreposition "till")) n) ;
      +      Even n = 
      +        UseCl TPres ASimul PPos 
      +          (PredVP n (UseComp (CompAP (PositA (regA "jämn"))))) ;
      +      And x y = 
      +        ConjS and_Conj (BaseS x y) ;
      +  }
      +
      +

      +

      How to find resource functions

      +

      +The definitions in this example were found by parsing: +

      +
      +    > i LangEng.gf
      +  
      +    -- for Successor:
      +    > p -cat=NP -mcfg -parser=topdown "the mother of Paris"
      +  
      +    -- for Even:
      +    > p -cat=S -mcfg -parser=topdown "Paris is old"
      +  
      +    -- for And:
      +    > p -cat=S -mcfg -parser=topdown "Paris is old and I am old"
      +
      +

      +The use of parsing can be systematized by example-based grammar writing, +to which we will return later. +

      + +

      A functor implementation

      +

      +The interesting thing now is that the +code in ArithmSwe is similar to the code in ArithmEng, except for +some lexical items ("noll" vs. "zero", "efterföljare" vs. "successor", +"jämn" vs. "even"). How can we exploit the similarities and +actually share code between the languages? +

      +

      +The solution is to use a functor: an incomplete module that opens +an abstract as an interface, and then instantiate it to different +languages that implement the interface. The structure is as follows: +

      +
      +    abstract Foo ...
      +  
      +    incomplete concrete FooI = open Lang, Lex in ...
      +  
      +    concrete FooEng of Foo = FooI with (Lang=LangEng), (Lex=LexEng) ;
      +    concrete FooSwe of Foo = FooI with (Lang=LangSwe), (Lex=LexSwe) ;
      +
      +

      +where Lex is an abstract lexicon that includes the vocabulary +specific to this application: +

      +
      +    abstract Lex = Cat ** ...
      +  
      +    concrete LexEng of Lex = CatEng ** open ParadigmsEng in ...
      +    concrete LexSwe of Lex = CatSwe ** open ParadigmsSwe in ...  
      +
      +

      +Here, again, a complete example (abstract Arithm is as above): +

      +
      +  incomplete concrete ArithmI of Arithm = open Lang, Lex in {
      +    lincat
      +      Prop = S ;
      +      Nat  = NP ;
      +    lin
      +      Zero = 
      +        UsePN zero_PN ;
      +      Succ n = 
      +        DetCN (DetSg (SgQuant DefArt) NoOrd) (ComplN2 successor_N2 n) ;
      +      Even n = 
      +        UseCl TPres ASimul PPos 
      +          (PredVP n (UseComp (CompAP (PositA even_A)))) ;
      +      And x y = 
      +        ConjS and_Conj (BaseS x y) ;
      +  }
      +  
      +  --# -path=.:alltenses:prelude
      +  concrete ArithmEng of Arithm = ArithmI with
      +    (Lang = LangEng),
      +    (Lex = LexEng) ;
      +  
      +  --# -path=.:alltenses:prelude
      +  concrete ArithmSwe of Arithm = ArithmI with
      +    (Lang = LangSwe),
      +    (Lex = LexSwe) ;
      +  
      +  abstract Lex = Cat ** {
      +    fun
      +      zero_PN : PN ;
      +      successor_N2 : N2 ;  
      +      even_A : A ;
      +  }
      +  
      +  concrete LexSwe of Lex = CatSwe ** open ParadigmsSwe in {
      +    lin 
      +      zero_PN = regPN "noll" neutrum ;
      +      successor_N2 = 
      +        mkN2 (mk2N "efterföljare" "efterföljare") (mkPreposition "till") ;
      +      even_A = regA "jämn" ;
      +  }
      +
      +

      + +

      Restricted inheritance and qualified opening

      + +

      More constructs for concrete syntax

      +

      +In this chapter, we go through constructs that are not necessary in simple grammars +or when the concrete syntax relies on libraries, but very useful when writing advanced +concrete syntax implementations, such as resource grammar libraries. +

      + +

      Local definitions

      +

      +Local definitions ("let expressions") are used in functional +programming for two reasons: to structure the code into smaller +expressions, and to avoid repeated computation of one and +the same expression. Here is an example, from +MorphoIta: +

      +
      +    oper regNoun : Str -> Noun = \vino -> 
      +          let 
      +            vin = init vino ;
      +            o   = last vino
      +          in
      +          case o of {
      +            "a"       => mkNoun Fem  vino (vin + "e") ;
      +            "o" | "e" => mkNoun Masc vino (vin + "i") ;
      +            _         => mkNoun Masc vino vino         
      +            } ;
      +
      +

      +

      Record extension and subtyping

      Record types and records can be extended with new fields. For instance, @@ -2025,7 +2195,7 @@ be used whenever a verb is required. Contravariance means that a function taking an R as argument can also be applied to any object of a subtype T.

      - +

      Tuples and product types

      Product types and tuples are syntactic sugar for record types and records: @@ -2035,9 +2205,9 @@ Product types and tuples are syntactic sugar for record types and records: <t1, ..., tn> === {p1 = T1 ; ... ; pn = Tn}

      -Thus the labels p1, p2,...` are hard-coded. +Thus the labels p1, p2,... are hard-coded.

      - +

      Record and tuple patterns

      Record types of parameter types are also parameter types. @@ -2048,7 +2218,7 @@ A typical example is a record of agreement features, e.g. French

      Notice the term PType rather than just Type referring to -parameter types. Every PType is also a Type. +parameter types. Every PType is also a Type, but not vice-versa.

      Pattern matching is done in the expected way, but it can moreover @@ -2075,7 +2245,7 @@ possible to write, slightly surprisingly, }

      - +

      Regular expression patterns

      To define string operations computed at compile time, such @@ -2092,8 +2262,24 @@ as in morphology, it is handy to use regular expression patterns:

      The last three apply to all types of patterns, the first two only to token strings. -Example: plural formation in Swedish 2nd declension -(pojke-pojkar, nyckel-nycklar, seger-segrar, bil-bilar): +As an example, we give a rule for the formation of English word forms +ending with an s and used in the formation of both plural nouns and +third-person present-tense verbs. +

      +
      +    add_s : Str -> Str = \w -> case w of {
      +      _ + "oo"                           => s + "s" ;   -- bamboo
      +      _ + ("s" | "z" | "x" | "sh" | "o") => w + "es" ;  -- bus, hero
      +      _ + ("a" | "o" | "u" | "e") + "y"  => w + "s" ;   -- boy
      +      x + "y"                            => x + "ies" ; -- fly
      +      _                                  => w + "s"     -- car
      +      } ;
      +
      +

      +Here is another example, the plural formation in Swedish 2nd declension. +The second branch uses a variable binding with @ to cover the cases where an +unstressed pre-final vowel e disappears in the plural +(nyckel-nycklar, seger-segrar, bil-bilar):

           plural2 : Str -> Str = \w -> case w of {
      @@ -2102,17 +2288,7 @@ Example: plural formation in Swedish 2nd declension
             bil                              => bil + "ar"
             } ;
       
      -

      -Another example: English noun plural formation. -

      -
      -    plural : Str -> Str = \w -> case w of {
      -      _ + ("s" | "z" | "x" | "sh")      => w + "es" ;
      -      _ + ("a" | "o" | "u" | "e") + "y" => w + "s" ;
      -      x + "y"                           => x + "ies" ;
      -      _                                 => w + "s"
      -      } ;
      -
      +

      Semantics: variables are always bound to the first match, which is the first in the sequence of binding lists Match p v defined as follows. In the definition, @@ -2137,7 +2313,7 @@ Examples:

    • x + "er"* matches "burgerer" with ``x = "burg"
    - +

    Prefix-dependent choices

    Sometimes a token has different forms depending on the token @@ -2156,7 +2332,7 @@ Thus

         artIndef ++ "cheese"  --->  "a" ++ "cheese"
    -    artIndef ++ "apple"   --->  "an" ++ "cheese"
    +    artIndef ++ "apple"   --->  "an" ++ "apple"
     

    This very example does not work in all situations: the prefix @@ -2171,7 +2347,7 @@ This very example does not work in all situations: the prefix } ;

    - +

    Predefined types and operations

    GF has the following predefined categories in abstract syntax: @@ -2194,11 +2370,17 @@ they can be used as arguments. For example: -- e.g. (StreetAddress 10 "Downing Street") : Address

    -The linearization type is {s : Str} for all these categories. +FIXME: The linearization type is {s : Str} for all these categories.

    - +

    More concepts of abstract syntax

    - +

    +This section is about the use of the type theory part of GF for +including more semantics in grammars. Some of the subsections present +ideas that have not yet been used in real-world applications, and whose +tool support outside the GF program is not complete. +

    +

    GF as a logical framework

    In this section, we will show how @@ -2217,8 +2399,8 @@ of such a theory, represented as an abstract module in GF.

       abstract Arithm = {
         cat
    -      Prop ;    -- proposition
    -      Nat ;     -- natural number
    +      Prop ;                        -- proposition
    +      Nat ;                         -- natural number
         fun
           Zero : Nat ;                  -- 0
           Succ : Nat -> Nat ;           -- successor of x
    @@ -2230,7 +2412,7 @@ of such a theory, represented as an abstract module in GF.
     A concrete syntax is given below, as an example of using the resource grammar
     library.
     

    - +

    Dependent types

    Dependent types are a characteristic feature of GF, @@ -2266,12 +2448,10 @@ a street, a city, and a country. }

    -The linearization rules -are straightforward, +The linearization rules are straightforward,

         lin
    -  
           mkAddress country city street = 
             ss (street.s ++ "," ++ city.s ++ "," ++ country.s) ;
           UK = ss ("U.K.") ;
    @@ -2286,11 +2466,11 @@ are straightforward,
           AvAlsaceLorraine = ss ("avenue" ++ "Alsace-Lorraine") ;
     

    -with the exception of mkAddress, where we have +Notice that, in mkAddress, we have reversed the order of the constituents. The type of mkAddress in the abstract syntax takes its arguments in a "logical" order, -with increasing precision. (This order is sometimes even used in the concrete -syntax of addresses, e.g. in Russia). +with increasing precision. (This order is sometimes even used in the +concrete syntax of addresses, e.g. in Russia).

    Both existing and non-existing addresses are recognized by this @@ -2314,10 +2494,11 @@ well-formed. What we do is to include contexts in cat judgements:

    -    cat Address ; 
    -    cat Country ; 
    -    cat City Country ; 
    -    cat Street (x : Country)(y : City x) ;
    +    cat 
    +      Address ; 
    +      Country ; 
    +      City Country ; 
    +      Street (x : Country)(City x) ;
     

    The first two judgements are as before, but the third one makes @@ -2342,19 +2523,18 @@ The fun judgements of the grammar are modified accordingly:

         fun
    +      mkAddress : (x : Country) -> (y : City x) -> Street x y -> Address ;
         
    -    mkAddress : (x : Country) -> (y : City x) -> Street x y -> Address ;
    -    
    -    UK : Country ;
    -    France : Country ;
    -    Paris : City France ; 
    -    London : City UK ; 
    -    Grenoble : City France ;
    -    OxfordSt : Street UK London ; 
    -    ShaftesburyAve : Street UK London ;
    -    BdRaspail : Street France Paris ; 
    -    RueBlondel : Street France Paris ; 
    -    AvAlsaceLorraine : Street France Grenoble ;
    +      UK : Country ;
    +      France : Country ;
    +      Paris : City France ; 
    +      London : City UK ; 
    +      Grenoble : City France ;
    +      OxfordSt : Street UK London ; 
    +      ShaftesburyAve : Street UK London ;
    +      BdRaspail : Street France Paris ; 
    +      RueBlondel : Street France Paris ; 
    +      AvAlsaceLorraine : Street France Grenoble ;
     

    Since the type of mkAddress now has dependencies among @@ -2394,11 +2574,17 @@ or any other naming of the variables. Actually the use of variables sometimes shortens the code, since we can write e.g.

    -    fun  ConjNP : Conj -> (x,y : NP) -> NP ;
    -    oper triple : (x,y,z : Str) -> Str = \x,y,z -> x ++ y ++ z ;
    +    oper triple : (x,y,z : Str) -> Str = ...
    +
    +

    +If a bound variable is not used, it can here, as elswhere in GF, be replaced by +a wildcard: +

    +
    +    oper triple : (_,_,_ : Str) -> Str = ...
     

    - +

    Dependent types in concrete syntax

    The functional fragment of GF @@ -2443,7 +2629,7 @@ When the operations are used, the type checker requires them to be equipped with all their arguments; this may be a nuisance for a Haskell or ML programmer.

    - +

    Expressing selectional restrictions

    This section introduces a way of using dependent types to @@ -2467,8 +2653,8 @@ For instance, the sentence is syntactically well-formed but semantically ill-formed. It is well-formed because it combines a well-formed noun phrase ("the number 2") with a well-formed -verb phrase ("is equilateral") in accordance with the -rule that the verb phrase is inflected in the +verb phrase ("is equilateral") and satisfies the agreement +rule saying that the verb phrase is inflected in the number of the noun phrase:

    @@ -2523,6 +2709,7 @@ but no proposition linearized to
     

    since Equilateral two is not a well-formed type-theoretical object. +It is not even accepted by the context-free parser.

    When formalizing mathematics, e.g. in the purpose of @@ -2559,64 +2746,15 @@ and dependencies of other categories on this:

         cat 
           S ;            -- sentence
    -      V1 Dom ;       -- one-place verb
    -      V2 Dom Dom ;   -- two-place verb
    +      V1 Dom ;       -- one-place verb with specific subject type
    +      V2 Dom Dom ;   -- two-place verb with specific subject and object types
           A1 Dom ;       -- one-place adjective
           A2 Dom Dom ;   -- two-place adjective
    -      PN Dom ;       -- proper name
    -      NP Dom ;       -- noun phrase
    +      NP Dom ;       -- noun phrase for an object of specific type
           Conj ;         -- conjunction
           Det ;          -- determiner
     

    -The number of Dom arguments depends on the semantic type -corresponding to the category: one-place verbs and adjectives -correspond to types of the form -

    -
    -    A -> Prop
    -
    -

    -whereas two-place verbs and adjectives correspond to types of the form -

    -
    -    A -> B -> Prop
    -
    -

    -where the domains A and B can be distinct. -Proper names correspond to types of the form -

    -
    -    A
    -
    -

    -that is, individual objects of the domain A. Noun phrases -correspond to -

    -
    -    (A -> Prop) -> Prop
    -
    -

    -that is, quantifiers over the domain A. -Sentences, conjunctions, and determiners correspond to -

    -
    -    Prop
    -    Prop -> Prop -> Prop
    -    (A : Dom) -> (A -> Prop) -> Prop
    -
    -

    -respectively, -and are thus independent of domain. As for common nouns CN, -the simplest semantics is that they correspond to -

    -
    -    Dom
    -
    -

    -In this section, we will, in fact, write Dom instead of CN. -

    -

    Having thus parametrized categories on domains, we have to reformulate the rules of predication, etc, accordingly. This is straightforward:

    @@ -2624,7 +2762,6 @@ the rules of predication, etc, accordingly. This is straightforward: fun PredV1 : (A : Dom) -> NP A -> V1 A -> S ; ComplV2 : (A,B : Dom) -> V2 A B -> NP B -> V1 A ; - UsePN : (A : Dom) -> PN A -> NP A ; DetCN : Det -> (A : Dom) -> NP A ; ModA1 : (A : Dom) -> A1 A -> Dom ; ConjS : Conj -> S -> S -> S ; @@ -2632,14 +2769,13 @@ the rules of predication, etc, accordingly. This is straightforward:

    In linearization rules, -we typically use wildcards for the domain arguments, -to get arities right: +we use wildcards for the domain arguments, +because they don't affect linearization:

         lin
           PredV1 _ np vp = ss (np.s ++ vp.s) ;
           ComplV2 _ _ v2 np = ss (v2.s ++ np.s) ;
    -      UsePN _ pn = pn ;
           DetCN det cn = ss (det.s ++ cn.s) ;
           ModA1 cn a1 = ss (a1.s ++ cn.s) ;
           ConjS conj s1 s2 = ss (s1.s ++ conj.s ++ s2.s) ;
    @@ -2666,24 +2802,23 @@ To explain the contrast, we introduce the functions
         human : Dom ; 
         game : Dom ;
         play : V2 human game ;
    -    John : PN human ;
    -    Golf : PN game ;
    +    John : NP human ;
    +    Golf : NP game ;
     

    Both sentences still pass the context-free parser, returning trees with lots of metavariables of type Dom:

    -    PredV1 ?0 (UsePN ?1 John) (ComplV2 ?2 ?3 play (UsePN ?4 Golf))
    -  
    -    PredV1 ?0 (UsePN ?1 Golf) (ComplV2 ?2 ?3 play (UsePN ?4 John))
    +    PredV1 ?0 John (ComplV2 ?1 ?2 play Golf)
    +    PredV1 ?0 Golf (ComplV2 ?1 ?2 play John)
     

    But only the former sentence passes the type checker, which moreover infers the domain arguments:

    -    PredV1 human (UsePN human John) (ComplV2 human game play (UsePN game Golf))
    +    PredV1 human John (ComplV2 human game play Golf)
     

    To try this out in GF, use pt = put_term with the tree transformation @@ -2705,7 +2840,7 @@ or less liberal. For instance, John loves golf

    -both make sense, even though Mary and golf +should both make sense, even though Mary and golf are of different types. A natural solution in this case is to formalize love as a polymorphic verb, which takes a human as its first argument but an object of any type as its second @@ -2716,16 +2851,21 @@ argument: lin love _ = ss "loves" ;

    -Problems remain, such as subtyping (e.g. what -is meaningful for a human is also meaningful for -a man and a woman, but not the other way round) -and the extended use of expressions (e.g. a metaphoric use that -makes sense of "golf plays John"). +In other words, it is possible for a human to love anything.

    - +

    +A problem related to polymorphism is subtyping: what +is meaningful for a human is also meaningful for +a man and a woman, but not the other way round. +One solution to this is coercions: functions that +"lift" objects from subtypes to supertypes. +

    + +

    Case study: selectional restrictions and statistical language models TODO

    +

    Proof objects

    -Perhaps the most well-known feature of constructive type theory is +Perhaps the most well-known idea in constructive type theory is the Curry-Howard isomorphism, also known as the propositions as types principle. Its earliest formulations were attempts to give semantics to the logical systems of @@ -2747,61 +2887,109 @@ The successor function Succ generates an infinite sequence of natural numbers, beginning from Zero.

    -We then define what it means for a number x to be less than +We then define what it means for a number x to be less than a number y. Our definition is based on two axioms:

      -
    • Zero is less than Succ y for any y. -
    • If x is less than y, thenSucc x is less than Succ y. -

      +
    • Zero is less than Succ y for any y. +
    • If x is less than y, thenSucc x is less than Succ y. +
    + +

    The most straightforward way of expressing these axioms in type theory -is as typing judgements that introduce objects of a type Less x y: +is as typing judgements that introduce objects of a type Less //x y //: +

         cat Less Nat Nat ; 
         fun lessZ : (y : Nat) -> Less Zero (Succ y) ;
         fun lessS : (x,y : Nat) -> Less x y -> Less (Succ x) (Succ y) ;
     
    +

    Objects formed by lessZ and lessS are called proof objects: they establish the truth of certain mathematical propositions. For instance, the fact that 2 is less that 4 has the proof object +

         lessS (Succ Zero) (Succ (Succ (Succ Zero)))
               (lessS Zero (Succ (Succ Zero)) (lessZ (Succ Zero)))
     
    +

    whose type is +

         Less (Succ (Succ Zero)) (Succ (Succ (Succ (Succ Zero))))
     
    -which is the same thing as the proposition that 2 is less than 4. -

    +

    +which is the formalization of the proposition that 2 is less than 4. +

    +

    GF grammars can be used to provide a semantic control of well-formedness of expressions. We have already seen examples of this: the grammar of well-formed addresses and the grammar with selectional restrictions above. By introducing proof objects -we have now added a very powerful -technique of expressing semantic conditions. -

    +we have now added a very powerful technique of expressing semantic conditions. +

    +

    A simple example of the use of proof objects is the definition of well-formed time spans: a time span is expected to be from an earlier to a later time: +

         from 3 to 8
     
    +

    is thus well-formed, whereas +

         from 8 to 3
     
    +

    is not. The following rules for spans impose this condition by using the Less predicate: +

         cat Span ;
         fun span : (m,n : Nat) -> Less m n -> Span ;
     
    - - - +

    +A possible practical application of this idea is proof-carrying documents: +to be semantically well-formed, the abstract syntax of a document must contain a proof +of some property, although the proof is not shown in the concrete document. +Think, for instance, of small documents describing flight connections: +

    +

    +To fly from Gothenburg to Prague, first take LH3043 to Frankfurt, then OK0537 to Prague. +

    +

    +The well-formedness of this text is partly expressible by dependent typing: +

    +
    +    cat
    +      City ;
    +      Flight City City ;
    +    fun
    +      Gothenburg, Frankfurt, Prague : City ;
    +      LH3043 : Flight Gothenburg Frankfurt ;
    +      OK0537 : Flight Frankfurt Prague ;
    +
    +

    +This rules out texts saying take OK0537 from Gothenburg to Prague. However, there is a +further condition saying that it must be possible to change from LH3043 to OK0537 in Frankfurt. +This can be modelled as a proof object of a suitable type, which is required by the constructor +that connects flights. +

    +
    +    cat
    +      IsPossible (x,y,z : City)(Flight x y)(Flight y z) ;
    +    fun
    +      Connect : (x,y,z : City) -> 
    +        (u : Flight x y) -> (v : Flight y z) -> 
    +          IsPossible x y z u v -> Flight x z ;
    +
    +

    +

    Variable bindings

    Mathematical notation and programming languages have lots of @@ -2813,8 +3001,8 @@ a universally quantifier proposition

    consists of the binding (All x) of the variable x, -and the body B(x), where the variable x is -said to occur bound. +and the body B(x), where the variable x can have +bound occurrences.

    Variable bindings appear in informal mathematical language as well, for @@ -2901,7 +3089,6 @@ since the linearization type of Prop is {s : Str}

    -(we remind that the order of fields in a record does not matter). In other words, the linearization of a function consists of a linearization of the body together with a field for a linearization of the bound variable. @@ -2911,16 +3098,16 @@ should notice that GF requires trees to be in any function of type

    -    A -> C
    +    A -> B
     

    always has a syntax tree of the form

    -    \x -> c
    +    \x -> b
     

    -where c : C under the assumption x : A. +where b : B under the assumption x : A. It is in this form that an expression can be analysed as having a bound variable and a body.

    @@ -2957,8 +3144,7 @@ linearized into the same strings that represent them in the print-out of the abstract syntax.

    -To be able to -parse variable symbols, however, GF needs to know what +To be able to parse variable symbols, however, GF needs to know what to look for (instead of e.g. trying to parse any string as a variable). What strings are parsed as variable symbols is defined in the lexical analysis part of GF parsing @@ -2968,11 +3154,10 @@ is defined in the lexical analysis part of GF parsing All (\x -> Eq x x)

    -(see more details on lexers below). -If several variables are bound in the same argument, the -labels are $0, $1, $2, etc. +(see more details on lexers below). If several variables are bound in the +same argument, the labels are $0, $1, $2, etc.

    - +

    Semantic definitions

    We have seen that, @@ -2993,7 +3178,7 @@ recognized by the key word def. At its simplest, it is just the definition of one constant, e.g.

    -    def one = succ zero ;
    +    def one = Succ Zero ;
     

    We can also define a function with arguments, @@ -3006,8 +3191,9 @@ which is still a special case of the most general notion of definition, that of a group of pattern equations:

    -    def sum x zero = x ;
    -    def sum x (succ y) = succ (sum x y) ;
    +    def 
    +      sum x Zero = x ;
    +      sum x (Succ y) = Succ (Sum x y) ;
     

    To compute a term is, as in functional programming languages, @@ -3015,10 +3201,10 @@ simply to follow a chain of reductions until no definition can be applied. For instance, we compute

    -    sum one one -->
    -    sum (succ zero) (succ zero) -->
    -    succ (sum (succ zero) zero) -->
    -    succ (succ zero)
    +    Sum one one -->
    +    Sum (Succ Zero) (Succ Zero) -->
    +    Succ (sum (Succ Zero) Zero) -->
    +    Succ (Succ Zero)
     

    Computation in GF is performed with the pt command and the @@ -3027,7 +3213,7 @@ Computation in GF is performed with the pt command and the

         > p -tr "1 + 1" | pt -transform=compute -tr | l
         sum one one
    -    succ (succ zero)
    +    Succ (Succ Zero)
         s(s(0))
     

    @@ -3040,9 +3226,9 @@ Thus, trivially, all trees in a chain of computation are definitionally equal to each other. So are the trees

    -    sum zero (succ one)
    -    succ one
    -    sum (sum zero zero) (sum (succ zero) one)
    +    sum Zero (Succ one)
    +    Succ one
    +    sum (sum Zero Zero) (sum (Succ Zero) one)
     

    and infinitely many other trees. @@ -3052,8 +3238,8 @@ A fact that has to be emphasized about def definitions is that they are not performed as a first step of linearization. We say that linearization is intensional, which means that the definitional equality of two trees does not imply that -they have the same linearizations. For instance, the seven terms -above all have different linearizations in arithmetic notation: +they have the same linearizations. For instance, each of the seven terms +shown above has a different linearizations in arithmetic notation:

         1 + 1
    @@ -3085,7 +3271,7 @@ equal types. For instance,
     

         Proof (Odd one)
    -    Proof (Odd (succ zero))
    +    Proof (Odd (Succ Zero))
     

    are equal types. Hence, any tree that type checks as a proof that @@ -3116,7 +3302,7 @@ and other functions, GF has a judgement form data to tell that certain functions are canonical, e.g.

    -    data Nat = succ | zero ;
    +    data Nat = Succ | Zero ;
     

    Unlike in Haskell, but similarly to ALF (where constructor functions @@ -3127,269 +3313,20 @@ are given separately, in ordinary fun judgements. One can also write directly

    -    data succ : Nat -> Nat ;
    +    data Succ : Nat -> Nat ;
     

    which is equivalent to the two judgements

    -    fun succ : Nat -> Nat ;
    -    data Nat = succ ;
    -
    -

    - -

    More features of the module system

    - -

    Interfaces, instances, and functors

    - -

    Resource grammars and their reuse

    -

    -A resource grammar is a grammar built on linguistic grounds, -to describe a language rather than a domain. -The GF resource grammar library, which contains resource grammars for -10 languages, is described more closely in the following -documents: -

    - - -

    -However, to give a flavour of both using and writing resource grammars, -we have created a miniature resource, which resides in the -subdirectory resource. Its API consists of the following -three modules: -

    -

    -Syntax - syntactic structures, language-independent: -

    -
    -  
    -
    -

    -LexEng - lexical paradigms, English: -

    -
    -  
    -
    -

    -LexIta - lexical paradigms, Italian: -

    -
    -  
    -
    -

    -

    -Only these three modules should be opened in applications. -The implementations of the resource are given in the following four modules: -

    -

    -MorphoEng, -

    -
    -  
    -
    -

    -MorphoIta: low-level morphology -

    - - -

    -An example use of the resource resides in the -subdirectory applications. -It implements the abstract syntax -FoodComments for English and Italian. -The following diagram shows the module structure, indicating by -colours which modules are written by the grammarian. The two blue modules -form the abstract syntax. The three red modules form the concrete syntax. -The two green modules are trivial instantiations of a functor. -The rest of the modules (black) come from the resource. -

    -

    - -

    - -

    Restricted inheritance and qualified opening

    - -

    Using the standard resource library

    -

    -The example files of this chapter can be found in -the directory arithm. -

    - -

    The simplest way

    -

    -The simplest way is to open a top-level Lang module -and a Paradigms module: -

    -
    -    abstract Foo = ...
    -  
    -    concrete FooEng = open LangEng, ParadigmsEng in ...
    -    concrete FooSwe = open LangSwe, ParadigmsSwe in ...
    -
    -

    -Here is an example. -

    -
    -  abstract Arithm = {
    -    cat
    -      Prop ;
    -      Nat ;
    -    fun
    -      Zero : Nat ;
    -      Succ : Nat -> Nat ;
    -      Even : Nat -> Prop ;
    -      And  : Prop -> Prop -> Prop ;
    -  }
    -  
    -  --# -path=.:alltenses:prelude
    -  
    -  concrete ArithmEng of Arithm = open LangEng, ParadigmsEng in {
    -    lincat
    -      Prop = S ;
    -      Nat  = NP ;
    -    lin
    -      Zero = 
    -        UsePN (regPN "zero" nonhuman) ;
    -      Succ n = 
    -        DetCN (DetSg (SgQuant DefArt) NoOrd) (ComplN2 (regN2 "successor") n) ;
    -      Even n = 
    -        UseCl TPres ASimul PPos 
    -          (PredVP n (UseComp (CompAP (PositA (regA "even"))))) ;
    -      And x y = 
    -        ConjS and_Conj (BaseS x y) ;
    -  
    -  }
    -  
    -  --# -path=.:alltenses:prelude
    -  
    -  concrete ArithmSwe of Arithm = open LangSwe, ParadigmsSwe in {
    -    lincat
    -      Prop = S ;
    -      Nat  = NP ;
    -    lin
    -      Zero = 
    -        UsePN (regPN "noll" neutrum) ;
    -      Succ n = 
    -        DetCN (DetSg (SgQuant DefArt) NoOrd) 
    -          (ComplN2 (mkN2 (mk2N "efterföljare" "efterföljare") 
    -             (mkPreposition "till")) n) ;
    -      Even n = 
    -        UseCl TPres ASimul PPos 
    -          (PredVP n (UseComp (CompAP (PositA (regA "jämn"))))) ;
    -      And x y = 
    -        ConjS and_Conj (BaseS x y) ;
    -  }
    +    fun Succ : Nat -> Nat ;
    +    data Nat = Succ ;
     

    -

    How to find resource functions

    -

    -The definitions in this example were found by parsing: -

    -
    -    > i LangEng.gf
    -  
    -    -- for Successor:
    -    > p -cat=NP -mcfg -parser=topdown "the mother of Paris"
    -  
    -    -- for Even:
    -    > p -cat=S -mcfg -parser=topdown "Paris is old"
    -  
    -    -- for And:
    -    > p -cat=S -mcfg -parser=topdown "Paris is old and I am old"
    -
    -

    -The use of parsing can be systematized by example-based grammar writing, -to which we will return later. -

    +

    Case study: representing anaphoric reference TODO

    -

    A functor implementation

    -

    -The interesting thing now is that the -code in ArithmSwe is similar to the code in ArithmEng, except for -some lexical items ("noll" vs. "zero", "efterföljare" vs. "successor", -"jämn" vs. "even"). How can we exploit the similarities and -actually share code between the languages? -

    -

    -The solution is to use a functor: an incomplete module that opens -an abstract as an interface, and then instantiate it to different -languages that implement the interface. The structure is as follows: -

    -
    -    abstract Foo ...
    -  
    -    incomplete concrete FooI = open Lang, Lex in ...
    -  
    -    concrete FooEng of Foo = FooI with (Lang=LangEng), (Lex=LexEng) ;
    -    concrete FooSwe of Foo = FooI with (Lang=LangSwe), (Lex=LexSwe) ;
    -
    -

    -where Lex is an abstract lexicon that includes the vocabulary -specific to this application: -

    -
    -    abstract Lex = Cat ** ...
    -  
    -    concrete LexEng of Lex = CatEng ** open ParadigmsEng in ...
    -    concrete LexSwe of Lex = CatSwe ** open ParadigmsSwe in ...  
    -
    -

    -Here, again, a complete example (abstract Arithm is as above): -

    -
    -  incomplete concrete ArithmI of Arithm = open Lang, Lex in {
    -    lincat
    -      Prop = S ;
    -      Nat  = NP ;
    -    lin
    -      Zero = 
    -        UsePN zero_PN ;
    -      Succ n = 
    -        DetCN (DetSg (SgQuant DefArt) NoOrd) (ComplN2 successor_N2 n) ;
    -      Even n = 
    -        UseCl TPres ASimul PPos 
    -          (PredVP n (UseComp (CompAP (PositA even_A)))) ;
    -      And x y = 
    -        ConjS and_Conj (BaseS x y) ;
    -  }
    -  
    -  --# -path=.:alltenses:prelude
    -  concrete ArithmEng of Arithm = ArithmI with
    -    (Lang = LangEng),
    -    (Lex = LexEng) ;
    -  
    -  --# -path=.:alltenses:prelude
    -  concrete ArithmSwe of Arithm = ArithmI with
    -    (Lang = LangSwe),
    -    (Lex = LexSwe) ;
    -  
    -  abstract Lex = Cat ** {
    -    fun
    -      zero_PN : PN ;
    -      successor_N2 : N2 ;  
    -      even_A : A ;
    -  }
    -  
    -  concrete LexSwe of Lex = CatSwe ** open ParadigmsSwe in {
    -    lin 
    -      zero_PN = regPN "noll" neutrum ;
    -      successor_N2 = 
    -        mkN2 (mk2N "efterföljare" "efterföljare") (mkPreposition "till") ;
    -      even_A = regA "jämn" ;
    -  }
    -
    -

    - -

    Transfer modules

    +

    Transfer modules TODO

    Transfer means noncompositional tree-transforming operations. The command apply_transfer = at is typically used in a pipe: @@ -3407,9 +3344,9 @@ See the transfer language documentation for more information.

    + +

    Practical issues TODO

    -

    Practical issues

    -

    Lexers and unlexers

    Lexers and unlexers can be chosen from @@ -3442,10 +3379,9 @@ Given by help -lexer, help -unlexer: -unlexer=codelit like code, but remove string literal quotes -unlexer=concat remove all spaces -unlexer=bind like identity, but bind at "&+" -

    - +

    Efficiency of grammars

    Issues: @@ -3456,7 +3392,7 @@ Issues:

  • parsing efficiency: -fcfg vs. others - +

    Speech input and output

    Thespeak_aloud = sa command sends a string to the speech @@ -3486,7 +3422,7 @@ The method words only for grammars of English. Both Flite and ATK are freely available through the links above, but they are not distributed together with GF.

    - +

    Multilingual syntax editor

    The @@ -3497,18 +3433,18 @@ describes the use of the editor, which works for any multilingual GF grammar. Here is a snapshot of the editor:

    - +

    The grammars of the snapshot are from the Letter grammar package.

    - +

    Interactive Development Environment (IDE)

    Forthcoming.

    - +

    Communicating with GF

    Other processes can communicate with the GF command interpreter, @@ -3525,7 +3461,7 @@ Thus the most silent way to invoke GF is - +

    Embedded grammars in Haskell, Java, and Prolog

    GF grammars can be used as parts of programs written in the @@ -3537,15 +3473,15 @@ following languages. The links give more documentation.

  • Prolog - +

    Alternative input and output grammar formats

    A summary is given in the following chart of GF grammar compiler phases:

    + +

    Larger case studies TODO

    -

    Case studies

    -

    Interfacing formal and natural languages

    Formal and Informal Software Specifications, @@ -3557,7 +3493,12 @@ English and German.

    A simpler example will be explained here.

    + +

    A multimodal dialogue system

    +

    +See TALK project deliverables, TALK homepage +

    - - + + diff --git a/doc/tutorial/gf-tutorial2.txt b/doc/tutorial/gf-tutorial2.txt index 4b20f38cd..9c3ae71b2 100644 --- a/doc/tutorial/gf-tutorial2.txt +++ b/doc/tutorial/gf-tutorial2.txt @@ -1,5 +1,5 @@ Grammatical Framework Tutorial -Author: Aarne Ranta +Author: Aarne Ranta aarne (at) cs.chalmers.se Last update: %%date(%c) % NOTE: this is a txt2tags file. @@ -20,7 +20,7 @@ Last update: %%date(%c) -[../gf-logo.gif] +[../gf-logo.png] @@ -552,7 +552,7 @@ module forms are %--! -===Record types, records, and ``Str``s=== +===Records and strings=== The linearization type of a category is a **record type**, with zero of more **fields** of different types. The simplest record @@ -922,7 +922,7 @@ The graph uses %--! -==System commands== +===System commands=== To document your grammar, you may want to print the graph into a file, e.g. a ``.png`` file that @@ -1385,7 +1385,8 @@ Why does the command also show the operations that form the same as the value of ``Noun``. -==Using morphology in concrete syntax== + +==Using parameters in concrete syntax== We can now enrich the concrete syntax definitions to comprise morphology. This will involve a more radical @@ -1595,34 +1596,6 @@ are not a good idea in top-level categories accessed by the users of a grammar application. -%--! -==More constructs for concrete syntax== - - -%--! -===Local definitions=== - -Local definitions ("``let`` expressions") are used in functional -programming for two reasons: to structure the code into smaller -expressions, and to avoid repeated computation of one and -the same expression. Here is an example, from -[``MorphoIta`` resource/MorphoIta.gf]: -``` - oper regNoun : Str -> Noun = \vino -> - let - vin = init vino ; - o = last vino - in - case o of { - "a" => mkNoun Fem vino (vin + "e") ; - "o" | "e" => mkNoun Masc vino (vin + "i") ; - _ => mkNoun Masc vino vino - } ; -``` - - - - %--! ===Free variation=== @@ -1644,1004 +1617,46 @@ In general, ``variants`` should be used cautiously. It is not recommended for modules aimed to be libraries, because the user of the library has no way to choose among the variants. -%Moreover, ``variants`` is only defined for basic types (``Str`` -%and parameter types). The grammar compiler will admit -%``variants`` for any types, but it will push it to the -%level of basic types in a way that may be unwanted. -%For instance, German has two words meaning "car", -%//Wagen//, which is Masculine, and //Auto//, which is Neuter. -%However, if one writes -%``` -% variants {{s = "Wagen" ; g = Masc} ; {s = "Auto" ; g = Neutr}} -%``` -%this will compute to -%``` -% {s = variants {"Wagen" ; "Auto"} ; g = variants {Masc ; Neutr}} -%``` -%which will also accept erroneous combinations of strings and genders. +===Overloading of operations=== +Large libraries, such as the GF Resource Grammar Library, may define +hundreds of names, which can be unpractical +for both the library writer and the user. The writer has to invent longer +and longer names which are not always intuitive, +and the user has to learn or at least be able to find all these names. +A solution to this problem, adopted by languages such as C++, is **overloading**: +the same name can be used for several functions. When such a name is used, the +compiler performs **overload resolution** to find out which of the possible functions +is meant. The resolution is based on the types of the functions: all functions that +have the same name must have different types. - -===Record extension and subtyping=== - -Record types and records can be **extended** with new fields. For instance, -in German it is natural to see transitive verbs as verbs with a case. -The symbol ``**`` is used for both constructs. +In C++, functions with the same name can be scattered everywhere in the program. +In GF, they must be grouped together in ``overload`` groups. Here is an example +of an overload group, defining four ways to define nouns in Italian: ``` - lincat TV = Verb ** {c : Case} ; - - lin Follow = regVerb "folgen" ** {c = Dative} ; -``` -To extend a record type or a record with a field whose label it -already has is a type error. - -A record type //T// is a **subtype** of another one //R//, if //T// has -all the fields of //R// and possibly other fields. For instance, -an extension of a record type is always a subtype of it. - -If //T// is a subtype of //R//, an object of //T// can be used whenever -an object of //R// is required. For instance, a transitive verb can -be used whenever a verb is required. - -**Contravariance** means that a function taking an //R// as argument -can also be applied to any object of a subtype //T//. - - - -===Tuples and product types=== - -Product types and tuples are syntactic sugar for record types and records: -``` - T1 * ... * Tn === {p1 : T1 ; ... ; pn : Tn} - === {p1 = T1 ; ... ; pn = Tn} -``` -Thus the labels ``p1, p2,...`` are hard-coded. - - -===Record and tuple patterns=== - -Record types of parameter types are also parameter types. -A typical example is a record of agreement features, e.g. French -``` - oper Agr : PType = {g : Gender ; n : Number ; p : Person} ; -``` -Notice the term ``PType`` rather than just ``Type`` referring to -parameter types. Every ``PType`` is also a ``Type``. - -Pattern matching is done in the expected way, but it can moreover -utilize partial records: the branch -``` - {g = Fem} => t -``` -in a table of type ``Agr => T`` means the same as -``` - {g = Fem ; n = _ ; p = _} => t -``` -Tuple patterns are translated to record patterns in the -same way as tuples to records; partial patterns make it -possible to write, slightly surprisingly, -``` - case of { - => t - ... - } -``` - -%--! -===Regular expression patterns=== - -To define string operations computed at compile time, such -as in morphology, it is handy to use regular expression patterns: - - //p// ``+`` //q// : token consisting of //p// followed by //q// - - //p// ``*`` : token //p// repeated 0 or more times - (max the length of the string to be matched) - - ``-`` //p// : matches anything that //p// does not match - - //x// ``@`` //p// : bind to //x// what //p// matches - - //p// ``|`` //q// : matches what either //p// or //q// matches - - -The last three apply to all types of patterns, the first two only to token strings. -Example: plural formation in Swedish 2nd declension -(//pojke-pojkar, nyckel-nycklar, seger-segrar, bil-bilar//): -``` - plural2 : Str -> Str = \w -> case w of { - pojk + "e" => pojk + "ar" ; - nyck + "e" + l@("l" | "r" | "n") => nyck + l + "ar" ; - bil => bil + "ar" - } ; -``` -Another example: English noun plural formation. -``` - plural : Str -> Str = \w -> case w of { - _ + ("s" | "z" | "x" | "sh") => w + "es" ; - _ + ("a" | "o" | "u" | "e") + "y" => w + "s" ; - x + "y" => x + "ies" ; - _ => w + "s" - } ; -``` -Semantics: variables are always bound to the **first match**, which is the first -in the sequence of binding lists ``Match p v`` defined as follows. In the definition, -``p`` is a pattern and ``v`` is a value. -``` - Match (p1|p2) v = Match p1 v ++ Match p2 v - Match (p1+p2) s = [Match p1 s1 ++ Match p2 s2 | - i <- [0..length s], (s1,s2) = splitAt i s] - Match p* s = [[]] if Match "" s ++ Match p s ++ Match (p+p) s ++... /= [] - Match -p v = [[]] if Match p v = [] - Match c v = [[]] if c == v -- for constant and literal patterns c - Match x v = [[(x,v)]] -- for variable patterns x - Match x@p v = [[(x,v)]] + M if M = Match p v /= [] - Match p v = [] otherwise -- failure -``` -Examples: -- ``x + "e" + y`` matches ``"peter"`` with ``x = "p", y = "ter"`` -- ``x + "er"*`` matches ``"burgerer"`` with ``x = "burg" - - - - - -%--! -===Prefix-dependent choices=== - -Sometimes a token has different forms depending on the token -that follows. An example is the English indefinite article, -which is //an// if a vowel follows, //a// otherwise. -Which form is chosen can only be decided at run time, i.e. -when a string is actually build. GF has a special construct for -such tokens, the ``pre`` construct exemplified in -``` - oper artIndef : Str = - pre {"a" ; "an" / strs {"a" ; "e" ; "i" ; "o"}} ; -``` -Thus -``` - artIndef ++ "cheese" ---> "a" ++ "cheese" - artIndef ++ "apple" ---> "an" ++ "apple" -``` -This very example does not work in all situations: the prefix -//u// has no general rules, and some problematic words are -//euphemism, one-eyed, n-gram//. It is possible to write -``` - oper artIndef : Str = - pre {"a" ; - "a" / strs {"eu" ; "one"} ; - "an" / strs {"a" ; "e" ; "i" ; "o" ; "n-"} - } ; -``` - - -===Predefined types and operations=== - -GF has the following predefined categories in abstract syntax: -``` - cat Int ; -- integers, e.g. 0, 5, 743145151019 - cat Float ; -- floats, e.g. 0.0, 3.1415926 - cat String ; -- strings, e.g. "", "foo", "123" -``` -The objects of each of these categories are **literals** -as indicated in the comments above. No ``fun`` definition -can have a predefined category as its value type, but -they can be used as arguments. For example: -``` - fun StreetAddress : Int -> String -> Address ; - lin StreetAddress number street = {s = number.s ++ street.s} ; - - -- e.g. (StreetAddress 10 "Downing Street") : Address -``` -FIXME: The linearization type is ``{s : Str}`` for all these categories. - - - -==More concepts of abstract syntax== - -===GF as a logical framework=== - -In this section, we will show how -to encode advanced semantic concepts in an abstract syntax. -We use concepts inherited from **type theory**. Type theory -is the basis of many systems known as **logical frameworks**, which are -used for representing mathematical theorems and their proofs on a computer. -In fact, GF has a logical framework as its proper part: -this part is the abstract syntax. - -In a logical framework, the formalization of a mathematical theory -is a set of type and function declarations. The following is an example -of such a theory, represented as an ``abstract`` module in GF. -``` -abstract Arithm = { - cat - Prop ; -- proposition - Nat ; -- natural number - fun - Zero : Nat ; -- 0 - Succ : Nat -> Nat ; -- successor of x - Even : Nat -> Prop ; -- x is even - And : Prop -> Prop -> Prop ; -- A and B - } -``` -A concrete syntax is given below, as an example of using the resource grammar -library. - - - -===Dependent types=== - -**Dependent types** are a characteristic feature of GF, -inherited from the -**constructive type theory** of Martin-Löf and -distinguishing GF from most other grammar formalisms and -functional programming languages. -The initial main motivation for developing GF was, indeed, -to have a grammar formalism with dependent types. -As can be inferred from the fact that we introduce them only now, -after having written lots of grammars without them, -dependent types are no longer the only motivation for GF. -But they are still important and interesting. - - -Dependent types can be used for stating stronger -**conditions of well-formedness** than non-dependent types. -A simple example is postal addresses. Ignoring the other details, -let us take a look at addresses consisting of -a street, a city, and a country. -``` -abstract Address = { - cat - Address ; Country ; City ; Street ; - - fun - mkAddress : Country -> City -> Street -> Address ; - - UK, France : Country ; - Paris, London, Grenoble : City ; - OxfordSt, ShaftesburyAve, BdRaspail, RueBlondel, AvAlsaceLorraine : Street ; + oper mkN = overload { + mkN : Str -> N = -- regular nouns + mkN : Str -> Gender -> N = -- regular nouns with unexpected gender + mkN : Str -> Str -> N = -- irregular nouns + mkN : Str -> Str -> Gender -> N = -- irregular nouns with unexpected gender } ``` -The linearization rules -are straightforward, +All of the following uses of ``mkN`` are easy to resolve: ``` - lin - - mkAddress country city street = - ss (street.s ++ "," ++ city.s ++ "," ++ country.s) ; - UK = ss ("U.K.") ; - France = ss ("France") ; - Paris = ss ("Paris") ; - London = ss ("London") ; - Grenoble = ss ("Grenoble") ; - OxfordSt = ss ("Oxford" ++ "Street") ; - ShaftesburyAve = ss ("Shaftesbury" ++ "Avenue") ; - BdRaspail = ss ("boulevard" ++ "Raspail") ; - RueBlondel = ss ("rue" ++ "Blondel") ; - AvAlsaceLorraine = ss ("avenue" ++ "Alsace-Lorraine") ; -``` -with the exception of ``mkAddress``, where we have -reversed the order of the constituents. The type of ``mkAddress`` -in the abstract syntax takes its arguments in a "logical" order, -with increasing precision. (This order is sometimes even used in the concrete -syntax of addresses, e.g. in Russia). - - - -Both existing and non-existing addresses are recognized by this -grammar. The non-existing ones in the following randomly generated -list have afterwards been marked by *: -``` - > gr -cat=Address -number=7 | l - - * Oxford Street , Paris , France - * Shaftesbury Avenue , Grenoble , U.K. - boulevard Raspail , Paris , France - * rue Blondel , Grenoble , U.K. - * Shaftesbury Avenue , Grenoble , France - * Oxford Street , London , France - * Shaftesbury Avenue , Grenoble , France -``` -Dependent types provide a way to guarantee that addresses are -well-formed. What we do is to include **contexts** in -``cat`` judgements: -``` - cat Address ; - cat Country ; - cat City Country ; - cat Street (x : Country)(y : City x) ; -``` -The first two judgements are as before, but the third one makes -``City`` dependent on ``Country``: there are no longer just cities, -but cities of the U.K. and cities of France. The fourth judgement -makes ``Street`` dependent on ``City``; but since -``City`` is itself dependent on ``Country``, we must -include them both in the context, moreover guaranteeing that -the city is one of the given country. Since the context itself -is built by using a dependent type, we have to use variables -to indicate the dependencies. The judgement we used for ``City`` -is actually shorthand for -``` - cat City (x : Country) -``` -which is only possible if the subsequent context does not depend on ``x``. - -The ``fun`` judgements of the grammar are modified accordingly: -``` - fun - - mkAddress : (x : Country) -> (y : City x) -> Street x y -> Address ; - - UK : Country ; - France : Country ; - Paris : City France ; - London : City UK ; - Grenoble : City France ; - OxfordSt : Street UK London ; - ShaftesburyAve : Street UK London ; - BdRaspail : Street France Paris ; - RueBlondel : Street France Paris ; - AvAlsaceLorraine : Street France Grenoble ; -``` -Since the type of ``mkAddress`` now has dependencies among -its argument types, we have to use variables just like we used in -the context of ``Street`` above. What we claimed to be the -"logical" order of the arguments is now forced by the type system -of GF: a variable must be declared (=bound) before it can be -referenced (=used). - -The effect of dependent types is that the *-marked addresses above are -no longer well-formed. What the GF parser actually does is that it -initially accepts them (by using a context-free parsing algorithm) -and then rejects them (by type checking). The random generator does not produce -illegal addresses (this could be useful in bulk mailing!). -The linearization algorithm does not care about type dependencies; -actually, since the //categories// (ignoring their arguments) -are the same in both abstract syntaxes, -we use the same concrete syntax -for both of them. - -**Remark**. Function types //without// -variables are actually a shorthand notation: writing -``` - fun PredV1 : NP -> V1 -> S -``` -is shorthand for -``` - fun PredV1 : (x : NP) -> (y : V1) -> S -``` -or any other naming of the variables. Actually the use of variables -sometimes shortens the code, since we can write e.g. -``` - oper triple : (x,y,z : Str) -> Str = ... -``` - - -===Dependent types in concrete syntax=== - -The **functional fragment** of GF -terms and types comprises function types, applications, lambda -abstracts, constants, and variables. This fragment is similar in -abstract and concrete syntax. In particular, -dependent types are also available in concrete syntax. -We have not made use of them yet, -but we will now look at one example of how they -can be used. - -Those readers who are familiar with functional programming languages -like ML and Haskell, may already have missed **polymorphic** -functions. For instance, Haskell programmers have access to -the functions -``` - const :: a -> b -> a - const c _ = c - - flip :: (a -> b -> c) -> b -> a -> c - flip f y x = f x y -``` -which can be used for any given types ``a``,``b``, and ``c``. - -The GF counterpart of polymorphic functions are **monomorphic** -functions with explicit **type variables**. Thus the above -definitions can be written -``` - oper const :(a,b : Type) -> a -> b -> a = - \_,_,c,_ -> c ; - - oper flip : (a,b,c : Type) -> (a -> b ->c) -> b -> a -> c = - \_,_,_,f,x,y -> f y x ; -``` -When the operations are used, the type checker requires -them to be equipped with all their arguments; this may be a nuisance -for a Haskell or ML programmer. - - - -===Expressing selectional restrictions=== - -This section introduces a way of using dependent types to -formalize a notion known as **selectional restrictions** -in linguistics. We first present a mathematical model -of the notion, and then integrate it in a linguistically -motivated syntax. - -In linguistics, a -grammar is usually thought of as being about **syntactic well-formedness** -in a rather liberal sense: an expression can be well-formed without -being meaningful, in other words, without being -**semantically well-formed**. -For instance, the sentence -``` - the number 2 is equilateral -``` -is syntactically well-formed but semantically ill-formed. -It is well-formed because it combines a well-formed -noun phrase ("the number 2") with a well-formed -verb phrase ("is equilateral") in accordance with the -rule that the verb phrase is inflected in the -number of the noun phrase: -``` - fun PredVP : NP -> VP -> S ; - lin PredVP np v = {s = np.s ++ vp.s ! np.n} ; -``` -It is ill-formed because the predicate "is equilateral" -is only defined for triangles, not for numbers. - -In a straightforward type-theoretical formalization of -mathematics, domains of mathematical objects -are defined as types. In GF, we could write -``` - cat Nat ; - cat Triangle ; - cat Prop ; -``` -for the types of natural numbers, triangles, and propositions, -respectively. -Noun phrases are typed as objects of basic types other than -``Prop``, whereas verb phrases are functions from basic types -to ``Prop``. For instance, -``` - fun two : Nat ; - fun Even : Nat -> Prop ; - fun Equilateral : Triangle -> Prop ; -``` -With these judgements, and the linearization rules -``` - lin two = ss ["the number 2"] ; - lin Even x = ss (x.s ++ ["is even"]) ; - lin Equilateral x = ss (x.s ++ ["is equilateral"]) ; -``` -we can form the proposition ``Even two`` -``` - the number 2 is even -``` -but no proposition linearized to -``` - the number 2 is equilateral -``` -since ``Equilateral two`` is not a well-formed type-theoretical object. - -When formalizing mathematics, e.g. in the purpose of -computer-assisted theorem proving, we are certainly interested -in semantic well-formedness: we want to be sure that a proposition makes -sense before we make the effort of proving it. The straightforward typing -of nouns and predicates shown above is the way in which this -is guaranteed in various proof systems based on type theory. -(Notice that it is still possible to form //false// propositions, -e.g. "the number 3 is even". -False and meaningless are different things.) - -As shown by the linearization rules for ``two``, ``Even``, -etc, it //is// possible to use straightforward mathematical typings -as the abstract syntax of a grammar. However, this syntax is not very -expressive linguistically: for instance, there is no distinction between -adjectives and verbs. It is hard to give rules for structures like -adjectival modification ("even number") and conjunction of predicates -("even or odd"). - -By using dependent types, it is simple to combine a linguistically -motivated system of categories with mathematically motivated -type restrictions. What we need is a category of domains of -individual objects, -``` - cat Dom -``` -and dependencies of other categories on this: -``` - cat - S ; -- sentence - V1 Dom ; -- one-place verb - V2 Dom Dom ; -- two-place verb - A1 Dom ; -- one-place adjective - A2 Dom Dom ; -- two-place adjective - PN Dom ; -- proper name - NP Dom ; -- noun phrase - Conj ; -- conjunction - Det ; -- determiner -``` -The number of ``Dom`` arguments depends on the semantic type -corresponding to the category: one-place verbs and adjectives -correspond to types of the form -``` - A -> Prop -``` -whereas two-place verbs and adjectives correspond to types of the form -``` - A -> B -> Prop -``` -where the domains ``A`` and ``B`` can be distinct. -Proper names correspond to types of the form -``` - A -``` -that is, individual objects of the domain ``A``. Noun phrases -correspond to -``` - (A -> Prop) -> Prop -``` -that is, **quantifiers** over the domain ``A``. -Sentences, conjunctions, and determiners correspond to -``` - Prop - Prop -> Prop -> Prop - (A : Dom) -> (A -> Prop) -> Prop -``` -respectively, -and are thus independent of domain. As for common nouns ``CN``, -the simplest semantics is that they correspond to -``` - Dom -``` -In this section, we will, in fact, write ``Dom`` instead of ``CN``. - -Having thus parametrized categories on domains, we have to reformulate -the rules of predication, etc, accordingly. This is straightforward: -``` - fun - PredV1 : (A : Dom) -> NP A -> V1 A -> S ; - ComplV2 : (A,B : Dom) -> V2 A B -> NP B -> V1 A ; - UsePN : (A : Dom) -> PN A -> NP A ; - DetCN : Det -> (A : Dom) -> NP A ; - ModA1 : (A : Dom) -> A1 A -> Dom ; - ConjS : Conj -> S -> S -> S ; - ConjV1 : (A : Dom) -> Conj -> V1 A -> V1 A -> V1 A ; -``` -In linearization rules, -we typically use wildcards for the domain arguments, -to get arities right: -``` - lin - PredV1 _ np vp = ss (np.s ++ vp.s) ; - ComplV2 _ _ v2 np = ss (v2.s ++ np.s) ; - UsePN _ pn = pn ; - DetCN det cn = ss (det.s ++ cn.s) ; - ModA1 cn a1 = ss (a1.s ++ cn.s) ; - ConjS conj s1 s2 = ss (s1.s ++ conj.s ++ s2.s) ; - ConjV1 _ conj v1 v2 = ss (v1.s ++ conj.s ++ v2.s) ; -``` -The domain arguments thus get suppressed in linearization. -Parsing initially returns metavariables for them, -but type checking can usually restore them -by inference from those arguments that are not suppressed. - -One traditional linguistic example of domain restrictions -(= selectional restrictions) is the contrast between the two sentences -``` - John plays golf - golf plays John -``` -To explain the contrast, we introduce the functions -``` - human : Dom ; - game : Dom ; - play : V2 human game ; - John : PN human ; - Golf : PN game ; -``` -Both sentences still pass the context-free parser, -returning trees with lots of metavariables of type ``Dom``: -``` - PredV1 ?0 (UsePN ?1 John) (ComplV2 ?2 ?3 play (UsePN ?4 Golf)) - - PredV1 ?0 (UsePN ?1 Golf) (ComplV2 ?2 ?3 play (UsePN ?4 John)) -``` -But only the former sentence passes the type checker, which moreover -infers the domain arguments: -``` - PredV1 human (UsePN human John) (ComplV2 human game play (UsePN game Golf)) -``` -To try this out in GF, use ``pt = put_term`` with the **tree transformation** -that solves the metavariables by type checking: -``` - > p -tr "John plays golf" | pt -transform=solve - > p -tr "golf plays John" | pt -transform=solve -``` -In the latter case, no solutions are found. - -A known problem with selectional restrictions is that they can be more -or less liberal. For instance, -``` - John loves Mary - John loves golf -``` -both make sense, even though ``Mary`` and ``golf`` -are of different types. A natural solution in this case is to -formalize ``love`` as a **polymorphic** verb, which takes -a human as its first argument but an object of any type as its second -argument: -``` - fun love : (A : Dom) -> V2 human A ; - lin love _ = ss "loves" ; -``` -Problems remain, such as **subtyping** (e.g. what -is meaningful for a ``human`` is also meaningful for -a ``man`` and a ``woman``, but not the other way round) -and the **extended use** of expressions (e.g. a metaphoric use that -makes sense of "golf plays John"). - - - - - -===Proof objects=== - -Perhaps the most well-known feature of constructive type theory is -the **Curry-Howard isomorphism**, also known as the -**propositions as types principle**. Its earliest formulations -were attempts to give semantics to the logical systems of -propositional and predicate calculus. In this section, we will consider -a more elementary example, showing how the notion of proof is useful -outside mathematics, as well. - -We first define the category of unary (also known as Peano-style) -natural numbers: -``` - cat Nat ; - fun Zero : Nat ; - fun Succ : Nat -> Nat ; -``` -The **successor function** ``Succ`` generates an infinite -sequence of natural numbers, beginning from ``Zero``. - -We then define what it means for a number //x// to be less than -a number //y//. Our definition is based on two axioms: -- ``Zero`` is less than ``Succ y`` for any ``y``. -- If ``x`` is less than ``y``, then``Succ x`` is less than ``Succ y``. - - -The most straightforward way of expressing these axioms in type theory -is as typing judgements that introduce objects of a type ``Less x y``: -``` - cat Less Nat Nat ; - fun lessZ : (y : Nat) -> Less Zero (Succ y) ; - fun lessS : (x,y : Nat) -> Less x y -> Less (Succ x) (Succ y) ; -``` -Objects formed by ``lessZ`` and ``lessS`` are -called **proof objects**: they establish the truth of certain -mathematical propositions. -For instance, the fact that 2 is less that -4 has the proof object -``` - lessS (Succ Zero) (Succ (Succ (Succ Zero))) - (lessS Zero (Succ (Succ Zero)) (lessZ (Succ Zero))) -``` -whose type is -``` - Less (Succ (Succ Zero)) (Succ (Succ (Succ (Succ Zero)))) -``` -which is the same thing as the proposition that 2 is less than 4. - -GF grammars can be used to provide a **semantic control** of -well-formedness of expressions. We have already seen examples of this: -the grammar of well-formed addresses and the grammar with -selectional restrictions above. By introducing proof objects -we have now added a very powerful -technique of expressing semantic conditions. - -A simple example of the use of proof objects is the definition of -well-formed //time spans//: a time span is expected to be from an earlier to -a later time: -``` - from 3 to 8 -``` -is thus well-formed, whereas -``` - from 8 to 3 -``` -is not. The following rules for spans impose this condition -by using the ``Less`` predicate: -``` - cat Span ; - fun span : (m,n : Nat) -> Less m n -> Span ; -``` - - - - -===Variable bindings=== - -Mathematical notation and programming languages have lots of -expressions that **bind** variables. For instance, -a universally quantifier proposition -``` - (All x)B(x) -``` -consists of the **binding** ``(All x)`` of the variable ``x``, -and the **body** ``B(x)``, where the variable ``x`` is -said to occur bound. - -Variable bindings appear in informal mathematical language as well, for -instance, -``` - for all x, x is equal to x - - the function that for any numbers x and y returns the maximum of x+y - and x*y -``` -In type theory, variable-binding expression forms can be formalized -as functions that take functions as arguments. The universal -quantifier is defined -``` - fun All : (Ind -> Prop) -> Prop -``` -where ``Ind`` is the type of individuals and ``Prop``, -the type of propositions. If we have, for instance, the equality predicate -``` - fun Eq : Ind -> Ind -> Prop -``` -we may form the tree -``` - All (\x -> Eq x x) -``` -which corresponds to the ordinary notation -``` - (All x)(x = x). -``` - - -An abstract syntax where trees have functions as arguments, as in -the two examples above, has turned out to be precisely the right -thing for the semantics and computer implementation of -variable-binding expressions. The advantage lies in the fact that -only one variable-binding expression form is needed, the lambda abstract -``\x -> b``, and all other bindings can be reduced to it. -This makes it easier to implement mathematical theories and reason -about them, since variable binding is tricky to implement and -to reason about. The idea of using functions as arguments of -syntactic constructors is known as **higher-order abstract syntax**. - -The question now arises: how to define linearization rules -for variable-binding expressions? -Let us first consider universal quantification, -``` - fun All : (Ind -> Prop) -> Prop -``` -We write -``` - lin All B = {s = "(" ++ "All" ++ B.$0 ++ ")" ++ B.s} -``` -to obtain the form shown above. -This linearization rule brings in a new GF concept - the ``$0`` -field of ``B`` containing a bound variable symbol. -The general rule is that, if an argument type of a function is -itself a function type ``A -> C``, the linearization type of -this argument is the linearization type of ``C`` -together with a new field ``$0 : Str``. In the linearization rule -for ``All``, the argument ``B`` thus has the linearization -type -``` - {$0 : Str ; s : Str}, -``` -since the linearization type of ``Prop`` is -``` - {s : Str} -``` -(we remind that the order of fields in a record does not matter). -In other words, the linearization of a function -consists of a linearization of the body together with a -field for a linearization of the bound variable. -Those familiar with type theory or lambda calculus -should notice that GF requires trees to be in -**eta-expanded** form in order to be linearizable: -any function of type -``` - A -> C -``` -always has a syntax tree of the form -``` - \x -> c -``` -where ``c : C`` under the assumption ``x : A``. -It is in this form that an expression can be analysed -as having a bound variable and a body. - - -Given the linearization rule -``` - lin Eq a b = {s = "(" ++ a.s ++ "=" ++ b.s ++ ")"} -``` -the linearization of -``` - \x -> Eq x x -``` -is the record -``` - {$0 = "x", s = ["( x = x )"]} -``` -Thus we can compute the linearization of the formula, -``` - All (\x -> Eq x x) --> {s = "[( All x ) ( x = x )]"}. -``` - -How did we get the //linearization// of the variable ``x`` -into the string ``"x"``? GF grammars have no rules for -this: it is just hard-wired in GF that variable symbols are -linearized into the same strings that represent them in -the print-out of the abstract syntax. - - -To be able to -//parse// variable symbols, however, GF needs to know what -to look for (instead of e.g. trying to parse //any// -string as a variable). What strings are parsed as variable symbols -is defined in the lexical analysis part of GF parsing -``` - > p -cat=Prop -lexer=codevars "(All x)(x = x)" - All (\x -> Eq x x) -``` -(see more details on lexers below). -If several variables are bound in the same argument, the -labels are ``$0, $1, $2``, etc. - - - -===Semantic definitions=== - -We have seen that, -just like functional programming languages, GF has declarations -of functions, telling what the type of a function is. -But we have not yet shown how to **compute** -these functions: all we can do is provide them with arguments -and linearize the resulting terms. -Since our main interest is the well-formedness of expressions, -this has not yet bothered -us very much. As we will see, however, computation does play a role -even in the well-formedness of expressions when dependent types are -present. - - -GF has a form of judgement for **semantic definitions**, -recognized by the key word ``def``. At its simplest, it is just -the definition of one constant, e.g. -``` - def one = succ zero ; -``` -We can also define a function with arguments, -``` - def Neg A = Impl A Abs ; -``` -which is still a special case of the most general notion of -definition, that of a group of **pattern equations**: -``` - def sum x zero = x ; - def sum x (succ y) = succ (sum x y) ; -``` -To compute a term is, as in functional programming languages, -simply to follow a chain of reductions until no definition -can be applied. For instance, we compute -``` - sum one one --> - sum (succ zero) (succ zero) --> - succ (sum (succ zero) zero) --> - succ (succ zero) -``` -Computation in GF is performed with the ``pt`` command and the -``compute`` transformation, e.g. -``` - > p -tr "1 + 1" | pt -transform=compute -tr | l - sum one one - succ (succ zero) - s(s(0)) + lin Pizza = mkN "pizza" ; -- Str -> N + lin Hand = mkN "mano" Fem ; -- Str -> Gender -> N + lin Man = mkN "uomo" "uomini" ; -- Str -> Str -> N ``` -The ``def`` definitions of a grammar induce a notion of -**definitional equality** among trees: two trees are -definitionally equal if they compute into the same tree. -Thus, trivially, all trees in a chain of computation -(such as the one above) -are definitionally equal to each other. So are the trees -``` - sum zero (succ one) - succ one - sum (sum zero zero) (sum (succ zero) one) -``` -and infinitely many other trees. - -A fact that has to be emphasized about ``def`` definitions is that -they are //not// performed as a first step of linearization. -We say that **linearization is intensional**, which means that -the definitional equality of two trees does not imply that -they have the same linearizations. For instance, the seven terms -above all have different linearizations in arithmetic notation: -``` - 1 + 1 - s(0) + s(0) - s(s(0) + 0) - s(s(0)) - 0 + s(0) - s(1) - 0 + 0 + s(0) + 1 -``` -This notion of intensionality is -no more exotic than the intensionality of any **pretty-printing** -function of a programming language (function that shows -the expressions of the language as strings). It is vital for -pretty-printing to be intensional in this sense - if we want, -for instance, to trace a chain of computation by pretty-printing each -intermediate step, what we want to see is a sequence of different -expression, which are definitionally equal. - -What is more exotic is that GF has two ways of referring to the -abstract syntax objects. In the concrete syntax, the reference is intensional. -In the abstract syntax, the reference is extensional, since -**type checking is extensional**. The reason is that, -in the type theory with dependent types, types may depend on terms. -Two types depending on terms that are definitionally equal are -equal types. For instance, -``` - Proof (Odd one) - Proof (Odd (succ zero)) -``` -are equal types. Hence, any tree that type checks as a proof that -1 is odd also type checks as a proof that the successor of 0 is odd. -(Recall, in this connection, that the -arguments a category depends on never play any role -in the linearization of trees of that category, -nor in the definition of the linearization type.) - -In addition to computation, definitions impose a -**paraphrase** relation on expressions: -two strings are paraphrases if they -are linearizations of trees that are -definitionally equal. -Paraphrases are sometimes interesting for -translation: the **direct translation** -of a string, which is the linearization of the same tree -in the targer language, may be inadequate because it is e.g. -unidiomatic or ambiguous. In such a case, -the translation algorithm may be made to consider -translation by a paraphrase. -To stress express the distinction between -**constructors** (=**canonical** functions) -and other functions, GF has a judgement form -``data`` to tell that certain functions are canonical, e.g. -``` - data Nat = succ | zero ; -``` -Unlike in Haskell, but similarly to ALF (where constructor functions -are marked with a flag ``C``), -new constructors can be added to -a type with new ``data`` judgements. The type signatures of constructors -are given separately, in ordinary ``fun`` judgements. -One can also write directly -``` - data succ : Nat -> Nat ; -``` -which is equivalent to the two judgements -``` - fun succ : Nat -> Nat ; - data Nat = succ ; -``` %--! -==More features of the module system== - -===Interfaces, instances, and functors=== - - -===Resource grammars and their reuse=== +==Using the resource grammar library TODO== A resource grammar is a grammar built on linguistic grounds, to describe a language rather than a domain. @@ -2654,59 +1669,7 @@ documents: for resource grammarians developing the resource. -However, to give a flavour of both using and writing resource grammars, -we have created a miniature resource, which resides in the -subdirectory [``resource`` resource]. Its API consists of the following -three modules: - -[Syntax resource/Syntax.gf] - syntactic structures, language-independent: -``` - -``` -[LexEng resource/LexEng.gf] - lexical paradigms, English: -``` - -``` -[LexIta resource/LexIta.gf] - lexical paradigms, Italian: -``` - -``` - - -Only these three modules should be ``open``ed in applications. -The implementations of the resource are given in the following four modules: - -[MorphoEng resource/MorphoEng.gf], -``` - -``` -[MorphoIta resource/MorphoIta.gf]: low-level morphology -- [SyntaxEng resource/SyntaxEng.gf]. - [SyntaxIta resource/SyntaxIta.gf]: definitions of syntactic structures - - -An example use of the resource resides in the -subdirectory [``applications`` applications]. -It implements the abstract syntax -[``FoodComments`` applications/FoodComments.gf] for English and Italian. -The following diagram shows the module structure, indicating by -colours which modules are written by the grammarian. The two blue modules -form the abstract syntax. The three red modules form the concrete syntax. -The two green modules are trivial instantiations of a functor. -The rest of the modules (black) come from the resource. - -[Multi.png] - - - -===Restricted inheritance and qualified opening=== - - -==Using the standard resource library== - -The example files of this chapter can be found in -the directory [``arithm`` ./arithm]. - +===Interfaces, instances, and functors=== ===The simplest way=== @@ -2862,9 +1825,1019 @@ concrete LexSwe of Lex = CatSwe ** open ParadigmsSwe in { } ``` +===Restricted inheritance and qualified opening=== -==Transfer modules== + + +%--! +==More constructs for concrete syntax== + +In this chapter, we go through constructs that are not necessary in simple grammars +or when the concrete syntax relies on libraries, but very useful when writing advanced +concrete syntax implementations, such as resource grammar libraries. + + +%--! +===Local definitions=== + +Local definitions ("``let`` expressions") are used in functional +programming for two reasons: to structure the code into smaller +expressions, and to avoid repeated computation of one and +the same expression. Here is an example, from +[``MorphoIta`` resource/MorphoIta.gf]: +``` + oper regNoun : Str -> Noun = \vino -> + let + vin = init vino ; + o = last vino + in + case o of { + "a" => mkNoun Fem vino (vin + "e") ; + "o" | "e" => mkNoun Masc vino (vin + "i") ; + _ => mkNoun Masc vino vino + } ; +``` + + +===Record extension and subtyping=== + +Record types and records can be **extended** with new fields. For instance, +in German it is natural to see transitive verbs as verbs with a case. +The symbol ``**`` is used for both constructs. +``` + lincat TV = Verb ** {c : Case} ; + + lin Follow = regVerb "folgen" ** {c = Dative} ; +``` +To extend a record type or a record with a field whose label it +already has is a type error. + +A record type //T// is a **subtype** of another one //R//, if //T// has +all the fields of //R// and possibly other fields. For instance, +an extension of a record type is always a subtype of it. + +If //T// is a subtype of //R//, an object of //T// can be used whenever +an object of //R// is required. For instance, a transitive verb can +be used whenever a verb is required. + +**Contravariance** means that a function taking an //R// as argument +can also be applied to any object of a subtype //T//. + + + +===Tuples and product types=== + +Product types and tuples are syntactic sugar for record types and records: +``` + T1 * ... * Tn === {p1 : T1 ; ... ; pn : Tn} + === {p1 = T1 ; ... ; pn = Tn} +``` +Thus the labels ``p1, p2,...`` are hard-coded. + + +===Record and tuple patterns=== + +Record types of parameter types are also parameter types. +A typical example is a record of agreement features, e.g. French +``` + oper Agr : PType = {g : Gender ; n : Number ; p : Person} ; +``` +Notice the term ``PType`` rather than just ``Type`` referring to +parameter types. Every ``PType`` is also a ``Type``, but not vice-versa. + +Pattern matching is done in the expected way, but it can moreover +utilize partial records: the branch +``` + {g = Fem} => t +``` +in a table of type ``Agr => T`` means the same as +``` + {g = Fem ; n = _ ; p = _} => t +``` +Tuple patterns are translated to record patterns in the +same way as tuples to records; partial patterns make it +possible to write, slightly surprisingly, +``` + case of { + => t + ... + } +``` + + +%--! +===Regular expression patterns=== + +To define string operations computed at compile time, such +as in morphology, it is handy to use regular expression patterns: + - //p// ``+`` //q// : token consisting of //p// followed by //q// + - //p// ``*`` : token //p// repeated 0 or more times + (max the length of the string to be matched) + - ``-`` //p// : matches anything that //p// does not match + - //x// ``@`` //p// : bind to //x// what //p// matches + - //p// ``|`` //q// : matches what either //p// or //q// matches + + +The last three apply to all types of patterns, the first two only to token strings. +As an example, we give a rule for the formation of English word forms +ending with an //s// and used in the formation of both plural nouns and +third-person present-tense verbs. +``` + add_s : Str -> Str = \w -> case w of { + _ + "oo" => s + "s" ; -- bamboo + _ + ("s" | "z" | "x" | "sh" | "o") => w + "es" ; -- bus, hero + _ + ("a" | "o" | "u" | "e") + "y" => w + "s" ; -- boy + x + "y" => x + "ies" ; -- fly + _ => w + "s" -- car + } ; +``` +Here is another example, the plural formation in Swedish 2nd declension. +The second branch uses a variable binding with ``@`` to cover the cases where an +unstressed pre-final vowel //e// disappears in the plural +(//nyckel-nycklar, seger-segrar, bil-bilar//): +``` + plural2 : Str -> Str = \w -> case w of { + pojk + "e" => pojk + "ar" ; + nyck + "e" + l@("l" | "r" | "n") => nyck + l + "ar" ; + bil => bil + "ar" + } ; +``` + + +Semantics: variables are always bound to the **first match**, which is the first +in the sequence of binding lists ``Match p v`` defined as follows. In the definition, +``p`` is a pattern and ``v`` is a value. +``` + Match (p1|p2) v = Match p1 v ++ Match p2 v + Match (p1+p2) s = [Match p1 s1 ++ Match p2 s2 | + i <- [0..length s], (s1,s2) = splitAt i s] + Match p* s = [[]] if Match "" s ++ Match p s ++ Match (p+p) s ++... /= [] + Match -p v = [[]] if Match p v = [] + Match c v = [[]] if c == v -- for constant and literal patterns c + Match x v = [[(x,v)]] -- for variable patterns x + Match x@p v = [[(x,v)]] + M if M = Match p v /= [] + Match p v = [] otherwise -- failure +``` +Examples: +- ``x + "e" + y`` matches ``"peter"`` with ``x = "p", y = "ter"`` +- ``x + "er"*`` matches ``"burgerer"`` with ``x = "burg" + + + + + +%--! +===Prefix-dependent choices=== + +Sometimes a token has different forms depending on the token +that follows. An example is the English indefinite article, +which is //an// if a vowel follows, //a// otherwise. +Which form is chosen can only be decided at run time, i.e. +when a string is actually build. GF has a special construct for +such tokens, the ``pre`` construct exemplified in +``` + oper artIndef : Str = + pre {"a" ; "an" / strs {"a" ; "e" ; "i" ; "o"}} ; +``` +Thus +``` + artIndef ++ "cheese" ---> "a" ++ "cheese" + artIndef ++ "apple" ---> "an" ++ "apple" +``` +This very example does not work in all situations: the prefix +//u// has no general rules, and some problematic words are +//euphemism, one-eyed, n-gram//. It is possible to write +``` + oper artIndef : Str = + pre {"a" ; + "a" / strs {"eu" ; "one"} ; + "an" / strs {"a" ; "e" ; "i" ; "o" ; "n-"} + } ; +``` + + +===Predefined types and operations=== + +GF has the following predefined categories in abstract syntax: +``` + cat Int ; -- integers, e.g. 0, 5, 743145151019 + cat Float ; -- floats, e.g. 0.0, 3.1415926 + cat String ; -- strings, e.g. "", "foo", "123" +``` +The objects of each of these categories are **literals** +as indicated in the comments above. No ``fun`` definition +can have a predefined category as its value type, but +they can be used as arguments. For example: +``` + fun StreetAddress : Int -> String -> Address ; + lin StreetAddress number street = {s = number.s ++ street.s} ; + + -- e.g. (StreetAddress 10 "Downing Street") : Address +``` +FIXME: The linearization type is ``{s : Str}`` for all these categories. + + + + +==More concepts of abstract syntax== + +This section is about the use of the type theory part of GF for +including more semantics in grammars. Some of the subsections present +ideas that have not yet been used in real-world applications, and whose +tool support outside the GF program is not complete. + + +===GF as a logical framework=== + +In this section, we will show how +to encode advanced semantic concepts in an abstract syntax. +We use concepts inherited from **type theory**. Type theory +is the basis of many systems known as **logical frameworks**, which are +used for representing mathematical theorems and their proofs on a computer. +In fact, GF has a logical framework as its proper part: +this part is the abstract syntax. + +In a logical framework, the formalization of a mathematical theory +is a set of type and function declarations. The following is an example +of such a theory, represented as an ``abstract`` module in GF. +``` +abstract Arithm = { + cat + Prop ; -- proposition + Nat ; -- natural number + fun + Zero : Nat ; -- 0 + Succ : Nat -> Nat ; -- successor of x + Even : Nat -> Prop ; -- x is even + And : Prop -> Prop -> Prop ; -- A and B + } +``` +A concrete syntax is given below, as an example of using the resource grammar +library. + + + +===Dependent types=== + +**Dependent types** are a characteristic feature of GF, +inherited from the +**constructive type theory** of Martin-Löf and +distinguishing GF from most other grammar formalisms and +functional programming languages. +The initial main motivation for developing GF was, indeed, +to have a grammar formalism with dependent types. +As can be inferred from the fact that we introduce them only now, +after having written lots of grammars without them, +dependent types are no longer the only motivation for GF. +But they are still important and interesting. + + +Dependent types can be used for stating stronger +**conditions of well-formedness** than non-dependent types. +A simple example is postal addresses. Ignoring the other details, +let us take a look at addresses consisting of +a street, a city, and a country. +``` +abstract Address = { + cat + Address ; Country ; City ; Street ; + + fun + mkAddress : Country -> City -> Street -> Address ; + + UK, France : Country ; + Paris, London, Grenoble : City ; + OxfordSt, ShaftesburyAve, BdRaspail, RueBlondel, AvAlsaceLorraine : Street ; + } +``` +The linearization rules are straightforward, +``` + lin + mkAddress country city street = + ss (street.s ++ "," ++ city.s ++ "," ++ country.s) ; + UK = ss ("U.K.") ; + France = ss ("France") ; + Paris = ss ("Paris") ; + London = ss ("London") ; + Grenoble = ss ("Grenoble") ; + OxfordSt = ss ("Oxford" ++ "Street") ; + ShaftesburyAve = ss ("Shaftesbury" ++ "Avenue") ; + BdRaspail = ss ("boulevard" ++ "Raspail") ; + RueBlondel = ss ("rue" ++ "Blondel") ; + AvAlsaceLorraine = ss ("avenue" ++ "Alsace-Lorraine") ; +``` +Notice that, in ``mkAddress``, we have +reversed the order of the constituents. The type of ``mkAddress`` +in the abstract syntax takes its arguments in a "logical" order, +with increasing precision. (This order is sometimes even used in the +concrete syntax of addresses, e.g. in Russia). + +Both existing and non-existing addresses are recognized by this +grammar. The non-existing ones in the following randomly generated +list have afterwards been marked by *: +``` + > gr -cat=Address -number=7 | l + + * Oxford Street , Paris , France + * Shaftesbury Avenue , Grenoble , U.K. + boulevard Raspail , Paris , France + * rue Blondel , Grenoble , U.K. + * Shaftesbury Avenue , Grenoble , France + * Oxford Street , London , France + * Shaftesbury Avenue , Grenoble , France +``` +Dependent types provide a way to guarantee that addresses are +well-formed. What we do is to include **contexts** in +``cat`` judgements: +``` + cat + Address ; + Country ; + City Country ; + Street (x : Country)(City x) ; +``` +The first two judgements are as before, but the third one makes +``City`` dependent on ``Country``: there are no longer just cities, +but cities of the U.K. and cities of France. The fourth judgement +makes ``Street`` dependent on ``City``; but since +``City`` is itself dependent on ``Country``, we must +include them both in the context, moreover guaranteeing that +the city is one of the given country. Since the context itself +is built by using a dependent type, we have to use variables +to indicate the dependencies. The judgement we used for ``City`` +is actually shorthand for +``` + cat City (x : Country) +``` +which is only possible if the subsequent context does not depend on ``x``. + +The ``fun`` judgements of the grammar are modified accordingly: +``` + fun + mkAddress : (x : Country) -> (y : City x) -> Street x y -> Address ; + + UK : Country ; + France : Country ; + Paris : City France ; + London : City UK ; + Grenoble : City France ; + OxfordSt : Street UK London ; + ShaftesburyAve : Street UK London ; + BdRaspail : Street France Paris ; + RueBlondel : Street France Paris ; + AvAlsaceLorraine : Street France Grenoble ; +``` +Since the type of ``mkAddress`` now has dependencies among +its argument types, we have to use variables just like we used in +the context of ``Street`` above. What we claimed to be the +"logical" order of the arguments is now forced by the type system +of GF: a variable must be declared (=bound) before it can be +referenced (=used). + +The effect of dependent types is that the *-marked addresses above are +no longer well-formed. What the GF parser actually does is that it +initially accepts them (by using a context-free parsing algorithm) +and then rejects them (by type checking). The random generator does not produce +illegal addresses (this could be useful in bulk mailing!). +The linearization algorithm does not care about type dependencies; +actually, since the //categories// (ignoring their arguments) +are the same in both abstract syntaxes, +we use the same concrete syntax +for both of them. + +**Remark**. Function types //without// +variables are actually a shorthand notation: writing +``` + fun PredV1 : NP -> V1 -> S +``` +is shorthand for +``` + fun PredV1 : (x : NP) -> (y : V1) -> S +``` +or any other naming of the variables. Actually the use of variables +sometimes shortens the code, since we can write e.g. +``` + oper triple : (x,y,z : Str) -> Str = ... +``` +If a bound variable is not used, it can here, as elswhere in GF, be replaced by +a wildcard: +``` + oper triple : (_,_,_ : Str) -> Str = ... +``` + + + +===Dependent types in concrete syntax=== + +The **functional fragment** of GF +terms and types comprises function types, applications, lambda +abstracts, constants, and variables. This fragment is similar in +abstract and concrete syntax. In particular, +dependent types are also available in concrete syntax. +We have not made use of them yet, +but we will now look at one example of how they +can be used. + +Those readers who are familiar with functional programming languages +like ML and Haskell, may already have missed **polymorphic** +functions. For instance, Haskell programmers have access to +the functions +``` + const :: a -> b -> a + const c _ = c + + flip :: (a -> b -> c) -> b -> a -> c + flip f y x = f x y +``` +which can be used for any given types ``a``,``b``, and ``c``. + +The GF counterpart of polymorphic functions are **monomorphic** +functions with explicit **type variables**. Thus the above +definitions can be written +``` + oper const :(a,b : Type) -> a -> b -> a = + \_,_,c,_ -> c ; + + oper flip : (a,b,c : Type) -> (a -> b ->c) -> b -> a -> c = + \_,_,_,f,x,y -> f y x ; +``` +When the operations are used, the type checker requires +them to be equipped with all their arguments; this may be a nuisance +for a Haskell or ML programmer. + + + +===Expressing selectional restrictions=== + +This section introduces a way of using dependent types to +formalize a notion known as **selectional restrictions** +in linguistics. We first present a mathematical model +of the notion, and then integrate it in a linguistically +motivated syntax. + +In linguistics, a +grammar is usually thought of as being about **syntactic well-formedness** +in a rather liberal sense: an expression can be well-formed without +being meaningful, in other words, without being +**semantically well-formed**. +For instance, the sentence +``` + the number 2 is equilateral +``` +is syntactically well-formed but semantically ill-formed. +It is well-formed because it combines a well-formed +noun phrase ("the number 2") with a well-formed +verb phrase ("is equilateral") and satisfies the agreement +rule saying that the verb phrase is inflected in the +number of the noun phrase: +``` + fun PredVP : NP -> VP -> S ; + lin PredVP np v = {s = np.s ++ vp.s ! np.n} ; +``` +It is ill-formed because the predicate "is equilateral" +is only defined for triangles, not for numbers. + +In a straightforward type-theoretical formalization of +mathematics, domains of mathematical objects +are defined as types. In GF, we could write +``` + cat Nat ; + cat Triangle ; + cat Prop ; +``` +for the types of natural numbers, triangles, and propositions, +respectively. +Noun phrases are typed as objects of basic types other than +``Prop``, whereas verb phrases are functions from basic types +to ``Prop``. For instance, +``` + fun two : Nat ; + fun Even : Nat -> Prop ; + fun Equilateral : Triangle -> Prop ; +``` +With these judgements, and the linearization rules +``` + lin two = ss ["the number 2"] ; + lin Even x = ss (x.s ++ ["is even"]) ; + lin Equilateral x = ss (x.s ++ ["is equilateral"]) ; +``` +we can form the proposition ``Even two`` +``` + the number 2 is even +``` +but no proposition linearized to +``` + the number 2 is equilateral +``` +since ``Equilateral two`` is not a well-formed type-theoretical object. +It is not even accepted by the context-free parser. + +When formalizing mathematics, e.g. in the purpose of +computer-assisted theorem proving, we are certainly interested +in semantic well-formedness: we want to be sure that a proposition makes +sense before we make the effort of proving it. The straightforward typing +of nouns and predicates shown above is the way in which this +is guaranteed in various proof systems based on type theory. +(Notice that it is still possible to form //false// propositions, +e.g. "the number 3 is even". +False and meaningless are different things.) + +As shown by the linearization rules for ``two``, ``Even``, +etc, it //is// possible to use straightforward mathematical typings +as the abstract syntax of a grammar. However, this syntax is not very +expressive linguistically: for instance, there is no distinction between +adjectives and verbs. It is hard to give rules for structures like +adjectival modification ("even number") and conjunction of predicates +("even or odd"). + +By using dependent types, it is simple to combine a linguistically +motivated system of categories with mathematically motivated +type restrictions. What we need is a category of domains of +individual objects, +``` + cat Dom +``` +and dependencies of other categories on this: +``` + cat + S ; -- sentence + V1 Dom ; -- one-place verb with specific subject type + V2 Dom Dom ; -- two-place verb with specific subject and object types + A1 Dom ; -- one-place adjective + A2 Dom Dom ; -- two-place adjective + NP Dom ; -- noun phrase for an object of specific type + Conj ; -- conjunction + Det ; -- determiner +``` +Having thus parametrized categories on domains, we have to reformulate +the rules of predication, etc, accordingly. This is straightforward: +``` + fun + PredV1 : (A : Dom) -> NP A -> V1 A -> S ; + ComplV2 : (A,B : Dom) -> V2 A B -> NP B -> V1 A ; + DetCN : Det -> (A : Dom) -> NP A ; + ModA1 : (A : Dom) -> A1 A -> Dom ; + ConjS : Conj -> S -> S -> S ; + ConjV1 : (A : Dom) -> Conj -> V1 A -> V1 A -> V1 A ; +``` +In linearization rules, +we use wildcards for the domain arguments, +because they don't affect linearization: +``` + lin + PredV1 _ np vp = ss (np.s ++ vp.s) ; + ComplV2 _ _ v2 np = ss (v2.s ++ np.s) ; + DetCN det cn = ss (det.s ++ cn.s) ; + ModA1 cn a1 = ss (a1.s ++ cn.s) ; + ConjS conj s1 s2 = ss (s1.s ++ conj.s ++ s2.s) ; + ConjV1 _ conj v1 v2 = ss (v1.s ++ conj.s ++ v2.s) ; +``` +The domain arguments thus get suppressed in linearization. +Parsing initially returns metavariables for them, +but type checking can usually restore them +by inference from those arguments that are not suppressed. + +One traditional linguistic example of domain restrictions +(= selectional restrictions) is the contrast between the two sentences +``` + John plays golf + golf plays John +``` +To explain the contrast, we introduce the functions +``` + human : Dom ; + game : Dom ; + play : V2 human game ; + John : NP human ; + Golf : NP game ; +``` +Both sentences still pass the context-free parser, +returning trees with lots of metavariables of type ``Dom``: +``` + PredV1 ?0 John (ComplV2 ?1 ?2 play Golf) + PredV1 ?0 Golf (ComplV2 ?1 ?2 play John) +``` +But only the former sentence passes the type checker, which moreover +infers the domain arguments: +``` + PredV1 human John (ComplV2 human game play Golf) +``` +To try this out in GF, use ``pt = put_term`` with the **tree transformation** +that solves the metavariables by type checking: +``` + > p -tr "John plays golf" | pt -transform=solve + > p -tr "golf plays John" | pt -transform=solve +``` +In the latter case, no solutions are found. + +A known problem with selectional restrictions is that they can be more +or less liberal. For instance, +``` + John loves Mary + John loves golf +``` +should both make sense, even though ``Mary`` and ``golf`` +are of different types. A natural solution in this case is to +formalize ``love`` as a **polymorphic** verb, which takes +a human as its first argument but an object of any type as its second +argument: +``` + fun love : (A : Dom) -> V2 human A ; + lin love _ = ss "loves" ; +``` +In other words, it is possible for a human to love anything. + +A problem related to polymorphism is **subtyping**: what +is meaningful for a ``human`` is also meaningful for +a ``man`` and a ``woman``, but not the other way round. +One solution to this is **coercions**: functions that +"lift" objects from subtypes to supertypes. + + +===Case study: selectional restrictions and statistical language models TODO=== + + +===Proof objects=== + +Perhaps the most well-known idea in constructive type theory is +the **Curry-Howard isomorphism**, also known as the +**propositions as types principle**. Its earliest formulations +were attempts to give semantics to the logical systems of +propositional and predicate calculus. In this section, we will consider +a more elementary example, showing how the notion of proof is useful +outside mathematics, as well. + +We first define the category of unary (also known as Peano-style) +natural numbers: +``` + cat Nat ; + fun Zero : Nat ; + fun Succ : Nat -> Nat ; +``` +The **successor function** ``Succ`` generates an infinite +sequence of natural numbers, beginning from ``Zero``. + +We then define what it means for a number //x// to be //less than// +a number //y//. Our definition is based on two axioms: +- ``Zero`` is less than ``Succ`` //y// for any //y//. +- If //x// is less than //y//, then``Succ`` //x// is less than ``Succ`` //y//. + + +The most straightforward way of expressing these axioms in type theory +is as typing judgements that introduce objects of a type ``Less`` //x y //: +``` + cat Less Nat Nat ; + fun lessZ : (y : Nat) -> Less Zero (Succ y) ; + fun lessS : (x,y : Nat) -> Less x y -> Less (Succ x) (Succ y) ; +``` +Objects formed by ``lessZ`` and ``lessS`` are +called **proof objects**: they establish the truth of certain +mathematical propositions. +For instance, the fact that 2 is less that +4 has the proof object +``` + lessS (Succ Zero) (Succ (Succ (Succ Zero))) + (lessS Zero (Succ (Succ Zero)) (lessZ (Succ Zero))) +``` +whose type is +``` + Less (Succ (Succ Zero)) (Succ (Succ (Succ (Succ Zero)))) +``` +which is the formalization of the proposition that 2 is less than 4. + +GF grammars can be used to provide a **semantic control** of +well-formedness of expressions. We have already seen examples of this: +the grammar of well-formed addresses and the grammar with +selectional restrictions above. By introducing proof objects +we have now added a very powerful technique of expressing semantic conditions. + +A simple example of the use of proof objects is the definition of +well-formed //time spans//: a time span is expected to be from an earlier to +a later time: +``` + from 3 to 8 +``` +is thus well-formed, whereas +``` + from 8 to 3 +``` +is not. The following rules for spans impose this condition +by using the ``Less`` predicate: +``` + cat Span ; + fun span : (m,n : Nat) -> Less m n -> Span ; +``` +A possible practical application of this idea is **proof-carrying documents**: +to be semantically well-formed, the abstract syntax of a document must contain a proof +of some property, although the proof is not shown in the concrete document. +Think, for instance, of small documents describing flight connections: + +//To fly from Gothenburg to Prague, first take LH3043 to Frankfurt, then OK0537 to Prague.// + +The well-formedness of this text is partly expressible by dependent typing: +``` + cat + City ; + Flight City City ; + fun + Gothenburg, Frankfurt, Prague : City ; + LH3043 : Flight Gothenburg Frankfurt ; + OK0537 : Flight Frankfurt Prague ; +``` +This rules out texts saying //take OK0537 from Gothenburg to Prague//. However, there is a +further condition saying that it must be possible to change from LH3043 to OK0537 in Frankfurt. +This can be modelled as a proof object of a suitable type, which is required by the constructor +that connects flights. +``` + cat + IsPossible (x,y,z : City)(Flight x y)(Flight y z) ; + fun + Connect : (x,y,z : City) -> + (u : Flight x y) -> (v : Flight y z) -> + IsPossible x y z u v -> Flight x z ; +``` + + + +===Variable bindings=== + +Mathematical notation and programming languages have lots of +expressions that **bind** variables. For instance, +a universally quantifier proposition +``` + (All x)B(x) +``` +consists of the **binding** ``(All x)`` of the variable ``x``, +and the **body** ``B(x)``, where the variable ``x`` can have +**bound occurrences**. + +Variable bindings appear in informal mathematical language as well, for +instance, +``` + for all x, x is equal to x + + the function that for any numbers x and y returns the maximum of x+y + and x*y +``` +In type theory, variable-binding expression forms can be formalized +as functions that take functions as arguments. The universal +quantifier is defined +``` + fun All : (Ind -> Prop) -> Prop +``` +where ``Ind`` is the type of individuals and ``Prop``, +the type of propositions. If we have, for instance, the equality predicate +``` + fun Eq : Ind -> Ind -> Prop +``` +we may form the tree +``` + All (\x -> Eq x x) +``` +which corresponds to the ordinary notation +``` + (All x)(x = x). +``` + + +An abstract syntax where trees have functions as arguments, as in +the two examples above, has turned out to be precisely the right +thing for the semantics and computer implementation of +variable-binding expressions. The advantage lies in the fact that +only one variable-binding expression form is needed, the lambda abstract +``\x -> b``, and all other bindings can be reduced to it. +This makes it easier to implement mathematical theories and reason +about them, since variable binding is tricky to implement and +to reason about. The idea of using functions as arguments of +syntactic constructors is known as **higher-order abstract syntax**. + +The question now arises: how to define linearization rules +for variable-binding expressions? +Let us first consider universal quantification, +``` + fun All : (Ind -> Prop) -> Prop +``` +We write +``` + lin All B = {s = "(" ++ "All" ++ B.$0 ++ ")" ++ B.s} +``` +to obtain the form shown above. +This linearization rule brings in a new GF concept - the ``$0`` +field of ``B`` containing a bound variable symbol. +The general rule is that, if an argument type of a function is +itself a function type ``A -> C``, the linearization type of +this argument is the linearization type of ``C`` +together with a new field ``$0 : Str``. In the linearization rule +for ``All``, the argument ``B`` thus has the linearization +type +``` + {$0 : Str ; s : Str}, +``` +since the linearization type of ``Prop`` is +``` + {s : Str} +``` +In other words, the linearization of a function +consists of a linearization of the body together with a +field for a linearization of the bound variable. +Those familiar with type theory or lambda calculus +should notice that GF requires trees to be in +**eta-expanded** form in order to be linearizable: +any function of type +``` + A -> B +``` +always has a syntax tree of the form +``` + \x -> b +``` +where ``b : B`` under the assumption ``x : A``. +It is in this form that an expression can be analysed +as having a bound variable and a body. + + +Given the linearization rule +``` + lin Eq a b = {s = "(" ++ a.s ++ "=" ++ b.s ++ ")"} +``` +the linearization of +``` + \x -> Eq x x +``` +is the record +``` + {$0 = "x", s = ["( x = x )"]} +``` +Thus we can compute the linearization of the formula, +``` + All (\x -> Eq x x) --> {s = "[( All x ) ( x = x )]"}. +``` + +How did we get the //linearization// of the variable ``x`` +into the string ``"x"``? GF grammars have no rules for +this: it is just hard-wired in GF that variable symbols are +linearized into the same strings that represent them in +the print-out of the abstract syntax. + + +To be able to //parse// variable symbols, however, GF needs to know what +to look for (instead of e.g. trying to parse //any// +string as a variable). What strings are parsed as variable symbols +is defined in the lexical analysis part of GF parsing +``` + > p -cat=Prop -lexer=codevars "(All x)(x = x)" + All (\x -> Eq x x) +``` +(see more details on lexers below). If several variables are bound in the +same argument, the labels are ``$0, $1, $2``, etc. + + + +===Semantic definitions=== + +We have seen that, +just like functional programming languages, GF has declarations +of functions, telling what the type of a function is. +But we have not yet shown how to **compute** +these functions: all we can do is provide them with arguments +and linearize the resulting terms. +Since our main interest is the well-formedness of expressions, +this has not yet bothered +us very much. As we will see, however, computation does play a role +even in the well-formedness of expressions when dependent types are +present. + +GF has a form of judgement for **semantic definitions**, +recognized by the key word ``def``. At its simplest, it is just +the definition of one constant, e.g. +``` + def one = Succ Zero ; +``` +We can also define a function with arguments, +``` + def Neg A = Impl A Abs ; +``` +which is still a special case of the most general notion of +definition, that of a group of **pattern equations**: +``` + def + sum x Zero = x ; + sum x (Succ y) = Succ (Sum x y) ; +``` +To compute a term is, as in functional programming languages, +simply to follow a chain of reductions until no definition +can be applied. For instance, we compute +``` + Sum one one --> + Sum (Succ Zero) (Succ Zero) --> + Succ (sum (Succ Zero) Zero) --> + Succ (Succ Zero) +``` +Computation in GF is performed with the ``pt`` command and the +``compute`` transformation, e.g. +``` + > p -tr "1 + 1" | pt -transform=compute -tr | l + sum one one + Succ (Succ Zero) + s(s(0)) +``` + +The ``def`` definitions of a grammar induce a notion of +**definitional equality** among trees: two trees are +definitionally equal if they compute into the same tree. +Thus, trivially, all trees in a chain of computation +(such as the one above) +are definitionally equal to each other. So are the trees +``` + sum Zero (Succ one) + Succ one + sum (sum Zero Zero) (sum (Succ Zero) one) +``` +and infinitely many other trees. + +A fact that has to be emphasized about ``def`` definitions is that +they are //not// performed as a first step of linearization. +We say that **linearization is intensional**, which means that +the definitional equality of two trees does not imply that +they have the same linearizations. For instance, each of the seven terms +shown above has a different linearizations in arithmetic notation: +``` + 1 + 1 + s(0) + s(0) + s(s(0) + 0) + s(s(0)) + 0 + s(0) + s(1) + 0 + 0 + s(0) + 1 +``` +This notion of intensionality is +no more exotic than the intensionality of any **pretty-printing** +function of a programming language (function that shows +the expressions of the language as strings). It is vital for +pretty-printing to be intensional in this sense - if we want, +for instance, to trace a chain of computation by pretty-printing each +intermediate step, what we want to see is a sequence of different +expression, which are definitionally equal. + +What is more exotic is that GF has two ways of referring to the +abstract syntax objects. In the concrete syntax, the reference is intensional. +In the abstract syntax, the reference is extensional, since +**type checking is extensional**. The reason is that, +in the type theory with dependent types, types may depend on terms. +Two types depending on terms that are definitionally equal are +equal types. For instance, +``` + Proof (Odd one) + Proof (Odd (Succ Zero)) +``` +are equal types. Hence, any tree that type checks as a proof that +1 is odd also type checks as a proof that the successor of 0 is odd. +(Recall, in this connection, that the +arguments a category depends on never play any role +in the linearization of trees of that category, +nor in the definition of the linearization type.) + +In addition to computation, definitions impose a +**paraphrase** relation on expressions: +two strings are paraphrases if they +are linearizations of trees that are +definitionally equal. +Paraphrases are sometimes interesting for +translation: the **direct translation** +of a string, which is the linearization of the same tree +in the targer language, may be inadequate because it is e.g. +unidiomatic or ambiguous. In such a case, +the translation algorithm may be made to consider +translation by a paraphrase. + +To stress express the distinction between +**constructors** (=**canonical** functions) +and other functions, GF has a judgement form +``data`` to tell that certain functions are canonical, e.g. +``` + data Nat = Succ | Zero ; +``` +Unlike in Haskell, but similarly to ALF (where constructor functions +are marked with a flag ``C``), +new constructors can be added to +a type with new ``data`` judgements. The type signatures of constructors +are given separately, in ordinary ``fun`` judgements. +One can also write directly +``` + data Succ : Nat -> Nat ; +``` +which is equivalent to the two judgements +``` + fun Succ : Nat -> Nat ; + data Nat = Succ ; +``` + + +===Case study: representing anaphoric reference TODO=== + + +==Transfer modules TODO== Transfer means noncompositional tree-transforming operations. The command ``apply_transfer = at`` is typically used in a pipe: @@ -2880,7 +2853,7 @@ See the for more information. -==Practical issues== +==Practical issues TODO== ===Lexers and unlexers=== @@ -2913,7 +2886,6 @@ Given by ``help -lexer``, ``help -unlexer``: -unlexer=codelit like code, but remove string literal quotes -unlexer=concat remove all spaces -unlexer=bind like identity, but bind at "&+" - ``` @@ -2946,8 +2918,6 @@ Both Flite and ATK are freely available through the links above, but they are not distributed together with GF. - - ===Multilingual syntax editor=== The @@ -2956,7 +2926,7 @@ describes the use of the editor, which works for any multilingual GF grammar. Here is a snapshot of the editor: -[../quick-editor.gif] +[../quick-editor.png] The grammars of the snapshot are from the [Letter grammar package http://www.cs.chalmers.se/~aarne/GF/examples/letter]. @@ -2999,7 +2969,7 @@ A summary is given in the following chart of GF grammar compiler phases: [../gf-compiler.png] -==Case studies== +==Larger case studies TODO== ===Interfacing formal and natural languages=== @@ -3011,3 +2981,8 @@ English and German. A simpler example will be explained here. + +===A multimodal dialogue system=== + +See TALK project deliverables, [TALK homepage http://www.talk-project.org] + diff --git a/lib/resource-1.0/finnish/CatFin.gf b/lib/resource-1.0/finnish/CatFin.gf index c00d6589f..bdded05b5 100644 --- a/lib/resource-1.0/finnish/CatFin.gf +++ b/lib/resource-1.0/finnish/CatFin.gf @@ -1,4 +1,4 @@ -concrete CatFin of Cat = CommonX ** open ResFin, Prelude in { +concrete CatFin of Cat = CommonX - [Adv] ** open ResFin, Prelude in { flags optimize=all_subs ; @@ -70,24 +70,28 @@ concrete CatFin of Cat = CommonX ** open ResFin, Prelude in { Conj = {s : Str ; n : Number} ; DConj = {s1,s2 : Str ; n : Number} ; Subj = {s : Str} ; - Prep = Compl ; -- Open lexical classes, e.g. Lexicon - V, VS, VQ = Verb1 ; -- = {s : VForm => Str ; sc : Case} ; - V2, VA = Verb1 ** {c2 : Compl} ; - V2A = Verb1 ** {c2, c3 : Compl} ; - VV = Verb1 ; ---- infinitive form - V3 = Verb1 ** {c2, c3 : Compl} ; + V = ResFin.V ; + V2 = ResFin.V2 ; + VA = ResFin.VA ; + VS = ResFin.VS ; + VQ = ResFin.VQ ; + V2A = ResFin.V2A ; + VV = ResFin.VV ; + V3 = ResFin.V3 ; - A = {s : Degree => AForm => Str} ; - A2 = {s : Degree => AForm => Str ; c2 : Compl} ; + A = ResFin.A ; + A2 = ResFin.A2 ; - N = {s : NForm => Str} ; - N2 = {s : NForm => Str} ** {c2 : Compl} ; - N3 = {s : NForm => Str} ** {c2,c3 : Compl} ; - PN = {s : Case => Str} ; + N = ResFin.N ; + N2 = ResFin.N2 ; + N3 = ResFin.N3 ; + PN = ResFin.PN ; + + Adv = ResFin.Adv ; + Prep = ResFin.Prep ; -oper Verb1 = {s : VForm => Str ; sc : NPForm} ; } diff --git a/lib/resource-1.0/finnish/GrammarFin.gf b/lib/resource-1.0/finnish/GrammarFin.gf index 6ae2ee9ea..9ed42e3b5 100644 --- a/lib/resource-1.0/finnish/GrammarFin.gf +++ b/lib/resource-1.0/finnish/GrammarFin.gf @@ -11,7 +11,7 @@ concrete GrammarFin of Grammar = RelativeFin, ConjunctionFin, PhraseFin, - TextX, + TextX - [Adv], IdiomFin, StructuralFin ** { diff --git a/lib/resource-1.0/finnish/ParadigmsFin.gf b/lib/resource-1.0/finnish/ParadigmsFin.gf index df83ed1f9..55331f940 100644 --- a/lib/resource-1.0/finnish/ParadigmsFin.gf +++ b/lib/resource-1.0/finnish/ParadigmsFin.gf @@ -25,8 +25,7 @@ resource ParadigmsFin = open (Predef=Predef), Prelude, - MorphoFin, - CatFin + MorphoFin in { flags optimize=noexpand ; diff --git a/lib/resource-1.0/finnish/ResFin.gf b/lib/resource-1.0/finnish/ResFin.gf index 03d92dbe7..a9f81764d 100644 --- a/lib/resource-1.0/finnish/ResFin.gf +++ b/lib/resource-1.0/finnish/ResFin.gf @@ -569,4 +569,26 @@ oper a = agrP3 Sg ; -- does not matter (--- at least in Slash) isPron = False -- has no special accusative } ; + +-- To export + + N : Type = {s : NForm => Str} ; + N2 = {s : NForm => Str} ** {c2 : Compl} ; + N3 = {s : NForm => Str} ** {c2,c3 : Compl} ; + PN = {s : Case => Str} ; + + A = {s : Degree => AForm => Str} ; + A2 = {s : Degree => AForm => Str ; c2 : Compl} ; + + V, VS, VQ = Verb1 ; -- = {s : VForm => Str ; sc : Case} ; + V2, VA = Verb1 ** {c2 : Compl} ; + V2A = Verb1 ** {c2, c3 : Compl} ; + VV = Verb1 ; ---- infinitive form + V3 = Verb1 ** {c2, c3 : Compl} ; + + Verb1 = {s : VForm => Str ; sc : NPForm} ; + + Prep = Compl ; + Adv = {s : Str} ; + }