_,      !"#$%&'()*+,-./012 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 :!;!<!=!>"?"@"A"B"C"D"E"F"G"H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y%z%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''(((((((((((((((((((((())))))))))))))) ) ) ) ) ))))))))))********* *!*"*#*$*%*&*'*(*)***+*,*-*.*/*0*1*2*3*4*5*6*7*8*9*:*;*<*=*>*?*@*A*B*C*D*E*F*G*H*I*J*K*L*M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*[*\*]*^*_*`*a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*{*|*}*~**********+++++++++,,,,,,,,,,,-----------------............//////////0000000000000000000000001111111111111111111112222222222333333333333333 3 3 3 3 3333333333333333333 3!3"3#3$3%3&3'3(3)3*3+3,3-3.4/404142434445464748494:4;4<5=5>5?5@5A5B5C5D5E5F5G5H5I5J5K6L6M6N6O6P7Q7R7S7T7U7V7W7X7Y7Z7[7\7]7^_`abcdefghijklmnopqrstuvw8x8y8z8{8|8}8~888888899999:::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ; ; ; ; ;;;;;;;;;;;;;;;;;;; ;!;";#;$;%;&;';(;);*;+;,;-;.;/;0;1;2;3;4;5;6;7;8;9;:;;;<;=;>;?;@;A;B;C;D;E<F<G<H<I<J<K<L<M<N<O<P<Q<R<S<T<U<V<W<X<Y<Z<[<\<]<^<_<`<a<b<c<d<e<f<g<h<i<j<k<l<m<n<o<p<q<r<s<t=u=v=w=x=y=z={=|=}=~==================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>??@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@.@/@0@1@2@3@4@5@6@7@8@9@:@;@<@=@>@?@@@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@.@/@0@1@2@3@4@5@6@7@8@9@:@;@<@=@>@?@@@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCC C C C C CDDDDDDDDDDDDDDDDDD D!D"D#D$D%D&D'D(D)D*D+D,D-D.D/D0D1D2D3D4D5D6D7D8D9D:D;D<D=D>D?D@DADBDCDDDEDFDGDHEIEJEKELEMENEOEPEQERESETEUEVEWEXEYEZF[F\F]F^F_F`FaFbFcFdFeFfFgFhFiFjFkFlFmFnFoGpGqGrGsGtGuGvGwGxGyGzG{G|G}G~GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG G G G G G G G G G G G G G G G G G G G G G G G H H H H H H H H H H !H "H #H $H %H &H 'H (H )H *H +H ,H -H .H /H 0H 1H 2H 3H 4H 5H 6H 7H 8H 9H :H ;H <H =H >H ?H @H AH BH CH DH EH FH GH HH IH JH KH LH MH NH OH PH QH RH SH TH UH VH WH XH YH ZH [H \H ]H ^H _H `H aH bH cH dH eI fI gI hI iI jI kI lI mI nI oI pI qI rI sI tI uI vI wI xI yI zI {I |I }I ~I I I I I I I I I I I I I I I I I I I I J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K K L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L !L "L #L $L %L &L 'L (L )L *L +L ,L -L .L /L 0L 1L 2L 3L 4L 5L 6L 7L 8L 9L :L ;L <L =L >L ?L @L AL BL CL DL EL FL GL HL IL JL KL LL ML NL OL PL QL RL SL TL UL VL WL XL YL ZL [M \M ]M ^M _M `M aM bM cM dM eM fM gM hM iM jM kM lM mM nN oN pN qN rN sN tN uN vN wN xN yN zN {N |N }N ~N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N O P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P P Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q !Q "Q #Q $Q %Q &Q 'Q (Q )Q *Q +Q ,Q -Q .Q /Q 0Q 1Q 2Q 3Q 4Q 5Q 6Q 7Q 8Q 9Q :Q ;Q <Q =Q >Q ?Q @Q AQ BQ CQ DQ EQ FQ GQ HQ IQ JQ KQ LQ MQ NQ OQ PQ QQ RQ SQ TQ UQ VQ WQ XQ YQ ZQ [Q \Q ]Q ^Q _Q `Q aQ bQ cQ dQ eQ fQ gQ hQ iQ jQ kQ lQ mQ nQ oQ pQ qQ rQ sQ tQ uQ vQ wQ xQ yQ zQ {Q |? }? ~? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? R R R R R R R R R R R R R R R R R R R R S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S S !S "S #S $S %S &S 'S (S )S *S +S ,S -S .S /S 0S 1S 2S 3S 4S 5S 6S 7S 8S 9S :S ;S <T =T >T ?T @T AT BT CT DT ET FT GT HT IT JT KT LT MT NT OT PT QT RT ST TT UT VT WT XT YT ZT [T \T ]T ^T _T `T aT bT cT dT eT fT gT hT iT jT kT lT mT nT oT pT qT rT sT tT uT vT wT xT yT zT {T |T }T ~T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U U V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V !V "V #V $V %V &V 'V (V )V *V +V ,V -V .V /V 0V 1V 2V 3V 4V 5V 6V 7V 8V 9V :V ;V <V =V >V ?V @V AV BV CV DV EV FV GV HV IV JV KV LV MV NV OV PV QV RV SV TV UV VV WV XV YV ZV [V \V ]V ^V _V `V aV bV cV dV eV fV gV hV iV jV kV lV mV nV oV pV qV rV sV tV uV vV wV xV yV zV {V |V }V ~V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V VVVVVVVVVV W W W W WWWWWWWWWWWWWWWWWWW W!W"W#W$W%W&W'W(W)W*W+W,W-W.W/W0W1W2W3W4W5W6W7W8W9W:W;W<W=W>W?W@WAWBXCXDXEXFXGXHXIXJXKXLXMXNXOXPXQXRXSXTXUXVXWXXXYXZX[X\X]X^X_X`XaXbXcXdXeXfXgXhXiXjXkXlXmXnXoXpXqXrXsYtYuYvYwYxYyYzY{Y|Y}Y~YYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[ [ [ [ [ [\\\\\\\\\\\\\\\\\\ \!\"\#\$\%\&\'\(\)\*\+\,\-\.\/\0\1\2\3\4\5\6\7\8\9\:\;]<]=]>]?]@]A]B]C]D]E]F]G]H]I]J]K]L]M]N]O]P]Q]R^S^T^U^V^W^X^Y^Z^[_\_]_^___`_a_b_c_d_e_f_g_h_i_j_k_l_m_n_o_p_q_r_s_t_u_v_w_x_y_z_{_|_}_~___________________________________________________________________________________________________________________________________________ _ _ _ _ ____```aaaaaaaaaaaa a!a"a#a$a%a&a'a(a)a*a+a,a-a.a/a0a1a2a3a4a5a6a7a8a9a:a;a<a=a>a?a@aAaBaCaDaEaFaGaHaIaJaKaLaMaNaOaPaQaRaSaTaUaVaWaXaYaZa[a\a]a^a_a`aaabacadaeafagahaiajakalamanaoapaqarasatauavawaxayaza{a|a}a~aaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddde e e e e eeeeeeeeeeeeeeeeeef f!f"f#g$g%g&g'g(g)g*g+g,g-g.g/g0g1g2g3g4g5g6g7h8h9h:h;h<h=h>h?h@hAhBhChDhEiFiGjHjIjJjKjLjMjNjOjPjQjRjSjTjUjVjWjXkYkZk[l\l]l^l_l`mambmcmdmemfmgmhmimjmkmlmmnnnonpnqnrnsntnunvjwjxkykzo{o|o}o~ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo o o o o ooooooooooooooooooo o!o"o#o$o%o&o'o(o)o*o+o,o-o.o/o0o1o2o3o4o5o6o7o8o9o:o;o<o=o>o?o@oAoBoCoDoEoFoGoHoIoJoKoLoMoNoOoPoQoRoSoToUoVoWoXoYoZo[o\o]o^o_o`oaobocodoeofogohoiojokolomonooopoqorosotouovowoxoyozo{o|o}o~oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppppppppqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq q q q q qqqqqqqqqqqqqqrrrrr r!r"r#r$r%r&r'r(r)r*r+r,r-r.r/r0r1r2r3r4r5r6r7r8r9r:r;r<r=r>r?r@rArBrCrDrErFrGrHrIrJsKsLsMsNsOsPsQsRsSsTsUsVsWsXsYsZs[s\s]s^s_s`sasbscsdsesfsgshsisjskslsmsnsospsqtrtstttutvtwtxtytzt{t|t}t~tttttuuuuuuuuuuuuuuuuuuuuuuuuuuvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx x x x x xxxxxxxxxxxxxxxxxxx x!x"x#x$x%x&x'x(x)x*x+x,x-x.x/x0x1x2x3x4x5x6x7x8x9x:x;x<x=x>x?x@xAxBxCxDxExFxGxHxIxJxKxLxMxNxOxPxQxRxSxTxUxVxWxXxYxZx[x\x]x^x_x`xaxbxcxdxexfxgxhxixjxkxlxmxnxoxpxqxrxsxtxuxvxwxxxyxzx{x|x}x~xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx x x x x xxxxxxxxxxxxxxxxxxx x!x"x#x$x%x&x'x(x)x*x+x,x-x.x/x0x1x2x3x4x5x6x7x8x9x:x;x<x=x>x?x@yAyByCyDyEyFyGyHyIyJyKyLyMyNyOyPyQyRySyTyUyVyWyXyYyZy[y\y]y^y_y`yaybyczdzezfzgzhzizjzkzlzmznzozpzqzrzsztzuzvzwzxzyzzz{z|z}z~zzzzzzzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{||||||||||||||||||||||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~ ~ ~ ~ ~~~~~~~~~~~~~~~~~~~ ~!~"~#~$~%~&~'~(~)~*~+~,~-~.~/~0~1~2~3~4~5~6~7~8~9~:~;~<~=~>~?~@~ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  !!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!5!6!7!8!9!:!;!<!=!>!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!r!s!t!u!v!w!x!y!z!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"""""""""" " " " " """"""""""""""""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g"h"i"j"k"l"m"n"o"p"q"r"s"t"u"v"w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""########## # # # # ################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}#~#################################################################################################################################$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$%%%%%%%%%% % % % % %%%%%%%%%%%%%%%%%%% %!%"%#%$%%%&%'%(%)%*%+%,%-%.%/%0%1%2%3%4%5%6%7%8%9%:%;%<%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%^%_%`%a%b%c%d%e%f%g%h%i%j%k%l%m%n%o%p%q%r%s%t%u%v%w%x%y%z%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&& & & & & &&&&&&&&&&&&&&&&&&& &!&"&#&$&%&&&'&(&)&*&+&,&-&.&/&0&1&2&3&4&5&6&7&8&9&:&;&<&=&>&?&@&A&B&C&D&E&F&G&H&I&J&K&L&M&N&O&P&Q&R&S&T&U&V&W&X&Y&Z&[&\&]&^&_&`&a&b&c&d&e&f&g&h&i&j&k&l&m&n&o&p&q&r&s&t&u&v&w&x&y&z&{&|&}&~&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''' ' ' ' ' ''''''''''''''''''' '!'"'#'$'%'&'''(')'*'+','-'.'/'0'1'2'3'4'5'6'7'8'9':';'<'='>'?'@'A'B'C'D'E'F'G'H'I'J'K'L'M'N'O'P'Q'R'S'T'U'V'W'X'Y'Z'['\']'^'_'`'a'b'c'd'e'f'g'h'i'j'k'l'm'n'o'p'q'r's't'u'v'w'x'y'z'{'|'}'~'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(((((((((( ( ( ( ( ((((((((((((((((((( (!("(#($(%(&('((()(*(+(,(-(.(/(0(1(2(3(4(5(6(7(8(9(:(;(<(=(>(?(@(A(B(C(D(E(F(G(H(I(J(K(L(M(N(O(P(Q(R(S(T(U(V(W(X(Y(Z([(\(](^(_(`(a(b(c(d(e(f(g(h(i(j(k(l(m(n(o(p(q(r(s(t(u(v(w(x(y(z({(|(}(~((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((()))))))))) ) ) ) ) ))))))))))))))))))) )!)")#)$)%)&)')()))*)+),)-).)/)0)1)2)3)4)5)6)7)8)9):);)<)=)>)?)@)A)B)C)D)E)F)G)H)I)J)K)L)M)N)O)P)Q)R)S)T)U)V)W)X)Y)Z)[)\)])^)_)`)a)b)c)d)e)f)g)h)i)j)k)l)m)n)o)p)q)r)s)t)u)v)w)x)y)z){)|)})~)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) * * * * * * * * * *  *  *  *  *  * * * * * * * * * * * * * * * * * * *  *! *" *# *$ *% *& *' *( *) ** *+ *, *- *. */ *0 *1 *2 *3 *4 *5 *6 *7 *8 *9 *: *; *< *= *> *? *@ *A *B *C *D *E *F *G *H *I *J *K *L *M *N *O *P *Q *R *S *T *U *V *W *X *Y *Z *[ *\ *] *^ *_ *` *a *b *c *d *e *f *g *h *i *j *k *l *m *n *o *p *q *r *s *t *u *v *w *x *y *z *{ *| *} *~ * * * * * ****************************************************************************************************************************++++++++++ + + + + +++++++++++++++++++ +!+"+#+$+%+&+'+(+)+*+++,+-+.+/+0+1+2+3+4+5+6+7+8+9+:+;+<+=+>+?+@+A+B+C+D+E+F+G+H+I+J+K+L+M+N+O+P+Q+R+S+T+U+V+W+X+Y+Z+[+\+]+^+_+`+a+b+c+d+e+f+g+h+i+j+k+l+m+n+o+p+q+r+s+t+u+v+w+x+y+z+{+|+}+~+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++,,,,,,,,,, , , , , ,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),*,+,,,-,.,/,0,1,2,3,4,5,6,7,8,9,:,;,<,=,>,?,@,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,[,\,],^,_,`,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,{,|,},~,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,"Safe"#$+-03457;<=>?ACNQV]^L2" Content of a  .agda-lib file.$!The symbolic name of the library.% Path to this  .agda-lib file (not content of the file).&3Roots where to look for the modules of the library.' Dependencies.(A symbolic library name.)The special name "."S is used to indicated that the current directory should count as a project root. "#'&%$()* ()"#$%&'*"#$%&'Safe"#$+-03457;<=>?ACNQV]^O,ICut off structural order comparison at some depth in termination checker?-c >= 0( means: record decrease up to including c+1.,.-,-./,-. Safe"#$+-03457;<=>?ACNQV]^WL2 Semirings.4 Addition.5Multiplication.6WZero. The one is never used in matrix multiplication , one :: a -- ^ One.7HasZero is needed for sparse matrices, to tell which is the element that does not have to be stored. It is a cut-down version of SemiRing, which is definable without the implicit ?cutoff.;The standard semiring on ,s.<The standard semiring on ,s.=The standard semiring on ,s. 23654789:; 78234569:;2345678 None"#$+-013457;<=>?ACKNQV]^_d >Finite bijective map from a to b. There, and back again.BLookup. O(log n).CInverse lookup. O(log n).DEmpty bimap. O(1).ESingleton bimap. O(1).F=Insert. Overwrites existing value if present. O(Map.insert).G Left-biased Union. O(Map.union).HConstruct from a list of pairs.KDoes not check for actual bijectivity of constructed finite map. O(n log n)IATurn into list, sorted ascendingly by first value. O(Map.toList) >?A@BCDEFGHI>?@ABCDEFGHILKJ>?@A Safe"#$+-03457;<=>?ACNQV]^i MUnicode characters are divided into letters, numbers, marks, punctuation, symbols, separators (including spaces) and others (including control characters).These are the tests that   offers:^Convert a character in '0'..'9' into the corresponding digit 0..9._Convert a character in '0'..'9','A'..'F','a'..'f'! into the corresponding digit 0..15.`Convert a character in '0'..'7' into the corresponding digit 0..7.a,Test names paired with their implementation.b+Find out which tests a character satisfies.M]\[ZYXWVUTSRQPON^_`ab^_`MNOPQRSTUVWXYZ[\]abMNOPQRSTUVWXYZ[\] None"#$+-03457;<=>?ACNQV]^rfCharacteristic identifiers.gGiven a function f :: a -> (C,[C])6 which returns a non-empty list of characteristics C of a, partition a list of as into groups such that each element in a group shares at least one characteristic with at least one other element of the group.hPartition a list of a5s paired with a non-empty list of characteristics C into groups such that each element in a group shares at least one characteristic with at least one other element of the group.fghfgh Safe"#$+-03457;<=>?ACNQV]^i Loop while we have an exception.jMonadic version of ,$ with a different argument ordering.k, is a bifunctor.l'Either _ b' is a functor.m'Either a' is a functor.n, is bitraversable.oReturns , iff the argument is , x for some x. Note: from base >= 4.7.0.0 already present in  Data.Either.pReturns , iff the argument is , x for some x. Note: from base >= 4.7.0.0 already present in  Data.Either.q Analogue of !".r Analogue of !".s Analogue of #.t Analogue of #.uSafe projection from ,. 8maybeLeft (Left a) = Just a maybeLeft Right{} = NothingvSafe projection from ,. <maybeRight (Right b) = Just b maybeRight Left{} = NothingwReturns , input_with_tags_stripped if all elements are to the ,, and otherwise ,.xReturns , input_with_tags_stripped2 if all elements are to the right, and otherwise ,. d allRight xs == if all isRight xs then Just (map ((Right x) -> x) xs) else Nothing yConvert , to , ().ijklmnopqrstuvwxyijklmnopqrstuvwxySafe"#$+-03457;<=>?ACNQV]^hzz,,,,Safe"#$+-03457;<=>?ACNQV]^}aError class for backward compatibility (from Control.Monad.Trans.Error in transformers 0.3.0.0).AWe cannot define data constructors synonymous, so we define the  mkExceptT6 function to be used instead of the data constructor ExceptT.#A string can be thrown as an error.  }~ }~ }~Safe"#$+-03457;<=>?ACNQV]^Repeat a state transition f :: a -> (b, a) with output b while condition condY on the output is true. Return all intermediate results and the final result where cond is False.(Postconditions (when it terminates): (fst (last (iterWhile cond f a)) == False. $all fst (init (interWhile cond f a)).Repeat something while a condition on some state is true. Return the last state (including the changes of the last transition, even if the condition became false then).Monadic version of .%A version of the trampoline function.The usual function iterates f :: a -> Maybe a as long as Just{}, is returned, and returns the last value of a upon Nothing.IusualTrampoline f = trampolineWhile $ a -> maybe (False,a) (True,) (f a).trampolineWhile is very similar to  repeatWhileA, only that it discards the state on which the condition went False;, and returns the last state on which the condition was True.Monadic version of .UMore general trampoline, which allows some final computation from iteration state a into result type b.Monadic version of .Iteration to fixed-point.iterateUntil r f a0 iterates endofunction f, starting with a0 , until r( relates its result to its input, i.e., f a r a.9This is the generic pattern behind saturation algorithms.If f is monotone with regard to r , meaning a r b implies f a r f b , and f-chains starting with a09 are finite then iteration is guaranteed to terminate.*A typical instance will work on sets, and r could be set inclusion, and a0 the empty set, and f- the step function of a saturation algorithm.Monadic version of . n f x applies f to x n times and returns the result.)The applications are calculated strictly.applyWhen b f a applies f to a when b.applyUnless b f a applies f to a unless b.Monadic version of  applyWhenMonadic version of  applyUnlessNone"#$+-03457;<=>?ACNQV]^[Semiring with idempotent , == dioidE.g. +neutral element of compose , e.g. zeroSafe"#$+-03457;<=>?ACNQV]^C ?A decoration is a functor that is traversable into any functor.The ,S superclass is given because of the limitations of the Haskell class system.  traverseF actually implies functoriality.Minimal complete definition:  traverseF or  distributeF. traverseF is the defining property.%Decorations commute into any functor.?Composition: pure function after functorial (monadic) function.The true pure for loop. $% is a misnomer, it should be forA.Infix version of .#Any decoration is traversable with traverse = traverseF. Just like any ,6 is a functor, so is any decoration, given by just  traverseF , a functor.Any decoration is a lens. set is a special case of dmap.0A typical decoration is pairing with some stuff.3Decorations compose. (Thus, they form a category.)%The identity functor is a decoration.  49 4&Safe"#$+-03457;<=>?ACNQV]^(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,-Safe"#$+-03457;<=>?ACNQV]^I7Unstructured pragma (Andreas, 2017-08-23, issue #2712).VV Safe"#$+-03457;<=>?ACNQV]^űCatch -s.+Upon exception, the written output is lost. Alias of - for the IO monad.Safe"#$+-03457;<=>?ACNQV]^AReturns a close function for the file together with the contents.Safe"#$+-03457;<=>?ACNQV]^-aConverts many character sequences which may be interpreted as line or paragraph separators into '\n'.KReads a UTF8-encoded text file and converts all Unicode line endings into '\n'.Writes UTF8-encoded text to the handle, which should be opened for writing and in text mode. The native convention for line endings is used.PThe handle's text encoding is not necessarily preserved, it is changed to UTF8.QWrites a UTF8-encoded text file. The native convention for line endings is used.QWrites a UTF8-encoded text file. The native convention for line endings is used.Safe"#$+-03457;<=>?ACNQV]^ӿRead -+, modify it strictly, and return old value. ----- - - - - -Safe"#$+-013457;<=>?ACNQV]^ܮz"Impossible" errors, annotated with a file name and a line number corresponding to the source code location of the error.7We reached a program point which should be unreachable.  Impossible with a different error message. Used when we reach a program point which can in principle be reached, but not for a certain run.!nAbort by throwing an "impossible" error. You should not use this function directly. Instead use the macro in  undefined.h.")Catch an "impossible" error, if possible. !" $#!" Safe"#$+-013457;<=>?ACNQV]^y'toImpossible e extracts the  Impossible value raised via  IMPOSSIBLE to create the element e of type Empty. It proceeds by evaluating e^ to weak head normal form and catching the exception. We are forced to wrap things in a Maybe because of catchImpossible's type.%&'%*)(&'Safe"#$+-03457;<=>?ACNQV]^,YA set with duplicates. Faithfully stores elements which are equal with regard to (==)..%The list contains all occurrences of aN (not just the duplicates!). Hence, the invariant: the list is never empty./Is the bag empty?07Number of elements in the bag. Duplicates count. O(n).1 (bag ! a) finds all elements equal to a(. O(log n). Total function, returns [] if none are.2 O(log n).3 O(log n).4CReturn the multiplicity of the given element. O(log n + count _ _).5O(1)6O(1)9 "insert a b = union b (singleton a): !fromList = unions . map singleton;:Returns the elements of the bag, grouped by equality (==).<!Returns the bag, with duplicates.=#Returns the bag without duplicates.>!Returns the bag, with duplicates.,-./0123456789:;<=>?@A,-./0123456789:;<=>?@AEDCB,-.Safe"#$+-03457;<=>?ACNQV]^HHNone"#$+-03457;<=>?ACKNQV]^|Agsy's meta variables.aE the type of the metavariable (what it can be instantiated with). blk= the search control information (e.g. the scope of the meta).~~Maybe an instantiation (refinement). It is usually shallow, i.e., just one construct(or) with arguments again being metas.RDoes this meta block a principal constraint (i.e., a type-checking constraint).:List of observers, i.e., constraints blocked by this meta.4Used for experiments with independence of subproofs. Experimental.Result of type-checking.Success.Definite failure. Experimental.$Parallel conjunction of constraints.Experimental, related to . First arg is sidecondition.lForking proof on something that is not part of the term language. E.g. whether a term will reduce or not. Obsolete.qIKJLMNPOQTSRUXWVYZ[\]^_`acbdefghijklmonpqutsrvw{zyx|}~y|}~vwxyz{pqrstumnokljghidef`abc^_]Z[\YUVWXQRSTNOPMLIJKIJKNOPQRSTUVWXZ[\^_`abcdefghiklmnopqrstuvwxyz{|}~Safe"#$+-03457;<=>?ACNQV]^ u GVan Laarhoven style homogeneous lenses. Mnemoic: "Lens inner outer".Get inner part i of structure o as designated by  Lens' i o.Set inner part i of structure o as designated by  Lens' i o.Modify inner part i of structure o using a function i -> i.Read a part of the state.Write a part of the state.Modify a part of the state.'Modify a part of the state monadically.?Modify a part of the state monadically, and return some result. Ask for part of read-only state./Modify a part of the state in a subcomputation.84444Safe"#$&'+,-03457;<=>?ACFNQSTV]^  An index into a type-level list.4Lists indexed by a type-level list. A value of type All p [x ..x ]% is a sequence of values of types p x , .., p x .&Existential wrapper for indexed types.Unpacking a wrapped value./Constructing an indexed list from a plain list./Turning an indexed list back into a plain list.!Indices are just natural numbers.Mapping over an indexed list.>If you have an index you can get a lens for the given element.)Looking up an element in an indexed list.!All indices into an indexed list.Safe"#$+-03457;<=>?ACNQV]^Tokenising the input (makes  cleaner)*Options for Auto, default value and lenses#$ Safe"#$+-03457;<=>?ACNQV]^FC(View source:) This is how you implement a lens for a record field.            Safe"#$+-03457;<=>?ACNQV]^-{Retain object when tag is ,. unionWith for collections of size <= 1. Unzipping a list of length <= 1.Filtering a singleton list. filterMaybe p a = - (- p [a]) Version of -" with different argument ordering. Version of -B with different argument ordering. Often, we want to case on a ,%, do something interesting in the ,( case, but only a default action in the ,* case. Then, the argument ordering of  caseMaybe is preferable. $caseMaybe m d f = flip (maybe d) m f with flipped branches.Monadic version of -.Monadic version of -.Monadic version of . That is, $ with a different argument ordering. with flipped branches.A more telling name for '( for the , collection type. Or:  without the , case. without the , case. without the , case. without the , case.Lazy version of allJust  . sequence. (allJust = mapM for the Maybe/ monad.) Only executes monadic effect while isJust.,,,--------- Safe"#$+-03457;<=>?ACNQV]^6H  .Lazy monadic computation of a list of results.#The empty lazy list.$Consing a value to a lazy list.%Singleton lazy list.& Case distinction over lazy list.'+Folding a lazy list, effects left-to-right.(The join operation of the ListT m monad.)We can `run' a computation of a   as it is monadic itself.* Monadic cons.+Monadic singleton., Extending a monadic function to  .-!Alternative implementation using '.. Change from one monad to another !"#$%&'()*+,-. !"#$%&'()*+,-.876543210/ !"!None"#$+-03457;<=>?ACNQV]^9:"Simple, non-reentrant memoisation.;RRecursive memoisation, second argument is the value you get on recursive calls.:;<=:;<="None"#$+-03457;<=>?ACKNQV]^;>/Maximum of on-negative (small) natural numbers.>?@>?@BA>?@#Safe"#$+-03457;<=>?ACNQV]^>#J Satisfying null empty == True.RA , is J' when it corresponds to the empty list. HJIKLMNOPHIJJ^]\[ZYXWVUTSRQKLMNOPHIJJ$Safe"#$+-0134567;<=>?ACNQV]^MDa Analogous to )* in  Data.Maybe.b Analogous to )+ in  Data.Maybe.c Analogous to ), in  Data.Maybe.d Analogous to )- in  Data.Maybe.e unionWith for collections of size <= 1.f Unzipping a list of length <= 1.gFiltering a singleton list. filterMaybe p a = a (- p [a])h Version of d" with different argument ordering.i Version of -B with different argument ordering. Often, we want to case on a -%, do something interesting in the -( case, but only a default action in the -* case. Then, the argument ordering of  caseMaybe is preferable. (caseMaybe m err f = flip (maybe err) m fjMonadic version of -.kMonadic version of -.lMonadic version of i. That is, j$ with a different argument ordering.ml with flipped branches.nA more telling name for '. for the - collection type. Or: i without the - case.ol without the - case.--------_`abcdefghijklmno_`vutsrqpabcdefghijklmno%None"#$+-03457;<=>?ACDNQV]^}m!zGRun a parser on a list of tokens. Returns the list of complete matches.{LConsumes and returns the next character. Fails if there is no input left.|PLook-ahead: returns the part of the input that is left, without consuming it.} Always fails.~Symmetric choice.}Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.zTransforms a parser into one that does the same, but in addition returns the exact characters read. IMPORTANT NOTE: ] gives a runtime error if its first argument is built using any occurrences of readS_to_P.TConsumes and returns the next character, if it satisfies the specified predicate.+Parses and returns the specified character.(Parses and returns the specified string.BParses the first zero or more characters satisfying the predicate.AParses the first one or more characters satisfying the predicate.+Combines all parsers in the specified list.Skips all whitespace. count n p parses n occurrences of p/ in sequence. A list of results is returned.between open close p parses open, followed by p and finally close. Only the value of p is returned. option x p will either parse p or return x without consuming any input. optional p optionally parses p and always returns ().4Parses zero or more occurrences of the given parser.3Parses one or more occurrences of the given parser.Like , but discards the result.Like , but discards the result. sepBy p sep$ parses zero or more occurrences of p, separated by sep*. Returns a list of values returned by p. sepBy1 p sep# parses one or more occurrences of p, separated by sep*. Returns a list of values returned by p. endBy p sep$ parses zero or more occurrences of p, separated and ended by sep. endBy p sep# parses one or more occurrences of p, separated and ended by sep. chainr p op x$ parses zero or more occurrences of p, separated by op#. Returns a value produced by a right9 associative application of all functions returned by op!. If there are no occurrences of p, x is returned. chainl p op x$ parses zero or more occurrences of p, separated by op#. Returns a value produced by a left9 associative application of all functions returned by op!. If there are no occurrences of p, x is returned.Like (, but parses one or more occurrences of p.Like (, but parses one or more occurrences of p.manyTill p end$ parses zero or more occurrences of p, until end3 succeeds. Returns a list of values returned by p.- hConverts a parser into a Haskell ReadS-style function. This is the main way in which you can "run" a y" parser: the expanded type is 1 readP_to_S :: ReadP a -> String -> [(a,String)] -!Converts a Haskell ReadS-style function into a parser. Warning: This introduces local backtracking in the resulting parser, and therefore a possible inefficiency.!yz{|}~!y{|~z}y-"-#-$-%-&-'-(~55&Safe"#$+-03457;<=>?ACNQV]^5Inclusion comparison wrapper.Pointwise comparison wrapper.Decidable partial orderings.6The result of comparing two things (of the same type). Less than.Less or equal than.EqualGreater or equal. Greater than.No information (incomparable).8Comparing the information content of two elements of '. More precise information is smaller.Includes equality: x  x == True. Opposites.related a po b iff related b (oppPO po) a.rCombining two pieces of information (picking the least information). Used for the dominance ordering on tuples.orPO1 is associative, commutative, and idempotent. orPO has dominant element POAny, but no neutral element.Chains (transitivity)  x R y S z.seqPO1 is associative, commutative, and idempotent. seqPO has dominant element POAny and neutral element (unit) POEQ.Embed -).%Represent a non-empty disjunction of -)s as .A ! information is a disjunction of -) informations.Any -* is a .+Are two elements related in a specific way? related a o b holds iff comparable a b is contained in o.1Partial ordering forms a monoid under sequencing..Less is ``less general'' (i.e., more precise).&Pointwise partial ordering for tuples.related (x1,x2) o (y1,y2) iff related x1 o x2 and related y1 o y2.$Partial ordering for disjoint sums: Left _ and Right _ are unrelated., and , _ are unrelated.Partial ordering for Maybe a is the same as for  Either () a.4The pointwise ordering for lists of the same length.qThere are other partial orderings for lists, e.g., prefix, sublist, subset, lexicographic, simultaneous order.(Sets are partially ordered by inclusion.Sublist for ordered lists.%'None"#$+-013457;<=>?ACNQV]^oIf f a contains many copies of a they will all be the same pointer in the result. If the function is well-behaved (i.e. preserves the implicit equivalence, this shouldn't matter).-+-,--(Safe"#$+-03457;<=>?ACNQV]^While -.- is for rendering data in Haskell syntax, L is for displaying data to the world, i.e., the user and the environment.BAtomic data has no inner document structure, so just implement  as pretty a = text $ ... a ....Use instead of -/ when printing to world.+Comma separated list, without the brackets.Apply -0 to -1 if boolean is true.align max rows lays out the elements of rowsp in two columns, with the second components aligned. The alignment column of the second components is at most max2 characters to the right of the left-most column.Precondition: max > 0.?Handles strings with newlines properly (preserving indentation) a  ? b = hang a 2 b pshow = text . prettyG-2-3-4-5-6-7-8-9-:-;-<-=->-?-@-A-B-C-D-0-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z-[-\-1-]-^-_-`-a-b-c-d-e-f-g-h-i6)Safe"#$+-03457;<=>?ACNQV]^̦-jmThe extended parser type computes one top-level document, plus one document per encountered memoisation key.,u is used to mark that a given memoisation key has been seen, but that no corresponding document has yet been stored.(Documents paired with precedence levels.@An extended parser type, with some support for printing parsers.-kInvariant: If the boolean is ,, then the result must be , something, and if the boolean is -l, then the result must be , something.Runs the parser.&Tries to print the parser, or returns -mF, depending on the implementation. This function might not terminate.OParses a token satisfying the given predicate. The computed value is returned.[Uses the given function to modify the printed representation (if any) of the given parser.Memoises the given parser./Every memoised parser must be annotated with a uniqueJ key. (Parametrised parsers must use distinct keys for distinct inputs.)AMemoises the given parser, but only if printing, not if parsing./Every memoised parser must be annotated with a uniqueJ key. (Parametrised parsers must use distinct keys for distinct inputs.)The parser type.The parameters of the type Parser k r tok a have the following meanings: kType used for memoisation keys.rTThe type of memoised values. (Yes, all memoised values have to have the same type.)tokThe token type.aThe result type.-nMemoised values.-oContinuations.-pState monad used by the parser.-q Positions.uUses the given document as the printed representation of the given parser. The document's precedence is taken to be  ..Parses a token satisfying the given predicate.Parses a single token.Parses a given token.Precedence of >>=. Precedence of  |. Precedence of  *. Precedence of " and +. Precedence of atoms.-rA smart constructor.-sExtracts the parser.-tExtracts the documents.-uA helper function.-v Pretty-prints a memoisation key.-wA helper function.        -k-x-y-n-z-{-|*None"#$+-03457;<=>?ACKNQV]^K4The flexibe variables contained in a pice of syntax.2The rigid variables contained in a pice of syntax.)Make offsets non-negative by rounding up.Offsets + n must be non-negative Executing a substitution."@Partial substitution from flexible variables to size expression.%*Type of solution wanted for each flexible.&,Assigning a polarity to a flexible variable.()What type of solution are we looking for?,<Constraint: an inequation between size expressions, e.g. X < " or  i + 3 "d j.1.Comparison operator, e.g. for size expression.2<.3"d.5*Size expressions appearing in constraints.6Constant number n.7Variable plus offset i + n.8 Infinity ".9Meta variable X + n.=Size meta variables X to solve for.@Fixed size variables i.CConstant finite sizes n >= 0.GDefault polarity is ).I?Returns an error message if we have a contradictory constraint.J3 acts as ,, 2 as -l.K Interpret 1 as relation on C.UAdd offset to size expression.YComparison operator is ordered 2 < 3.5 !"#$%&'(*)+,-0./132458976:<;=>?@ABCDEFGHIJKYCDONML@ABQP=>?SR56789:;:<:4123ZYXW,-./0+()*&'%EFG"#$^H !cba`_UIJKT\]V[edgfjihmlk !"#$&'()*,-./01235 6789:;:<:=>?@ABCD+Safe"#$+-03457;<=>?ACNQV]^;Star semirings ( 5https://en.wikipedia.org/wiki/Semiring#Star_semirings). Semirings ( &https://en.wikipedia.org/wiki/Semiring). ,None"#$+-03457;<=>?ACKNQV]^ -Safe"#$+-03457;<=>?ACNQV]^^Thing decorated with its size. The thing should fit into main memory, thus, the size is an Int.,The size of a collection (i.e., its length).Cache the size of an object.Return the cached size..Safe"#$+-03457;<=>?ACNQV]^ &Classification of identifier variants.Identifier ends in Int many primes.Identifier ends in number Int (ordinary digits).Identifier ends in number Int (subscript digits).'Is the character one of the subscripts ' '-' '? Converts '0'-'9' to ' '-' '.-Precondition: The digit needs to be in range. Converts ' '-' ' to '0'-'9'.-Precondition: The digit needs to be in range.?Increase the suffix by one. If no suffix yet, put a subscript 1. Parse suffix. Print suffix.Add first available Suffix to a name. Is the given name already taken?+Name of which we want an available variant.2Name extended by suffix that is not taken already.  /Safe"#$+-03457;<=>?ACNQV]^Enum type with 3 elements.Partition a list into 3 groups.)Preserves the relative order or elements.0None"#$+-03457;<=>?ACKNQV]^ Finite map from [k] to v.With the strict , type,  is also strict in v.-}"Helper function used to implement  and .Singleton trie.everyPrefix k v! is a trie where every prefix of k (including k itself) is mapped to v.Left biased union.#union = unionWith ( new old -> new)./Pointwise union with merge function for values..Insert. Overwrites existing value if present. %insert = insertWith ( new old -> new)6Insert with function merging new value with old value..Delete value at key, but leave subtree intact.*Adjust value at key, leave subtree intact.Convert to ascending list.Convert to ascending list.]Convert to list where nodes at the same level are ordered according to the given ordering.WCreate new values based on the entire subtrie. Almost, but not quite comonad extend.8Returns the value associated with the given key, if any.%Is the given key present in the trie?&Collect all values along a given path.(Get the subtrie rooted at the given key.Filter a trie. Empty trie.II1None"#$+-03457;<=>?ACKNQV]^Bifunctoriality for pairs. mapFst f = f -*- id mapSnd g = id -*- gLifted pairing.)Swap. (Only in Data.Tuple from base-4.3)Monadic version of .Monadic .Monadic .232None"#$+-03457;<=>?ACNQV]^D3Not very efficient (goes via a list), but it'll do.Big conjunction over a map.Filter a map based on the keys. Unzip a map.  3None"#$+-03457;<=>?ACNQV]^E/ Result of .First list is prefix of second.First list is suffix of second.The lists are equal.The lists are incomparable.4Case distinction for lists, with list first. Cf. #/.+Case distinction for lists, with list last.Head function (safe).5Head function (safe). Returns a value on empty lists. >headWithDefault 42 [] = 42 headWithDefault 42 [1,2,3] = 1Last element (safe).Last two elements (safe).Opposite of cons (:), safe.Maybe cons. "mcons ma as = maybeToList ma ++ as -~ and - in one go, safe. !Lookup function (partially safe). downFrom n = [n-1,..1,0] 1Update the first element of a list, if it exists. 0Update the last element of a list, if it exists.OUpdate nth element of a list, if it exists. Precondition: the index is >= 0.A generalized version of  partition . (Cf. mapMaybe vs. filter).A generalized version of  takeWhile . (Cf. mapMaybe vs. filter).A generalized version of span.Partition a list into ,s and ,s. - f = snd . partitionMaybe f.Like -S, but additionally return the last partition of the list where the predicate is False everywhere.Like -^, but additionally return the last partition of the list where the function always returns Nothing.=Drops from both lists simultaneously until one list is empty.Sublist relation.OCheck if a list has a given prefix. If so, return the list minus the prefix.3Compare lists with respect to prefix partial order.FSplit a list into sublists. Generalisation of the prelude function words. words xs == wordsBy isSpace xs+Chop up a list in chunks of a given length.FChop a list at the positions when the predicate holds. Contrary to , consecutive separator elements will result in an empty segment in the result. > intercalate [x] (chopWhen (== x) xs) == xs-All ways of removing one element from a list.Check whether a list is sorted.Assumes that the -*% instance implements a partial order.UCheck whether all elements in a list are distinct from each other. Assumes that the -. instance stands for an equivalence relation. An optimised version of ./Precondition: The list's length must fit in an ,.!DChecks if all the elements in the list are equal. Assumes that the -- instance stands for an equivalence relation."ZReturns an (arbitrary) representative for each list element that occurs more than once.# A variant of -3 which applies the predicate to consecutive pairs.$$ f = groupBy ((- ) `on` f) - - (- `on` f).%#splitExactlyAt n xs = Just (ys, zs) iff  xs = ys ++ zs and genericLength ys = n.&A generalised variant of  elemIndex.',Requires both lists to have the same length. Otherwise, Nothing is returned.(Efficient variant of nubBy for finite lists.Specification: )nubOn f xs == 'nubBy' ((==) `'on'` f) xs.)Efficient variant of nubBy for finite lists.Specification: For each list xs there is a list ys which is a permutation of xs such that *uniqOn f xs == 'nubBy' ((==) `'on'` f) ys. Furthermore :List.sortBy (compare `on` f) (uniqOn f xs) == uniqOn f xs.*'Compute the common suffix of two lists.+'Compute the common prefix of two lists.4      !"#$%&'()*+,-4      !"#$%&'()*+,-4None"#$+-03457;<=>?ACNQV]^S 11I adds double quotes around the string, replaces newline characters with nh, and escapes double quotes and backslashes within the string. This is different from the behaviour of -/: > - $ -/ "\x2200" "\8704" > - $ 1 "\x2200" """ V(The code examples above have been tested using version 4.2.0.0 of the base library.)2$Adds hyphens around the given stringputStrLn $ delimiter "Title"<     Title                                                 3FShows a non-negative integer using the characters - instead of 0-9.41Adds a final newline if there is not already one.5-Indents every line the given number of steps.66Show a number using comma to separate powers of 1,000.7Remove leading whitespace.8Remove trailing whitespace.9'Remove leading and trailing whitesapce. ./0123456789 12345./0:6789./05None"#$+-03457;<=>?ACKNQV]^X:<"CPU time in pico (10^-12) seconds.> Timestamps.?The current time.BOMeasure the time of a computation. Of course, does not work with exceptions.C(Print CPU time in milli (10^-3) seconds.<=>?@AB>?AB<=@<=6None"#$+-03457;<=>?ACNQV]^x -Lines with line numbers.-JHeader line, like a field name, e.g. "include :". Cannot be indented. String is trimmed.-"Other line. Must be indented. String is trimmed.-(Library file field format format [sic!].-Name of the field.-Is it optional?-Content parser for this field.-Sets parsed content in " structure.-E.g. field name. trimmed.-E.g. field content. trimmed.-IThe config files we parse have the generic structure of a sequence of field : content entries.-Parser monad: Can throw String error messages.- .agda-lib& file format with parsers and setters.LParse  .agda-lib file.Sets %Y name and turn mentioned include directories into absolute pathes (provided the given - is absolute).-Parse file contents.-Parse - with - descriptors.-Given a list of -5 descriptors (with their custom parsers), parse a - into the " structure.LChecks mandatory fields are present; no duplicate fields, no unknown fields.-NEnsure that there are no duplicate fields and no mandatory fields are missing.-Find - with given -, throw error if unknown.-Example:  parseGeneric "name:Main--BLAndepend:--BLAn standard-library--BLAninclude : . --BLAn src more-src n" == Right [("name",[MainE]),("depend",["standard-library"]),("include",[".","src more-src"])] -Parse line into - and - components.LPrecondition: line comments and trailing whitespace have been stripped away. Example file: V name: Main depend: standard-library include: . src more-src This should give ' [ Header 1 "name" , Content 1 Main , Header 2 "depend" , Content 3 "standard-library" , Header 4 "include" , Content 4 "." , Content 5 "src more-src" ] -Collect - and subsequent -s into -.Tailing -s? That's an error.M+Remove leading whitespace and line comment.N4Break a comma-separated string. Result strings are trimmed.--...and trailing, but not leading, whitespace.KLMNLNMK-------------7None"#$+-03457;<=>?ACNQV]^. PSimple Emacs Lisp expressions.QAtom.SList.UFormats a response command. Replaces '\n'= with spaces to ensure that each command is a single line.V-Writes a response command to standard output.-0displayInBuffer buffername append header content displays content (with header header%) in some suitable way in the buffer  buffername. If append is Trueh, then the content is appended to previous content (if any), otherwise any previous content is deleted.-$The name of the running info buffer.YClear the running info buffer.ZClear the warning buffer[ADisplay running information about what the type-checker is up to. PTSQRUVWXYZ[ PQRSTUVWXYZ[PQRSTNone"#$+-03457;<=>?ACNQV]^^ Binary bind.aMonadic guard.bMonadic if-then-else.c ifNotM mc = ifM (not  $ mc)dLazy monadic conjunction.gLazy monadic disjunction.jLazy monadic disjunction with Either> truth values. Returns the last error message if all fail.khLazy monadic disjunction with accumulation of errors in a monoid. Errors are discarded if we succeed.lGeneralized version of .mapM_ :: Monad m => (a -> m ()) -> [a] -> m ()n Executes effects and collects results in left-to-right order. Works best with left-associative monoids.!Note that there is an alternative !mapM' f t = foldr mappend mempty  $ mapM f tthat collects results in right-to-left order (effects still left-to-right). It might be preferable for right associative monoids.mGeneralized version of .forM_ :: Monad m => [a] -> (a -> m ()) -> m ()nA monadic version of - :: (a -> Maybe b) -> [a] -> [b].oThe for version of n.pA monadic version of - :: (a -> Bool) -> [a] -> [a].qA `monadic' version of @ partition# :: (a -> Bool) -> [a] -> ([a],[a])rFinally for the }F class. Errors in the finally part take precedence over prior errors.sTry a computation, return , if an } occurs.t;Bracket without failure. Typically used to preserve state.u Restore state after computation.tAcquires resource. Run first.Releases resource. Run last. Computes result. Run in-between.!  ^_`abcdefghijklmnopqrstuv!^_`abcdefghijklmnopqrstuv   8None"#$+-013457;<=>?ACKNQV]^ w%Paths which are known to be absolute.Note that the - and -*S instances do not check if different paths point to the same files or directories.y Extract the w to be used as -.z Constructs ws.2Precondition: The path must be absolute and valid.-maps blablabla foo.bar.xxx to foo.bar.|Makes the path absolute.This function may raise an __IMPOSSIBLE__ error if -" does not return an absolute path.}PTries to establish if the two file paths point to the same file (or directory).~Case-sensitive - for Windows.This is case-sensitive only on the file name part, not on the directory part. (Ideally, path components coming from module name components should be checked case-sensitively and the other path components should be checked case insensitively.)wxyz{|}~wxyz|}~{wx-}49None"#$+-03457;<=>?ACNQV]^-Hashing a module name for unique identifiers.:None"#$+-03457;<=>?ACNQV]^'Monad with access to benchmarking data.EWe need to be able to terminate benchmarking in case of an exception.qBenchmark structure is a trie, mapping accounts (phases and subphases) to CPU time spent on their performance.Are we benchmarking at all?!What are we billing to currently?/The accounts and their accumulated timing bill.3Record when we started billing the current account.(Account we can bill computation time to.Semantic editor combinator.Semantic editor combinator.Semantic editor combinator."Add to specified CPU time account.Turn benchmarking on/off.cBill current account with time up to now. Switch to new account. Return old account (if any)..Resets the account and the timing information.fBill a computation to a specific account. Works even if the computation is aborted by an exception.;Bill a CPS function to an account. Can't handle exceptions..Bill a pure computation to a specific account.2Print benchmark as three-column table with totals.$Initial benchmark structure (empty).Maybe new account.Maybe old account.!;None"#$+-0134567;<=>?ACKNQV]^ 8=Killing the range of an object sets all range information to .;If it is also possible to set the range, this is the class.Instances should satisfy  ( r x) == r.5Things that have a range are instances of this class.1Wrapper to indicate that range should be printed.A range is a file name, plus a sequence of intervals, assumed to point to the given file. The intervals should be consecutive and separated.1Note the invariant which ranges have to satisfy: .An interval. The iEnd* position is not included in the interval.4Note the invariant which intervals have to satisfy: . Represents a point in the input.If two positions have the same  and  components, then the final two components should be the same as well, but since this can be hard to enforce the program should not rely too much on the last two components; they are mainly there to improve error messages for the user.4Note the invariant which positions have to satisfy: .File.Position, counting from 1.Line number, counting from 1.Column number, counting from 1. Sets the  components of the interval. Gets the P component of the interval. Because of the invariant, they are both the same.6Converts a file name and two positions to an interval.The length of an interval.TThe intervals that make up the range. The intervals are consecutive and separated ().8Turns a file name plus a list of intervals into a range.Precondition: .}Are the intervals consecutive and separated, do they all point to the same file, and do they satisfy the interval invariant?Range invariant."The file the range is pointing to.%Conflate a range to its right margin.*Remove ranges in keys and values of a map.;The first position in a file: position 1, line 1, column 1.;The first position in a file: position 1, line 1, column 1.$Ranges between two unknown positions?Advance the position by one character. A newline character ('\n'~) moves the position to the first character in the next line. Any other character moves the position to the next column.!Advance the position by a string.  movePosByString = foldl' movePos%Backup the position by one character.(Precondition: The character must not be '\n'.Extracts the interval corresponding to the given string, assuming that the string starts at the beginning of the given interval.?Precondition: The string must not be too long for the interval.Removes the interval corresponding to the given string from the given interval, assuming that the string starts at the beginning of the interval.?Precondition: The string must not be too long for the interval.2Converts a file name and two positions to a range."Converts two positions to a range.;Precondition: The positions have to point to the same file.0Converts a file name and an interval to a range.-Converts a range to an interval, if possible.gConverts a range to an interval, if possible. Note that the information about the source file is lost.?Returns the shortest continuous range containing the given one.0Removes gaps between intervals on the same line.*The initial position in the range, if any.*The initial position in the range, if any.;The position after the final position in the range, if any.;The position after the final position in the range, if any.4Finds the least interval which covers the arguments.8Precondition: The intervals must point to the same file.fuseRanges r r' unions the ranges r and r'.!Meaning it finds the least range r0 that covers r and r'.CPrecondition: The ranges must point to the same file (or be empty).DPrecondition: The ranges must point to the same file (or be empty). beginningOf rN is an empty range (a single, empty interval) positioned at the beginning of r. If r" does not have a beginning, then  is returned.beginningOfFile rC is an empty range (a single, empty interval) at the beginning of r\'s starting position's file. If there is no such position, then an empty range is returned.x `withRangeOf` y sets the range of x to the range of y.*Interleaves two streams of ranged elements*It will report the conflicts as a list of conflicting pairs. In case of conflict, the element with the earliest start position is placed first. In case of a tie, the element with the earliest ending position is placed first. If both tie, the element from the first list is placed first.ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).ZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).YPrecondition: The ranges of the list elements must point to the same file (or be empty).$Overlaps with  KillRange [a].VV<None"#$+-013457;<=>?ACNQV]^>E%Things that support delayed dropping.I)Delayed dropping which allows undropping.K&Non-negative number of things to drop.LWhere to drop from.M3Invert a Permutation on a partial finite int map. inversePermute perm f = f' such that permute perm f' = f!Example, with map represented as  [Maybe a]: r f = [Nothing, Just a, Just b ] perm = Perm 4 [3,0,2] f' = [ Just a , Nothing , Just b , Nothing ]  Zipping perm with f gives  [(0,a),(2,b)], after compression with  catMaybes. This is an IntMap9 which can easily written out into a substitution again.OPartial permutations. Examples:)permute [1,2,0] [x0,x1,x2] = [x1,x2,x0] (proper permutation).&permute [1,0] [x0,x1,x2] = [x1,x0] (partial permuation).,permute [1,0,1,2] [x0,x1,x2] = [x1,x0,x1,x2]- (not a permutation because not invertible).Agda typing would be: 9Perm : {m : Nat}(n : Nat) -> Vec (Fin n) m -> Permutation m is the  of the permutation.S'permute [1,2,0] [x0,x1,x2] = [x1,x2,x0] More precisely, permute indices list = sublist , generates sublist from list1 by picking the elements of list as indicated by indices. *permute [1,3,0] [x0,x1,x2,x3] = [x1,x3,x0]Agda typing: ,permute (Perm {m} n is) : Vec A m -> Vec A nUIdentity permutation.V"Restrict a permutation to work on n elements, discarding picks >=n.W9Pick the elements that are not picked by the permutation.XliftP k takes a  Perm {m} n to a Perm {m+k} (n+k). Analogous to 01?, but Permutations operate on de Bruijn LEVELS, not indices.Y 2permute (compose p1 p2) == permute p1 . permute p2Z invertP err p is the inverse of p) where defined, otherwise defaults to err. composeP p (invertP err p) == p[ITurn a possible non-surjective permutation into a surjective permutation.\ ?permute (reverseP p) xs == reverse $ permute p $ reverse xs Example: Q permute (reverseP (Perm 4 [1,3,0])) [x0,x1,x2,x3] == permute (Perm 4 $ map (3-) [0,3,1]) [x0,x1,x2,x3] == permute (Perm 4 [3,0,2]) [x0,x1,x2,x3] == [x3,x0,x2] == reverse [x2,x0,x3] == reverse $ permute (Perm 4 [1,3,0]) [x3,x2,x1,x0] == reverse $ permute (Perm 4 [1,3,0]) $ reverse [x0,x1,x2,x3] With reversePc, you can convert a permutation on de Bruijn indices to one on de Bruijn levels, and vice versa.]8permPicks (flipP p) = permute p (downFrom (permRange p)) or Gpermute (flipP (Perm n xs)) [0..n-1] = permute (Perm n xs) (downFrom n)dCan be use to turn a permutation from (de Bruijn) levels to levels to one from levels to indices.See 23.^ expandP i n  in the domain of  replace the ith element by n elements._~Stable topologic sort. The first argument decides whether its first argument is an immediate parent to its second argument.FPerform the dropping.G Drop more.HPick up dropped stuff.EHGFIJKLMNOPRQSTUVWXYZ[\]^_&OPQRcba`STMNgfedUVWXYZ[\]^_IJKLhEFGHjiEFGHIJKLMNOPQR=None"#$+-013457;<=>?ACNQV]^q,t The result of parsing something.wWarnings for parsingx,Parse errors that concern a range in a file.y)The range of the bigger overlapping tokenzWhat you get if parsing fails.{4Errors that arise at a specific position in the file|,Parse errors that concern a range in a file.}'Parse errors that concern a whole file.%The file in which the error occurred.Where the error occurred.The remaining input.The previous token.*Hopefully an explanation of what happened.)The range of the bigger overlapping token"The file which the error concerns.,There aren't any parser flags at the moment./Should comment tokens be returned by the lexer?We need to keep track of the context to do layout. The context specifies the indentation (if any) of a layout block. See Agda.Syntax.Parser.Layout for more informaton. no layoutlayout at specified column<To do context sensitive lexing alex provides what is called  start codeso in the Alex documentation. It is really an integer representing the state of the lexer, so we call it LexState instead.RThe parser state. Contains everything the parser and the lexer could ever need."position at current input locationposition of last tokenthe current inputthe character before the inputthe previous tokenthe stack of layout contextsCthe state of the lexer (states can be nested so we need a stack)currently there are no flagsThe parse monad. Equivalent to StateT  (Either z)! except for the definition of fail, which builds a suitable z object.Constructs the initial state of the parser. The string argument is the input string, the file path is only there because it's part of a position.The default flags..The most general way of parsing a string. The Agda.Syntax.Parser; will define more specialised functions that supply the  and the ..The even more general way of parsing a string.,The most general way of parsing a file. The Agda.Syntax.Parser; will define more specialised functions that supply the  and the .GNote that Agda source files always use the UTF-8 character encoding.eParses a string as if it were the contents of the given file Useful for integrating preprocessors.IThe parse interval is between the last position and the current position. parseError = failFake a parse error at the specified position. Used, for instance, when lexing nested comments, which when failing will always fail at the end of the file. A more informative position is the beginning of the failing comment.Use  or  as appropriate.For lexical errors we want to report the current position as the site of the error, whereas for parse errors the previous position is the one we're interested in (since this will be the position of the token we just lexed). This function does  the current position."Return the current layout context.Should only be used at the beginning of a file. When we start parsing we should be in layout mode. Instead of forcing zero indentation we use the indentation of the first token.=tuvwxyz{|}~>tuvz{|}~wxytuvwxyz{|}~ -->None"#$%+-03457;<=>?ACNQV]^/Type of a literate preprocessor: Invariants:  f : Processor f pos s /= []f pos s >>= layerContent == sA list of contiguous layers8A sequence of characters in a file playing the same roleRole of a character in the file-7Annotates a tokenized string with position information.[List of valid extensions for literate Agda files, and their corresponding preprocessors.yIf you add new extensions, remember to update test/Utils.hs so that test cases ending in the new extensions are found.Returns ,# if a role corresponds to Agda codeReturns , a layer contains Agda codeBlanks the non-code parts of a given file, preserving positions of characters corresponding to code. This way, there is a direct correspondence between source positions and positions in the processed result.-6Replaces non-space characters in a string with spaces.-*Check if a character is a blank character.,Possible extensions for a literate Agda fileIShort list of extensions for literate Agda files For display purposes.-Fbreak a list just *after* an element satisfying the predicate is foundbreak1 even [1,3,5,2,4,7,8]([1,3,5,2],[4,7,8])-XReturns a tuple consisting of the first line of the input, and the rest of the input.-1Canonical decomposition of an empty literate file-dCreate a regular expression that: - Must match the whole string - Works across line boundariesPreprocessor for literate TeXPreprocessor for Markdown!Preprocessor for reStructuredText@None"#$+-0134567;<=>?ACKNQV]^X#Positivity check? (Default = True).0Termination check? (Default = TerminationCheck).Run the termination checker.#Skip termination checking (unsafe).Treat as non-terminating./Treat as terminating (unsafe). Same effect as .2Skip termination checking but use measure instead.Rename from this name.#To this one. Must be same kind as .CThe range of the "to" keyword. Retained for highlighting purposes.2An imported name can be a module or a defined nameYThe things you are allowed to say when you shuffle names between name spaces (i.e. in import,  namespace, or open declarations). Only for open3. Exports the opened names from the current module.@Placeholders are used to represent the underscores in a section.YThe second argument is used only (but not always) for name parts other than underscores.4The position of a name part or underscore in a name.;The following underscore is at the beginning of the name: _foo.8The following underscore is in the middle of the name: foo_bar.4The following underscore is at the end of the name: foo_.4A meta variable identifier is just a natural number.WThe unique identifier of a name. Second argument is the top-level module identifier.Is this a macro definition? 0Is this definition eligible for instance search?Abstract or concreteAccess modifier. Store the Lp of the private block that lead to this qualifier. This is needed for more faithful printing of declarations.bVisible from outside, but not exported when opening the module Used for qualified constructors.@Functions can be defined in both infix and prefix style. See V4."Where does a projection come from?User wrote a prefix projection. User wrote a postfix projection.'Projection was generated by the system.Where does the ConP or Con come from? 8Inserted by system or expanded from an implicit pattern.!#User wrote a constructor (pattern)."User wrote a record (pattern).#(Generated by interactive case splitting.$String with range info.%A RawName is some sort of string.&Thing with range info.*Only f arguments can have names.+Standard naming.,&Something potentially carrying a name.0 Similar to 7, but we need to distinguish an irrelevance annotation in a function domain (the domain itself is not irrelevant!) from an irrelevant argument.Dom is used in Pi of internal syntax, in Context and  Telescope. 7 is used for actual arguments (Var, Con, Def etc.) and in Abstract syntax and other situations.?4A function argument can be hidden and/or irrelevant.DA lens to access the L: attribute in data structures. Minimal implementation:  getOrigin and one of  setOrigin or  mapOrigin.HDecorating something with L information.LOrigin of arguments.M/From the source file / user input. (Preserve!)NE.g. inserted hidden arguments.O%Produced by the reflection machinery.P&Produced by an interactive case split.QA lens to access the U: attribute in data structures. Minimal implementation:  getRelevance and one of  setRelevance or  mapRelevance.U:A function argument can be relevant or irrelevant. See Agda.TypeChecking.Irrelevance.V4The argument is (possibly) relevant at compile-time.WThe argument may never flow into evaluation position. Therefore, it is irrelevant at run-time. It is treated relevantly during equality checking.X3The argument is irrelevant at compile- and runtime.YThe argument can be skipped during equality checking because its value is already determined by the type. If a constructor argument is big, it has to be regarded absent, otherwise we get into paradoxes.ZAn constructor argument is big if the sort of its type is bigger than the sort of the data type. Only parameters (and maybe forced arguments) are allowed to be big. = List : Set -> Set nil : (A : Set) -> List A  A is big in constructor nil as the sort Set1 of its type Set is bigger than the sort Set of the data type List.]A lens to access the e: attribute in data structures. Minimal implementation:  getHiding and one of  setHiding or  mapHiding.aDecorating something with e information.o4Used to specify whether something should be delayed.rMonoidal composition of e information in some data.sh arguments are visible.tg and f arguments are  notVisible.uf arguments are hidden.|Ignores i.Information ordering. [Relevant `moreRelevant` Forced `moreRelevant` NonStrict `moreRelevant` IrrelevantunusableRelevance rel == True! iff we cannot use a variable of rel.U composition. X is dominant, V is neutral.inverseComposeRelevance r x returns the most irrelevant y such that forall x, y we have )x `moreRelevant` (r `composeRelevance` y) iff 0(r `inverseComposeRelevance` x) `moreRelevant` y (Galois connection).For comparing  Relevance ignoring Forced.KIrrelevant function arguments may appear non-strictly in the codomain type.BApplied when working on types (unless --experimental-irrelevance).xs `withArgsFrom` args translates xs into a list of 7s, using the elements in args to fill in the non-: fields.5Precondition: The two lists should have equal length.Get the content of a *.The functor instance for *8 would be ambiguous, so we give it another name here. ,setNamedArg a b = updateNamedArg (const b) aThing with no range info.)Prefer user-written over system-inserted.An abbreviation: noPlaceholder =  -.Default is directive is private% (use everything, but do not export). Just for the e9 instance. Should never combine different overlapping.e, is an idempotent partial monoid, with unit h. g and h are incompatible.Ranges are not forced.(Show non-record version of this newtype. Ranges are not forced.Ranges are not forced.     #"! $%&'()*+,-/.0132465789:;>=<?@CBADGFEHIKJLNMOPQTSRUYXWVZ\[]`_^abdcehgfikjlnmoqprstuvwxyz{|}~9opqlmnijkefghabcd]^_`rstuvwxyz{|Z[\UVWXY}QRST~LMNOPHIJKDEFG?@ABC;<=>789:4560123,-./+*&'()%$ !"#          &      !"#&'(),-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqANone"#$+-034567;<=>?ACNQV]^p The parser monad.Memoisation keys.Runs the parser.OParses a token satisfying the given predicate. The computed value is returned..Parses a token satisfying the given predicate.uUses the given document as the printed representation of the given parser. The document's precedence is taken to be atomP.Memoises the given parser./Every memoised parser must be annotated with a uniqueI key. (Parametrised parsers must use distinct keys for distinct inputs.)@Memoises the given parser, but only if printing, not if parsing./Every memoised parser must be annotated with a uniqueI key. (Parametrised parsers must use distinct keys for distinct inputs.)&Tries to print the parser, or returns -mF, depending on the implementation. This function might not terminate.BNone"#$+-0134567;<=>?ACKNQV]^$?+Check whether a name is the empty name "_".Number of holes in a $ (i.e., arity of a mixfix-operator).ATop-level module names. Used in connection with the file system.&Invariant: The list must not be empty.QNamee is a list of namespaces and the name of the constant. For the moment assumes namespaces are just Names and not explicitly applied modules. Also assumes namespaces are generative by just using derived equality. We will have to define an equality instance to non-generative namespaces (as well as having some sort of lookup table for namespace names).A.rest.x.<Mixfix identifiers are composed of words and holes, e.g. _+_ or  if_then_else_ or [_/_]._ part.Identifier part.*A name is a non-empty list of alternating s and js. A normal name is represented by a singleton list, and operators are represented by a list with /s where the arguments should go. For instance: [Hole,Id "+",Hole] is infix addition.Equality and ordering on NameQs are defined to ignore range so same names in different locations are equal.A (mixfix) identifier._.+Parse a string to parts of a concrete name.Note: 5stringNameParts "_" == [Id "_"] == nameParts NoName{}Is the name an operator? qualify A.B x == A.B.x unqualify A.B.x == xThe range is preserved. qnameParts A.B.x = [A, B, x]Is the name qualified?Turns a qualified name into a F. The qualified name is assumed to represent a top-level module name.FTurns a top-level module name into a file name with the given suffix.pFinds the current project's "root" directory, given a project file and the corresponding top-level module name.8Example: If the module "A.B.C" is located in the file "fooABC.agda", then the root is "foo".2Precondition: The module name must be well-formed.  noName_ =  Ranges are not forced.Define equality on NameC to ignore range so same names in different locations are equal.'Is there a reason not to do this? -JeffNo. But there are tons of reasons to do it. For instance, when using names as keys in maps you really don't want to have to get the range right to be able to do a lookup. -Ulf$GDNone"#$+-013457;<=>?ACNQV]^'}2Arbitrary JS code.% !02/-,+*%"#$1.&()'.!"#$%&'()*+,-./012 6543;:987 !"#$%&'()*+,-./012ENone"#$+-03457;<=>?ACNQV]^*UHIJKLMNOPQRSTUVWXYHIJKLMNOPQRSTUVWXYFNone"#$+-03457;<=>?ACNQV]^.fCheck if a string is a valid JS identifier. The check ignores keywords as we prepend z_ to our identifiers. The check is conservative and may not admit all valid JS identifiers. Z[\]^_`abcdef^_`\]kZ[nmjihlabcdgefZ[\]GNone"#$+-03457;<=>?ACNQV]^P'{"Entry of an explicit substitution.&An explicit substitution is a list of CAction<s. This is isomorphic to the usual presentation where Skip and Weak& would be constructors of exp. substs.|Instantation of variable.}'For going under a binder, often called Lift.~2Shifting substitution (going to a larger context).An expression a in an explicit substitution  [CAction a].BLazy concatenation of argument lists under explicit substitutions.Head-normal form of . First entry is exposed.,Q: Why are there no projection eliminations?No more eliminations.Application and tail. proj pre args, projfcn idx, tailConstructor parameter (missing in Agda). Agsy has monomorphic constructors. Inserted to cover glitch of polymorphic constructor applications coming from Agda>"Maybe expression": Expression or reference to meta variable.Agsy's internal syntax.Lambda with hiding information.True8 if possibly dependent (var not known to not occur). False if non-dependent.&Absurd lambda with hiding information.Unique identifier of the head.'This application has been type-checked.Head. Arguments."Head of application (elimination). Dot pattern.Constant definitions.Constant signatures.For debug printing.Reference to the Agda constant.Type of constant.Constant definition.7Free vars of the module where the constant is defined..Abstraction with maybe a name.NDifferent from Agda, where there is also info whether function is constant.The concrete instance of the blk parameter in |8. I.e., the information passed to the search control.[Nat - deffreevars (to make cost of using module parameters correspond to that of hints).1Size of typing context in which meta was created.!Head normal form of type of meta.True if iota steps performed when normalising target type (used to put cost when traversing a definition by construction instantiation).;Unique identifiers for variable occurrences in unification.Substituting for a variable.FreeVars class and instances Renaming Typeclass and instancesopqrstuvwxyz{|}~{|}~zywxuv    st    qr op      opqrstuvwx{|}~ HNone"#$+-03457;<=>?ACNQV]^e !Moves A move is composed of a Cost: together with an action computing the refined problem. $ univar sub v figures out what the name of v" "outside" of the substitution sub ought to be, if anything. %6List of the variables instantiated by the substitution &New constructors Taking a step towards a solution consists in picking a constructor and filling in the missing parts with placeholders to be discharged later on. *5New spine of arguments potentially using placeholders ,New App?lication node using a new spine of arguments respecting the Hiding annotation .Equality reasoning steps The begin token is accompanied by two steps because it does not make sense to have a derivation any shorter than that. 3kPick the first unused UId amongst the ones you have seen (GA: ??) Defaults to the head of the seen ones.E    !       " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [N c         ! " # $ %  & ' ( ) * + , - . / 0 1 2 3 d 4 b a 6 7 8 9 : ; < = > ? @ A B C D E F G H 5 I J K L M N O P Q R W S T U V X Y Z [ ` _ ^ ] \         !INone"#$+-03457;<=>?ACNQV]^i s)Typechecker drives the solution of metas.- e h g f i k j l n m o q p r s t u v w x y z { | } ~  - s t u v w x y z { r | } ~  o p q l m n i j k e f g h  e f g h i j k l m n o p qJNone"#$+-03457;<=>?ACNQV]^o5 dSpeculation: Type class computing the size (?) of a pattern and collecting the vars it introduces ITake a list of patterns and returns (is, size, vars) where (speculation):2 F        KNone"#$+-013457;<=>?ACNQV]^ Classification of notations. Ex:  _bla_blub_. Ex:  _bla_blub. Ex:  bla_blub_. Ex: bla_blub. Part of a Notation SArgument is the position of the hole (with binding) where the binding should occur. +Argument is where the expression should go. "An underscore in binding position. Notation as provided by the syntax declaration. 8Data type constructed in the Happy parser; converted to  $ before it leaves the Happy code.  x -> y2; 1st argument is the bound name (unused for now). Simple named hole with hiding. Is the hole a binder? 2Get a flat list of identifier parts of a notation. ATarget argument position of a part (Nothing if it is not a hole). eIs the part a hole? WildHoles don't count since they don't correspond to anything the user writes. Is the part a normal hole? Is the part a binder? <Classify a notation by presence of leading and/or trailing normal holes. 2From notation with names to notation with indices. Example: n ids = ["for", "x", """, "xs", "return", "e"] holes = [ LambdaHole "x" "e", ExprHole "xs" ]  creates the notation  [ IdPart "for" , BindHole 0 , IdPart """ , NormalHole 1 , IdPart "return" , NormalHole 0 ]       LNone"#$+-013457;<=>?ACKNQV]^` Make a   from some kind of string. The  sets the definition site of the name, not the use site. *Check whether we are a projection pattern. <Ambiguous qualified names. Used for overloaded constructors.Invariant: All the names in the list must have the same concrete, unqualified name. (This implies that they all have the same ). 'A module name is just a qualified name.The H instance for module names sets all individual ranges to the given one. (Something preceeded by a qualified name. Qualified names are non-empty lists of names. Equality on qualified names are just equality on the last name, i.e. the module part is just for show.The r instance for qualified names sets all individual ranges (including those of the module prefix) to the given one. A name is a unique identifier and a suggestion for a concrete name. The concrete name contains the source location (if any) of the name. The source location of the binding site is also recorded. FA module is anonymous if the qualification path ends in an underscore. Sets the ranges of the individual names in the module name to match those of the corresponding concrete names. If the concrete names are fewer than the number of module name name parts, then the initial name parts get the range .C.D.E `withRangesOf` [A, B] returns C.D.E! but with ranges set as follows:C: .D: the range of A.E: the range of B.jPrecondition: The number of module name name parts has to be at least as large as the length of the list. Like  b, but uses the name parts (qualifier + name) of the qualified name as the list of concrete names. Turn a qualified name into a concrete name. This should only be used as a fallback when looking up the right concrete name in the scope fails.  Computes the TopLevelModuleName` corresponding to the given module name, which is assumed to represent a top-level module name.2Precondition: The module name must be well-formed. $ Convert a   to a   (add no module name). %Is the name an operator? (9Get the next version of the concrete name. For instance, nextName "x" = "x ". The name must not be a NoName. )The range is not forced. .Only use this show3 function in debugging! To convert an abstract   into a string use  prettyShow. 08An abstract name is empty if its concrete name is empty. :Only use this show3 function in debugging! To convert an abstract   into a string use  prettyShow. AOnly use this show3 function in debugging! To convert an abstract   into a string use  prettyShow. HThe range of an AmbiguousQNameQ is the range of any of its disambiguations (they are the same concrete name). JPWe can have an instance for ambiguous names as all share a common concrete name. ZUse  to print names to the user.1                           ! " # $ % & ' (V              L K       M        ! " # $ % & ' ( 3 2 1 E D C 0 / B J . : A - 9 @ I F , 8 ? H + > 7 * 6 = G < 5 ) ; 4                  MNone"#$+-013457;<=>?ACNQV]^? eRanges are not forced. [ a ` _ ^ ] \ b c d [ \ ] ^ _ ` a l k b c j i d h g f e [ \ ] ^ _ ` aNNone"#$+-013457;<=>?ACNQV]^ o5Checks if the given expression is unreachable or not. q Code which is unreachable. E.g. absurd branches or missing case defaults. Runtime behaviour of unreachable code is undefined, but preferably the program will exit with an error message. The compiler is free to assume that this code is unreachable and to remove it. sMatches on the given constructor. If the match succeeds, the pattern variables are prepended to the current environment (pushes all existing variables aArity steps further away) tBinds no variables CCompiler-related primitives. This are NOT the same thing as primitives in Agda's surface or internal syntax! Some of the primitives have a suffix indicating which type of arguments they take, using the following naming convention: Char | Type C | Character F | Float I | Integer Q | QName S | String introduces a new local binding. The bound term MUST only be evaluated if it is used inside the body. Sharing may happen, but is optional. It is also perfectly valid to just inline the bound term in the body. Case scrutinee (always variable), case type, default value, alternatives First, all TACon alternatives are tried; then all TAGuard alternatives in top to bottom order. TACon alternatives must not overlap. ,A runtime error, something bad has happened. Introduces a new bindingx                           ! " # $ % & ' ( n o p q r s t u v w x y z { | } ~  L { | } ~  r s t u v w x y x z x p q n o  n o p q r s t u v w x y x z x { | } ~    ONone"#$+-03457;<=>?ACNQV]^ү-----PNone"#$+-03457;<=>?ACNQV]^Ӵ) )        QNone"#$+-03457;<=>?ACNQV]^ 'A misplaced end-comment "-}".t                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s tt         ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t                   ! " # $ % & '                            ! " # $ % & ' (K ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s?None"#$+-013457;<=>?ACNQV]^@$gThe notation is handled as the fixity in the renamer. Hence, they are grouped together in this type. |When printing we keep track of a stack of precedences in order to be able to decide whether it's safe to leave out parens around lambdas. An empty stack is equivalent to  ~. Invariant: `notElem TopCtx`. }(Precedence is associated with a context. Fixity of operators. &Range of the whole fixity declaration. Associativity.  Precedence levels for operators. No fixity declared. Fixity level declared as the Integer. -Sections, as well as non-sectioned operators. >For non-sectioned operators this should match the notation's  . Effective precedence level. , for closed notations. -l for non-sectioned operators. /All the notation information related to a name. -The names the syntax and/or fixity belong to.AInvariant: The set is non-empty. Every name in the list matches  . 3Associativity and precedence (fixity) of the names. !Syntax associated with the names. PTrue if the notation comes from an operator (rather than a syntax declaration). Decorating something with Fixity'. `Range of the name in the fixity declaration (used for correct highlighting, see issue #2140). LIf an operator has no specific notation, then it is computed from its name. Replace   by  .  Return the  s of a notation, the first part qualified, the other parts unqualified. This allows for qualified use of operators, e.g., M.for x " xs return e, or x !.+ y.  Create a  # (without binders) from a concrete  . Does the obvious thing:  s become  s,  s become IdParts. If  has no s, it returns  . Merges  Is that have the same precedence level and notation, with two exceptions:MOperators and notations coming from syntax declarations are kept separate.If all instances of a given   have the same precedence level or are "unrelated", then they are merged. They get the given precedence level, if any, and otherwise they become unrelated (but related to each other).If  @s that are merged have distinct associativities, then they get   as their associativity.Precondition: No  1 may occur in more than one list element. Every   must have the same  .Postcondition: No  & occurs in more than one list element. 'Converts a notation to a (non-)section. ;The precedence corresponding to a possibly hidden argument. lDo we need to bracket an operator application of the given fixity in a context with the given precedence. lDo we need to bracket an operator application of the given fixity in a context with the given precedence. Does a lambda-like thing (lambda, let or pi) need brackets in the given context? A peculiar thing with lambdas is that they don't need brackets in certain right operand contexts. To decide we need to look at the stack of precedences and not just the current precedence. Example: m >>= ( x ! x) >>= m  (for _>>=_ left associative). The first argument is the parenthesis preference. If True, we add parentheses also in right operand contexts where they aren't strictly needed. "Preference for adding parentheses. *Does a function application need brackets? *Does a function application need brackets? &Does a with application need brackets? $Does a function space need brackets? Ranges are not forced.D  | }  ~ N  } ~  |  } ~        RNone"#$+-013457;<=>?ACNQV]^= .Zero or more consecutive and separated ranges. QCharacter ranges. The first character in the file has position 1. Note that the  4 position is considered to be outside of the range. Invariant:   -  . The   invariant. The   invariant. , iff the ranges overlap.)The ranges are assumed to be well-formed. , iff the range is empty. (Converts a range to a list of positions. /Converts several ranges to a list of positions.  Converts a  to a  .  minus xs ys! computes the difference between xs and ys<: the result contains those positions which are present in xs but not in ys.*Linear in the lengths of the input ranges.     SNone"#$+-03457;<=>?ACKNQV]^95  SCC DAGs.0The maps map SCC indices to and from SCCs/nodes. For homogeneous graphs, (s = t)& we can compute a set of all nodes. Structure Nodes is for computing all nodes but also remembering which were incoming and which outgoing. This is mostly for efficiency reasons, to avoid recomputation when all three sets are needed. Outgoing node. Incoming node. Edge label (weight).  Graph s t e- is a directed graph with source nodes in s target nodes in t and edges in e.nAdmits at most one edge between any two nodes. Several edges can be modeled by using a collection type for e.uRepresented as "adjacency list", or rather, adjacency map. This allows to get all outgoing edges for a node in O(log n) time where n% is the number of nodes of the graph.'Incoming edges can only be computed in O(n + e) time where e is the number of edges. Forward edges. Reverse an edge. $Turn a graph into a list of edges. O(n + e) \All edges originating in the given nodes. (I.e., all outgoing edges for the given nodes.)0Roughly linear in the length of the result list  O(result). WAll edges ending in the given nodes. (I.e., all incoming edges for the given nodes.) Expensive: O(n * |ts| * log n). Get all self-loops. Lookup label of an edge. )Get a list of outgoing edges with target. )Get a list of outgoing edges with target. ,Returns all the nodes with outgoing edges. O(n). 7Returns all the nodes with incoming edges. Expensive! O(e). -The set of all nodes (outgoing and incoming). JConstructs a completely disconnected graph containing the given nodes. O(n). 4Constructs a graph from a list of edges. O(e log n)$Later edges overwrite earlier edges. 4Constructs a graph from a list of edges. O(e log n)HLater edges are combined with earlier edges using the supplied function. *Convert a graph into a list of edges. O(e) vCheck whether the graph is discrete (no edges). This could be seen as an empty graph. Worst-case (is discrete): O(e). Removes H edges (and empty -s). !Empty graph (no nodes, no edges). 4A graph with two nodes and a single connecting edge. Insert an edge into the graph. #Insert an edge, possibly combining old edge weight with new weight by given function f into  f new old. Left-biased union.--The opposite graph (with all edges reversed).-*Auxiliary function to turn empty map into Nothing.-KRemoves the given source node, and all corresponding edges, from the graph. O(log n).-KRemoves the given target node, and all corresponding edges, from the graph. Expensive!  O(n log n). _Removes the given node, be it source or target, and all corresponding edges, from the graph. Expensive!  O(n log n). !removeEdge s t g removes the edge going from s to t , if any. O((log n)^2). "1Keep only the edges that satisfy the predicate. O(e). #4Unzipping a graph (naive implementation using fmap). $HMaps over a graph under availability of positional information, like -. %IThe graph's strongly connected components, in reverse topological order. &IThe graph's strongly connected components, in reverse topological order. '  invariant. (The opposite DAG. )'The nodes reachable from the given SCC. *GConstructs a DAG containing the graph's strongly connected components. +GConstructs a DAG containing the graph's strongly connected components. ,Returns True iff the graph is acyclic. -reachableFrom g n/ is a map containing all nodes reachable from n in g. For each node a simple path to the node is given, along with its length (the number of edges). The paths are as short as possible (in terms of the number of edges).Precondition: n must be a node in g<. The number of nodes in the graph must not be larger than - :: ,.KAmortised time complexity (assuming that comparisons take constant time):  O(e log n)j, if the lists are not inspected. Inspection of a prefix of a list is linear in the length of the prefix. .#walkSatisfying every some g from to% determines if there is a walk from from to to in g/, in which every edge satisfies the predicate every(, and some edge satisfies the predicate someg. If there are several such walks, then a shortest one (in terms of the number of edges) is returned.Precondition: from and to must be nodes in g<. The number of nodes in the graph must not be larger than - :: ,.iAmortised time complexity (assuming that comparisons and the predicates take constant time to compute):  O(e log n). /composeWith times plus g g' finds all edges s --c_i--> t_i --d_i--> u) and constructs the result graph from !edge(s,u) = sum_i (c_i times d_i).Complexity: for each edge s --> t in g, we lookup up all edges starting in with t in g'. 0Transitive closure ported from Agda.Termination.CallGraph.%Relatively efficient, see Issue 1560.- Version of  0~ that produces a list of intermediate results paired to the left with a difference that lead to the new intermediat result.TThe last element in the list is the transitive closure, paired with the empty graph. (complete g = snd $ last $ completeIter g 1-Computes the transitive closure of the graph.Uses the Gauss-Jordan-Floyd-Warshall-McNaughton-Yamada algorithm (as described by Russell O'Connor in "A Very General Method of Computing Shortest Paths"  'http://r6.ca/blog/20110808T035622Z.html), implemented using matrices.4The resulting graph does not contain any zero edges.JThis algorithm should be seen as a reference implementation. In practice  2! is likely to be more efficient. 2-Computes the transitive closure of the graph.Uses the Gauss-Jordan-Floyd-Warshall-McNaughton-Yamada algorithm (as described by Russell O'Connor in "A Very General Method of Computing Shortest Paths"  'http://r6.ca/blog/20110808T035622Z.html), implemented using  , and with some shortcuts:SZero edge differences are not added to the graph, thus avoiding some zero edges.MStrongly connected components are used to avoid computing some zero edges.yThe graph's strongly connected components (in reverse topological order) are returned along with the transitive closure. **The graph's strongly connected components.A                           ! " # $ % & ' ( ) * + , - . / 0 1 2A                           ! " # $ % & ' ( ) * + , - . / 0 1 2      TNone"#$+-03457;<=>?ACNQV]^r% @These metas are < ". A,Lower or upper bound for a flexible variable IA graph forest. O Going from Lt to Le is pred , going from Le to Lt is succ.X --(R,n)--> Y means  X (R) Y + n#. [ ... if n positive and X + (-n) (R) Y if n negative. ] QNodes not connected. T4Test for negativity, used to detect negative cycles. d1Compute list of edges that start in a given node. e/Compute list of edges that target a given node.9Note: expensive for unidirectional graph representations. f Set.foldl* does not exist in legacy versions of the  containers package. gFloyd-Warshall algorithm. h5Convert a label to a weight, decrementing in case of 2. nSplit a list of graphs gs into those that mention node n and those that do not. If n6 is zero or infinity, we regard it as "not mentioned". oTAdd an edge to a graph forest. Graphs that share a node with the edge are joined. pReflexive closure. Add edges 0 -> n -> n -> oo for all nodes n. qh  q g if any edge in gG between rigids and constants is implied by a corresponding edge in h", which means that the edge in g/ carries at most the information of the one in h.SApplication: Constraint implication: Constraints are compatible with hypotheses. t2Build a graph from list of simplified constraints. u2Build a graph from list of simplified constraints. {If we have an edge  X + n <= X (with n >= 0), we must set X = oo. }2Compute a lower bound for a flexible from an edge. ~3Compute an upper bound for a flexible from an edge. 6Compute the lower bounds for all flexibles in a graph. 6Compute the upper bounds for all flexibles in a graph. 0Compute the bounds for all flexibles in a graph. cCompute the relative minima in a set of nodes (those that do not have a predecessor in the set). aCompute the relative maxima in a set of nodes (those that do not have a successor in the set). Given source nodes n1,n2,... find all target nodes m1,m2, such that for all j, there are edges n_i --l_ij--> m_j for all i. Return these edges as a map from target notes to a list of edges. We assume the graph is reflexive-transitive. Given target nodes m1,m2,... find all source nodes n1,n2, such that for all j, there are edges n_i --l_ij--> m_j for all i. Return these edges as a map from target notes to a list of edges. We assume the graph is reflexive-transitive. BCompute the sup of two different rigids or a rigid and a constant. BCompute the inf of two different rigids or a rigid and a constant. $Compute the least upper bound (sup). ]Compute the greatest lower bound (inf) of size expressions relative to a hypotheses graph. hSolve a forest of constraint graphs relative to a hypotheses graph. Concatenate individual solutions. XCheck that after substitution of the solution, constraints are implied by hypotheses. 1Iterate solver until no more metas can be solved.sThis might trigger a (wanted) error on the second iteration (see Issue 2096) which would otherwise go unnoticed. Partial implementation of Num. $An edge is negative if its label is.  A graph is  UU if it contains a negative loop (diagonal edge). Makes sense on transitive graphs. ;Meta variable polarities (prefer lower or upper solution?).BHypotheses (assumed to have no metas, so, fixed during iteration).Constraints to solve.7Previous substitution (already applied to constraints).Accumulated substition.U < = @ ? > A B C D E F G H I J N M L K O Q P S R T U V X W Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  t ] \ [ Z Y ^ _ ` a b c d e f g V W X T U O P Q R S h J K L M N i j k l I m n o p q r s t u H G F v w x E y D z { B C A | < = > ? @ } ~   < = > ? @ B C J K L M N O P Q R S T U V W XUNone"#$+-013457;<=>?ACNQV]^ wSubterm occurrences for positivity checking. The constructors are listed in increasing information they provide: 3Mixed <= JustPos <= StrictPos <= GuardPos <= Unused Mixed <= JustNeg <= Unused. -Arbitrary occurrence (positive and negative). Negative occurrence. /Positive occurrence, but not strictly positive. Strictly positive occurrence. VGuarded strictly positive occurrence (i.e., under "). For checking recursive records. -One part of the description of an occurrence. (in the nth argument of a define constant 'in the principal argument of built-in " "as an argument to a bound variable  as an argument of a metavariable in the type of a constructor $in a datatype index of a constructor 'in the nth clause of a defined function 1matched against in a clause of a defined function in the definition of a constant Description of an occurrence. )an unknown position (treated as negative) XThe elements of the sequence, from left to right, explain how to get to the occurrence. &The map contains bindings of the form  bound |-> ess?, satisfying the following property: for every non-empty list w, -  w - bound iff - [ - every w - - some w | (every, some) <- ess ]. +productOfEdgesInBoundedWalk occ g u v bound returns , e iff there is a walk c (a list of edges) in g, from u to v, for which the product -  (- occ c) - bound#. In this case the returned value e is the product -  c for one such walk.Preconditions: u and v must belong to g, and bound must belong to the domain of boundToEverySome.  * is a complete lattice with least element   and greatest element  .&It forms a commutative semiring where  is meet (glb) and 0 is composition. Both operations are idempotent.For ,   is neutral (zero) and   is dominant. For ,   is neutral (one) and   is dominant.     VNone"#$+-013457;<=>?ACNQV]^3Nw The  f is not an application. =Modules: Top-level pragmas plus other top-level declarations. first string is backend name first string is backend name :Invariant: The string must be a valid Haskell module name. &same as above, but for the UHC backend :For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop).   tel. M args   M {{...}} ~The representation type of a declaration. The comments indicate which type in the intended family the constructor targets. DAxioms and functions can be irrelevant. (Hiding should be NotHidden) .Record field, can be hidden and/or irrelevant. #lone data signature in mutual block %lone record signature in mutual block 7The optional name is a name for the record constructor. notation declaration for a name In  Agda.Syntax.Concrete.Definitions~ we generate private blocks temporarily, which should be treated different that user-declared private blocks. Thus the L. (Just type signatures or instance blocks. Just type signatures. #The "as" name. $CThe range of the "as" keyword. Retained for highlighting purposes. %3An imported name can be a module or a defined name. (YThe things you are allowed to say when you shuffle names between name spaces (i.e. in import,  namespace, or open declarations). )vAn expression followed by a where clause. Currently only used to give better a better error message in interaction. ,No where clauses. - Ordinary where. . Named where: module M where . The  flag applies to the J (not the module contents!) and is propagated from the parent function. 1+No right hand side because of absurd match. 48Processed (scope-checked) intermediate form of the core f ps of  ?. Corresponds to  B. 7 f 8 ps 9record projection identifier : side patterns ; main branch < side patterns ?;Left hand sides can be written in infix style. For example: +n + suc m = suc (n + m) (f " g) x = f (g x)@We use fixity information to see which name is actually defined. @Goriginal pattern, with-patterns, rewrite equations and with-expressions A9new with-patterns, rewrite equations and with-expressions B f ps C| p (many) D rewrite e (many) Ewith e (many) F\A telescope is a sequence of typed bindings. Bound variables are in scope in later types. HBinding (x1 ... xn : A). I Let binding (let Ds) or  (open M args). JA typed binding. NHfor implicit function types the label matters and can't be alpha-renamed Q. (xs : e) or {xs : e} or something like  (x {y} _ : e). R}A sequence of typed bindings with hiding information. Appears in dependent function spaces, typed lambdas, and telescopes.FIf the individual binding contains hiding information as well, the e in  TypedBindings must be the unit h. T. x or {x} or .x or .{x} or {.x} U. (xs : e) or {xs : e} V0A lambda binding is either domain free or typed. W9Concrete patterns. No literals in patterns at the moment. Xc or x Y quote Zp p' or  p {x = p'} [p1..pn before parsing operators \eg: p => p' for operator _=>_ The Q is possibly ambiguous, but it must correspond to one of the names in the set. ]{p} or {x = p} ^{{p}} or  {{x = p}} _ (p) ` _ a () bx@p unused c.eg (the Origin keeps track whether this dot pattern was written by the user or inserted by the system) d0, 1, etc. e record {x = p; y = q} fCConcrete expressions. Should represent exactly what the user wrote. gex: x hex: 1 or "foo" iex: ? or  {! ... !} jex: _ or _A_5 kbefore parsing operators lex: e e, e {e}, or  e {x = e} mex: e + e The S is possibly ambiguous, but it must correspond to one of the names in the set. nex: e | e1 | .. | en oex: {e} or {x=e} pex: {{e}} or {{x=e}} qex:  \x {y} -> e or \(x:A){y:B} -> e rex: \ () sex: .\ { p11 .. p1a -> e1 ; .. ; pn1 .. pnz -> en } tex: e -> e or .e -> e (NYI: {e} -> e) uex:  (xs:e) -> e or  {xs:e} -> e vex: Set wex: Prop xex: Set0, Set1, .. yex: record {x = a; y = b}, or record { x = a; M1; M2 } zex: record e {x = a; y = b} {ex:  let Ds in e |ex: (e) }ex: (| e |) ~ex: () or {}, only in patterns ex: x@p, only in patterns ex: .p, only in patterns !only used for printing telescopes ex: quoteGoal x in e ex:  quoteContext ex: quote, should be applied to a name ex:  quoteTerm, should be applied to a term 'tactic solve | subgoal1 | .. | subgoalN ex: unquote&, should be applied to a term of type Term to print irrelevant things ex: a = b, used internally in the parser \An abstraction inside a special syntax declaration (see Issue 358 why we introduce this). #Computes the top-level module name.Precondition: The   has to be well-formed. This means that there are only allowed declarations before the first module declaration, typically import declarations. See  . Splits off allowed (= import) declarations before the first non-allowed declaration. After successful parsing, the first non-allowed declaration should be a module declaration. <Get all the identifiers in a pattern in left-to-right order. <Get all the identifiers in a pattern in left-to-right order. Ranges are not forced. A  / is J when the whereG keyword is absent. An empty list of declarations does not count as J here. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced. Ranges are not forced.                           ! " # $ % & ' ( ) * + , - . / 0 2 1 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G I H J K L M N O P Q R S T U V W d b ` e c a X Y Z [ \ ] ^ _ f g l t v h m } { w j q u i k n o p r s x y z | ~  f g h i j k l m n o p q r s t u v w x y z { | } ~  V S T U R P Q J G H I K L M N O F                         ( ' % & ! " # $   > = ? @ A B C D E W X Y Z [ \ ] ^ _ ` a b c d e 4 5 6 7 8 9 : ; < 3 0 1 2 / + , - . ) *                              ! " # $ ) * + , - . 0 1 2 4 5 6 7 8 9 : ; < ? @ A B C D E G H I K L M N O P Q S T U W X Y Z [ \ ] ^ _ ` a b c d e f# g h i j k l m n o p q r s t u v w x y z { | } ~     WNone"#$+-03457;<=>?ACNQV]^@#prettyHiding info visible doc# puts the correct braces around doc according to info info and returns  visible doc% if the we deal with a visible thing.      9?>=<;:987   6543210A/.-,+*  @)('&%$#"!   XNone"#$+-03457;<=>?ACNQV]^Tw%DPhases to allocate CPU time to.E#Happy parsing and operator parsing.FImport chasing.GReading interface files.H2Scope checking and translation to abstract syntax.I1Type checking and translation to internal syntax.JTermination checking.K-Positivity checking and polarity computation.LInjectivity checking.M!Checking for projection likeness.N0Coverage checking and compilation to case trees.OGenerating highlighting info.PWriting interface files.QDeac code elimination.R Subphase for J.S Subphase for J.T Subphase for J.U Subphase for J.V Subphase for J.W Subphase for J.X Subphase for F.Y Subphase for P.Z Subphase for P.[ Subphase for P.\ Subphase for P.] Subphase for E.^ Subphase for E._ Subphase for I: free variable computation.` Subphase for I!: occurs check for solving metas.a Subphase for I: checking the LHSb Subphase for I: checking the RHSc Subphase for I: checking a type signatured Subphase for a: unification of the indicesePretty printing names.k.Global variable to store benchmark statistics.l=Benchmark an IO computation and bill it to the given account.m>Benchmark a pure computation and bill it to the given account.,BCDfedba`^]\[YPMIHGEFgZcOKLJSQNWVX_UTRhijklm.DEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgoCBhijknlmD#EFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgYNone"#$&'+-03457;<=>?ACFNQTV]^g sA singleton type for   (except for the constructor  ).x"Used to define the return type of .yShould sections be parsed?The O is possibly ambiguous, but it must correspond to one of the names in the set.Runs a parser. If sections should be parsed, then identifiers with at least two name parts are split up into multiple tokens, using O to record the tokens' original positions within their respective identifiers.)Parse a specific identifier as a NamePartKParses a split-up, unqualified name consisting of at least two name parts.The parser does not check that underscores and other name parts alternate. The range of the resulting name is the range of the first name part that is not an underscore.Either a wildcard (_E), or an unqualified name (possibly containing multiple name parts).0Parse the "operator part" of the given notation.ENormal holes (but not binders) at the beginning and end are ignored.RIf the notation does not contain any binders, then a section notation is allowed.!swvutxy{z|~}$|}~yz{xstuvwstuvwyz{|}~ ZNone"#$+-03457;<=>?ACNQV]^l:,Generic traversals for concrete expressions. Note: does not go into patterns!This corresponds to -.This corresponds to -.This is a reduce.[None"#$+-013457;<=>?ACNQV]^;* A compressed 0, in which consecutive positions with the same  are stored together. Syntax highlighting information.A 6 is a mapping from file positions to meta information.,The first position in the file has number 1.The defining module.!The file position in that module. Has this DefinitionSite/ been created at the defining site of the name?#A pretty name for the HTML linking.KMeta information which can be associated with a character/character range.This note, if present, can be displayed as a tool-tip or something like that. It should contain useful information about the range (like the module containing a certain identifier, or the fixity of an operator).jThe definition site of the annotated thing, if applicable and known. File positions are counted from 1.ZOther aspects, generated by type checking. (These can overlap with each other and with s.)hUnsolved constraint not connected to meta-variable. This could for instance be an emptyness constraint.GWhen this constructor is used it is probably a good idea to include a * explaining why the pattern is incomplete.!Code which is being type-checked.NameKind(s are figured out during scope checking.Bound variable.%Inductive or coinductive constructor. Record field. Module name. Primitive. Record type.!Named argument, like x in {x = v}Macro.Syntactic aspects of the code. (These cannot overlap.) They can be obtained from the lexed tokens already, except for the . Symbols like forall, =, ->, etc.Things like Set and Prop.Is the name an operator part? rs m( is a file whose positions are those in rs2, and in which every position is associated with m.Like , but with several   instead of only one.-Merges meta information. Merges files..Returns the smallest position, if any, in the . Convert the E to a map from file positions (counting from 1) to meta information.Invariant for compressed files.-Note that these files are not required to be  maximally? compressed, because ranges are allowed to be empty, and the -s in adjacent ranges are allowed to be equal.cCompresses a file by merging consecutive positions with equal meta information into longer ranges.Decompresses a compressed file.Clear any highlighting info for the given ranges. Used to make sure unsolved meta highlighting overrides error highlighting. rs m( is a file whose positions are those in rs2, and in which every position is associated with m.Like  singletonR, but with a list of   instead of a single one.Merges compressed files. splitAtC p f splits the compressed file f into (f1, f2), where all the positions in f1 are < p, and all the positions in f2 are >= p..Returns the smallest position, if any, in the .CC  \None"#$+-03457;<=>?ACNQV]^BYCallback fuction to call when there is a response to give to the interactive frontend.Note that the response is given in pieces and incrementally, so the user can have timely response even during long computations.Typical  functions:Convert the response into a -g representation and print it on standard output (suitable for inter-process communication).LPut the response into a mutable variable stored in the closure of the < function. (suitable for intra-process communication).Give action result"Comment derived from agda2-mode.elIf 2 is 'Give_String s', then the goal is replaced by sM, and otherwise the text inside the goal is retained (parenthesised if  is ).Status information.!Are implicit arguments displayed?.Has the module been successfully type checked?4Info to display at the end of an interactive command3Strings are the warnings and the (non-fatal) errors>Strings are the goals, the warnings and the (non-fatal) errorsWhen an error message is displayed this constructor should be used, if appropriate. | Info_Warning String --FNF: currently unusedV denotes two different types of errors TODO: split these into separate constructors, denotes either an error or a success (when 1< is present) TODO: split these into separate constructors),There are two kinds of "make case" commands.,'Responses for any interactive interfaceNote that the response is given in pieces and incrementally, so the user can have timely response even during long computations.3(Solution for one or more meta-variables.5)The integer is the message's debug level.8AA command sent when an abort command has completed successfully.9 The default S function prints certain things to stdout (other things generate internal errors)., !"#$%&'()*+,-./0123456789,,-./012345678)*+ !"#$%&'(9 !"#$%&'()*+, -./012345678]None"#$+-03457;<=>?ACKNQV]^R ;;Result of comparing a candidate with the current favorites.<xGreat, you are dominating a possibly (empty list of favorites) but there is also a rest that is not dominated. If null dominated, then  notDominated2 is necessarily the complete list of favorites.=.Sorry, but you are dominated by that favorite.A!A list of incomparable favorites.DGosh, got some pretty a here, compare with my current favorites! Discard it if there is already one that is better or equal. (Skewed conservatively: faithful to the old favorites.) If there is no match for it, add it, and dispose of all that are worse than a.FWe require a partial ordering. Less is better! (Maybe paradoxically.)ECompare a new set of favorites to an old one and discard the new favorites that are dominated by the old ones and vice verse. (Skewed conservatively: faithful to the old favorites.) 'compareFavorites new old = (new', old')G)After comparing, do the actual insertion.H%Compare, then insert accordingly. :insert a l = insertCompared a l (compareWithFavorites a l)I=Insert all the favorites from the first list into the second.JConstruct favorites from elements of a partial order. The result depends on the order of the list if it contains equal elements, since earlier seen elements are favored over later seen equals. The first element of the list is seen first.LA forms a - under I and 'union.MLEquality checking is a bit expensive, since we need to sort! Maybe use a Set! of favorites in the first place?;=<@?>ABCDEFGHIJABCM;<=>?@DEFGHIJLK;<=>?@ABC^None"#$+-03457;<=>?ACNQV]^ R,A finite map, represented as a set of pairs.%Invariant: at most one value per key.SO(n). Reexport -.T9O(n). Get the domain (list of keys) of the finite map.UJO(1). Add a new binding. Assumes the binding is not yet in the list.VO(n). Update the value at a key. The key must be in the domain of the finite map. Otherwise, an internal error is raised.WO(n). Update the value at a key with a certain function. The key must be in the domain of the finite map. Otherwise, an internal error is raised.X<O(n). Map over an association list, preserving the order.Y{O(n). If called with a effect-producing function, violation of the invariant could matter here (duplicating effects).ZO(n). Named in analogy to 56u. To preserve the invariant, it is sufficient that the key transformation is injective (rather than monotonic). RSTUVWXYZ RSTUVWXYZ_None"#$&'+-013457;<=>?ACNQV]^ 6_Y\nUsed for instance arguments to check whether a name is in scope, but we do not care whether is is ambiguous]&Ambiguous constructors or projections.`-A decoration of abstract syntax module names.bThe resolved module name.c&Explanation where this name came from.dA decoration of L7.fThe resolved qualified name.g6The kind (definition, constructor, record field etc.).h&Explanation where this name came from.iWhere does a name come from?=This information is solely for reporting to the user, see 8.jDefined in this module.kImported from another module.l!Imported by a module application.mqFor the sake of parsing left-hand sides, we distinguish constructor and record field names from defined names.nConstructor name.oRecord field name.pOrdinary defined name.qName of a pattern synonym.rName of a macrosA name that can only be quoted.t-Type class for some dependent-types trickery.v#Set of types consisting of exactly d and `..A GADT just for some dependent-types trickery.}A  NameSpace contains the mappings from concrete names that the user can write to the abstract fully qualified names that the type checker wants to read.0Maps concrete names to a list of abstract names.>Maps concrete module names to a list of abstract module names.A local variable can be shadowed by an import. In case of reference to a shadowed variable, we want to report a scope error.Unique ID of local variable.-Flag whether the variable is introduced by a let.TIf this list is not empty, the local variable is shadowed by one or more imports.Local variables.The complete information about the scope at a particular program point includes the scope stack, the local variables, and the context precedence.See .#Things not exported by this module.+Things defined and exported by this module.1Things from open public, exported by this module.uVisible (as qualified) from outside, but not exported when opening the module. Used for qualified constructors.TA scope is a named collection of names partitioned into public and private names.Get a } from . A lens for `Monadic' lens (Functor sufficient).3Shadow a local name by a non-empty list of imports.*Project name of unshadowed local variable.%Get all locals that are not shadowed  by imports. Lens for . inNameSpace> selects either the name map or the module name map from a }X. What is selected is determined by result type (using the dependent-type trickery).!A list containing all name kinds.Van Laarhoven lens on f.Van Laarhoven lens on b.The empty name space.9Map functions over the names and modules in a name space.Zip together two name spaces.&Map monadic function over a namespace.The empty scope.The empty scope info.4Map functions over the names and modules in a scope.Same as 2 but applies the same function to all name spaces.Same as 7 but applies the function only on the given name space.<Map monadic functions over the names and modules in a scope.Same as M but applies the same function to both the public and private name spaces.UZip together two scopes. The resulting scope has the same name as the first scope.Same as M but applies the same function to both the public and private name spaces.&Recompute the inScope sets of a scope.Filter a scope keeping only concrete names matching the predicates. The first predicate is applied to the names and the second to the modules.Return all names in a scope.&Returns the scope's non-private names.=Merge two scopes. The result has the name of the first scope.\Merge a non-empty list of scopes. The result has the name of the first scope in the list.aMove all names in a scope to the given name space (except never move from Imported to Public).Update a particular name space.Modify a particular name space.Add names to a scope.Add a name to a scope.Remove a name from a scope. Caution: does not update the nsInScope set. This is only used by rebindName and in that case we add the name right back (but with a different kind).Add a module to a scope. Apply an  to a scope.%Rename the abstract names in a scope.%Remove private name space of a scope.Should be a right identity for . >exportedNamesInScope . restrictPrivate == exportedNamesInScope.9Remove private things from the given module from a scope.CRemove names that can only be used qualified (when opening a scope).Add an explanation to why things are in scope.5Get the public parts of the public modules of a scopeoCompute a flattened scope. Only include unqualified names or names qualified by modules in the first argument.:Get all concrete names in scope. Includes bound variables.Look up a name in the scopehFind the concrete names that map (uniquely) to a given abstract name. Sort by length, shortest first.rFind the concrete names that map (uniquely) to a given abstract qualified name. Sort by length, shortest first.oFind the concrete names that map (uniquely) to a given abstract module name. Sort by length, shortest first.+Add first string only if list is non-empty.AWe show shadowed variables as prefixed by a ".", as not in scope.[^]\_`acbdehgfikjlmsrqpontuvxwyz{|}~}~|{zyvwxtumnopqrsijkldefgh`abc_[\]^ [\]^`abcdefghijklmnopqrstuvwx}~`None"#$+-03457;<=>?ACNQV]^ A.Types which Geniplate should not descend into.A localised instance of -. The generated -. functions neither descend into the types in *, nor into the types in the list argument.A localised instance of -. The generated -. functions neither descend into the types in *, nor into the types in the list argument.aNone"#$+-013457;<=>?ACKNQV]^ L Constructor pattern info.EDoes this pattern come form the eta-expansion of an implicit pattern?;For a general pattern we remember the source code position.2UThe range of the "as" and "to" keywords, if any. Retained for highlighting purposes.3AThe "as" module name, if any. Retained for highlighting purposes.5 Retained for abstractToConcrete of  .6Information about lambdas.:/Do we prefer the lambda with or without parens?E-Default is system inserted and prefer parens.F6 with no range information.HSame as  mkDefInfo but where we can also give the  IsInstanceIEmpty range for patterns.^Default value for .6 !"$#%&,+*)('-./05432167:98;<=>BA@?CDEFGHIQ=>?@ABCKJ;<DML6789:EFPON/012345SRQ-.UT%&'()*+,GH[ZY!"#$XWV ^]\`_Idcba  !"#$%&'()*+,-./0123456789:;<=>?@ABbNone"#$+-03457;<=>?ACNQV]^ $-Transposable things. m extracts the diagonal of m.fFor non-square matrices, the length of the diagonal is the minimum of the dimensions of the matrix.6Type of matrices, parameterised on the type of values.aSparse matrices are implemented as an ordered association list, mapping coordinates to values.Dimensions of the matrix.!Association of indices to values.%Type of matrix indices (row, column). Row index, 1 <= row <= rows. Column index 1 <= col <= cols.Size of a matrix.Number of rows, >= 0.Number of columns, >= 0.- Convert a I to a set of bounds suitable for use with the matrices in this module., iff the matrix is square.Returns , iff the matrix is empty.5Compute the matrix size of the union of two matrices.-<Compute the matrix size of the intersection of two matrices.#Constructs a matrix from a list of (index, value) -pairs. O(n) where n is size of the list.!Precondition: indices are unique. sz rsL constructs a matrix from a list of lists of values (a list of rows). O(size) where size = rows cols.Precondition: - rs -  sz and - (( sz -) . -) rs.6Converts a sparse matrix to a sparse list of rows. O(n) where n1 is the number of non-zero entries of the matrix."Only non-empty rows are generated.-`Turn a sparse vector into a vector by inserting a fixed element at the missing positions. O(size) where size is the dimension of the vector.-Converts a matrix to a list of row lists. O(size) where size = rows cols.<Returns 'Just b' iff it is a 1x1 matrix with just one entry b. O(1).AGeneral pointwise combination function for association lists.  O(n1 + n2) where ni- is the number of non-zero element in matrix i.In zipAssocWith fs gs f g h l l',fs* is possibly more efficient version of - ( (i, a) -> (i,)  $ f a), and same for gs and g.- Instance of $ which keeps longer assoc lists.  O(n1 + n2).?General pointwise combination function for sparse matrices.  O(n1 + n2). (+) m1 m2 adds m1 and m2, using (+) to add values.  O(n1 + n2).Returns a matrix of size  m1 m2. f m1 m2! build the pointwise conjunction m1 and m2 . Uses f to combine non-zero values.  O(n1 + n2).Returns a matrix of size  infSize m1 m2."Association list intersection.  O(n1 + n2). AinterAssocWith f l l' = { (i, f a b) | (i,a) " l and (i,b) " l' }HUsed to combine sparse matrices, it might introduce zero elements if f( can return zero for non-zero arguments. semiring m1 m2 multiplies matrices m1 and m2). Uses the operations of the semiring semiring" to perform the multiplication.0O(n1 + n2 log n2 + (i <= r1) (j <= c2) d(i,j)) where r1$ is the number of non-empty rows in m1 and c2' is the number of non-empty columns in m2 and d(i,j)Q is the bigger one of the following two quantifies: the length of sparse row i in m1$ and the length of sparse column j in m2.Given dimensions  m1 : r1 c1 and  m2 : r2 c2, a matrix of size r1 c2* is returned. It is not necessary that c1 == r2, the matrices are implicitly patched with zeros to match up for multiplication. For sparse matrices, this patching is a no-op. x m adds a new column to m`, after the columns already existing in the matrix. All elements in the new column get set to x. x m adds a new row to mY, after the rows already existing in the matrix. All elements in the new row get set to x.NPointwise comparison. Only matrices with the same dimension are comparable.Diagonal of sparse matrix.O(n) where n2 is the number of non-zero elements in the matrix.Matrix transposition. O(n log n) where n2 is the number of non-zero elements in the matrix.Transposing coordinates.Size of transposed matrix.Only left map remaining.Only right map remaining.!Element only present in left map."Element only present in right map.Element present in both maps.-!Element only present in left map."Element only present in right map.Element present in both maps.$Element only present in left matrix.%Element only present in right matrix.!Element present in both matrices.Result counts as zero?-cNone"#$+-03457;<=>?ACNQV]^ \A partial order, aimed at deciding whether a call graph gets worse during the completion.:In the paper referred to above, there is an order R with  - Le - Lt.This is generalized to  - 'Decr k' where Decr 1 replaces Lt and Decr 0 replaces Le. A negative decrease means an increase. The generalization allows the termination checker to record an increase by 1 which can be compensated by a following decrease by 2 which results in an overall decrease.However, the termination checker of the paper itself terminates because there are only finitely many different call-matrices. To maintain termination of the terminator we set a cutoff point which determines how high the termination checker can count. This value should be set by a global or file-wise option.See Call for more information.9TODO: document orders which are call-matrices themselves.2Decrease of callee argument wrt. caller parameter.The Bool indicates whether the decrease (if any) is usable. In any chain, there needs to be one usable decrease. Unusable decreases come from SIZELT constraints which are not in inductive pattern match or a coinductive copattern match. See issue #2331.UPDATE: Andreas, 2017-07-26: Feature #2331 is unsound due to size quantification in terms. While the infrastructure for usable/unusable decrease remains in place, no unusable decreases are generated by TermCheck.ENo relation, infinite increase, or increase beyond termination depth.&Matrix-shaped order, currently UNUSED.$Raw increase which does not cut off.$Raw decrease which does not cut off.Smart constructor for Decr k :: Order which cuts off too big values.Possible values for k:  - ?cutoff - k - ?cutoff + 1.RSmart constructor for matrix shaped orders, avoiding empty and singleton matrices.le, lt,  decreasing, unknown4: for backwards compatibility, and for external use.Usable decrease.Decreasing and usable?HMatrix-shaped order is decreasing if any diagonal element is decreasing.Multiplication of .s. (Corresponds to sequential composition.)- collapse mWe assume that mD codes a permutation: each row has at most one column that is not Unknown.To collapse a matrix into a single value, we take the best value of each column and multiply them. That means if one column is all UnknownR, i.e., no argument relates to that parameter, then the collapsed value is also Unknown.,This makes order multiplication associative.-'Can two matrices be multplied together?+The supremum of a (possibly empty) list of ;s. More information (i.e., more decrease) is bigger. # is no information, thus, smallest.-(, -, ) forms a semiring, with  as zero and Le as one.%The infimum of a (non empty) list of $s. Gets the worst information. & is the least element, thus, dominant.-Pick the worst information.We use a record for semiring instead of a type class since implicit arguments cannot occur in instance constraints, like +instance (?cutoff :: Int) => SemiRing Order.Information order: M is least information. The more we decrease, the more information we have.When having comparable call-matrices, we keep the lesser one. Call graph completion works toward losing the good calls, tending towards Unknown (the least information)./We assume the matrices have the same dimension.It does not get worse then ` increase'C. If we are still decreasing, it can get worse: less decreasing.dNone"#$+-03457;<=>?ACKNQV]^ VSets of incomparable call matrices augmented with path information. Use overloaded J, I, , -.,Call matrix augmented with path information."The matrix of the (composed call).Meta info, like call path.0Call matrix multiplication and call combination.Call matrices.A call matrix for a call f --> g has dimensions  ar(g) ar(f).9Each column corresponds to one formal argument of caller f9. Each row corresponds to one argument in the call to g.FIn the presence of dot patterns, a call argument can be related to several different formal arguments of f. See e.g. testsucceedDotPatternTermination.agda:  data D : Nat -> Set where cz : D zero c1 : forall n -> D n -> D (suc n) c2 : forall n -> D n -> D n f : forall n -> D n -> Nat f .zero cz = zero f .(suc n) (c1 n d) = f n (c2 n d) f n (c2 .n d) = f n d 'Call matrices (without guardedness) are  -1 -1 n < suc n and n < c1 n d ? = c2 n d <= c1 n d = -1 n <= n and n < c2 n d ? -1 d < c2 n d `Here is a part of the original documentation for call matrices (kept for historical reasons):This datatype encodes information about a single recursive function application. The columns of the call matrix stand for sourceD function arguments (patterns). The rows of the matrix stand for target function arguments. Element (i, j)0 in the matrix should be computed as follows: (less than) if the j-th argument to the target; function is structurally strictly smaller than the i-th pattern. (less than or equal) if the j-th argument to the target+ function is structurally smaller than the i-th pattern. otherwise.0Call matrix indices = function argument indices.Machine integer ,^ is sufficient, since we cannot index more arguments than we have addresses on our machine.Non-augmented call matrix.Insert into a call matrix set.Union two call matrix sets./Convert into a list of augmented call matrices.Call matrix multiplication.f --(m1)--> g --(m2)--> h is combined to f --(m2  m1)--> h9Note the reversed order of multiplication: The matrix c1 of the second call g-->h in the sequence  f-->g-->h is multiplied with the matrix c2 of the first call.Preconditions: m1 has dimensions  ar(g) ar(f). m2 has dimensions  ar(h) ar(g).Postcondition:  m1 >*< m2 has dimensions  ar(h) ar(f).%Augmented call matrix multiplication.1Call matrix set product is the Cartesian product.eNone"#$+-03457;<=>?ACKNQV]^ %gA call graph is a set of calls. Every call also has some associated meta information, which should be -bal so that the meta information for different calls can be combined when the calls are combined. Calls are edges in the call graph. It can be labelled with several call matrices if there are several pathes from one function to another. Call graph nodes.Machine integer ,T is sufficient, since we cannot index more than we have addresses on our machine.!Make a call with a single matrix.Make a call with empty cinfo.@Returns all the nodes with incoming edges. Somewhat expensive. O(e).MConverts a call graph to a list of calls with associated meta information.MConverts a list of calls with associated meta information to a call graph.#Takes the union of two call graphs.!Inserts a call into a call graph.-Call graph combination.Application of  to all pairs (c1,c2) for which   c1 =   c2.)"Call graph comparison. A graph cs' is `worse' than csy if it has a new edge (call) or a call got worse, which means that one of its elements that was better or equal to Le moved a step towards Un.A call graph is complete if combining it with itself does not make it any worse. This is sound because of monotonicity: By combining a graph with itself, it can only get worse, but if it does not get worse after one such step, it gets never any worse. cs completes the call graph csB. A call graph is complete if it contains all indirect calls; if f -> g and g -> h are present in the graph, then f -> h should also be present.?Displays the recursion behaviour corresponding to a call graph. is a monoid under .J: checks whether the call graph is completely disconnected.            --  fNone"#$+-03457;<=>?ACNQV]^ '2TODO: This comment seems to be partly out of date. cs( checks if the functions represented by cs terminate. The call graph cs should have one entry ( &) per recursive function application., perms: is returned if the functions are size-change terminating.,If termination can not be established, then , problems is returned instead. Here problemsG contains an indication of why termination cannot be established. See lexOrder for further details.KNote that this function assumes that all data types are strictly positive.The termination criterion is taken from Jones et al. In the completed call graph, each idempotent call-matrix from a function to itself must have a decreasing argument. Idempotency is wrt. matrix multiplication.This criterion is strictly more liberal than searching for a lexicographic order (and easier to implement, but harder to justify)."A call c! is idempotent if it is an endo (  ==  ) of order 1. (Endo-calls of higher orders are e.g. argument permutations). We can test idempotency by self-composition. Self-composition c >*< c: should not make any parameter-argument relation worse. !" !"gNone"#$+-03457;<=>?ACNQV]^ 3#Sometimes regular expressions aren't enough. Alex provides a way to do arbitrary computations to see if the input matches. This is done with a lex predicate.$nIn the lexer, regular expressions are associated with lex actions who's task it is to construct the tokens.(#This is what the lexer manipulates.*File.+Current position.,Current input.-Previously read character.. A lens for ,./,Get the previously lexed character. Same as -L. Alex needs this to be defined to handle "patterns with a left-context".0Lex a character. No surprises. This function is used by Alex 2.1 A variant of 0. This function is used by Alex 3.4Conjunction of #s.5Disjunction of #s.6 Negation of #s.#$%&'()*+,-./0123456()*+,-./01$#456'&%23()*+,-hNone"#$+-03457;<=>?ACKNQV]^ D 7IThe LookAhead monad is basically a state monad keeping with an extra (, wrapped around the  monad.8$Get the current look-ahead position.9Set the look-ahead position.:Lift a computation in the  monad to the 7 monad.;BLook at the next character. Fails if there are no more characters.<AConsume all the characters up to the current look-ahead position.=-Undo look-ahead. Restores the input from the .>!Consume the next character. Does ; followed by <.?Do a case on the current input string. If any of the given strings match we move past it and execute the corresponding action. If no string matches, we execute a default action, advancing the input one character. This function only affects the look-ahead position.@Same as ? but takes the initial character from the first argument instead of reading it from the input. Consequently, in the default case the input is not advanced.ARun a 77 computation. The first argument is the error function. 789:;<=>?@A 7A89:;><=?@---7--iNone"#$+-03457;<=>?ACNQV]^ W3 EALex a string literal. Assumes that a double quote has been lexed.FzLex a character literal. Assumes that a single quote has been lexed. A character literal is lexed in exactly the same way as a string literal. Only before returning the token do we check that the lexed string is of length 1. This is maybe not the most efficient way of doing things, but on the other hand it will only be inefficient if there is a lexical error.-Custom error function.-mThe general function to lex a string or character literal token. The character argument is the delimiter (" for strings and ' for characters).-oThis is where the work happens. The string argument is an accumulating parameter for the string being lexed.-A string gap consists of whitespace (possibly including line breaks) enclosed in backslashes. The gap is not part of the resulting string.-Lex a single character.-?Lex an escaped character. Assumes the backslash has been lexed.-$Read a number in the specified base.-Same as -$ but with an accumulating parameter.-The escape codes.EFEFlNone"#$+-03457;<=>?ACNQV]^ _[ Should comment tokens be output?\ Should comment tokens be output?],Manually lexing a block comment. Assumes an  open comment< has been lexed. In the end the comment is discarded and W" is called to lex a real token.^ Lex a hole ( {! ... !}#). Holes can be nested. Returns    ._Skip a block of text enclosed by the given open and close strings. Assumes the first open string has been consumed. Open-close pairs may be nested.[\]^_[\]^_mNone"#$+-03457;<=>?ACDNQV]^ w eCThis is the initial state for parsing a regular, non-literate file.f8The layout state. Entered when we see a layout keyword (S3) and exited either when seeing an open brace ( openBrace) or at the next token (Y)./Update: we don't use braces for layout anymore.-The state inside a pragma.gWe enter this state from Y when the token following a layout keyword is to the left of (or at the same column as) the current layout context. Example: )data Empty : Set where foo : Empty -> Nat(Here the second line is not part of the where8 clause since it is has the same indentation as the dataD definition. What we have to do is insert an empty layout block {} after the where;. The only thing that can happen in this state is that X] is executed, generating the closing brace. The open brace is generated when entering by Y.hThis state is entered at the beginning of each line. You can't lex anything in this state, and to exit you have to check the layout rule. Done with Z.i]This state can only be entered by the parser. In this state you can only lex the keywords using, hiding, renaming and to. Moreover they are only keywords in this particular state. The lexer will never enter this state by itself, that has to be done in the parser.jHReturn the next token. This is the function used by Happy in the parser.  lexer k = W >>= k-&Do not use this function; it sets the  to -.l3This is the main lexing function generated by Alex. `abcdefghijkl jekfghi`abcdl----------`abcd--nNone"#$+-03457;<=>?ACDNQV]^ m1Parse the token stream. Used by the TeX compiler.n3Parse an expression. Could be used in interactions.oNParse an expression followed by a where clause. Could be used in interactions.pParse a module.-Required by Happy.-Grab leading OPTIONS pragmas.-Insert a top-level module if there is none. Also fix-up for the case the declarations in the top-level module are not indented (this is allowed as a special case).-Create a name from a string.-.Create a qualified name from a list of strings-Create a qualified name from a string (used in pragmas). Range of each name component is range of whole string. TODO: precise ranges!-Polarity parser..Match a particular name..'Build a forall pi (forall x y z -> ...). Build a telescoping let (let Ds).+Converts lambda bindings to typed bindings..=Check that an import directive doesn't contain repeated namesrpBreaks up a string into substrings. Returns every maximal subsequence of zero or more characters distinct from -. splitOnDots "" == [""] splitOnDots "foo.bar" == ["foo", "bar"] splitOnDots ".foo.bar" == ["", "foo", "bar"] splitOnDots "foo.bar." == ["foo", "bar", ""] splitOnDots "foo..bar" == ["foo", "", "bar"].Returns ,= iff the name is a valid Haskell (hierarchical) module name..)Turn an expression into a left hand side..UTurn an expression into a pattern. Fails if the expression is not a valid pattern..UTurn an expression into a name. Fails if the expression is not a valid identifier.mnopqrpqnomr. . . . . ........... 9 . 9 jNone"#$+-03457;<=>?ACNQV]^ }G<True if the given state appears somewhere on the state stackH&True if we are at the end of the file.IHTrue when the given character is the next character of the input string.JParse a literal.K7Parse an identifier. Identifiers can be qualified (see Name). Example:  Foo.Bar.fLParse a   token.MParse a  ( token, triggers layout for  t.N8Exit the current state throwing away the current lexeme.O3Enter a new state throwing away the current lexeme.P4Exit the current state and perform the given action.Q/Enter a new state and perform the given action.R.Enter a new state without consuming any input.S)Executed for layout keywords. Enters the f( state and performs the given action.TLike U', but applies a function to the string.UParse a token from an  and the lexed string.V(The most general way of parsing a token.W-Scan the input to find the next token. Calls lL. This is the main lexing function where all the work happens. The function jB, used by the parser is the continuation version of this function..%Called at the end of a file. Returns  ..1Set the current input and lex a new token (calls W)..Use the input string from the previous input (with the appropriate number of characters dropped) instead of the fake input string that was given to Alex (with unicode characters removed)..mAlex 2 can't handle unicode characters. To solve this we translate all Unicode (non-ASCII) identifiers to z(, all Unicode operator characters to +/, and all whitespace characters (except for t and n) to ' '. Further, non-printable Unicode characters are translated to an arbitrary, harmless ASCII non-printable character, '\1'.:It is important that there aren't any keywords containing z, + or  .v3Return a token without looking at the lexed string.w2Exit the current state without consuming any input. Parse a possibly qualified name.GHIJKLMNOPQRSTUVWvwWVUTvSRwQPONMLKJIHGkNone"#$+-03457;<=>?ACNQV]^ ѢX&This action is only executed from the g/ state. It will exit this state, enter the h\ state, and return a virtual close brace (closing the empty layout block started by Y).YJStart a new layout context. This is one of two ways to get out of the f state (the other is x#). There are two possibilities:hThe current token is to the right of the current layout context (or we're in a no layout context).WThe current token is to the left of or in the same column as the current context.In the first case everything is fine and we enter a new layout context at the column of the current token. In the second case we have an empty layout block so we enter the gU state. In both cases we return a virtual open brace without consuming any input.@Entering a new state when we know we want to generate a virtual {} may seem a bit roundabout. The thing is that we can only generate one token at a time, so the way to generate two tokens is to generate the first one and then enter a state in which the only thing you can do is generate the second one.Z/Executed for the first token in each line (see hc). Checks the position of the token relative to the current layout context. If the token is to the leftZ : Exit the current context and a return virtual close brace (stay in the h state). same column : Exit the h/ state and return a virtual semi colon. to the right : Exit the h state and continue lexing.DIf the current block doesn't use layout (i.e. it was started by x%) all positions are considered to be  to the right.x$Executed upon lexing an open brace ('{'). Enters the  context.y$Executed upon lexing a close brace ('}'). Exits the current layout context. This might look a bit funny--the lexer will happily use a close brace to close a context open by a virtual brace. This is not a problem since the parser will make sure the braces are appropriately matched..MCompute the relative position of a location to the current layout context.SXYZxyxySZYXoNone"#$+-013457;<=>?ACKNQV]^ ivzThe size of a term is roughly the number of nodes in its syntax tree. This number need not be precise for logical correctness of Agda, it is only used for reporting (and maybe decisions regarding performance).'Not counting towards the term size are:sort and color annotations, projections.KPick the better name suggestion, i.e., the one that is not just underscore.#Constructing a singleton telescope. Drop the types from a telescope.Telescope as list.View type as equality type.reducedSort of this type.Builtin EQUALITY.Hidden. Empty or Level.Hidden NotHidden NotHiddenSubstitutions.Identity substitution.   " IdS : DEmpty substitution, lifts from the empty context. First argument is  IMPOSSIBLEK. Apply this to closed terms you want to use in a non-empty context.  " EmptyS : ()Substitution extension, `cons'. S  " u : A  "  :  ----------------------  " u :#  : , A /Strengthening substitution. First argument is  IMPOSSIBLEi. Apply this to a term which does not contain variable 0 to lower all de Bruijn indices by one. Y  "  :  ---------------------------  " Strengthen  : , A 8Weakning substitution, lifts to an extended context. I  "  :  ------------------- ,  " Wk ||  :  9Lifting substitution. Use this to go under a binder. Lift 1  == var 0 :# Wk 1 . X  "  :  ------------------------- ,  " Lift ||  : ,  7Extract pattern variables in left-to-right order. A + is also treated as variable (see docu for ).The ConPatternInfo= states whether the constructor belongs to a record type (Just) or data type (Nothing). In the former case, the Bool` says whether the record pattern orginates from the expansion of an implicit pattern. The Type is the type of the whole record pattern. The scope used for the type is given by any outer scope plus the clause's telescope ().Nothing if data constructor. Just if record constructor.AThe type of the whole constructor pattern. Should be present (Just]) if constructor pattern is is generated ordinarily by type-checking. Could be absent (Nothing]) if pattern comes from some plugin (like Agsy). Needed e.g. for with-clause stripping.+Type used when numbering pattern variables.7Patterns are variables, constructors, or wildcards. QName is used in ConP rather than Name since a constructor might come from a particular namespace. This also meshes well with the fact that values (i.e. the arguments we are matching with) use QName. x .tc ps= The subpatterns do not contain any projection copatterns.()W The argument is to keep track of the original pattern (before the absurd match).E.g. 5, "hello".1Projection copattern. Can only appear by itself.Pattern variables.3A clause is a list of patterns and the clause body. The telescope contains the types of the pattern variables and the de Bruijn indices say how to get from the order the variables occur in the patterns to the order they occur in the telescope. The body binds the variables in the order they appear in the telescope. <clauseTel ~ permute clausePerm (patternVars namedClausePats)8Terms in dot patterns are valid in the clause telescope.eFor the purpose of the permutation and the body dot patterns count as variables. TODO: Change this!9: The types of the pattern variables in dependency order. " ps". The de Bruijn indices refer to .Just v with  " v for a regular clause, or Nothing for an absurd one. " t. The type of the rhs under  clauseTel. Used, e.g., by  TermCheck . Can be XB if we encountered an irrelevant projection pattern on the lhs.%Clause has been labelled as CATCHALL.DClause has been labelled as unreachable by the coverage checker. NothingH means coverage checker has not run yet (clause may be unreachable).  Just False% means clause is not unreachable.  Just True means clause is unreachable. t without the t.4Something where a meta variable may block reduction.Even if we are not stuck on a meta during reduction we can fail to reduce a definition by pattern matching for another reason.The ' is neutral and blocks a pattern match.<Not enough arguments were supplied to complete the matching.2We matched an absurd clause, results in a neutral .We ran out of clauses, all considered clauses produced an actual mismatch. This can happen when try to reduce a function application but we are still missing some function clauses. See  Agda.TypeChecking.Patterns.Match.RReduction was not blocked, we reached a whnf which can be anything but a stuck .An atomic term of type Level.A meta variable targeting Level under some eliminations.A term of type Level& whose reduction is blocked by a meta.A neutral term of type Level.Introduced by  instantiate , removed by reduce.n, to represent Set .n + !.(A level is a maximum expression of 0..n C expressions each of which is a number or an atom plus a number.>The empty maximum is the canonical representation for level 0.Sorts.Set !. Dummy sort.Set.SizeUniv, a sort inhabited by type Size.Dependent least upper bound. If the free variable occurs in the second sort, the whole thing should reduce to Inf, otherwise it's the normal lub.VSequence of types. An argument of the first type is bound in later types and so on. is never .'Types are terms with a sort annotation. Binder. 2: The bound variable might appear in the body. P is pseudo-binder, it does not introduce a fresh variable, similar to the const of Haskell.6The body has (at least) one free variable. Danger: ! doesn't shift variables properlyNames in binders and arguments.5Eliminations, subsuming applications and projections. Application. Projection.   is name of a record projection. Raw values.Def is used for both defined and undefined constants. Assume there is a type declaration and a definition for every constant, even if the definition is an empty list of clauses.x es neutral+Terms are beta normal. Relevance is ignoredf es, possibly a delta/iota-redexc vs or record { fs = vs })dependent or non-dependent function spaceIrrelevant stuff in relevant position, but created in an irrelevant context. Basically, an internal version of the irrelevance axiom .irrAx : .A -> A.Explicit sharingStore the names of the record fields in the constructor. This allows reduction of projection redexes outside of TCM. For instance, during substitution and application.The name of the constructor.'Record constructors can be coinductive.GThe name of the record fields. Empty list for data constructors. 7B is not needed here since it is stored in the constructor args.Type of argument lists.When trying to reduce f es(, on match failed on one elimination e " es that came with info r :: NotBlocked.  stuckOn e r produces the new  NotBlocked info.i must be propagated, as this is blockage that can be lifted in the future (as more clauses are added). e0F is also propagated, since it provides more precise information as  StuckOn e (as e0L is the original reason why reduction got stuck and usually a subterm of e). An information like %StuckOn (Apply (Arg info (Var i [])))u (stuck on a variable) could be used by the lhs/coverage checker to trigger a split on that (pattern) variable.In the remaining cases for r$, we are terminally stuck due to  StuckOn e. Propagating  does not seem useful.4 must not be propagated, as this would mean that f esD is underapplied, which is not the case (it is stuck). Note that \ can only arise when projection patterns were missing to complete the original match (in e/). (Missing ordinary pattern would mean the eQ is of function type, but we cannot match against something of function type.)Build partial  from Build  from .1Does the pattern perform a match that could fail?QAbsurd lambdas are internally represented as identity with variable name "()".Remove top-level Shared data constructors.Introduce sharing.0Typically m would be TCM and f would be Blocked.An unapplied variable. Add  is it is not already a DontCare.! A dummy type."Top sort (Setomega).%Get the next higher sort.,)A traversal for the names in a telescope.0(Convert a list telescope to a telescope.1%Convert a telescope to its list form.5Removing a topmost  constructor.6Doesn't do any reduction.7!Make a name that is not in scope.8>Convert top-level postfix projections into prefix projections.9Convert / projection eliminations according to their  into  projection applications.:#A view distinguishing the neutrals Var, Def, and MetaV which can be projected.;Drop  constructor. (Unsafe!)<Drop  constructor. (Safe)=Drop  constructors. (Safe)>Split at first non-?Discard Proj f entries.@ Discards Proj f entries.ADrop  constructors. (Safe)JThis instance cheats on , use with care. s are always assumed to be M, since they have no ?.P2The size of a telescope is its length (as a list).Y is the unit.  is dominant. {}1 should be propagated, if tied, we take the left._Blocking by a meta is dominant.gA JL clause is one with no patterns and no rhs. Should not exist in practice.The  PatVarName is a name suggestion.#eliminations ordered left-to-right.                           ! " # $ % & ' (z{|}~      !"#$%&'()*+,-./0123456789:;<=>?@A&FEDCHGJNZ]\[YX_a`h     kjiel !"#$%&'()*+,-./01onrqp234567vuts89:;<=>}~w?@AQgMPLz{|~}|{zyxBWVUTSRmcbdfO^KIz{|}~  4pNone"#$+-03457;<=>?ACNQV]^ z~yThings we can substitute for a variable. Needs to be able to represent variables, e.g. for substituting under binders.+Produce a variable without name suggestion.(Produce a variable with name suggestion.=Are we dealing with a variable? If yes, what is its index?We can substitute Terms for variables.qNone"#$+-03457;<=>?ACNQV]^ &Gather free variables in a collection.The current context.Ignore free variables in sorts.Are we flexible or rigid?What is the current relevance?#Method to return a single variable.5Where should we skip sorts in free variable analysis? Do not skip.Skip when annotation to a type.Skip unconditionally.Any representation of a set of variables need to be able to be modified by a variable occurrence. This is to ensure that free variable analysis is compositional. For instance, it should be possible to compute `fv (v [u/x])` from `fv v` and `fv u`.#Laws * Respects monoid operations: ``` withVarOcc o mempty == mempty withVarOcc o (x <> y) == withVarOcc o x <> withVarOcc o y ``` * Respects VarOcc composition ``` withVarOcc (composeVarOcc o1 o2) = withVarOcc o1 . withVarOcc o2 ```XOccurrence of free variables is classified by several dimensions. Currently, we have  and U.Depending on the surrounding context of a variable, it's occurrence can be classified as flexible or rigid, with finer distinctions.KThe constructors are listed in increasing order (wrt. information content).In arguments of metas.*In arguments to variables and definitions.=In top position, or only under inductive record constructors.3Under at least one and only inductive constructors.: composition. For accumulating the context of a variable.W is dominant. Once we are under a meta, we are flexible regardless what else comes.0 is next in strength. Destroys strong rigidity. is still dominant over .0 is the unit. It is the top (identity) context.JWhen we extract information about occurrence, we care most about about  V occurrences.?First argument is the outer occurrence and second is the inner.The initial context.Run function for FreeM.Base case: a variable.3Subtract, but return Nothing if result is negative.Going under a binder. Changing the  context. Changing the U.<What happens to the variables occurring under a constructor?*=     rNone"#$+-03457;<=>?ACKNQV]^ %!3Under at least one and only inductive constructors.=In top position, or only under inductive record constructors. *In arguments to variables and definitions.!In arguments of metas.#Free variables of a term, (disjointly) partitioned into strongly and and weakly rigid variables, flexible variables and irrelevant variables.%?Variables under only and at least one inductive constructor(s).&Variables at top or only under inductive record constructors s and s. The purpose of recording these separately is that they can still become strongly rigid if put under a constructor whereas weakly rigid ones stay weakly rigid.':Ordinary rigid variables, e.g., in arguments of variables.(Variables occuring in arguments of metas. These are only potentially free, depending how the meta variable is instantiated. The set contains the id's of the meta variables that this variable is an argument to.).Variables in irrelevant arguments and under a DontCare#, i.e., in irrelevant positions.* Variables in  UnusedArguments.+CRigid variables: either strongly rigid, unguarded, or weakly rigid.,!All but the irrelevant variables.- allVars fv includes irrelevant variables..ICompute an occurrence of a single variable in a piece of internal syntax..EExtract occurrence of a single variable from computed free variables..GMark variables as flexible. Useful when traversing arguments of metas.. UMark rigid variables as non-strongly. Useful when traversing arguments of variables..!hMark unguarded variables as strongly rigid. Useful when traversing arguments of inductive constructors.."<What happens to the variables occurring under a constructor?.#&Mark all free variables as irrelevant..$>Mark all free variables as unused, except for irrelevant vars..%Pointwise union..& delete x fv deletes variable x from variable set fv./\Doesn't go inside solved metas, but collects the variables from a metavariable application X ts as  flexibleVars.0Compute free variables..'5Check if a variable is free, possibly ignoring sorts.57Is the variable bound by the abstraction actually used?60Is the term entirely closed (no free variables)?7Collect all free variables.8ZCollect all relevant free variables, excluding the "unused" ones, possibly ignoring sorts.9ACollect all relevant free variables, excluding the "unused" ones.A'Free variable sets form a monoid under .%.'"! #$%&'()*+,-./0123456789(#$%&'()*0+,-79812543 !".6/.(.).* !"#$%&'()*sNone"#$+-03457;<=>?ACNQV]^ KJApply a substitution.L(abstract args v) O args --> v[args].NmApply something to a bunch of arguments. Preserves blocking tags (application can never resolve blocking).Q Apply to some default arguments.R#Apply to a single default argument.UReplace de Bruijn index i by a  in something.WBReplace what is now de Bruijn index 0, but go under n binders. %substUnder n u == subst n (raise n u).\To replace index n by term u, do applySubst (singletonS n u). l ,  " u : A --------------------------------- ,  " singletonS || u : , A,  ]@Single substitution without disturbing any deBruijn indices. m , A,  " u : A --------------------------------- , A,  " inplace || u : , A,  ^$Lift a substitution under k binders._ I  "  : ,  -------------------  " dropS ||  :  ` applySubst ( `& ) v == applySubst  (applySubst  v)c   "  :   " reverse vs :  ----------------------------- (treating Nothing as having any type)  " prependS vs  : ,  f " (strengthenS " ||) : ,h/Instantiate an abstraction. Strict in the term.iFInstantiate an abstraction. Lazy in the term, which allow it to be  IMPOSSIBLEG in the case where the variable shouldn't be used but we cannot use j. Used in Apply.j9Instantiate an abstraction that doesn't use its argument.nunderAbs k a b applies k to a# and the content of abstraction b# and puts the abstraction back. aM is raised if abstraction was proper such that at point of application of k and the content of b. are at the same context. Precondition: a and b& are at the same context at call time.ounderLambdas n k a b drops n initial s from b, performs operation k on a and the body of b, and puts the  s back. a@ is raised correctly according to the number of abstractions.&JKLMNPOQRSTUVWXYZ[\]^_`abcdefghijklmno'NOPQRLMJKSTUVWpXYZ[\]^_`abcdefghijklmnoJKLMNOPb4tNone"#$+-03457;<=>?ACNQV]^ s, for root of split treevSplit tree branching. A finite map from constructor names to splittrees A list representation seems appropriate, since we are expecting not so many constructors per data type, and there is no need for random access.wAbstract case tree shape.x@No more splits coming. We are at a single, all-variable clause.yA split is necessary.z+The number of variables bound in the clause{Arg. no to split at.|Sub split trees.Convert a split tree into a 9 (for printing).qrutsvwyx|{z}~~}wxyz{|vqrstuqrstuwxyz{|uNone"#$+-03457;<=>?ACFNQTV]^ WGeneric term traversal.ONote: ignores sorts in terms! (Does not traverse into or collect from them.)?Generic traversal with post-traversal action. Ignores sorts.Generic fold, ignoring sorts.5Put it in a monad to make it possible to do strictly.vNone"#$+-013457;<=>?ACNQV]^ % Case tree with bodies. Case n bs stands for a match on the n(-th argument (counting from zero) with bs as the case branches. If the n+-th argument is a projection, we have only  with arity 0. Done xs b stands for the body b where the xs contains hiding and name suggestions for the free variables. This is needed to build lambdas on the right hand side for partial applications which can still reduce. Absurd case.Branches in a case tree.3We are constructing a record here (copatterns).  lists projections.oMap from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)!Map from literal to case subtree.'(Possibly additional) catch-all clause.1Check whether a case tree has a catch-all clause.#wNone"#$+-03457;<=>?ACFNQTV]^ Getting the used definitions.Note: in contrast to u: getDefsF also collects from sorts in terms. Thus, this is not an instance of foldTerm.*What it takes to get the used definitions.Inputs to and outputs of getDefs' are organized as a monad.getDefs' lookup emb aF extracts all used definitions (functions, data/record types) from a, embedded into a monoid via emb7. Instantiations of meta variables are obtained via lookup."Typical monoid instances would be [QName] or  Set QName. Note that embV can also choose to discard a used definition by mapping to the unit of the monoid. xNone"#$+-013457;<=>?ACNQV]^ vq,Parameterised over the type of dot patterns.Destructor pattern d.%Defined pattern: function definition f psw. It is also abused to convert destructor patterns into concrete syntax thus, we put AmbiguousQName here as well.\Underscore pattern entered by user. Or generated at type checking for implicit arguments. Dot pattern .e: the Origin keeps track whether this dot pattern was written by the user or inserted by the system (e.g. while expanding the ellipsis in a with clause).-Convert a focused lhs to spine view and back.The lhs minus withI-patterns in projection-application view. Parameterised over the type e of dot patterns.&The head applied to ordinary patterns. ProjectionHead f.Applied to patterns ps.Record projection identifier. Main branch.Further applied to patterns.tThe lhs of a clause in focused (projection-application) view (outside-in). Projection patters are represented as s.Range.  Copatterns. with patterns (after |). XThe lhs of a clause in spine view (inside-out). Projection patterns are contained in  spLhsPats, represented as ProjP d. Range.!Name of function we are defining.Function parameters (patterns).with patterns (after |).The  " is the name of the with function.sWe store the original concrete expression in case we have to reproduce it during interactive case splitting. , for internally generated rhss.The  As are the names of the generated with functions, one for each t.The RHS should not be another  RewriteRHS.&The where clauses are attached to the  RewriteRHS byWe could throw away where0 clauses at this point and translate them to let,. It's not obvious how to remember that the let was really a where6 clause though, so for the time being we keep it here. Only in with-clauses where we inherit some already checked dot patterns from the parent. These live in the context of the parent clause left-hand side.!In with-clauses where a dot pattern from the parent clause is repeated in the with-clause. In this case it's not actually part of the clause, but it still needs to be checked (Issue 142).*A typed binding. Appears in dependent function spaces, typed lambdas, and telescopes. It might be tempting to simplify this to only bind a single name at a time, and translate, say,  (x y : A) to (x : A)(y : A)G before type-checking. However, this would be slightly problematic: $We would have to typecheck the type A several times.If AX contains a meta variable or hole, it would be duplicated by such a translation.SWhile 1. is only slightly inefficient, 2. would be an outright bug. Duplicating A~ could not be done naively, we would have to make sure that the metas of the copy are aliases of the metas of the original.+As in telescope  (x y z : A) or type (x y z : A) -> B.,E.g.  (let x = e) or  (let open M).-'Typed bindings with hiding information... (xs : e) or {xs : e}/0A lambda binding is either domain free or typed.0. x or {x} or .x or .{x}1. (xs:e) or {xs:e} or (let Ds)4Only ms.5Bindings that are valid in a let.6 LetBind info rel name type defn7Irrefutable pattern binding.8*LetApply mi newM (oldM args) renamings dir. The ImportDirective is for highlighting purposes.9,only for highlighting and abstractToConcrete:?Only used for highlighting. Refers to the first occurrence of x in let x : A; x = e.>WBuiltins that do not come with a definition, but declare a name for an Agda concept.I:For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop).N tel. M args : applies M to args and abstracts tel.O  M {{...}}V3Type signature (can be irrelevant, but not hidden).PThe fourth argument contains an optional assignment of polarities to arguments.W record fieldXprimitive functionY)a bunch of mutually recursive definitions[The ImportDirective is for highlighting purposes.\The ImportDirective is for highlighting purposes.^'only retained for highlighting purposes_sequence of function clauses`lone data signatureathe /s are 0) and bind the parameters of the datatype.blone record signaturecThe /s are 01 and bind the parameters of the datatype. The t' gives the constructor type telescope, (x1 : A1)..(xn : An) -> Prop5, and the optional name is the constructor's name.dOnly for highlighting purposesgscope annotationlRenaming (generic).mIs a type signature a  postulate or a function signature?nA function signature.oyNot a function signature, i.e., a postulate (in user input) or another (e.g. data/record) type signature (internally).sRecord field assignment f = e.tDExpressions after scope checking (operators parsed, names resolved).uBound variable.v/Constant: axiom, function, data or record type.wProjection (overloaded).xConstructor (overloaded).yPattern synonym.zMacro.{Literal.|&Meta variable for interaction. The " is usually identical with the A of =B. However, if you want to print an interaction meta as just ? instead of ?n, you should set the A to , while keeping the .}=Meta variable for hidden argument (must be inferred locally).~.e, for postfix projection.Ordinary (binary) application.With application. bs ! e.() or {}.Dependent function space  ! A.Non-dependent function space.Set, Set1, Set2, ...Prop+ (no longer supported, used as dummy type). let bs in e.#Only used when printing telescopes.Record construction.Record update.Scope annotation.Binds Name to current type in Expr.Returns the current context.Quote an identifier  . Quote a term.#The splicing construct: unquote ...  tactic e x1 .. xn | y1 | .. | yn For printing DontCare from Syntax.Internal.@Add applicative patterns (non-projection patterns) to the right.5Add projection and applicative patterns to the right.$Used for checking pattern linearity.Used in AbstractToConcrete.List instance (for clauses).Does not compare  fields.Does not compare H fields. Does not distinguish between prefix and postfix projections. LHS instance.Clause instance.Are we in an abstract block?)In that case some definition is abstract./Extracts all the names which are declared in a U. This does not include open public or let expressions, but it does include local modules, where clauses and the names of extended lambdas.$The name defined by the given axiom.3Precondition: The declaration has to be a (scoped) m.Turn an d to an expression.                           ! " # $ % & ' (     $ !"#%&'()*,+-./0123456789:;<=?DCABEFG@HJKIL>MNOPQRSTU][X^YW_aV`\efZbcdghijklmnopqrstx{~vu}|yzw !tuvwxyz{|}~srqpmnolhijkUVWXYZ[\]^_`abcdefgSTRQPMNO;<=>?@ABCDEFGHIJKL56789:432/01-.*+,)'(%& !"#$          "10/.-,+*)('&%$#32 ?>=<;:987654!        !"#$%&'(*+,-./0156789:;<=>?@ABCDEFGHIJKLMNOSTUVWXYZ[\]^_`abcdefghijkmnotuvwxyz{|}~yNone"#$+-03457;<=>?ACFNQTV]^ '@Generic pattern traversal.KPre-applies a pattern modification, recurses, and post-applies another one.A Fold pattern.BTraverse pattern.EyLabel the pattern variables from left to right using one label for each variable pattern and one for each dot pattern.GJIntended, but unpractical due to the absence of type-level lambda, is: @labelPatVars :: f (Pattern' x) -> State [i] (f (Pattern' (i,x)))H+Arity of a function, computed from clauses.J\Translate the clause patterns to terms with free variables bound by the clause telescope.%Precondition: no projection patterns.KkTranslate the clause patterns to an elimination spine with free variables bound by the clause telescope.L5Augment pattern variables with their de Bruijn index.OOComputes the permutation from the clause telescope to the pattern variables.Use as  fromMaybe  IMPOSSIBLE . dbPatPermK to crash in a controlled way if a de Bruijn index is out of scope here.OThe first argument controls whether dot patterns counts as variables or not.POComputes the permutation from the clause telescope to the pattern variables.Use as  fromMaybe  IMPOSSIBLE . clausePermK to crash in a controlled way if a de Bruijn index is out of scope here.QTurn a pattern into a term. Projection patterns are turned into projection eliminations, other patterns into apply elimination.TFCompute from each subpattern a value and collect them all in a monoid.UETraverse pattern(s) with a modification before the recursive descent.VDTraverse pattern(s) with a modification after the recursive descent.W!Get the number of common initial  patterns in a list of clauses.XGet the number of initial  patterns in a clause.YGet the number of initial  patterns.^Modify the content of VarP, and the closest surrounding NamedArg. Note: the  mapNamedArg for Pattern'! is not expressible simply by fmap or traverse etc., since ConP has NamedArg1 subpatterns, which are taken into account by  mapNamedArg.A>Combine a pattern and the value computed from its subpatterns.Bpre : Modification before recursion.post: Modification after recursion.Upre : Modification before recursion.Vpost: Modification after recursion.@BACDEGFHIJKLMNOPQRSTUV'JKHIYXWEFGFG]\[ZLMNOPQRSCD^@AABBTUVba`_@AABBCDEFGFGHIzNone"#$&'+-03457;<=>?ACNQV]^ cIApply an expression rewriting to every subexpression, inside-out. See Agda.Syntax.Internal.Generic.dEThe first expression is pre-traversal, the second one post-traversal.hCollects plain lambdas.l-Gather applications to expose head and spine.ENote: everything is an application, possibly of itself to 0 argumentspGather top-level %atterns to expose underlying pattern.q-Check whether we are dealing with a universe.r Remove top  wrappers.sRemove  wrappers everywhere.!NB: Unless the implementation of cF for clauses has been finished, this does not work for clauses yet.cdefghijklmnopqrstu+jklmnhiopqrstucddefg~}|{zyxwvcddefghijk{None"#$+-03457;<=>?ACFNQTV]^ Generic pattern traversal. Fold pattern.Traverse pattern.FCompute from each subpattern a value and collect them all in a monoid.ETraverse pattern(s) with a modification before the recursive descent.DTraverse pattern(s) with a modification after the recursive descent.9Collect pattern variables in left-to-right textual order.4Check if a pattern contains a specific (sub)pattern.@Check if a pattern contains an absurd pattern. For instance, suc () , does so.+Precondition: contains no pattern synonyms.)Check if a pattern contains an @-pattern.+Precondition: contains no pattern synonyms.>Combine a pattern and the value computed from its subpatterns.pre : Modification before recursion.post: Modification after recursion.pre : Modification before recursion.post: Modification after recursion. |None "#$&'+,-03457;<=>?ACFNQSTV]^ U Currying as b# witnesses the isomorphism between  Arrows as b and Products as -> bO. It is defined as a type class rather than by recursion on a singleton for asX so all of that these conversions are inlined at compile time for concrete arguments.Using IsBase we can define notions of Domains and  CoDomains. which *reduce* under positive information IsBase t ~ 'True even though the shape of t is not formally exposedIsBase t is 'True whenever t is *not* a function space.Arrows [a1,..,an] r corresponds to a1 -> .. -> an -> r | Products [a1,..,an] corresponds to (a1, (..,( an, ())..)) Version of FoldrV taking a defunctionalised argument so that we can use partially applied functions.On Lists On BooleansAll p as ensures that the constraint p is satisfied by all the types in asZ. (Types is between scare-quotes here because the code is actually kind polymorphic)}None"#$+-03457;<=>?ACKNQV]^ l Like  Bifunctor, but preserving sharing.Like ,, but preserving sharing.The Change monad..+The ChangeT monad transformer.The class of change monads.Run a 0 computation, returning result plus change flag.Blindly run an updater.Mark a computation as dirty.FReplace result of updating with original input if nothing has changed..,Eval an updater (using ).A mock change monad. = sharing . updater1-Mark computation as having changed something..-...+./.0~None"#$&'+-013457;<=>?ACNQV]^ 1<.1Make a declaration private.*Andreas, 2012-11-17: Mark computation as v if there was a declaration that could be privatized. If no privatization is taking place, we want to complain about ."Alternatively, we could only flag 6 if a non-private thing was privatized. Then, nested private+s would sometimes also be complained about..2Make a declaration abstract.Mark computation as w if there was a declaration that could be made abstract. If no abstraction is taking place, we want to complain about ."Alternatively, we could only flag 7 if a non-abstract thing was abstracted. Then, nested abstract+s would sometimes also be complained about..3Nicifier state..44Lone type signatures that wait for their definition..55Termination checking pragma waiting for a definition..64Positivity checking pragma waiting for a definition..7.Catchall pragma waiting for a function clause..8(Stack of warnings. Head is last warning.ANicifier monad. Preserve the state when throwing an exception..9@The kind of the forward declaration, remembering the parameters..:$Name of a data type with parameters..;&Name of a record type with parameters..<Name of a function..=we are nicifying a mutual block.>,we are nicifying decls not in a mutual block.?QSeveral declarations expect only type signatures as sub-declarations. These are:.@  postulate.A primitive. Ensured by parser..BinstanceE. Actually, here all kinds of sub-declarations are allowed a priori..Cfield. Ensured by parser..Ddata ... where=. Here we got a bad error message for Agda-2.5 (Issue 1698).,Non-fatal errors encountered in the NicifierThe exception type. of symbol, .E of signature, .E of definition.7in a mutual block, a clause could belong to any of the [Name] type signaturesRIn a mutual block, all or none need a MEASURE pragma. Range is of mutual block.Pragma {- NO_TERMINATION_CHECK -} has been replaced by {- TERMINATING  -} and {- NON_TERMINATING -}.DOne clause in a function definition. There is no guarantee that the  ? actually declares the #. We will have to check that later.Only s.Only s.1Termination measure is, for now, a variable name.The nice declarations. No fixity declarations and function definitions are contained in a single constructor instead of spread out between type signatures and clauses. The private,  postulate, abstract and instanceD modifiers have been distributed to the individual declarations. Observe the order of components:oRange Fixity' Access IsAbstract IsInstance TerminationCheck PositivityCheckfurther attributes(Q)Namecontent (Expr, Declaration ...): argument: We record whether a declaration was made in an abstract block.?@ argument: Axioms and functions can be declared irrelevant. (e should be h.)Maybe [Occurrence]5 argument: Polarities can be assigned to identifiers. An uncategorized function clause, could be a function clause without type signature or a pattern lhs (e.g. for irrefutable let). The   is the actual  .KBlock of function clauses (we have seen the type signature before). The  As are the original declarations that were processed into this  and are only used in notSoNiceDeclaration9. Andreas, 2017-01-01: Because of issue #2372, we add  6 here. An alias should know that it is an instance..FCheck that declarations in a mutual block are consistently equipped with MEASURE pragmas, or whether there is a NO_TERMINATION_CHECK pragma..GoCheck that the parameters of the data/record definition match the parameters of the corresponding signature.nThe definition may omit some hidden parameters. The names need to match. The types are not checked here.CPrecondition: the signature and definition have the same kind (datarecordfun).SRun a Nicifier computation, return result and warnings (in chronological order)..HInitial nicifier state..ILens for field .4..J%Adding a lone signature to the state..K'Remove a lone signature from the state..L"Search for forward type signature..M4Check that no lone signatures are left in the state..NBEnsure that all forward declarations have been given a definition..OLens for field .5..PLens for field .6..QLens for field .7..R>Get current catchall pragma, and reset it for the next clause..SAdd a new warning..T4Check whether name is not "_" and return its fixity..UFail if the name is _Q. Otherwise the name's polarity, if any, is removed from the state and returned..V?Compute parameters of a data or record signature or definition.Main..WAdd more fixities. Throw an exception for multiple fixity declarations. OR: Disjoint union of fixity maps. Throws exception if not disjoint..XGet the fixities and polarity pragmas from the current block. Doesn't go inside modules and where blocks. The reason for this is that these declarations have to appear at the same level (or possibly outside an abstract or mutual block) as their target declaration.(Approximately) convert a  back to a list of  s.Has the  a field of type ? While .Y~ and Polarities are not semigroups under disjoint union (which might fail), we get a semigroup instance for the monadic Nice (Fixities, Polarities)% which propagates the first error.&Contents of a where& clause are abstract if the parent is..Z(Stack of warnings. Head is last warning..GThe data/record name.The data/record signature.6The parameters as given in the data/record definition.<     <      .1.[.[.2.\.\.].^._.`.3.a.4.5.6.7.b.c.8.d.e.9.:.;.<.f.g.f.g.h.=.>.?.@.A.B.C.D     None"#$+-013457;<=>?ACKNQV]^ ;[ AWrapped Parser type.B"A monad for handling parse results.iExtensions supported by HIParses a module.JParses a module name.KParses an expression.L0Parses an expression followed by a where clause.M3Gives the parsed token stream (including comments)..j9Keep comments in the token stream generated by the lexer..k@Do not keep comments in the token stream generated by the lexer.wxyz{|}~ABCDEFGHIJKLMAFGHIJKLMz{|}~wxyBCDEA.l.m.n.oBCDSafe"#$+-03457;<=>?ACNQV]^ =aSTSTNone"#$+-03457;<=>?ACNQV]^ a%.p Return type of fold over syntax..qIgnore free variables in sorts..r'Under how many binders have we stepped?V5Where should we skip sorts in free variable analysis?W Do not skip.XSkip when annotation to a type.YSkip unconditionally.]3Under at least one and only inductive constructors.^=In top position, or only under inductive record constructors._*In arguments to variables and definitions.`In arguments of metas.bFree variables of a term, (disjointly) partitioned into strongly and and weakly rigid variables, flexible variables and irrelevant variables.d?Variables under only and at least one inductive constructor(s).eVariables at top or only under inductive record constructors s and s. The purpose of recording these separately is that they can still become strongly rigid if put under a constructor whereas weakly rigid ones stay weakly rigid.f:Ordinary rigid variables, e.g., in arguments of variables.g~Variables occuring in arguments of metas. These are only potentially free, depending how the meta variable is instantiated.h.Variables in irrelevant arguments and under a DontCare#, i.e., in irrelevant positions.i Variables in  UnusedArguments.jCRigid variables: either strongly rigid, unguarded, or weakly rigid.k!All but the irrelevant variables.l allVars fv includes irrelevant variables..sGMark variables as flexible. Useful when traversing arguments of metas..tUMark rigid variables as non-strongly. Useful when traversion arguments of variables..uhMark unguarded variables as strongly rigid. Useful when traversion arguments of inductive constructors..v<What happens to the variables occurring under a constructor?.w&Mark all free variables as irrelevant..x>Mark all free variables as unused, except for irrelevant vars..yPointwise union..z delete x fv deletes variable x from variable set fv..{subtractFV n fv* subtracts $n$ from each free variable in fv..|A single unguarded variable.n\Doesn't go inside solved metas, but collects the variables from a metavariable application X ts as  flexibleVars..}Base case: a variable..~Going under a binder..Going under n binders.u7Is the variable bound by the abstraction actually used?w'Free variable sets form a monoid under .y.!UVYWXZa`_^][\bcdefghijklmnopqrstu!bcdefghiUVWXYnolkjpuqrtsZ[\]^_`amU....q.rVWXYZ[\]^_`abcdefghiNone"#$+-03457;<=>?ACKNQV]^ | e.g. x + 5a number or infinitybA solution assigns to each flexible variable a size expression which is either a constant or a v + n for a rigid variable v."A matrix with row descriptions in b and column descriptions in c.6The Graph Monad, for constructing a graph iteratively.Scope for each flexible var.Node labels to node numbers.Node numbers to node labels.Number of nodes n.The edges (restrict to [0..n[).%A constraint is an edge in the graph.For  Arc v1 k v2 at least one of v1 or v2 is a MetaV+ (Flex), the other a MetaV or a Var (Rigid). If k <= 0 this means suc^(-k) v1 <= v2 otherwise v1 <= suc^k v3.3Which rigid variables a flex may be instatiated to.QNodes of the graph are either - flexible variables (with identifiers drawn from Int*), - rigid variables (also identified by Int<s), or - constants (like 0, infinity, or anything between)..Edge weight in the graph, forming a semi ring.AWarshall's algorithm on a graph represented as an adjacency list.isBelow r w r' checks, if r and r' are connected by w (meaning w not infinite), whether  r + w <= r'/. Precondition: not the same rigid variable.EThe empty graph: no nodes, edges are all undefined (infinity weight).Add a size meta node.BLookup identifier of a node. If not present, it is added first.addEdge n1 k n2 improves the weight of egde n1->n2 to be at most k(. Also adds nodes if not yet present. sizeRigid r n. returns the size expression corresponding to r + n5<;Safe"#$+-03457;<=>?ACNQV]^ ........Safe"#$+-03457;<=>?ACNQV]^ ,The version of Agda.None"#$+-03457;<=>?ACNQV]^ 8?Information about current git commit, generated at compile timeNone"#$+-03457;<=>?ACNQV]^ œThrows -1 exceptions.. Collects .s..0Collected errors while processing library files..FRaised when a library name could no successfully be resolved to an  .agda-lib file..1Raised when a library name is defined in several .agda-lib files..Generic error.YLibrary names are structured into the base name and a suffix of version numbers, e.g.  mylib-1.2.3". The version suffix is optional.Actual library name.Major version, minor version, subminor version, etc., all non-negative. Note: a priori, there is no reason why the version numbers should be Ints..Raise collected  LibErrors as exception..Get the path to ~/.agda1 (system-specific). Can be overwritten by the AGDA_DIR environment variable.s(This is not to be confused with the directory for the data files that Agda needs (e.g. the primitive modules).).The ~.agda librariesD file lists the libraries Agda should know about. The content of  libraries is is a list of pathes to  .agda-lib files."Agda honors also version specific  libraries files, e.g. libraries-2.6.0.defaultLibraryFiles gives a list of all  libraries) files Agda should process by default..The  defaultsFileA contains a list of library names relevant for each Agda project..Get pathes of  .agda-lib files in given project root.EIf there are none, look in the parent directories until one is found.:Get dependencies and include paths for given project root: Look for  .agda-lib files according to .?. If none are found, use default dependencies (according to defaults/ file) and current directory (project root)../Return list of libraries to be used by default. None if the defaults file does not exist..Returns the path of the  libraries1 file which lists the libraries Agda knows about.Note: file may not exist.9Parse the descriptions of the libraries Agda knows about.Returns none if there is no  libraries file..Parse the given library files...Remove trailing white space and line comments.. Pretty-print ..6Get all include pathes for a list of libraries to use..findLib x libs retrieves the matches for x from list libs. Case x is unversioned: If x is contained in libsi, then that match is returned. Otherwise, the matches with the highest version number are returned.Case xH is versioned: the matches with the highest version number are returned.Examples, see .Generalized version of . for testing. DfindLib' id "a" [ "a-1", "a-02", "a-2", "b" ] == [ "a-02", "a-2" ] findLib' id "a" [ "a", "a-1", "a-01", "a-2", "b" ] == [ "a" ] findLib' id "a-1" [ "a", "a-1", "a-01", "a-2", "b" ] == [ "a-1", "a-01" ] findLib' id "a-2" [ "a", "a-1", "a-01", "a-2", "b" ] == [ "a-2" ] findLib' id "c" [ "a", "a-1", "a-01", "a-2", "b" ] == [].x . y if x and y have the same vvBase and either x5 has no version qualifier or the versions also match.ASplit a library name into basename and a list of version numbers. sversionView "foo-1.2.3" == VersionView "foo" [1, 2, 3] versionView "foo-01.002.3" == VersionView "foo" [1, 2, 3]$Note that because of leading zeros,  versionView is not injective. (unVersionView . versionView would produce a normal form.)Print a  VersionView , inverse of  versionView (modulo leading zeros).. Project root. Pathes of  .agda-lib! files for this project (if any). Project root.Use defaults if no  .agda-lib file exists for this project? The returned LibNames are all non-empty strings..Override the default  libraries file?Override the default  libraries file?-Content of library files. (Might have empty LibNames.).Name of  libraries file for error reporting./Library files paired with their line number in  libraries.-Content of library files. (Might have empty LibNames.) libraries file (error reporting only).Libraries Agda knows about.>(Non-empty) library names to be resolved to (lists of) pathes.2Resolved pathes (no duplicates). Contains "." if  [LibName] does. ( (....Safe"#$+-03457;<=>?ACNQV]^ .=Action to be carried out for copying a directory recursively..Create directory if missing..Copy file if changed.copyDirContent src dest recursively copies directory src onto dest.WFirst, a to-do list of copy actions is created. Then, the to-do list is carried out.MThis avoids copying files we have just created again, which can happen if src and dest( are not disjoint. (See issue #2705.).Perform scheduled ...copyDirContentDryRun src dest; creates a to-do list for recursively copying directory src onto dest..copyIfChanged src dst makes sure that dst' exists and has the same content as dst....None"#$+-03457;<=>?ACNQV]^ f :: Flag optsO is an action on the option record that results from parsing an option. f optsC produces either an error message or an updated options recordThe options from an OPTIONS pragma.In the future it might be nice to switch to a more structured representation. Note that, currently, there is not a one-to-one correspondence between list elements and options.%Options which can be set in a pragma.ICut off structural order comparison at some depth in termination checker?+irrelevant levels, irrelevant data matching(Allow definitions by copattern matching?0Is pattern matching allowed in the current file?$Can rewrite rules be added and used?$Should system generated projections  ProjSystem0 be printed postfix (True) or prefix (False). -Use this (if Just) instead of .agda/libraries Use ~.agdadefaults look for .agda-lib files2In the absence of a path the project root is used.PCount extended grapheme clusters rather than code points when generating LaTeX. KShould the top-level module only be scope-checked, and not type-checked?)'This should probably go somewhere else.*Map a function over the long options. Also removes the short options. Will be used to add the plugin name to the plugin options./The default termination depth..'The default output directory for LaTeX..&The default output directory for HTML..The default warning mode.1-Checks that the given options are consistent.2;Check for unsafe pramas. Gives a list of used unsafe flags.5Used for printing usage info.6gSimple interface for System.Console.GetOpt Could be moved to Agda.Utils.Options (does not exist yet)7Parse the standard options.9%Parse options from an options pragma.:Parse options for a plugin.;LThe usage info message. The argument is the program name (probably agda).<_Returns the absolute default lib dir. This directory is used to store the Primitive.agda file.6command line argument wordsoptions handlers,handler of non-options (only one is allowed)(combined opts data structure transformer9Pragma options.-Command-line options which should be updated.`      !"#$%&'()*+,-./0123456789:;<`      %&'0(!"#$1789:-,+/.52)*;<346      !"#$%&'CNone"#$+-013457;<=>?ACKNQV]^fMDMaps top-level module names to the corresponding source file names. 6How should highlighting be sent to the user interface?CInteraction monad.I Environment of the reduce monad.K Read only access to environment.L0Read only access to state (signature, metas...).N9Returns the pragma options which are currently in effect.O?Returns the command line options which are currently in effect.PType-checking errors.S?The first argument is the state in which the error was raised.T\The exception which is usually caught. Raised for pattern violations during unification (assignV=) but also in other situations where we want to backtrack.U(The state in which the error was raised.V<The environment in which the error as raised plus the error.WDDistinguish error message when parsing lhs or pattern synonym, resp.bGThe target of a constructor isn't an application of its datatype. The  records what it does target.cThe target of a constructor isn't its datatype applied to something that isn't the parameters. First term is the correct target and the second term is the actual target.d>Expected a type to be an application of a particular datatype.econstructor, datatypefDatatype, constructors.gconstructor, typeh+Varying number of arguments for a function.ieThe left hand side of a function definition has a hidden argument where a non-hidden was expected.j9Expected a non-hidden function and found a hidden lambda.kKA function is applied to a hidden argument where a non-hidden was expected.lBA function is applied to a hidden named argument it does not have.m0Wrong user-given relevance annotation in lambda.n6A term is declared as an instance but it s not allowedo<The given hiding does not correspond to the expected hiding.pAThe given relevance does not correspond to the expected relevane.x'The given type should have been a sort.y%The given type should have been a pi.#This sort is not a type expression.#This term is not a type expression.4This term, a function type constructor, lives in SizeUniv, which is not allowed.0The two function types have different relevance.-The two function types have different hiding.wThe arguments are the meta variable, the parameters it can depend on and the paratemeter that it wants to depend on.OSome interaction points (holes) have not been filled by user. There are not  UnsolvedMetas{ since unification solved them. This is an error, since interaction points are never filled without user interaction.(Found module name, expected module name.pModule name, file from which it was loaded, file which the include path says contains the module. Scope errorshThe expr was used in the right hand side of an implicit module definition, but it wasn't of the form m Delta.>Failed to apply injectivity to constructor of indexed datatype=Can't solve equation because variable occurs in (type of) lhs=Can't solve reflexive equation because --without-K is enabledKError when splitting a pattern variable into possible constructor patterns.Neither data type nor record.&Data type, but in irrelevant position.tSplit on codata not allowed. UNUSED, but keep! -- | NoRecordConstructor Type -- ^ record type, but no constructor Constructor.Context for indices.,Inferred indices (from type of constructor).)Expected indices (from checking pattern).$Reason(s) why unification got stuck.MInformation about a mutual block which did not pass the termination checker.ZThe functions which failed to check. (May not include automatically generated functions.)The problematic call sites.Information about a call.Target function name.Range of the target function.+To be formatted representation of the call."Range where the warning was raisedThe warning itselfDThe warning printed in the state and environment where it was raisedzA non-fatal error is an error which does not prevent us from checking the document further and interacting with the user.!`CoverageIssue f pss` means that pss are not covered in fDo not use directly with warningDo not use directly with warningDo not use directly with warningAIn `OldBuiltin old new`, the BUILTIN old has been replaced by newIf the user wrote just {- REWRITE -}.QIf the user opens a module public before the module header. (See issue #2377.) 'Harmless generic warning (not an error) OGeneric error which doesn't abort proceedings (not a warning) Safe flag errors)`DeprecationWarning old new version`: old is deprecated, use new( instead. This will be an error in Agda version.A candidate solution for an instance meta is a term with its type. It may be the case that the candidate is not fully applied yet or of the wrong type, hence the need for the type.7Explicit arguments are considered as instance argumentsAAdd implicit arguments in the end until type is no longer hidden . !Do not append implicit arguments."6Abstract things in the current module can be accessed.##No abstract things can be accessed.$$All abstract things can be accessed.,The Context is a stack of (s.4=The path to the file that is currently being type-checked. ,9 if we do not have a file (like in interactive mode see  CommandLine).54anonymous modules and their number of free variables6to detect import cycles7!the current (if any) mutual block8/are we inside the scope of a termination pragma9>Are we currently in the process of solving active constraints?:OHave we stepped into the where-declarations of a clause? Everything under a where# will be checked with this flag on.;Are we allowed to assign metas?=When checking the typesignature of a public definition or the body of a non-abstract definition this is true. To prevent information about abstract things leaking outside the module.>*Are we checking an irrelevant argument? (= IrrelevantE) Then top-level irrelevant declarations are enabled. Other value: Relevant&, then only relevant decls. are avail.?+Sometimes we want to disable display forms.A8Interactive highlighting uses this range rather than @.BjWhat is the current clause we are type-checking? Will be recorded in interaction points in this clause.Cwhat we're doing at the momentDSet to Y+ when imported modules are type-checked.FJThis number indicates how far away from the top-level module Agda has come when chasing modules. The level of a given module is not necessarily the same as the length, in the module dependency graph, of the shortest path from the top-level module; it depends on in which order Agda chooses to chase dependencies.G When True, allows destructively shared updating terms during evaluation or unification. This is disabled when doing speculative checking, like solve instance metas, or when updating might break abstraction, as is the case when checking abstract definitions.HWhen type-checking an alias f=e, we do not want to insert hidden arguments in the end, because these will become unsolved metas.I]We are reducing an application of this function. (For debugging of incomplete matches only.)JYDid we encounter a simplification (proper match) during the current reduction process?L`Can we compare blocked things during conversion? No by default. Yes for rewriting feature.MWhen TrueI, types will be omitted from printed pi types if they can be inferred.NWhen True, throw away meta numbers and meta elims. This is used for reifying terms for feeding into the user's source code, e.g., for the interaction tactics solveAll.OUsed by the scope checker to make sure that certain forms of expressions are not used inside dot patterns: extended lambdas and let-expressions.QrUntil we get a termination checker for instance search (#1743) we limit the search depth to ensure termination.U  "  :  for a  module M  where  is the current context  envContext.V Via stdout.WBoth via files and via stdout.X;How much highlighting should be sent to the user interface?[This includes both non-interactive highlighting and interactive highlighting of the expression that is currently being type-checked.i-Builtin of any kind. Type can be checked (Just t) or inferred (NothingD). The second argument is the hook for the verification function.j2When typechecking something of the following form:"instance x : _ x = y it's not yet known where to add xQ, so we add it to a list of unresolved instances and we'll deal with it later.kThe instance table is a Map' associating to every name of record data typepostulate its list of instances*Interaction command: show module contents.used by setCurrentRange Controlling reduce.:(Projection and) projection-like functions may be reduced.'Functions marked INLINE may be reduced.%Copattern definitions may be reduced.6Non-recursive functions and primitives may be reduced.(Even recursive functions may be reduced.Reduce  terms.9Functions whose termination has not (yet) been confirmed.0Functions that have failed termination checking.NThree cases: 1. not reduced, 2. reduced, but blocked, 3. reduced, not blocked."Did we encounter a simplifying reduction? In terms of CIC, that would be a iota-reduction. In terms of Agda, this is a constructor or literal pattern that matched. Just beta-reduction (substitution) or delta-reduction (unfolding of definitions) does not count as simplifying? Postulate. Returned by  getConstInfo if definition is abstract.Primitive or builtin functions.,* while function is still type-checked. Just ccC after type and coverage checking and translation to case trees.2Intermediate representation for compiler backends.Mutually recursive functions, datas and recordEs. Does include this function. Empty list if not recursive. Nothing- if not yet computed (by positivity checker).+Are the clauses of this definition delayed?(Is it a record projection? If yes, then return the name of the record type and index of the record argument. Start counting with 1, because 0 means that it is already applied to the record. (Can happen in module instantiation.) This information is used in the termination checker.9Has this function been termination checked? Did it pass?Is this function generated from an extended lambda? If yes, then return the number of hidden and non-hidden lambda-lifted argumentsZIs this a generated with-function? If yes, then what's the name of the parent function.)Is this a function defined by copatterns?Number of parameters. Parameters that are maybe small."Parameters that appear in indices.Number of indices.data or codata (legacy).(This might be in an instantiated module.Constructor names.Mutually recursive functions, datas and recordAs. Does include this data type. Empty if not recursive. Nothing- if not yet computed (by positivity checker).Number of parameters.Was this record type created by a module application? If yes, the clause is its definition (linking back to the original record type).Constructor name and fields.Does this record have a  constructor?The record field names.CThe record field telescope. (Includes record parameters.) Note: $TelV recTel _ == telView' recConType . Thus, recTel is redundant.Mutually recursive functions, datas and record>s. Does include this record. Empty if not recursive. Nothing- if not yet computed (by positivity checker).#Eta-expand at this record type? False` for unguarded recursive records and coinductive records unless the user specifies otherwise.m or n*? Matters only for recursive records. ,T means that the user did not specify it, which is an error for recursive records.Number of parameters.+Number of arguments (excluding parameters).PName of (original) constructor and fields. (This might be in a module instance.) Name of datatype or record type.Inductive or coinductive?OWhich arguments are erased at runtime (computed during compilation to treeless)J for primitive functions, not null for builtin functions., for primitive functions, , something for builtin functions.<Should calls to this function be normalised at compile-time?9Should calls to this function be inlined by the compiler?Is this function a macro?(Should a record type admit eta-equality?User specifed 'eta-equality' or 'no-eta-equality'.0Positivity checker inferred whether eta is safe.@Abstractions to build projection function (dropping parameters).&Additional information for projection s.Nothing if only projection-like, Just r if record projection. The r_ is the name of the record type projected from. This field is updated by module application.PThe original projection name (current name could be from module application).-Type projected from. Original record type if projProper = Just{}. Also stores ArgInfoM of the principal argument. This field is unchanged by module application.Index of the record argument. Start counting with 1, because 0 means that it is already applied to the record value. This can happen in module instantiation, but then either the record value is var 0, or funProjection == Nothing.Term t to be be applied to record parameters and record value. The parameters will be dropped. In case of a proper projection, a postfix projection application will be created: t = pars r -> r .p2 (Invariant: the number of abstractions equals X.) In case of a projection-like function, just the function symbol is returned as : t = pars -> f.,Additional information for extended lambdas.;The backends are responsible for parsing their own pragmas.+Polarity for equality and subtype checking.monotoneantitoneno information (mixed variance)constantHiding should not be used. Type of the lifted definition. Variance information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors. Positivity information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.Just q/ when this definition is an instance of class q:Has this function been created by a module instantiation?-Is the def matched against in a rewrite rule?GShould the def be treated as injective by the pattern matching unifier??Rewrite rules can be added independently from function clauses.Name of rewrite rule q :  ! f ps "a rhs where "a is the rewrite relation..f.  " f ps : t.  " rhs : t. " t.#1Non-linear (non-constructor) first-order pattern.$pMatches anything (modulo non-linearity) that only contains bound variables that occur in the given arguments.%)Matches anything (e.g. irrelevant terms).&Matches f es'Matches  x ! t(Matches  (x : A) ! B)Matches x es# where x is a lambda-bound variable*'Matches the term modulo  (ideally ).+A structured presentation of a  for reification into <=.,(f vs | ws) es. The first + is the parent function f with its args vs. The list of +s are the with expressions ws . The  are additional arguments esl (possible in case the with-application is of function type) or projections (if it is of record type).-c vs..d vs./.v.0v.2A  DisplayForm! is in essence a rewrite rule  q ts --> dt : for a defined symbol (could be a constructor as well) q. The right hand side is a + which is used to reify to a more readable <=. The patterns ts are just terms, but var 02 is interpreted as a hole. Each occurrence of var 0: is a new hole (pattern var). For each *occurrence* of var0 the rhs dt_ has a free variable. These are instantiated when matching a display form against a term q vs succeeds.4Number n of free variables in 6.5Left hand side patterns, where var 04 stands for a pattern variable. There should be n occurrences of var0 in 5 . The ? is ignored in these patterns.6Right hand side, with n free variables.B'The rewrite rules defined in this file.C0Which clause is an interaction point located in?E4The interaction point is not in the rhs of a clause.FThe name of the function.G*The number of the clause of this function.HThe original AST clause rhs.I/Data structure managing the interaction points.DWe never remove interaction points from this map, only set their N to True. (Issue #2368)JInteraction points are created by the scope checker who sets the range. The meta variable is created by the type checker and then hooked up to the interaction point.L&The position of the interaction point.M0The meta variable, if any, holding the type etc.N/Has this interaction point already been solved?OIThe clause of the interaction point (if any). Used for case splitting.Q8For printing, we couple a meta with its name suggestion.UEName suggestion for meta variable. Empty string means no suggestion.VMetaInfo4 is cloned from one meta to the next during pruning.Y7Run the extended occurs check that goes in definitions?ZUsed for printing. Just x8 if meta-variable comes from omitted argument with name x.^pMeta variable priority: When we have an equation between meta-variables, which one should be instantiated?6Higher value means higher priority to be instantiated.c( (xs : t ) ! e) : t This is not an instance of aT as the domain type has already been checked. For example, when checking '( (x y : Fin _) ! e) : (x : Fin n) ! ? we want to postpone ( (y : Fin n) ! e) : ? where Fin n is a  rather than an t.dCFirst argument is computation and the others are hole and goal typef4solved by term (abstracted over some free variables)gunsolvedh1open, to be instantiated as "implicit from scope"i(solution blocked by unsolved constraintskFrozen meta variable cannot be instantiated by unification. This serves to prevent the completion of a definition by its use outside of the current block. (See issues 118, 288, 399).lDo not instantiate.t4some metavariables are more eager to be instantiatedua metavariable doesn't have to depend on all variables in the context, this "permutation" will throw away the ones it does not depend onxBmeta variables scheduled for eta-expansion but blocked by this oneyBare we past the point where we can instantiate this meta variable?zFParametrized since it is used without MetaId when creating a new meta.TLocal to a given module, the value should have module parameters as free variables.Global value, should be closed.-A thing tagged with the context it came from.An extension of  to >=.,the two types are for the error message only+The range is the one of the absurd pattern.Check that the . is either not a SIZELT or a non-empty SIZELT.the first argument is the instance argument, the second one is the meta on which the constraint may be blocked on and the third one is the list of candidates (or Nothing if we haven t determined the list of candidates yet)0Since module parameters are currently stored in   not in  2, we save them here. The map contains for each   M with module telescope _M a substitution   " _M : _M from the current context  = envContext (clEnv).Hash of the source code."Imported modules and their hashes.Module name of this interface.Scope defined by this module.yAndreas, AIM XX: Too avoid duplicate serialization, this field is not serialized, so if you deserialize an interface, iScope will be empty. But constructIScope constructs  from .1Scope after we loaded this interface. Used in  > and ?.-Display forms added for imported identifiers.Pragma options set in the file.,@ if warnings were encountered when the module was type checked.DMaps source file names to the corresponding top-level module names.Create a fresh name from a.0A complete log for a module will look like this:, entering the main module.$'Decl'/'EnterSection'/'LeaveSection'*, for declarations and nested modules, leaving the main module.Never a Section or ScopeDeclLike y, but storing the log for an ongoing type checking of a module. Stored in reverse order (last performed action first).A log of what the type checker does and states after the action is completed. The cached version is stored first executed action first.YA part of the state which is not reverted when an error is thrown or the state is reset.wCallback function to call when there is a response to give to the interactive frontend. See the documentation of .wStructure to track how much CPU time was spent on which Agda phase. Needs to be a strict field to avoid space leaks!Should be strict field.`Cached typechecking state from the last loaded file. Should be Nothing when checking imports.#Current backends with their options)A mutual block of names in the signature.&The original info of the mutual block.Highlighting info.jDisambiguation carried out by the type checker. Maps position of first name character to disambiguated   for each  $ already passed by the type checker.TDirty when a constraint is added, used to prevent pointer update. Currently unused.Definitions to be considered during occurs check. Initialized to the current mutual block before the check. During occurs check, we remove definitions from this set as soon we have checked them.eDeclared identifiers of the current file. These will be serialized after successful type checking."TODO: can these be moved into the TCEnv?-Display forms we add for imported identifiers@The current module is available after it has been type checked.ZCounters to collect various statistics about meta variables etc. Only for current file.UHighlighting info for tokens (but not those tokens for which highlighting exists in ).?Imported declared identifiers. Those most not be serialized!2Pattern synonyms of the current file. Serialized.3Imported pattern synonyms. Must not be serialized!&Options applying to the current file. OPTIONS! pragmas only affect this field.;Display forms added by someone else to imported identifiers{- FOREIGN -}b code that should be included in the compiled output. Does not include code for imported modules. /The state which is frozen after scope checking. 1The state which is modified after scope checking. 'State which is forever, like a diamond. Empty persistent state. Empty state of type checker.< Creates a  map based on . O(n log n).For a single reverse lookup in , rather use lookupModuleFromSourse.= Lookup an w in <.O(n).>GCombines the source hash and the (full) hashes of the imported modules.@Embed  into .A!Flip the direction of comparison.BTurn a  function into a  function. Property:  dirToCmp f (fromCmp cmp) = f cmpQ$By default, we have no display form.T+Create a definition with sensible defaults.Y>Building the projection function (which drops the parameters).Z,The info of the principal (record) argument.\3Make sure we do not overwrite a user specification.]Is the record type recursive?_A template for creating % definitions, with sensible defaults.eBChecking whether we are dealing with a function yet to be defined.m:Not quite all reductions (skip non-terminating reductions)r+Are the clauses of this definition delayed?s2Has the definition failed the termination checker?tAHas the definition not termination checked or did the check fail?v&ifTopLevelAndHighlightingLevelIs l b m runs mV when we're type-checking the top-level module and either the highlighting level is at least l or b is ,.w$ifTopLevelAndHighlightingLevelIs l m runs mO when we're type-checking the top-level module and the highlighting level is at least l..Preserve the state of the failing computation.Execute a finalizer even when an exception is thrown. Does not catch any errors. In case both the regular computation and the finalizer throw an exception, the one of the finalizer is propagated.4Running the type checking monad (most general form).ARunning the type checking monad on toplevel (with initial state). runs a safe  action (a 9 action which cannot fail) in the initial environment.6Runs the given computation in a separate thread, with a copy' of the current state and environment.RNote that Agda sometimes uses actual, mutable state. If the computation given to forkTCM tries to modify\ this state, then bad things can happen, because accesses are not mutually exclusive. The forkTCM8 function has been added mainly to allow the thread to read7 (a snapshot of) the current state in a convenient way.Note also that exceptions which are raised in the thread are not propagated to the parent, so the thread should not do anything important.&Base name for extended lambda patterns!Name of absurdLambda definitions.:Check whether we have an definition from an absurd lambda.)Short-cutting disjunction forms a monoid.aWe store benchmark statistics in an IORef. This enables benchmarking pure computation, see Agda.Benchmarking.We only -/ the name of the callee.RThe map contains for each   M with module telescope _M a substitution   " _M : _M from the current context  = envContext (clEnv).       0QPONMLKJIHGCBA@?=<;:98765432DF>E1 WVCDEFGHIJLKMONPTSRQVUWYXZ~}|{zyxwvutsrqponmlkjihgfedcba`_^]\[      !$#"%&'()*+,-./RSTUX[ZY\]^_`acbdihgfejkl~}|{zyxwvutsrqponm     ! "#*)('&%$+0/.-,123654789:;<=>?BA@CEDHGFIJKONMLPQRTSUVWZYX[]\^_`dcbaejihfgkmlnpoqryxwtsuvz|{~}   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       !"#$%&'()*+,-./012345678.-,+*)(9:;! <=>?   @AB C z{|}~}~qrstuvwxynopklmefghij`abcd^_[\]VWXYZUQRSTPDEFGHIJKJKLMNOICDEFGH>?@ABLMN=<;:789OP234561+,-./0QR#$%&'()*" !     STUVWXYZ[\]^_`abcdefghijklmnopqrstulmnopqrstuvwxyz{|}~kjdefghi`abc_\]^XYZ[ VWvwSTUxR 0123456789:;<=>?@ABCDEFGHIJKLMNOPQyz-./{|}~,()*+&'%!"#$      Z[\]^_`abcdefghijklmnopqrstuvwxyz{|}~WXYPQRSTUV'&%$MNOIJKLFGH0  DE/#C654321"Z       "0123456789:;<=>?@ABCDEFGHIJKLMNOPQ VWDEFGHIJKLMNOPQRSTUVWXYZz[\]^_`abcdefghijklmnopqrstuvwxyz{|}~       !"#$&'()*+-./STUXYZ[\]^`abcdefghilmnopqrstuvwxyz{|}~3      !#$%&'()*+,-./023456789>?@ABCDEFGHJKLMNOQRSTVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~}~ None"#$+-013457;<=>?ACNQV]^JPerforms void (noAbs) abstraction over telescope.If $v$ is a record value, canProject f v returns its field f.Eliminate a constructed term.defApp f us vs applies Def f us to further arguments vs/, eliminating top projection redexes. If us` is not empty, we cannot have a projection redex, since the record argument is the first one.  (x:A)->B(x)  [u] = B(u)gPrecondition: The type must contain the right number of pis without having to perform any reduction.piApply$ is potentially unsafe, the monadic piApplyM is preferable.If permute  : [a] -> [a], then ,applySubst (renaming _ ) : Term  -> Term If permute  : [a] -> [a], then +applySubst (renamingR ) : Term  -> Term NThe permutation should permute the corresponding context. (right-to-left list)  projDropParsApply proj o args = Y proj o `apply' argssThis function is an optimization, saving us from construction lambdas we immediately remove through application.lTakes off all exposed function domains from the given type. This means that it does not reduce to expose Pi-types.telView'UpTo n t takes off the first n exposed function types of t#. Takes off all (exposed ones) if n < 0.Turn a typed binding (x1 .. xn : A) into a telescope.Turn a typed binding (x1 .. xn : A) into a telescope. )mkPi dom t = telePi (telFromList [dom]) t)Uses free variable analysis to introduce  bindings.Everything will be an .]Abstract over a telescope in a term, producing lambdas. Dumb abstraction: Always produces , never .$The implementation is sound because  does not use .Given arguments vs : tel= (vector typing), extract their individual types. Returns Nothing is tel is not long enough.In compiled clauses, the variables in the clause body are relative to the pattern variables (including dot patterns) instead of the clause telescope.The `rule'B, if Agda is considered as a functional pure type system (pts).TODO: This needs to be properly implemented, requiring refactoring of Agda's handling of levels. Without impredicativity or , Agda's pts rule is just the least upper bound, which is total and commutative. The handling of levels relies on this simplification.FDependent least upper bound, to assign a level to expressions like forall i -> Set i.dLub s1 i.s2 = omega if i# appears in the rigid variables of s2.|Equality of binders relies on weakening which is a specical case of renaming which is a specical case of substitution. Syntactic  equality, ignores stuff below DontCare and sharing.  Syntactic $ equality, ignores sort annotations.Dtel " ( " lhs ! rhs : t) becomes tel,  " lhs ! rhs : t)\ we do not need to change lhs, rhs, and t since they live in . See 'Abstract Clause'._)Make sure we only drop variable patterns._JKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnogfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:9876543210/.-,+*)('&%$#"!  ih    None"#$+-03457;<=>?ACKNQV]^HNone"#$+-03457;<=>?ACNQV]^.,Split alts into TAGuard alts and other alts.None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^&PWe lose track of @-patterns in the internal syntax. This pass puts them back...None"#$+-03457;<=>?ACFNQSTV]^(icodeArgs proxy (a1, ..., an) maps icode over a1, ..., an* and returns the corresponding list of Int32.Monad used by the decoder.TCMJ is not used because the associated overheads would make decoding slower.Monad used by the encoder.State of the decoder.Obtained from interface file.Obtained from interface file.Obtained from interface file.Obtained from interface file.Obtained from interface file.ZCreated and modified by decoder. Used to introduce sharing while deserializing objects.<Maps module names to file names. Constructed by the decoder.The include directories.=Univeral memo structure, to introduce sharing during decoding!Universal type, wraps everything.State of the the encoder.Written to interface file.Written to interface file.Written to interface file.Written to interface file.vWritten to interface file. Dicitionaries which are not serialized, but provide short cuts to speed up serialization:~Not written to interface file. Andreas, Makoto, AIM XXI Memoizing A.Name does not buy us much if we already memoize A.QName.Not written to interface file.@Not written to interface file. Fresh UIDs and reuse statistics:If True collect in stats the quantities of calls to icode for each  Typeable a.Not written to interface file.Two  s are equal if their QNameId is equal.zStructure providing fresh identifiers for hash map and counting hash map hits (i.e. when no fresh identifier required).Number of hash map misses.Number of hash map hits.+The type of hashtables used in this module.0A very limited amount of testing indicates that . is somewhat slower than . , and that . and the hashtables from Data.Hashtable are much slower.5Constructor tag (maybe omitted) and argument indices.(Computing a qualified names composed ID.Creates an empty dictionary.EThrows an error which is suitable when the data stream is malformed.Increase entry for a in . Data.Binary.runGetState is deprecated in favour of runGetIncremental. Reimplementing it in terms of the new function. The new Decoder type contains strict byte strings so we need to be careful not to feed the entire lazy byte string to the decoder at once.icode# only if thing has not seen before.vcase value ix decodes thing represented by  ix :: Int32 via the valu function and stores it in . If ix is present in , valu, is not used, but the thing is read from  instead.icodeN tag t a1 ... an serialises the arguments a1, ..., an of the constructor t together with a tag tagP picked to disambiguate between different constructors. It corresponds to 0icodeNode . (tag :) =<< mapM icode [a1, ..., an]icodeN' is the same as icodeN except that there is no tagSerialization (wrapper).Serialization (worker).Deserialization.Collect statistics for icode calls? Memo structure for thing of key a. Statistics.Key to the thing.)Fallback computation to encode the thing.Encoded thing.HL None"#$+-03457;<=>?ACNQV]^0*WAssumes that the first module in the import path is the module we are worried about. !"#$%&'()* !"#$%&'()*None"#$+-03457;<=>?ACNQV]^'l++Get the name of the current module, if any.,#Set the name of the current module.-7Get the number of variables bound by anonymous modules..+Add variables bound by an anonymous module./(Set the current environment to the given0Get the current environment1DIncreases the module nesting level by one in the given computation.2Set highlighting level3Restore setting for  to default.5oIf the reduced did a proper match (constructor or literal pattern), then record this as simplification step.8 Lens for .;Reduce Def f vs only if f is a projection.<DAllow all reductions except for non-terminating functions (default).=9Allow all reductions including non-terminating functions.+,-./0123456789:;<=>?+,-./0123456789:;<=>?None"#$+-03457;<=>?ACNQV]^.I+Create an open term in the current context.J$Create an open term which is closed.K Check if an  is closed.LrExtract the value from an open term. Must be done in an extension of the context in which the term was created.MTry to use an ! the current context. Returns ,G if current context is not an extension of the context in which the  was created.IJKLMIJKLMNone"#$+-03457;<=>?ACNQV]^9NThe coinductive primitives.]2Rewrite a literal to constructor form if possible.oBuiltins that come without a definition in Agda syntax. These are giving names to Agda internal concepts which cannot be assigned an Agda type.,An example would be a user-defined name for Set.{- BUILTIN TYPE Type -} The type of Type would be Type : Level ! Set which is not valid Agda.pTries to build a N.r"Get the name of the equality type.scCheck whether the type is actually an equality (lhs "a rhs) and extract lhs, rhs, and their type.Precondition: type is reduced.t Revert the .Postcondition: type is reduced.'NORQPSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst)STvUuVWXYZ[\]^_`abcdfgehijklmnopqrstuvwxyz{|}~     ( !"#$%&')*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgjkhilmnoNOPQRpqrstNOPQRSTNone"#$+-03457;<=>?ACNQV]^L%simplifyLevelConstraint c cs turns an cp into an equality constraint if it is an inequality constraint and the reverse inequality is contained in cs.The constraints doesn't necessarily have to live in the same context, but they do need to be universally quanitfied over the context. This function takes care of renaming variables when checking for matches..ICheck if two inequality constraints are the same up to variable renaming..GTurn a level constraint into a list of level inequalities, if possible...None"#$+-03457;<=>?ACNQV]^Q.DClassifying warnings: some are benign, others are (non-fatal) errors(warnings that will be turned into errorsuall warnings, including errors and benign ones Note: order of constructors is important for the derived Ord instancerunning the Parse monad  None"#$+-03457;<=>?ACNQV]^r:Resets the non-persistent part of the type checking state.&Resets all of the type checking state. Keep only C and backend information.Restore  ! after performing subcomputation.In contrast to @, the C* info from the subcomputation is saved.Same as I but also returns the state in which we were just before reverting it.A fresh TCM instance.OThe computation is run in a fresh state, with the exception that the persistent state is preserved. If the computation changes the state, then these changes are ignored, except for changes to the persistent state. (Changes to the persistent state are also ignored if errors other than type errors or IO exceptions are encountered.) Lens for .Get the current scope.Set the current scope.;Modify the current scope without updating the inverse maps.Modify the current scope.#Run a computation in a local scope.Same as -, but discard the scope from the computation.2Discard any changes to the scope by a computation. Scope error.Debug print the scope. Update a possibly imported definition. Warning: changes made to imported definitions (during type checking) will not persist outside the current module. This function is currently used to update the compiled representation of a function during compilation.JRun some computation in a different signature, restore original signature.ZSet the top-level module. This affects the global module id of freshly generated names.gUse a different top-level module for a computation. Used when generating names for imported modules.5Tell the compiler to import the given Haskell module.5Tell the compiler to import the given Haskell module. Lens for .Lens getter for C from  . Lens map for C.Lens getter for C from .Lens modify for C.>Look through the signature and reconstruct the instance table. Lens for ,.4Remove all instances whose type is still unresolved./Add an instance whose type is still unresolved.Add instance to some `class'.Name of the instance.Name of the class.AANone"#$+-03457;<=>?ACNQV]^|aPass the current mutual block id or create a new mutual block if we are not already inside on.PSet the mutual block info for a block, possibly overwriting the existing one.6Set the mutual block info for a block if non-existing.&Set the mutual block for a definition.RGet the current mutual block, if any, otherwise a fresh mutual block is returned.0Reverse lookup of a mutual block id for a names.None"#$+-03457;<=>?ACNQV]^DConditionally render debug -1 and print it.E#Conditionally println debug string.F!Conditionally print debug string.Conditionally render debug -1, print it, and then continue.=Print brackets around debug messages issued by a computation. @CBADEF@ABCFED@ABCNone"#$+-03457;<=>?ACNQV]^IWhen verbosity is set or changes, we need to turn benchmarking on or off..(Check whether benchmarking is activated.aPrints the accumulated benchmark results. Does nothing if profiling is not activated at level 7.4BCDRTU_XVWNQSJLKOcZgFEGHIMPY[\]^`abdefhijklm None"#$+-03457;<=>?ACFNQTV]^'!      "None"#$+-03457;<=>?ACNQV]^)),+*-.43210/58769:=;<>A@?BEDCFGHIJKLMNOPQ:BCDESRF>?@AUTGH:;<=WVI95678[ZYXJK./01234^]\LMNO-)*+,ba`_PQ)*+,./012345678:;<=>?@ABCDENone"#$+-03457;<=>?ACNQV]^f<Run a computation if a certain verbosity level is activated.-Precondition: The level must be non-negative.5Check whether a certain verbosity level is activated.-Precondition: The level must be non-negative.Gets the include directories.Precondition:  must be nonempty (i.e. g must have run).c?Which directory should form the base of relative include paths?dThe root directory of the "project" containing the given file. The file needs to be syntactically correct, with a module name matching the file name.eThe current working directory.fSets the pragma options.gPSets the command line options (both persistent and pragma options are updated).Relative include directories are made absolute with respect to the current working directory. If the include directories have changed (thus, they are , now, and were previously , something>), then the state is reset (completely, see setIncludeDirs) ./An empty list of relative include directories (, []) is interpreted as ["."].nDisable display forms.oDisable display forms.p#Check if display forms are enabled.rMMakes the given directories absolute and stores them as include directories.pIf the include directories change, then the state is reset (completely, except for the include directories and ). An empty list is interpreted as ["."].tShould only be run if v.u Return the  as w , if any.mSwitch on printing of implicit and irrelevant arguments. E.g. for reification in with-function generation. Restores all > after completion. Thus, do not attempt to make persistent  changes in a  bracket.Change * for a computation and restore afterwards.%Retrieve the current verbosity level.CCheck whether a certain verbosity level is activated (exact match).JRun a computation if a certain verbosity level is activated (exact match).rNew include directories.)How should relative paths be interpreted?+cdefghijklmnopqrstuvwxyz{|}~+fghijklmnopcdeqrstuvwxyz{|}~cdeNone"#$+-03457;<=>?ACNQV]^t$Record a function call in the trace.Sets the current range (for error messages etc.) to the range of the given object, if it has a range (i.e., its range is not ).None"#$+-03457;<=>?ACNQV]^ &Ensures that the module name matches the file name. The file corresponding to the module name (according to the include path) has to be the same as the given file name.'CComputes the module name of the top-level module in the given file.IWarning! Parses the whole file to get the module name out. Use wisely!No side effects! Only in  to raise errors.( A variant of 'H which raises an error if the file name does not match the module name.`The file name is interpreted relative to the current working directory (unless it is absolute).9Errors which can arise when trying to find a source file."Invariant: All paths are absolute.HThe file was not found. It should have had one of the given file names."Several matching files were found.AInvariant: The list of matching files has at least two elements.EConverts an Agda file name to the corresponding interface file name.KGiven the module name which the error applies to this function converts a  to a Z.gFinds the source file corresponding to a given top-level module name. The returned paths are absolute.,Raises an error if the file cannot be found.qTries to find the source file corresponding to a given top-level module name. The returned paths are absolute.SIDE EFFECT: Updates . A variant of  which does not require .jFinds the interface file corresponding to a given top-level module name. The returned paths are absolute.ARaises an error if the source file cannot be found, and returns ,= if the source file can be found but not the interface file.&The name of the module."The file from which it was loaded.3The expected name, coming from an import statement.Include paths.Cached invocations of . An updated copy is returned.&'(&'(None"#$+-013457;<=>?ACNQV]^έ*Ranges that should be serialised properly."Ranges are always deserialised as .None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^ղGet the statistics.)Modify the statistics via given function.Increase specified counter by 1.Increase specified counter by n.BSet the specified counter to the maximum of its current value and n..'Modify specified counter by a function f.;Print the given statistics if verbosity "profile" is given.None"#$+-03457;<=>?ACNQV]^A deep view on sizes.A useful view on sizes.Check if a type is the y type. The argument should be reduced.)Result of querying whether size variable i is bounded by another size.yes  i : Size< t QTest whether OPTIONS --sized-types and whether the size built-ins are defined. $Add polarity info to a SIZE builtin. The sort of built-in types SIZE and SIZELT. The type of built-in types SIZE and SIZELT. The built-in type SIZE with user-given name. The built-in type SIZE.  The name of SIZESUC. >Transform list of terms into a term build from binary maximum. Expects argument to be reduced. sizeViewComparable v w checks whether v >= w (then Left) or v <= w (then Right ). If uncomparable, it returns  NotComparable. sizeViewPred k v decrements v by k (must be possible!). sizeViewOffset v8 returns the number of successors or Nothing when infty. 'Remove successors common to both sides. Turn a size view into a term. maxViewCons v ws = max v ws. It only adds v to ws+ if it is not subsumed by an element of ws. sizeViewComparableWithMax v ws tries to find w in ws that compares with v+ and singles this out. Precondition:  v /= DSizeInv.0                    4                          None"#$+-03457;<=>?ACNQV]^ " # $ % " # $ %None"#$+-03457;<=>?ACNQV]^F &/To be called before any write or restore calls. ' Writes a ( to the current log, using the current  )The cache should not be used for an imported module, and it should be restored after the module has been type-checked. This combinator takes care of that. *>Reads the next entry in the cached type check log, if present. +CEmpties the "to read" CachedState. To be used when it gets invalid. ,Makes sure that the  is ,(, with a clean current log. Crashes is e is already active with a dirty log. Should be called when we start typechecking the current file. -cCaches the current type check log. Discardes the old cache. Does nothing if caching is inactive. & ' ( ) * + , - ' * + - , & ) (None"#$+-03457;<=>?ACNQV]^ 4AWe put the translation into TCM in order to print debug messages..CBind a concrete name to an abstract in the translation environment..|Names in abstract syntax are fully qualified, but the concrete syntax requires non-qualified names in places. In theory (if all scopes are correct), we should get a non-qualified name when translating back to a concrete name, but I suspect the scope isn't always perfect. In these cases we just throw away the qualified part. It's just for pretty printing anyway....QAdd a abstract name to the scope and produce an available concrete version of it..Like .0, but do not care whether name is already taken..General bracketing function..Expression bracketing.Pattern bracketing.rApplications where the argument is a lambda without parentheses need parens more often than other applications..|If a name is defined with a fixity that differs from the default, we have to generate a fixity declaration for that name..Add abstract, private, instance modifiers. =9Translate something in a context of the given precedence..9Translate something in a context of the given precedence..'Translate something in the top context..'Translate something in the top context...Translate something in a context indicated by e info...Translate something in a context indicated by e info..the bracketing function?Should we bracket things which have the given precedence?.Check for parenless lambdas, for sections . / 0 1 2 3 4 5 6 7 8 9 : ; < = 1 2 3 = < : 9 . / ; 7 6 4 0 5 8 ............ . /.. 0. 1 2 3 5...None"#$+-03457;<=>?ACNQVZ]^>$ fBool: did we copy recursively? We need to track this because we don't copy recursively when creating new modules for reexported functions (issue1985), but we might need to copy recursively later. i9Local variable bound by , , module telescope, pattern, let. j&Function, data/record type, postulate. kBRecord field name. Needs to be distinguished to parse copatterns. l Data or record constructor name. mName of pattern synonym. n Unbound name. pVariable bound by let? qTo simplify interaction between scope checking and type checking (in particular when chasing imports), we use the same monad. y-Create a new module with an empty scope. (Just' if it is a datatype or record module.) z"Apply a function to the scope map. {$Apply a function to the given scope. }*Apply a monadic function to the top scope. ~&Apply a function to the current scope. 5Apply a function to the public or private name space. 7Run a computation without changing the local variables. 2Create a fresh abstract name from a concrete name.MThis function is used when we translate a concrete name in a binder. The ) of the concrete name is saved as the   of the abstract name. 0freshAbstractName_ = freshAbstractName noFixity' 'Create a fresh abstract qualified name. ?Look up the abstract name referred to by a given concrete name. VLook up the abstract name corresponding to a concrete name of a certain kind and/or from a given set of names. Sometimes we know already that we are dealing with a constructor or pattern synonym (e.g. when we have parsed a pattern). Then, we can ignore conflicting definitions of that name of a different kind. (See issue 822.) Look up a module in the scope. ?Get the notation of a name. The name is assumed to be in scope. Bind a variable. .Bind a defined name. Must not shadow anything. }Rebind a name. Use with care! Ulf, 2014-06-29: Currently used to rebind the name defined by an unquoteDecl, which is a s in the body, but a  j later on. Bind a module name. HBind a qualified module name. Adds it to the imports field of the scope.  Clear the scope of any no names. Create a new scope with the given name from an old scope. Renames public names in the old scope to match the new name and returns the renamings. SApply an import directive and check that all the names mentioned actually exist. A finite map for  ImportedNames. Translation of ImportDirective. Translation of Using or Hiding. Translation of Renaming. Open a module. 9The name must correspond to one of the names in this set. Let-bound variable?Concrete name.Abstract name. Translation of imported names.,Translation of names defined by this import. Translation of names in using or hiding list. Translation of  names.Translation of rento names.: c d f e g h n m l k j i p o q r s t u v w x y z { | } ~  ; q r s t u v w x y z { | } ~  h i j k l m n o p g c d e f  c d e f h i j k l m n o pNone"#$+-03457;<=>?ACNQV]^d!GPCheck if we are in a compatible context, i.e. an extension of the given context.HGet the current context. Wrapper to tell   not to  [s. Used when adding a user-provided, but already type checked, telescope to the context. Various specializations of addCtx.  Modify the + field of a (.  Modify all (s.  Modify a , in a computation. Change to top (=empty) context. TODO: currently, this makes the ModuleParamDict ill-formed! Delete the last n bindings from the context. TODO: currently, this makes the ModuleParamDict ill-formed! 0Locally set module parameters for a computation. .Apply a substitution to all module parameters.  Since the ModuleParamDicti is relative to the current context, this function should be called everytime the context is extended. Get substitution   "  : m where  is the current context and m- is the module parameter telescope of module m.In case the current R does not know m^, we return the identity substitution. This is ok for instance if we are outside module m[ (in which case we have to supply all module parameters to any symbol defined within m we want to refer). addCtx x arg cont add a variable to the context.Chooses an unused  .7Warning: Does not update module parameter substitution! APick a concrete name that doesn't shadow anything in the context. Since the module parameter substitution is relative to the current context, we need to weaken it when we extend the context. This function takes care of that. 4Context entries without a type have this dummy type. Go under an abstraction. KGo under an abstract without worrying about the type to add to the context. Add a let bound variable. $Get the size of the current context.  Generate [var (n - 1), ..., var 0]% for all declarations in the context.  Generate [var (n - 1), ..., var 0]% for all declarations in the context. Get the current context as a . 1Get the names of all declarations in the context. 0get type of bound variable (i.e. deBruijn index) Get the term corresponding to a named variable. If it is a lambda bound variable the deBruijn index is returned and if it is a let bound variable its definition is returned.#GH 0 H G    None"#$+-03457;<=>?ACNQV]^hc xPrecondition: must not be called if the module parameter of the current module have been refined or (touched at all).  None"#$+-03457;<=>?ACNQVZ]^6Lookup a section telescope._If it doesn't exist, like in hierarchical top-level modules, the section telescope is empty.Unless all variables in the context are module parameters, create a fresh module to capture the non-module parameters. Used when unquoting to make sure generated definitions work properly. oLookup the definition of a name. The result is a closed thing, all free variables have been abstracted over.  Version that reports exceptions: 4Lookup the rewrite rules with the given head symbol. Signature lookup errors. 8The name is not in the signature; default error message. 0The name is not available, since it is abstract. CAdd a constant to the signature. Lifts the definition to top level. 2Set termination info of a defined function symbol. !Modify the clauses of a function. PLifts clauses to the top-level and adds them to definition. Also adjusts the  field if necessary. Add a compiler pragma `{-! COMPILE <backend> <name> <text> -}` Add a section to the signature.[The current context will be stored as the cumulative module parameters for this section. Get a section.Why Maybe? The reason is that we look up all prefixes of a module to compute number of parameters, and for hierarchical top-level modules, A.B.C say, A and A.B do not exist. >Module application (followed by module parameter abstraction). LAdd a display form to a definition (could be in this or imported signature). CFind all names used (recursively) by display forms of a given name. #Check if a display form is looping. NCan be called on either a (co)datatype, a record type or a (co)constructor. ?Does the given constructor come from a single-constructor type?5Precondition: The name has to refer to a constructor.!Standard eliminator for  .!`Get the original name of the projection (the current one could be from a module application).!%Look up the polarity of a definition.!MLook up polarity of a definition and compose with polarity represented by .!!Set the polarity of a definition.!*Get argument occurrence info for argument i of definition d (never fails).!  Sets the  I for the given identifier (which should already exist in the signature).!FGet the mutually recursive identifiers of a symbol from the signature.!.Get the mutually recursive identifiers from a .!'Set the mutually recursive identifiers.!5Check whether two definitions are mutually recursive.! A functiondataVrecord definition is nonRecursive if it is not even mutually recursive with itself.!3Get the number of parameters to the current module.!Compute the number of free variables of a defined name. This is the sum of number of parameters shared with the current module and the number of anonymous variables (if the name comes from a let-bound module).!7Compute the context variables to apply a definition to.We have to insert the module telescope of the common prefix of the current module and the module where the definition comes from. (Properly raised to the current context.) y Example:  module M  where module M  where f = ... module M  where ... M .M .f [insert  raised by ] !PInstantiate a closed definition with the correct part of the current context.!'Give the abstract view of a definition.! OEnter abstract mode. Abstract definition in the current module are transparent.!!:Not in abstract mode. All abstract definitions are opaque.!"?Ignore abstract mode. All abstract definitions are transparent.!#eEnter concrete or abstract mode depending on whether the given identifier is concrete or abstract.!$MCheck whether a name might have to be treated abstractly (either if we're ! d or it's not a local name). Returns true for things not declared abstract as well, but for those ! will have no effect.!%Andreas, 2015-07-01: If the current~ module is a weak suffix of the identifier module, we can see through its abstract definition if we are abstract. (Then treatAbstractly' returns False).<If I am not mistaken, then we cannot see definitions in the where block of an abstract function from the perspective of the function, because then the current module is a strict prefix of the module of the local identifier. This problem is fixed by removing trailing anonymous module name parts (underscores) from both names.!&<Get type of a constant, instantiated to the current context.!'Get relevance of a constant.!(pThe number of dropped parameters for a definition. 0 except for projection(-like) functions and constructors.!)&Is it the name of a record projection?!+Is it a function marked STATIC?!,Is it a function marked INLINE?!-Returns True if we are dealing with a proper projection, i.e., not a projection-like function nor a record field value (projection applied to argument).!.DNumber of dropped initial arguments of a projection(-like) function.!/+Check whether a definition uses copatterns.!0Apply a function fF to its first argument, producing the proper postfix projection if f is a projection. /Name of new module defined by the module macro.Parameters of new module.(Name of old module applied to arguments. Arguments of module application.Imported names and modulesb !!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0e  ! !!!3!!2!1!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0   None"#$+-03457;<=>?ACNQV]^!6!7!8!6!7!8None"#$+-03457;<=>?ACNQVZ]^!!9cUnfreeze meta and its type if this is a meta again. Does not unfreeze deep occurrences of metas.!;pCheck whether all metas are instantiated. Precondition: argument is a meta (in some form) or a list of metas.!=Switch off assignment of metas.!>Get the meta store.!@8Run a computation and record which new metas it created.!ALookup a meta variable!G=Given a meta, return the type applied to the current context.!IOReturns every meta-variable occurrence in the given type, except for those in s.!JCreate V in the current environment.!RfRegister an interaction point during scope checking. If there is no interaction id yet, create one.!SFind an interaction point by  by searching the whole map.<O(n): linear in the number of registered interaction points.!T+Hook up meta variable to interaction point.!U$Mark an interaction point as solved.!VGet a list of interaction ids.!W:Get all metas that correspond to unsolved interaction ids.!X:Get all metas that correspond to unsolved interaction ids.!Y:Does the meta variable correspond to an interaction point?Time: O(n) where n$ is the number of interaction metas.!Z7Get the information associated to an interaction point.![Get K for an interaction point. Precondition: interaction point is connected.!\KCheck whether an interaction id is already associated with a meta variable.!^Generate new meta variable.!_jGenerate a new meta variable with some instantiation given. For instance, the instantiation could be a j.!`Get the  for an interaction point.!aGet the  for a meta variable.!hlistenToMeta l m : register l as a listener to m3. This is done when the type of l is blocked by m.!iUnregister a listener.!jGet the listeners to a meta.!lKFreeze all so far unfrozen metas for the duration of the given computation.!mGFreeze all meta variables and return the list of metas that got frozen.!nHFreeze some meta variables and return the list of metas that got frozen.!oThaw all meta variables.!p6Thaw some metas, as indicated by the passed condition.!rDoes not worry about raising.9!9!:!;!<!=!>!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!qK!=!>!?!@!A!B!C!D!E!F!G!;!<!z!y!x!w!v!u!t!s!r!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!9!:!!!!!!~!}!|!{!9!:!;!<None"#$+-03457;<=>?ACNQV]^!MAdd all constraints belonging to the given problem to the current problem(s).!Get the awake constraints!Suspend constraints matching the predicate during the execution of the second argument. Caution: held sleeping constraints will not be woken up by events that would normally trigger a wakeup call.!Add new a constraint!Add already awake constraints!Start solving constraints!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!ANone"#$+-03457;<=>?ACNQV]^[       01E>FD23456789:;<=?@ABCGHIJKLMNOPQ VWCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()+*,-./RSTUXYZ[\^]_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdegfhijklmnopqrvustwxyz{|}~   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMcedfghijklmnopqrstuvwxyz{|}~                     " # $ % & ' ( ) * + , - !!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!6!7!8!9!:!;!<!=!>!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!None"#$+-03457;<=>?ACNQV]^^!!None"#$+-03457;<=>?ACNQV]^^+!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!None"#$+-03457;<=>?ACNQV]^ !!!!!!!!!!!!!None"#$+-03457;<=>?ACNQV]^.!!!!None"#$+-03457;<=>?ACNQV]^.None"#$+-03457;<=>?ACNQV]^!dEncodes something. To ensure relocatability file paths in positions are replaced with module names.!:Decodes something. The result depends on the include path.Returns ,f if the input does not start with the right magic number or some other decoding error is encountered.!dEncodes something. To ensure relocatability file paths in positions are replaced with module names.!:Decodes something. The result depends on the include path.Returns ,e if the file does not start with the right magic number or some other decoding error is encountered..Store a  (map from  AbsolutePath to TopLevelModuleName) as map from  AbsolutePath to Int32t, in order to directly get the identifiers from absolute pathes rather than going through top level module names..{Maps file names to the corresponding module names. Must contain a mapping for every file name that is later encountered.!!!!!!!!!!!!!!None"#$+-03457;<=>?ACNQV]^!;Apply a function if a certain verbosity level is activated.-Precondition: The level must be non-negative. !!!!!!!!!! !!!!None"#$+-03457;<=>?ACFNQTV]^J"BExpand literal integer pattern into suc/zero constructor patterns."7Expand away (deeply) all pattern synonyms in a pattern." " "" """ " " """"""" " " None"#$+-03457;<=>?ACNQV]^""""")"("'"&"%"$"#"""!" """"""""""None"#$+-03457;<=>?ACNQV]^2W"*ZPrepare parts of a parameter telescope for abstraction in constructors and projections."+)Used to modify context when going into a rel argument.",rCompose two relevance flags. This function is used to update the relevance information on pattern variables a! after a match against something rel."-sModify the context whenever going from the l.h.s. (term side) of the typing judgement to the r.h.s. (type side).".TInternal workhorse, expects value of --experimental-irrelevance flag as argument."/(Conditionally) wake up irrelevant variables and make them relevant. For instance, in an irrelevant function argument otherwise irrelevant variables may be used, so they are awoken before type checking the argument."0 Wake up irrelevant variables and make them relevant. This is used when type checking terms in a hole, in which case you want to be able to (for instance) infer the type of an irrelevant variable. In the course of type checking an irrelevant function argument "/> is used instead, which also sets the context relevance to X. This is not the right thing to do when type checking interactively in a hole since it also marks all metas created during type checking as irrelevant (issue #2568)."*"+","-"."/"0"*"+","-"."/"0None"#$+-03457;<=>?ACNQV]^4["53Contracts all eta-redexes it sees without reducing."1"3"2"4"5"6"1"2"3"4"5"6"1"2"3None"#$+-03457;<=>?ACNQVZ]^GG "7instantiateFull' "B5s metas everywhere (and recursively) but does not "D.";uOnly unfold definitions if this leads to simplification which means that a constructor/literal pattern is matched."@Instantiate something. Results in an open meta variable or a non meta. Doesn't do any reduction, and preserves blocking tags (when blocking meta is uninstantiated)."H+Meaning no metas left in the instantiation."ICase on whether a term is blocked on a meta (or is a meta). That means it can change its shape when the meta is instantiated."J;Case on whether a type is blocked on a meta (or is a meta)."OIf the first argument is ,0, then a single delayed clause may be unfolded."SIReduce a non-primitive definition if it is a copy linking to another def."T*Reduce simple (single clause) definitions."VpApply a definition using the compiled clauses, or fall back to ordinary clauses if no compiled clauses exist."XApply a defined function to it's arguments, using the compiled clauses. The original term is the first argument applied to the third."ZGApply a defined function to it's arguments, using the original clauses.&"7"8"9":";"<"="?">"@"A"B"C"D"E"F"G"H"I"J"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"B"C"D"E"F"G"H"@"A"p"o"n"m"l"k"j"i"h"g"f"e"d"c"b"a"`"_"^"]"I"J"=">"?""""""~"}"|"{"z"y"x"w"K"L"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["v"u"t"s"r"q";"<""\""""""""""""""""""""""""9":""""""""""""""""""""""""""""""7"8"""""""""""""""""""""""""""""""""""""""""""""""""""""7"8"9":";"<"=">"?"@"ANone"#$+-03457;<=>?ACNQV]^;+Gather leading s of a type in a telescope.A safe variant of piApply."A telescope split in two.";The permutation takes us from the original telescope to firstPart ++ secondPart."(Flatten telescope: ( : Tel) -> [Type ]"YOrder a flattened telescope in the correct dependeny order:  -> Permutation ( -> ~)Since reorderTel tel( uses free variable analysis of type in tel, the telescope should be "Fd."\Unflatten: turns a flattened telescope into a proper telescope. Must be properly ordered."(Get the suggested names from a telescope" A variant of " which takes the argument names (and the argument info) from the first telescope and the variable names from the second telescope.6Precondition: the two telescopes have the same length.#Permute telescope: permutes or drops the types in the telescope according to the given permutation. Assumes that the permutation preserves the dependencies in the telescope.3For example (Andreas, 2016-12-18, issue #2344): x tel = (A : Set) (X : _18 A) (i : Fin (_m_23 A X)) tel (de Bruijn) = 2:Set, 1:_18 0, 0:Fin(_m_23 1 /0) flattenTel tel = 2:Set, 1:_18 0, 0:Fin(_m_23 1 0) |- [ Set, _18 2, Fin (_m_23 2 1) ] perm = 0,1,2 -> 0,1 (picks the first two) renaming _ perm = [var 0, var 1, error] -- THE WRONG RENAMING! renaming _ (flipP perm) = [error, var 1, var 0] -- The correct renaming! apply to flattened tel = ... |- [ Set, _18 1, Fin (_m_23 1 60) ] permute perm it = ... |- [ Set, _18 11 ] unflatten (de Bruijn) = 1:Set, 0: _18 90 unflatten = (A : Set) (X : _18 A) #Recursively computes dependencies of a set of variables in a given telescope. Any dependencies outside of the telescope are ignored.#^Split a telescope into the part that defines the given variables and the part that doesn't.See BC.#|As splitTelescope, but fails if any additional variables or reordering would be needed to make the first part well-typed.#Try to instantiate one variable in the telescope (given by its de Bruijn level) with the given value, returning the new telescope and a substitution to the old one. Returns Nothing if the given value depends (directly or indirectly) on the variable.#QTry to eta-expand one variable in the telescope (given by its de Bruijn level)#telViewUpTo n t takes off the first n function types of t. Takes off all if n < 0.#telViewUpTo' n p t takes off $t$ the first n (or arbitrary many if n < 0-) function domains as long as they satify p.#Decomposing a function type.# If the given type is a Piu, pass its parts to the first continuation. If not (or blocked), pass the reduced type to the second continuation.# If the given type is a Piu, pass its parts to the first continuation. If not (or blocked), pass the reduced type to the second continuation.# &If the given type is blocked or not a Pi;, pass it reduced to the first continuation. If it is a Pi,, pass its parts to the second continuation.# &If the given type is blocked or not a Pi;, pass it reduced to the first continuation. If it is a Pi,, pass its parts to the second continuation.#Compute type arity#AStrips all Pi's and return the head definition name, if possible.#Try to solve the instance definitions whose type is not yet known, report an error if it doesn't work and return the instance table otherwise.#A set of de Bruijn indices.Original telescope. firstPart mentions the given variables,  secondPart not.#A list of de Bruijn indicesThe telescope to split firstPart5 mentions the given variables in the given order,  secondPart contains all other variables#"   " var k : A  " u : A("""""""""""""""""""########## # # # # #####("""""""""##"""""######## # # # # #"""""####""""""""""None"#$+-03457;<=>?ACNQV]^@#,Instantiate full as long as things are equal.%Monad for checking syntactic equality#'Syntactic equality check for terms. t checkSyntacticEquality v v' = do (v,v') <- instantiateFull (v,v') return ((v,v'), v==v')  only that v,v'B are only fully instantiated to the depth where they are equal..Return, flagging inequalty..0If inequality is flagged, return, else continue.#!Syntactic equality ignores sorts.#  Syntactic term equality ignores  stuff.#####..None"#$+-03457;<=>?ACNQV]^g#+Get the  as a .#.-Raises an error if no level kit is available.#!#"#*#)#(#'#&#%#$###+#,#-#.#/#0#1#2#3#4#5#6#7#8#!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#! #"###$#%#&#'#(#)#*None"#$+-03457;<=>?ACNQV]^D#::When making a function projection-like, we drop the first n arguments.#<To drop the first nL arguments in a compiled clause, we reduce the split argument indices by n and drop n arguments from the bodies. NOTE: this only works for non-recursive functions, we are not dropping arguments to recursive calls in bodies.#>,NOTE: does not work for recursive functions.#@=NOTE: This creates telescopes with unbound de Bruijn indices.#:#;#:#;#A#@#?#>#=#<#:#;None"#$+-03457;<=>?ACNQV]^#BaSubstitute terms with origin into display terms, replacing variables along with their origins.The purpose is to replace the pattern variables in a with-display form, and only on the top level of the lhs. Thus, we are happy to fall back to ordinary substitution where it does not matter. This fixes issue #2590.#DClass Match for matching a term p, in the role of a pattern against a term v.The 0th variable in pP plays the role of a place holder (pattern variable). Each occurrence of var 0 in p) stands for a different pattern variable.sThe result of matching, if successful, is a list of solutions for the pattern variables, in left-to-right order.*The 0th variable is in scope in the input vC, but should not actually occur! In the output solution, the 0th@ variable is no longer in scope. (It has been substituted by  IMPOSSIBLE( which corresponds to a raise by -1).#F Convert a + into a .#G0Get the arities of all display forms for a name.#H!Find a matching display form for q es&. In essence this tries to rewrite q es with any display form  q ps --> dt! and returns the instantiated dt" if successful. First match wins.#IMatch a 2 q ps = v against q es. Return the + v[us]' if the match was successful, i.e., es / ps = Just us.#B#C#D#E#F#G#H#I#F#G#H#I#D#E#O#N#M#L#K#J#B#C#U#T#S#R#Q#P#B#C#D#ENone"#$+-03457;<=>?ACNQV]^*.=A graph is cyclic if it has any strongly connected component..recDef names name returns all definitions from names! that are used in the body of name.#canysDef names a returns all definitions from names that are used in a.#b#c#b#cNone"#$+-03457;<=>?ACNQV]^#e Check that   "  : .#d#e#d#eNone"#$+-03457;<=>?ACNQV]^w#i Variant of #f- which does not insert outermost parentheses.#j Variant of #g- which does not insert outermost parentheses.#f#g#h#i#j#f#g#h#i#jNone"#$+-03457;<=>?ACFKNQTVZ]^%.0Collect the binders in some abstract syntax lhs.. blank bound e& replaces all variables in expression e that are not in bound by an underscore _. It is used for printing dot patterns: we don't want to make implicit variables explicit, so we blank them out in the dot patterns instead (this is fine since dot patterns can be inferred anyway).#lJAlso tracks whether module parameters should be dropped from the patterns...Drops hidden arguments unless --show-implicit...Drops hidden arguments unless --show-implicit...Drops hidden arguments unless --show-implicit...Drops hidden arguments unless --show-implicit..reifyDisplayForm f vs fallback tries to rewrite f vs with a display form for fK. If successful, reifies the resulting display term, otherwise, does fallback..reifyDisplayFormP; tries to recursively rewrite a lhs with a display form.=Note: we are not necessarily in the empty context upon entry!. -nameFirstIfHidden (x:a) ({e} es) = {x = e} es.Removes implicit arguments that are not needed, that is, that don't bind any variables that are actually used and doesn't do pattern matching. Doesn't strip any arguments that were written explicitly by the user.#ptAssumes that pattern variables have been added to the context already. Picks pattern variable names from context..If the record constructor is generated or the user wrote a record pattern, turn constructor pattern into record pattern. Otherwise, keep constructor pattern.#|BSkip reification of implicit and irrelevant args if option is off.#k#l#m#n#o#p#m#n#o#k#l#p.........#k#l#m#n#oNone"#$+-03457;<=>?ACNQV]^מ#ELine reader. The line reader history is not stored between sessions.C#C#None"#$+-03457;<=>?ACNQV]^ئ################None"#$+-03457;<=>?ACNQV]^Z. Converts the  and 2 fields to atoms readable by the Emacs interface..JShows meta information in such a way that it can easily be read by Emacs.#DTurns syntax highlighting information into a list of S-expressions..@Must contain a mapping for the definition site's module, if any.#:Must contain a mapping for every definition site's module.##None"#$+-03457;<=>?ACNQV]^R####None"#$+-03457;<=>?ACNQV]^Z##None"#$+-03457;<=>?ACNQV]^R##..None"#$+-03457;<=>?ACNQV]^[##. ..........None"#$+-03457;<=>?ACNQV]^#Calls a compiler:Checks the exit code to see if the compiler exits successfully. If not, then an exception is raised, containing the text the compiler printed to stderr (if any).eUses the debug printout machinery to relay any progress information the compiler prints to stdout.#Generalisation of  callCompiler) where the raised exception is returned.#$Should we actually call the compilerThe path to the compilerCommand-line arguments.#The path to the compilerCommand-line arguments.####None"#$+-03457;<=>?ACNQV]^j#uRun before serialisation to remove any definitions that are not reachable from the public interface to the module.##None"#$+-03457;<=>?ACNQV]^#.Adds a new unique name to the current context.#@Returns the name of the variable with the given de Bruijn index.#^Translate reflected syntax to abstract, using the names from the current typechecking context.#5Drop implicit arguments unless --show-implicit is on. #####################################None"#$+-03457;<=>?ACNQV]^y#2Pairing something with a node (for printing only).#!Comma-separated list in brackets.## without the brackets.##Proper pretty printing of patterns:'     #############################e########## ## #  ########## $)$($'$&$%$$$#$"$!$ $$$$$$$$$$$$$$$$$$$ $ $ $ $ $$$$$$$$$########$+$*##############$-$, #### 5 6 6#5#6None"#$+-03457;<=>?ACNQVZ]^($.Size constraints we can solve.$/ Leq a +n b represents  a =< b + n.  Leq a -n b represents  a + n =< b.$0Atomic size expressions.$1)A size meta applied to de Bruijn indices.$2A de Bruijn index.$3JCheck whether a type is either not a SIZELT or a SIZELT that is non-empty.$4;Precondition: Term is reduced and not blocked. Throws a  if undecided$5-Checks that a size variable is ensured to be > 0. E.g. variable i cannot be zero in context 9(i : Size) (j : Size< ! ! i) (k : Size< j) (k' : Size< k). Throws a  if undecided.$6OCheck whether a variable in the context is bounded by a size expression. If  x : Size< a, then a is returned.$7XWhenever we create a bounded size meta, add a constraint expressing the bound. In boundedSizeMetaHook v tel a, tel includes the current context.$8#trySizeUniv cmp t m n x els1 y els28 is called as a last resort when conversion checking m cmp n : t failed for definitions  m = x els1 and  n = y els2, where the heads x and y are not equal. trySizeUniv9 accounts for subtyping between SIZELT and SIZE, like Size< i =< Size.>If it does not succeed it reports failure of conversion check.$9OCompute the deep size view of a term. Precondition: sized types are enabled.$;Compare two sizes.$<Compare two sizes in max view.$=compareBelowMax u vs checks  u <= max vs. Precondition:  size vs >= 2$?3Checked whether a size constraint is trivial (like X <= X+1).$@9Test whether a problem consists only of size constraints.$A(Test is a constraint speaks about sizes.$B(Take out all size constraints (DANGER!).$CFind the size constraints.$D.Return a list of size metas and their context.$ECompute a set of size constraints that all live in the same context from constraints over terms of type size that may live in different contexts.cf. D$F@Turn a constraint over de Bruijn indices into a size constraint.$GFTurn a term with de Bruijn indices into a size expression with offset. Throws a , if the term isn't a proper size expression.$HUCompute list of size metavariables with their arguments appearing in a constraint.$IKConvert size constraint into form where each meta is applied to indices  0,1,..,n-1 where n is the arity of that meta. X[] <= t becomes X[id] <= t[^-1] X[] "d Y[] becomes X[id] "d Y[[^-1]] or X[[^1]] "d Y[id]: whichever is defined. If none is defined, we give up.$JAMain function. Uses the old solver for size constraints using Agda.Utils.Warshall6. This solver does not smartly use size hypotheses  j : Size< i<. It only checks that its computed solution is compatible$K&Old solver for size constraints using Agda.Utils.Warshall6. This solver does not smartly use size hypotheses  j : Size< i.$KSize metas and their arity.(Size constraints (in preprocessed form).Returns False if solver fails.$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K $3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$0$1$2$L$.$/$M$E$F$G$H$I$J$K$.$/$0$1$2None"#$+-03457;<=>?ACNQV]^Um$O7State worked on during the main loop of checking a lhs.$V`Instantiations of a dot pattern with a term. `Maybe e` if the user wrote a dot pattern .e ,? if this is an instantiation of an implicit argument or a name.$\ Result of  splitProblem*: Determines position for the next split.$]Split on constructor pattern.$^Split on projection pattern.$_BThe typed user patterns left of the split position. Invariant: $ == empty.$`0How to split the variable at the split position.$a4The typed user patterns right of the split position.$b@The projection could be belonging to an irrelevant record field.$j.Do we come from an implicit or record pattern?$q<Type of variable we are splitting, kept for record patterns.$u1User patterns that could not be given a type yet. Example:  f : (b : Bool) -> if b then Nat else Nat -> Nat f true = zero f false zero = zero f false (suc n) = n G In this sitation, for clause 2, we construct an initial problem  problemInPat = [false] problemTel = (b : Bool) problemRest.restPats = [zero] problemRest.restType = if b then Nat else Nat -> Nat  As we instantiate b to false, the $x reduces to  Nat -> Nat and we can move pattern zero over to  problemInPat.$w3List of user patterns which could not yet be typed.$xType eliminated by $w . Can be Xx to indicate that we came by an irrelevant projection and, hence, the rhs must be type-checked in irrelevant mode.$zThe de Bruijn indices in the pattern refer to positions in the list of abstract patterns in the problem, counted from the back.${&State of typechecking a LHS; input to split!. [Ulf Norell's PhD, page. 35]In Problem ps p delta, ps( are the user patterns of supposed type delta. p- is the pattern resulting from the splitting.$}User patterns.$~Patterns after splitting.$Type of in patterns.$"Patterns that cannot be typed yet.$Flexible variables are equipped with information where they come from, in order to make a choice which one to assign when two flexibles are unified.$When we encounter a flexible variable in the unifier, where did it come from? The alternatives are ordered such that we will assign the higher one first, i.e., first we try to assign a DotFlex , then...$From a record pattern (). Saves the $ of its subpatterns.$-From a hidden formal argument or underscore (WildP).$From a dot pattern ().$*From a non-record constructor or literal ( or ).$*Put a typed pattern on the very left of a  SplitProblem.$p A pattern.x* The name of the argument (from its type).t Its type.The split problem, containing $_ ps;xs:ts.The result, now containing $_ (p,ps);(x,xs):(t,ts).I$O$P$S$R$Q$T$U$V$W$[$Z$Y$X$\$^$]$d$c$b$a$`$_$e$h$g$f$t$s$r$q$p$o$n$m$l$k$j$i$u$v$x$w$y$z${$|$$$~$}$$$$$$$$$$$$$$$$$$$$$$$^$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$${$|$}$~$$$z$y$u$v$w$x$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$\$]$^$_$`$a$b$c$d$$V$W$X$Y$Z$[$T$U$O$P$Q$R$S$$$$$$$$$$ $O$P$Q$R$S$T$U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m$n$o$p$q$r$s$t$u$v$w$x${$|$}$~$$$$$$$$$$$$$$$$$$$$$None"#$+-03457;<=>?ACNQV]^]w$MInstantiate a telescope with a substitution. Might reorder the telescope. +instantiateTel ( : Tel)( :  --> ) = ~( Monadic only for debugging purposes.$2Produce a nice error message when splitting failed$$$$None"#$+-03457;<=>?ACNQV]^^w$$None"#$+-03457;<=>?ACNQVZ]^+!TCheck if a name refers to a record constructor. If yes, return record definition."KCheck if a constructor name is the internally generated record constructor.%Works also for abstract constructors.",The fields should be eta contracted already."We can eta contract if all fields f = ...! are irrelevant or all fields f are the projection f v of the same value v?, but we need at least one relevant field to find the value v.oTODO: this can be moved out of TCM (but only if ConHead stores also the Arg-decoration of the record fields." Get the field names of a record."3Check if a name refers to an eta expandable record."HCheck if a name refers to a record. If yes, return record definition.$8Replace projection patterns by the original projections.$Typing of an elimination.$Type of the argument.$+The type of the record which is eliminated.$The type of the field.$YOrder the fields of a record construction. Use the second argument for missing fields.$A record field assignment record{xs = es}+ might not mention all visible fields. insertMissingFields inserts placeholders for the missing visible fields and returns the values in order of the fields in the record declaration.$1The name of the module corresponding to a record.$yGet the definition for a record. Throws an exception if the name does not refer to a record or the record is abstract.$.Get the record name belonging to a field name.$0Find all records with at least the given fields.$ Get the field types of a record.$/Get the field names belonging to a record type.$HReturns the given record type's constructor name (with an empty range).$Reduce a type and check whether it is a record type. Succeeds only if type is not blocked by a meta var. If yes, return its name, parameters, and definition.$Reduce a type and check whether it is a record type. Succeeds only if type is not blocked by a meta var. If yes, return its name, parameters, and definition. If no, return the reduced type (unless it is blocked).$*Get the original projection info for name.$getDefType f t? computes the type of (possibly projection-(like)) function f whose first argument has type t . The  parameters for f are extracted from t. Nothing if f is projection(like) but t is not a datarecord axiom type.Precondition: t is reduced. See also: E$The analogue of . If v is a value of record type t with field f, then projectTyped v t f returns the type of f v0. And also the record type (as first result).+Works also for projection-like definitions f9. In this case, the first result is not a record type.Precondition: t is reduced.$AGiven a head and its type, compute the types of the eliminations.$dCheck if a name refers to a record which is not coinductive. (Projections are then size-preserving)$`Check if a type is an eta expandable record and return the record identifier and the parameters.$YTurn off eta for unguarded recursive records. Projections do not preserve guardedness.$`Turn on eta for inductive guarded recursive records. Projections do not preserve guardedness.$ETurn on eta for non-recursive record, unless user declared otherwise.$1Check whether record type is marked as recursive.9Precondition: record type identifier exists in signature.$ etaExpandBoundVar i = (, , )%Precondition: The current context is  =  , x:R pars,   where | | = i and R4 is a eta-expandable record type with constructor c and fields '.Postcondition:  =  , ',  [c '] and   "  :  and   "  : .$ #expandRecordVar i  = (, , , ')Precondition:  =  , x:R pars,   where | | = i and R7 is a eta-expandable record type with constructor c and fields '.Postcondition:  =  , ',  [c '] and   "  :  and   "  : .$CPrecondition: variable list is ordered descendingly. Can be empty.$ curryAt v ( (y : R pars) -> B) n = ( v ->   ys ! v  (c ys) {- curry -} , v ->   y ! v  (p1 y) ... (pm y) {- uncurry -} ,  (ys : As) ! B[c ys / y] )where  n = size .$etaExpand r pars u, computes the eta expansion of record value u at record type r pars.The first argument r? should be the name of an eta-expandable record type. Given /record R : Set where field x : A; y : B; .z : Cand r : R, /etaExpand R [] r = (tel, [R.x r, R.y r, R.z r])where tel8 is the record telescope instantiated at the parameters pars.$DEta expand a record regardless of whether it's an eta-record or not.$VIs the type a hereditarily singleton record type? May return a blocking metavariable.nPrecondition: The name should refer to a record type, and the arguments should be the parameters to the type.$Return the unique (closed) inhabitant if exists. In case of counting irrelevance in, the returned inhabitant contains garbage.$[Check whether a type has a unique inhabitant and return it. Can be blocked by a metavar.$hCheck whether a type has a unique inhabitant (irrelevant parts ignored). Can be blocked by a metavar.$Auxiliary function.$*Name of record type (for error reporting).=Function to generate a placeholder for missing visible field. Given fields.All record field names with ?.BGiven fields enriched by placeholders for missing explicit fields.$Head (record value). Its type. Projection.5!"""""$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$;$$$$$"$$$$$"$$$$$$$$$$$$"$$$!"$$$$$$$$$$$$$$"$$$$$$$$$$$$$$$$$$$$$None"#$+-03457;<=>?ACNQVZ]^ $OMatch a non-linear pattern against a neutral term, returning a substitution.$Matching against a term produces a constraint which we have to verify after applying the substitution computed by matching.$+Telescope of free variables in the equation$-Term from pattern, living in pattern context.$BTerm from scrutinee, living in context where matching was invoked.$Monad for non-linear matching.$@Turn a term into a non-linear pattern, treating the free variables as pattern variables. The first argument indicates the relevance we are working under: if this is Irrelevant, then we construct a pattern that never fails to match. The second argument is the number of bound variables (from pattern lambdas).%Add substitution i |-> v to result of matching.% PUntyped -equality, does not handle things like empty record types. Returns , if the terms are equal, or `Just b` if the terms are not (where b contains information about possible metas blocking the comparison)% mNormalise the given term but also preserve blocking tags TODO: implement a more efficient version of this.$3Are we currently matching in an irrelevant context?"The telescope of pattern variables'The telescope of lambda-bound variablesThe pattern to match*The term to be matched against the pattern$$$$$$$$$$$$$$$$%%%%%%%%%% % % % /$$%%%%%%%% $$$$$%%%%%%%%$$$$$$$$$%%%%%%%%%%%% % % % $$$$$$$$$$$$$None"#$+-03457;<=>?ACNQV]^%Could the literal cover (an instantiation of) the split clause pattern? Basically, the split clause pattern needs to be a variable.Note: literal patterns do not occur in the split clause since we cannot split into all possible literals (that would be infeasible).%!Variable blocking a match.%#/De Bruijn index of variable blocking the match.%$Nothing means there is an overlapping match for this variable. This happens if one clause has a constructor pattern at this position, and another a variable. It is also used for "just variable". Just cons2 means that it is an non-overlapping match and cons" are the encountered constructors.%%If matching is inconclusive (Block<) we want to know which variables are blocking the match.%&Matches unconditionally.%'Definitely does not match.%(YCould match if non-empty list of blocking variables is instantiated properly. Also . is ,O if all clauses have a result split. (Only then can we do result splitting.)%)If matching succeeds, we return the instantiation of the clause pattern vector to obtain the split clause pattern vector, plus the literals of the clause patterns matched against split clause variables.%*Given the function clauses cs the patterns psIwe want to compute a variable index of the split clause to split on next.First, we find the set cs': of all the clauses that are instances (via substitutions rhos) of the split clause.vIn these substitutions, we look for a column that has only constructor patterns. We try to split on this column first.2Match the given patterns against a list of clauses%+CConvert the root of a term into a pattern constructor, if possible.%,-A pattern that matches anything (modulo eta).%- Lens for %$.%0%Left dominant merge of blocking vars.%1 choice m m' combines the match results m of a function clause with the (already combined) match results $m'$ of the later clauses. It is for skipping clauses that definitely do not match (%')). It is left-strict, to be used with foldr,. If one clause unconditionally matches (%&) we do not look further.%2NUse this function if literal patterns should not cover a split clause pattern.%3TUse this function if a literal pattern should cover a split clause variable pattern.%4>Check if a clause could match given generously chosen literals%5matchClause mlit qs i c checks whether clause c number i( covers a split clause with patterns qs.%6matchPats mlit ps qs3 checks whether a function clause with patterns ps% covers a split clause with patterns qs.Issue 842 / 1986: This is accepted: D F : Bool -> Set1 F true = Set F = x -> Set / For the second clause, the split clause is F false, so there are more patterns in the split clause than in the considered clause. These additional patterns are simply dropped by zipWith. This will result in  mconcat [] which is Yes [].%7matchPat mlit p q* checks whether a function clause pattern p" covers a split clause pattern q. There are three results: Yes rs means it covers, because p is a variable pattern. rs4 collects the instantiations of the variables in p s.t.  p[rs] = q. No means it does not cover.  Block [x] means p is a proper instance of q and could become a cover if q was split on variable x.%:]Combine results of checking whether function clause patterns covers split clause patterns.%' is dominant: if one function clause pattern is disjoint to the corresponding split clause pattern, then the whole clauses are disjoint.%&5 is neutral: for a match, all patterns have to match.%( accumulates variables of the split clause that have to be instantiated (an projection names of copattern matches) to make the split clause an instance of the function clause.%5Consider literals?Split clause patterns qs.Clause number i.Clause c to cover split clause.Result. If %& the instantiation rs such that (namedClausePats c)[rs] == qs.%6Matcher for literals.Clause pattern vector ps( (to cover split clause pattern vector).Split clause pattern vector qs* (to be covered by clause pattern vector).Result. If %& the instantiation rs such that  ps[rs] == qs.%7Matcher for literals.Clause pattern p! (to cover split clause pattern).Split clause pattern q# (to be covered by clause pattern).Result. If %&, also the instantiation rsI of the clause pattern variables to produce the split clause pattern,  p[rs] = q.%% %!%"%$%#%%%'%&%(%)%*%+%,%-%.%/%0%1%2%3%4%5%6%7%*%+%,%)%%%&%'%(%!%"%#%$%8% %-%.%/%0%1%%2%3%4%5%6%:%9%7%!%"%#%$%%%&%'%(None"#$+-03457;<=>?ACNQV]^%=%>%D%C%B%A%@%?%E%F%G%H%I%J%K%L%M%N%O%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%=%>%?%@%A%B%C%DNone"#$+-03457;<=>?ACNQV]^0R/What is the polarity of a function composition?Main function of this module.%Ppolarities i a4 computes the list of polarities of de Bruijn index i in syntactic entity a.%R'Infimum on the information lattice. " is bottom (dominant for inf),  is top (neutral for inf).%S* negation, swapping monotone and antitone.%U#Get the next polarity from a list,  if empty.%VReplace  by &. (Arbitrary bias, but better than , see issue 1596).%W6A quick transliterations of occurrences to polarities.%X|Data and record parameters are used as phantom arguments all over the test suite (and possibly in user developments). enablePhantomTypes turns  parameters to  to enable phantoms.%YMake arguments  if the type of a not-K later argument depends on it. Also, enable phantom types by turning b into something else if it is a data/record parameter but not a size argument. [See issue 1596]SPrecondition: the "phantom" polarity list has the same length as the polarity list.%ZhCheck whether a variable is relevant in a type expression, ignoring domains of non-variant arguments.%[oHack for polarity of size indices. As a side effect, this sets the positivity of the size index. See testsucceed9PolaritySizeSucData.agda for a case where this is needed.%\checkSizeIndex d np i a% checks that constructor target type a has form d ps (!  i) idxs where  |ps| = np.Precondition: a is reduced and of form  d ps idxs0.%] polarity i a* computes the polarity of de Bruijn index i in syntactic entity a by taking the infimum of all %Q.%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%R%S%T%U%V%W%X%Y%Z%[%\%P%Q%]%h%g%f%e%d%c%b%a%`%_%^%P%QNone"#$+-03457;<=>?ACNQV]^C%j'this many implicits have to be inserted%k=hidden argument where there should have been a non-hidden arg%lbad named argument%nimplicitArgs n expand eti t generates up to n+ implicit arguments metas (unbounded if n<0), as long as t is a function type and expand( holds on the hiding info of its domain.If explicit arguments are to be inserted as well, they are inserted as instance arguments (used for recursive instance search).%o implicitNamedArgs n expand eti t generates up to n1 named implicit arguments metas (unbounded if n<0), as long as t is a function type and expand1 holds on the hiding and name info of its domain.If explicit arguments are to be inserted as well, they are inserted as instance arguments (used for recursive instance search).%p'Create a metavariable according to the e info.%q'Create a questionmark according to the e info.%sThe list should be non-empty.%pKind/relevance of meta.Name suggestion for meta. Type of meta.#The created meta as id and as term.%qKind/relevance of meta.Name suggestion for meta. Type of meta.#The created meta as id and as term. %i%m%l%k%j%n%o%p%q%r%s %n%o%p%q%i%j%k%l%m%r%s%i%j%k%l%mNone"#$+-03457;<=>?ACNQV]^Nb%u&Insert implicit patterns in a problem.%v.Eta-expand implicit pattern if of record type.%w/Try to eta-expand implicit pattern. Returns ,O unless dealing with a record type that has eta-expansion and a constructor c. In this case, it returns ,  c _ _ ... _R (record constructor applied to as many implicit patterns as there are fields).%y;Insert implicit patterns in a list of patterns. Even if  (, trailing SIZELT patterns are inserted.%z(Insert trailing SizeLt patterns, if any.%{;Insert implicit patterns in a list of patterns. Even if  (, trailing SIZELT patterns are inserted.%u%v%w%x%y%z%{%u%v%w%x%y%z%{None"#$+-03457;<=>?ACNQV]^`.%|HRename the variables in a telescope using the names from a given pattern%~)Are there any untyped user patterns left?%Construct an initial split $z% from user patterns. Example: @dCase : {A : Set} ! Maybe A ! Set ! Set ! Set Case nothing B C = B Case (just _) B C = Csample : {A : Set} (m : Maybe A) ! Case m Bool (Maybe A ! Bool) sample (just a) (just b) = true sample (just a) nothing = false sample nothing = true 2 The problem generated for the first clause of sample with patterns just a, just b would be: > problemInPat = ["_", "just a"] problemOutPat = [A, "m"] problemTel = [A : Set, m : Maybe A] problemRest = restPats = ["just b"] restType = "Case m Bool (Maybe A -> Bool)" @%Try to move patterns from the problem rest into the problem. Possible if type of problem rest has been updated to a function type.%The user patterns.%The type the user patterns eliminate.7The initial problem constructed from the user patterns.%|%}%~%%%%|%}%~%%%None"#$+-03457;<=>?ACNQV]^d%kExpand a clause to the maximal arity, by inserting variable patterns and applying the body to variables.%MGet the name of defined symbol of the head normal form of a term. Returns , if no such head exists.%%%%None"#$+-03457;<=>?ACNQV]^^ !4zGet the name of the datatype constructed by a given constructor. Precondition: The argument must refer to a constructor!5(Get true constructor with record fields.%Arity.%List of field names.%TGet true constructor with fields, expanding literals to constructors if possible.%sAugment constructor with record fields (preserve constructor name). The true constructor might only surface via reduce.%getConType c t/ computes the constructor parameters from type t? and returns them plus the instantiated type of constructor c. This works also if tI is a function type ending in a data/record type; the term from which c comes need not be fully appliedNothing if t= is not a data/record type or does not have a constructor c.%getFullyAppliedConType c t7 computes the constructor parameters from data type t? and returns them plus the instantiated type of constructor c.Nothing if t= is not a data/record type or does not have a constructor c.Precondition: t is reduced.%rReturn the number of non-parameter arguments to a data constructor, or the field names of a record constructor.*For getting just the arity of constructor c , use either id size  $ getConstructorArity c.%JCheck if a name refers to a datatype or a record with a named constructor.%1Check if a name refers to a datatype or a record.% Precodition:  is reduced.%,Precondition: Name is a data or record type.% Constructor.Ending in data/record type.Nothing$ if not ends in data or record type.Just ((d, dt, pars), ct) otherwise, where d* is the data or record type name, dt0 is the type of the data or record name, pars( are the reconstructed parameters, ctA is the type of the constructor instantiated to the parameters.% Constructor..Reduced type of the fully applied constructor.Nothing if not data or record type.Just ((d, dt, pars), ct) otherwise, where d* is the data or record type name, dt0 is the type of the data or record name, pars( are the reconstructed parameters, ctA is the type of the constructor instantiated to the parameters.!4!5%%%%%%%%%%%%%%%%!5%%!4%%%%%%%%%%%%%%%%%%%%None"#$+-03457;<=>?ACNQV]^.~Given a fully applied constructor term and its type, deconstruct it and return, amongst others, the types of its arguments..Type need not be reduced.Fully applied constructor.gData/record type name, constructor name, argument telescope, types of arguments. arguments.%%None"#$+-03457;<=>?ACKNQV]^Մ.Record pattern trees..ICorresponds to variable and dot patterns; contains the original pattern.. RecCon t args/ stands for a record constructor application: tl is the type of the application, and the list contains a projection function and a tree for every argument.., p6 means that a variable (corresponding to the pattern p7, a variable or dot pattern) should be kept unchanged. , (n, x, t) means that n / variables, and n /E dot patterns, should be removed, and a new variable, with the name x5, inserted instead. The type of the new variable is t./VarPat# stands for variable patterns, and DotPat for dot patterns./*A monad used to translate record patterns.The state records the number of variables produced so far, the reader records the total number of variables produced by the entire computation. Functions using this monad need to be sufficiently lazy in the reader component./ dropFrom i n drops arguments j with  j < i + n and j >= i . NOTE: n7 can be negative, in which case arguments are inserted./4Split tree annotated for record pattern translation./Split tree annotation./!Constructor name for this branch./Arity of the constructor./ $Should we translate this split away?%Take a record pattern p_ and yield a list of projections corresponding to the pattern variables, from left to right. E.g. for  (x , (y , z)) we return [ fst, fst . snd, snd . snd ].%If it is not a record pattern, error { is raised./ ]Take a matrix of booleans (at least one row!) and summarize the columns using conjunction./ insertColumn i a m inserts a column before the ith column in matrix m and fills it with value a./ #cutSublist i n xs = (xs', ys, xs'') cuts out a sublist ys of width n from xs, starting at column i./ replaceByProjections i projs cc replaces variables i..i+n-1' (counted from left) by projections projs_1 i .. projs_n i.If n==0, we matched on a zero-field record, which means that we are actually introduce a new variable, increasing split positions greater or equal to i' by one. Otherwise, we have to lower/RCheck if a split is on a record constructor, and return the projections if yes./+Bottom-up procedure to annotate split tree.%;Bottom-up procedure to record-pattern-translate split tree.%Replaces pattern matching on record constructors with uses of projection functions. Does not remove record constructor patterns which have sub-patterns containing non-record constructor or literal patterns./Runs a computation in the / monad./>Returns the next pattern variable, and the corresponding term./ projections t9 returns a projection for every non-dot leaf pattern in tU. The term is the composition of the projection functions from the leaf to the root.KEvery term is tagged with its origin: a variable pattern or a dot pattern./gConverts a record tree to a single pattern along with information about the deleted pattern variables./*Removes record constructors from patterns.Returns the following things:The new pattern.A substitution which maps the old pattern variables (in the order they occurred in the pattern; not including dot patterns) to terms (either the new name of the variable, or a projection applied to a new pattern variable).GA list explaining the changes to the variables bound in the pattern.rRecord patterns containing non-record constructor patterns are not translated (though their sub-patterns may be).Example: The pattern !rec1 (con1 a) (rec2 b c) (rec3 d) should yield the pattern rec1 (con1 x) y z(, along with a substitution similar to $[x, proj2-1 y, proj2-2 y, proj3-1 z].=This function assumes that literals are never of record type./2Traverses a pattern and returns one of two things:>If there is no non-record constructor in the pattern, then , ps is returned, where psk contains one projection for every variable in the input pattern (in the order they are encountered)._Otherwise the output is a computation returning the same kind of result as that coming from /x. (Computations are returned rather than values to ensure that variable numbers are allocated in the right order.)/Assumes that literals are never of record type./Translates the telescope./iExplanation of how the telescope should be changed. Types should be in the context of the old telescope.:Old telescope, flattened, in textual left-to-right order.;New telescope, flattened, in textual left-to-right order. ,3 is used to indicate the locations of dot patterns.%%%%%%%%...//////////// None"#$+-03457;<=>?ACNQV]^/%%Edge labels for the positivity graph.% Monad for computing occurrences.%"Context for computing occurrences.%*Items corresponding to the free variables.=Potential invariant: It seems as if the list has the form genericReplicate n , ++ - (, . %) is, for some n and is, where is! is decreasing (non-strictly).%Name for " builtin.%A type used locally in %.%Used to build % and occurrence graphs.%Used to build % and occurrence graphs.%OnlyVarsUpTo n occs* discards occurrences of de Bruijn index >= n.%hCheck that the datatypes in the mutual block containing the given declarations are strictly positive.UAlso add information about positivity and recursivity of records to the signature.%Removes % entries and adds   entries.=WARNING: There can be lots of sharing between the generated  D entries. Traversing all of these entries could be expensive. (See % for an example.)%An interpreter for %.=WARNING: There can be lots of sharing between the generated  D entries. Traversing all of these entries could be expensive. (See % for an example.)%Running the monad%1Computes the occurrences in the given definition.2WARNING: There can be lots of sharing between the  E entries. Traversing all of these entries could be expensive. (See % for an example.)%1Computes the occurrences in the given definition.%2WARNING: There can be lots of sharing between the  R entries in the edges. Traversing all of these entries could be expensive. (See % for an example.)%Computes all non-2 occurrence graph edges represented by the given %.2WARNING: There can be lots of sharing between the  l entries in the edges. Traversing all of these entries could be expensive. For instance, for the function F in  benchmarkmiscSlowOccurrences.agda, a large number of edges from the argument X to the function F* are computed. These edges have polarity  ,   or  , and contain the following   elements:  (/ [  F,   0]),  (/ [  F,   0,  ]),  (/ [  F,   0,  ,  ]),  (/ [  F,   0,  ,  ,  ]), and so on.%As   does not have an . we cannot do something meaningful for the  OccursWhere here.E.g. 'ostar (Edge JustNeg w) = Edge Mixed (w  (w >*< w))1 would probably more sense, if we could do it.%FThese operations form a semiring if we quotient by the relation "the   components are equal".%&The names in the current mutual block.The current name.+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%B%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%None"#$+-03457;<=>?ACNQV]^# Which DefOtypes are eligible for the principle argument of a projection-like function?BTurn a definition into a projection if it looks like a projection.&Conditions for projection-likeness of f:  The type of f must be of the shape   ! D  ! C for D a name (Def ) which is : data  record   postulate.iThe application of f should only get stuck if the principal argument is inferable (neutral). Thus:a. ff cannot have absurd clauses (which are stuck even if the principal argument is a constructor)b. fZ cannot be abstract as it does not reduce outside abstract blocks (always stuck).c. f= cannot match on other arguments than the principal argument.d. f cannot match deeply.e. f%s body may not mention the paramters.For internal reasons: f cannot be constructor headedfj cannot be recursive, since we have not implemented a function which goes through the bodies of the f^ and the mutually recursive functions and drops the parameters from all applications of f.$Examples for these reasons: see testSucceedNotProjectionLike.agda% View for a Def f (Apply a : es) where isProjection f. Used for projection-like fs.%NA projection or projection-like function, applied to its principal argument%sJust a lone projection-like function, missing its principal argument (from which we could infer the parameters).%*Not a projection or projection-like thing.% Semantics of %.% Top-level % (no reduction).%Reduce away top-level projection like functions. (Also reduces projections, but they should not be there, since Internal is in lambda- and projection-beta-normal form.)%Turn prefix projection-like function application into postfix ones. This does just one layer, such that the top spine contains the projection-like functions as projections. Used in  compareElims in TypeChecking.Conversion and in Agda.TypeChecking.CheckInternal.If the , is ,{, a lone projection like function will be turned into a lambda-abstraction, expecting the principal argument. If the , is -l , it will be returned unaltered.No precondition. Preserves constructorForm, since it really does only something on (applications of) projection-like functions. %%%%%%%%%%% %%%%%%%%%%%%%%%%%%None"#$+-03457;<=>?ACNQVZ]^,/Indefinite article.&Turns all warnings into errors.&EDepending which flags are set, one may happily ignore some warnings./?Drops given amount of leading components of the qualified name.&3Drops the filename component of the qualified name./MProduces a function which drops the filename component of the qualified name./Print two terms that are supposedly unequal. If they print to the same identifier, add some explanation why they are different nevertheless. %&&&&&& &&%&&&&/// /!/"/#None"#$+-03457;<=>?ACKNQV]^7&*buildList A ts builds a list of type List A. Assumes that the terms ts all have type A.&+Conceptually: 2redBind m f k = either (return . Left . f) k =<< m&/ 4trustMe : {a : Level} {A : Set a} {x y : A} -> x "a y&0Get the ?+ of the principal argument of BUILTIN REFL.Returns Nothing for e.g. P data Eq {a} {A : Set a} (x : A) : A ! Set a where refl : Eq x x Returns Just ... for e.g. V data Eq {a} {A : Set a} : (x y : A) ! Set a where refl : " x ! Eq x x &1Used for both  primForce and primForceLemma.&MAbbreviation: argN = 7 .&OAbbreviation: argH = v 7 .D&&&&&&&&&&&&& &!&"&#&$&%&&&'&(&)&*&+&,&-&.&/&0&1&2&3&4&5&6&7&8&9&:&;&<&=&>&?&@&A&B&C&D&E&F&G&H&I&J&K&L&M&N&O&P&Q&R&S&T&U&V&Wr&(&)&%&&&'&Z&Y&X&"&#&$&[& &!&j&i&&&h&g&f&e&d&c&b&a&`&_&^&]&\&&&&{&z&y&x&w&v&u&t&s&r&q&p&o&n&m&l&*&k&&&&&&&&&&&~&}&|&+&,&-&.&/&0&1&2&3&4&5&6&7&8&9&:&;&<&=&>&?&@&A&B&C&D&E&F&G&H&I&J&K&L&M&N&O&P&&&&&Q&R&S&T&U&V&W&&&&&&&& &!&"&#&$&%&&&'&(&)&;4&<4&=4&D9 &E9 None"#$+-03457;<=>?ACNQV]^<$&&/$/%/&/'/(/)/*/+/,/-/.///0/1None"#$+-03457;<=>?ACNQV]^=_&&&&&&&&&&&&&&&&None"#$+-03457;<=>?ACNQV]^>&&None"#$+-03457;<=>?ACNQVZ]^^. &*Compute a list of instance candidates. ,I if type is a meta, error if type is not eligible for instance search.&findInScope m (v,a)s& tries to instantiate on of the types as of the candidate terms vs to the type t of the metavariable m. If successful, meta m% is solved with the instantiation of v. If unsuccessful, the constraint is regenerated, with possibly reduced candidate set. The list of candidates is equal to Nothingz when the type of the meta wasn't known when the constraint was generated. In that case, try to find its type again.&Result says whether we need to add constraint, and if so, the set of remaining candidates and an eventual blocking metavariable.&?Precondition: type is spine reduced and ends in a Def or a Var.&A meta _M is rigidly constrained if there is a constraint _M us == D vs, for inert D. Such metas can safely be instantiated by recursive instance search, since the constraint limits the solution space.&(Returns True if one of the arguments of ty is a meta which isn t rigidly constrained. Note that level metas are never considered rigidly constrained (#1865).&Apply the computation to every argument in turn by reseting the state every time. Return the list of the arguments giving the result True.If the resulting list contains exactly one element, then the state is the same as the one obtained after running the corresponding computation. In all the other cases, the state is reseted.& Given a meta m of type t and a list of candidates cands, checkCandidates m t cands, returns a refined list of valid candidates.&To preserve the invariant that a constructor is not applied to its parameter arguments, we explicitly check whether function term we are applying to arguments is a unapplied constructor. In this case we drop the first a arguments. See Issue670a. Andreas, 2013-11-07 Also do this for projections, see Issue670b.&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&None"#$+-03457;<=>?ACNQVZ]^m"If matching is inconclusive (DontKnowE) we want to know whether it is due to a particular meta variable." matchCopatterns ps es matches spine es against copattern spine ps.Returns "e and a substitution for the pattern variables (in form of IntMap Term) if matching was successful.Returns "3 if there was a constructor or projection mismatch.Returns "b if an argument could not be evaluated to constructor form because of a blocking meta variable. In any case, also returns spine eso in reduced form (with all the weak head reductions performed that were necessary to come to a decision)." IBuilds a proper substitution from an IntMap produced by match(Co)patterns& Instead of zipWithMQ, we need to use this lazy version of combining pattern matching computations.&Match a single copattern.&Match a single pattern. """"" " " &&&&& """"&&" &" &" &&""""None"#$+-03457;<=>?ACNQVZ]^&the kill list is empty or only Falses&0there is no possible kill (because of type dep.)&%managed to kill some args in the list&$all prescribed kills where performed&rCollect the *definitely* rigid variables in a monoid. We need to successively reduce the expression to do this.&Extended occurs check.&>Distinguish relevant and irrelevant variables in occurs check.&We are in arguments of a meta.&2We are not in arguments of a meta but a bound var.&9We are at the start or in the arguments of a constructor.&)We are at the term root (this turns into  StronglyRigid).&!We are in an irrelevant argument.&XSet the names of definitions to be looked at to the defs in the current mutual block.&,Is a def in the list of stuff to be checked?&3Remove a def from the list of defs to be looked at.&Leave the top position.&"Leave the strongly rigid position.&When assigning  m xs := v , check that m does not occur in v# and that the free variables of v are contained in xs.&prune m' vs xs' attempts to remove all arguments from vs. whose free variables are not contained in xs. If successful, m'= is solved by the new, pruned meta variable and we return True else False.'Issue 1147: If any of the meta args vs is matchable, e.g., is a constructor term, we cannot prune, because the offending variables could be removed by reduction for a suitable instantiation of the meta variable.&hasBadRigid xs v = Just True# iff one of the rigid variables in v is not in xs. Actually we can only prune if a bad variable is in the head. See issue 458. Or in a non-eliminateable position (see succeed/PruningNonMillerPattern).hasBadRigid xs v = Nothing` means that we cannot prune at all as one of the meta args is matchable. (See issue 1147.)&Check whether a term Def f esD is finally stuck. Currently, we give only a crude approximation.&Check whether any of the variables (given as de Bruijn indices) occurs *definitely* in the term in a rigid position. Reduces the term successively to remove variables in dead subterms. This fixes issue 1386.&killArgs [k1,...,kn] X prunes argument i from metavar X if ki==TrueA. Pruning is carried out whenever > 0 arguments can be pruned.&/killedType [((x1,a1),k1)..((xn,an),kn)] b = ([k'1..k'n],t') (ignoring Dom). Let t' = (xs:as) -> b. Invariant:  k'i == True iff  ki == True and pruning the ith argument from type b4 is possible without creating unbound variables. t' is type t after pruning all  k'i==True.&dInstantiate a meta variable with a new one that only takes the arguments which are not pruneable.&9Arguments to old meta var in left to right order with Bool' indicating whether they can be pruned.$The old meta var to receive pruning.$The pruned type of the new meta var.+&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&G&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&None"#$+-03457;<=>?ACNQVZ]^guardConstraint c blocker tries to solve blockerC first. If successful without constraints, it moves on to solve c, otherwise it adds a  Guarded c cs constraint to the blocker-generated constraints cs.4Don't allow the argument to produce any constraints.7Catches pattern violation errors and adds a constraint.&,Create a fresh problem for the given action.'4Wake up the constraints depending on the given meta.'Wake up all constraints.&''''''''&''''''''None"#$+-03457;<=>?ACNQVZ]^g,yGCreate a new value meta with specific dependencies without -expanding.zXCreate a new value meta with specific dependencies, possibly -expanding in the process.{?Create a new metavariable, possibly -expanding in the process.|newIFSMeta s t candsP creates a new "implicit from scope" metavariable of type the output type of t with name suggestion s.}Miller pattern unification: assign x vs v solves problem x vs = v for meta x if vs1 are distinct variables (linearity check) and v9 depends only on these variables and does not contain x itself (occurs check).9This is the basic story, but we have added some features: Pruning.Benign cases of non-linearity.vs may contain record patterns.iFor a reference to some of these extensions, read Andreas Abel and Brigitte Pientka's TLCA 2011 paper.~Assign to an open metavar which may not be frozen. First check that metavar args are in pattern fragment. Then do extended occurs check on given thing.$Assignment is aborted by throwing a  PatternErr via a call to patternViolation. This error is caught by catchConstraint during equality checking ( compareAtom:) and leads to restoration of the original constraints.!Do safe eta-expansions for meta (SingletonRecords,Levels).(Performing the meta variable assignment.#The instantiation should not be an f and the  should point to something  or a i+. Further, the meta variable may not be k.'7Exceptions raised when substitution cannot be inverted.' Cannot recover.' =A potentially neutral arg: can't invert, but can try pruning.' &Try to eta-expand var to remove projs.'6Check whether one of the meta args is a projected var.'Various kinds of metavariables.'Meta variables of record type.'7Meta variables of "hereditarily singleton" record type.';Meta variables of level type, if type-in-type is activated.'aFind position of a value in a list. Used to change metavar argument indices during assignment.reverse@ is necessary because we are directly abstracting over the list.'CCheck whether a meta variable is a place holder for a blocked term.'8Skip frozen check. Used for eta expanding frozen metas.'4Create a sort meta that cannot be instantiated with  (Set).'1Create a sort meta that may be instantiated with  (Set).'1Create a sort meta that may be instantiated with  (Set).'$,Create a new value meta without -expanding.'%3Create a new value meta with specific dependencies.')ZCreate a metavariable of record type. This is actually one metavariable for each field.'-6Construct a blocked constant if there are constraints.'0unblockedTester t returns False if t is a meta or a blocked term.?Auxiliary function to create a postponed type checking problem.'1)Create a postponed type checking problem e : t that waits for type tA to unblock (become instantiated or its constraints resolved).'2)Create a postponed type checking problem e : t that waits for conditon unblockv. A new meta is created in the current context that has as instantiation the postponed type checking problem. An @ constraint is added for this meta, which links to this meta.'31Type of the term that is produced by solving the `.'47Eta expand metavariables listening on the current meta.'5/Wake up a meta listener and let it do its thing'6 All possible metavariable kinds.'7vEta expand a metavariable, if it is of the specified kind. Don't do anything if the metavariable is a blocked term.'8PEta expand blocking metavariables of record type, and reduce the blocked thing.':assignMeta m x t ids u solves  x ids = u for meta x of type t, where term u lives in a context of length m. Precondition: ids is linear.';assignMeta' m x t ids u solves  x = [ids]u for meta x of type t, where term u lives in a context of length m , and ids is a partial substitution.'<Turn the assignment problem _X args <= SizeLt u into _X args = SizeLt (_Y args) and constraint  _Y args <= u.'= Eta-expand bound variables like z in  X (fst z).'>JEta-expand a de Bruijn index of record type in context and passed term(s).'?_Turn non-det substitution into proper substitution, if possible. Otherwise, raise the error.'@Check that arguments args to a metavar are in pattern fragment. Assumes all arguments already in whnf and eta-reduced. Parameters are represented as Vars so  checkArgs$ really checks that all args are Var^s and returns the "substitution" to be applied to the rhs of the equation to solve. (If args8 is considered a substitution, its inverse is returned.)The returned list might not be ordered. Linearity, i.e., whether the substitution is deterministic, has to be checked separately.'A Turn open metas into postulates.Preconditions: We are  .3 is set to the top-level module.' )a possibly non-deterministic substitution'< dirThe meta variable x.Its associated information mvar <- lookupMeta x. Its type  t = jMetaType $ mvJudgement mvarIts arguments.Its to-be-assigned value v , such that x args dir v.0Continuation taking its possibly assigned value.Fwxyz{|}~'' ' ' ' ' ''''''''''''''''''' '!'"'#'$'%'&'''(')'*'+','-'.'/'0'1'2'3'4'5'6'7'8'9':';'<'='>'?'@'AI'''''''''' '!|'"zy{'#'$'%xw'&'''(')'*'+','-'.'/'0'1'2'3'4'5'''''6'7'8~'9}':';'<'='>'''''D'C'B'' '?' '' ' ' '@'A'' ' ' ''''''''None"#$+-03457;<=>?ACNQV]^2%highlightAsTypeChecked rPre r m runs mG and returns its result. Additionally, some code may be highlighted:If r% is non-empty and not a sub-range of rPre (after  has been applied to both): r/ is highlighted as being type-checked while m0 is running (this highlighting is removed if m completes  successfully).'Otherwise: Highlighting is removed for rPre - r before m runs, and if m completes successfully, then rPre - r) is highlighted as being type-checked./2<A function mapping names to the kind of name they stand for.'IHighlighting levels.'JXFull highlighting. Should only be used after typechecking has completed successfully.'KBHighlighting without disambiguation of overloaded constructors.'L5Lispify and print the given highlighting information.'MwGenerate syntax highlighting information for the given declaration, and (if appropriate) print it. If the boolean is ,, then the state is additionally updated with the new highlighting info (in case of a conflict new info takes precedence over old info).CThe procedure makes use of some of the token highlighting info in U (that corresponding to the interval covered by the declaration). If the boolean is ,B, then this token highlighting info is additionally removed from .'NZGenerate and return the syntax highlighting information for the tokens in the given file.'OSame as 'N* but takes a string instead of a filename./31Compute syntax highlighting for the given tokens./4 Builds a /2 function./5Generates syntax highlighting information for all constructors occurring in patterns and expressions in the given declaration.This function should only be called after type checking. Constructors can be overloaded, and the overloading is resolved by the type checker.'Q-Prints syntax highlighting info for an error.'RRGenerate highlighting for error. Does something special for termination errors./6*Generate syntax highlighting for warnings./74Generate syntax highlighting for termination errors./8NGenerate syntax highlighting for not-strictly-positive inductive definitions.'SsGenerates and prints syntax highlighting information for unsolved meta-variables and certain unsolved constraints.'TGGenerates syntax highlighting information for unsolved meta variables.'UnGenerates syntax highlighting information for unsolved constraints that are not connected to a meta variable./98Generates a suitable file for a possibly ambiguous name./:Converts names to suitable s./; A variant of /: for qualified abstract names.'VfRemember a name disambiguation (during type checking). To be used later during syntax highlighting.'MUpdate the state?'NThe module to highlight./4This should only be 'J@ if type-checking completed successfully (without any errors)./5'Maps source file paths to module names.The module to highlight./9'Maps source file paths to module names.The module to highlight./:'Maps source file paths to module names.DThe file name of the current module. Used for consistency checking."The name qualifier (may be empty).The base name.The  0 of the name in its fixity declaration (if any).BMeta information to be associated with the name. The argument is , iff the name is an operator.rThe definition site of the name. The calculated meta information is extended with this information, if possible./;'Maps source file paths to module names.DThe file name of the current module. Used for consistency checking. The name.0Should the binding site be included in the file?DMeta information to be associated with the name. ^ The argument is , iff the name is an operator.%'I'K'J'L'M'N'O'P'Q'R'S'T'U'V'I'J'K'M'N'O'P'Q'R'S'L%'T'U'V'I'J'KNone"#$+-03457;<=>?ACNQV]^4'_,Argument should be in weak head normal form. 'W'Y'X'Z'['\']'^'_'` ']'^'_'Z'['\'W'X'Y'`'W'X'Y'Z'['\None"#$+-03457;<=>?ACNQVZ]^o#W.Check that the first sort equal to the second.#\compareTel t1 t2 cmp tel1 tel1 checks whether pointwise tel1 `cmp` tel2 and complains that  t2 `cmp` t1 failed if not.#]Equality on Types#^compareElims pols a v els1 els2: performs type-directed equality on eliminator spines. t is the type of the head v.#_(Type-directed equality on argument lists#`)Syntax directed equality on atomic values#a!Type directed equality on values.'aTry whether a computation runs without errors or new constraints (may create new metas, though). Restores state upon failure.'bnTry whether a computation runs without errors or new constraints (may create new metas, though). Return ,$ the result upon success. Return , and restore state upon failure.'cqCheck if to lists of arguments are the same (and all variables). Precondition: the lists have the same length.'dintersectVars us vs) checks whether all relevant elements in us and vs? are variables, and if yes, returns a prune list which says True8 for arguments which are different and can be pruned.'f$Ignore errors in irrelevant context.'h_Try to assign meta. If meta is projected, try to eta-expand and run conversion check again.'kRaise  if there is no hope that by meta solving and subsequent eta-contraction these terms could become equal. Precondition: the terms are in reduced form (with no top-level pointer) and failed to be equal in the #` check.QBy eta-contraction, a lambda or a record constructor term can become anything.'mCompute the head type of an elimination. For projection-like functions this requires inferring the type of the principal argument.'nCheck whether a1 cmp a2% and continue in context extended by a1.'pWhen comparing argument spines (in compareElims) where the first arguments don't match, we keep going, substituting the anti-unification of the two terms in the telescope. More precisely:@ (u = v : A)[pid] w = antiUnify pid A u v us = vs : [w/x] ------------------------------------------------------------- u us = v vs : (x : A)  @The simplest case of anti-unification is to return a fresh metavariable (created by blockTermOnProblem), but if there's shared structure between the two terms we can expose that.This is really a crutch that lets us get away with things that otherwise would require heterogenous conversion checking. See for instance issue #2384.'sCompare two terms in irrelevant position. This always succeeds. However, we can dig for solutions of irrelevant metas in the terms we compare. (Certainly not the systematic solution, that'd be proof search...)'v coerce v a b coerces v : a to type b, returning a v' : b@ with maybe extra hidden applications or hidden abstractions.In principle, this function can host coercive subtyping, but currently it only tries to fix problems with hidden function types.Precondition: a and b are reduced.'wAccount for situations like k : (Size< j) <= (Size< k + 1)Actually, the semantics is (Size<= k) ") (Size< j) " rhsJ which gives a disjunctive constraint. Mmmh, looks like stuff TODO."For now, we do a cheap heuristics. Precondition: types are reduced.'x9Check that the first sort is less or equal to the second. We can put SizeUniv below Inf;, but otherwise, it is unrelated to the other universes.'{Precondition: levels are "Fd.'ncmp The comparison directiona1 The smaller domain.a2 The other domain.b1 The smaller codomain.b2 The bigger codomain.Continuation if mismatch in e.Continuation if mismatch in U.)Continuation if comparison is successful.(#V#W#X#Y#Z#[#\#]#^#_#`#a'a'b'c'd'e'f'g'h'i'j'k'l'm'n'o'p'q'r's't'u'v'w'x'y'z'{'|('a'b'c'd#Y'e#X'f#a'g'h'i'j#\'k'l'm#`'n'o'p'q'r#^'s't'u#_#]#V'v'w#Z#['x'y'z'{#W'|None"#$+-03457;<=>?ACNQV]^u'"Argument should be a term of type  Term ! TCM A3 for some A. Returns the resulting term of type A. The second argument is the term for the hole, which will typically be a metavariable. This is passed to the computation (quoted).#'}''~''''''''''''''''''''''''''''''''9'''''''''''''''''''''''''''''''''''''}'~''''''''''''''''''''}'~'''''''None"#$+-03457;<=>?ACNQVZ]^''Size constraint with de Bruijn indices.' Living in Context.' Living in Context.''Size expression with de Bruijn indices.'Size metas in size expressions.'De Bruijn indices.' Identifiers for rigid variables.'$Name for printing in debug messages.'De Bruijn index.',Flag to control the behavior of size solver.'2Instantiate all unconstrained size variables to ".',Leave unconstrained size variables unsolved.',Solve size constraints involving hypotheses.'"TODO: this does not actually work!"We would like to use a constraint c created in context  from module N in the current context  and current module M. is module tel   of N! extended by some local bindings  . K is the current context. The module parameter substitution from current M to N be   "  :  .If M == N=, we do not need the parameter substitution. We try raising.We first strengthen  " c to live in   and obtain c = strengthen  c. We then transport c  to  and obtain c = applySubst  c .)This works for different modules, but if M == N we should not strengthen and then weaken, because strengthening is a partial operation. We should rather lift the substitution  by   and then raise by  -  0. This "raising" might be a strengthening if   is shorter than  .:(TODO: If the module substitution does not exist, because N is not a parent of MS, we cannot use the constraint, as it has been created in an unrelated context.)'0A hazardous hack, may the Gods have mercy on us.STo cast to the current context, we match the context of the given constraint by &,, and as fallback, by variable name (douh!).%This hack lets issue 2046 go through.'TReturn the size metas occurring in the simplified constraints. A constraint like ! _j =< " : Size simplifies to nothing, so _j would not be in this set.'2Solve a cluster of constraints sharing some metas.'ICollect constraints from a typing context, looking for SIZELT hypotheses.'KConvert size constraint into form where each meta is applied to indices  n-1,...,1,0 where n is the arity of that meta. X[] <= t becomes X[id] <= t[^-1] X[] "d Y[] becomes X[id] "d Y[[^-1]] or X[[^1]] "d Y[id]: whichever is defined. If none is defined, we give up.Cf. (SizedTypes.oldCanonicalizeSizeConstraint.Fixes (the rather artificial) issue 300. But it is unsound when pruned metas occur and triggers issue 1914. Thus we deactivate it. This needs to be properly implemented, possibly using the metaPermuatation of each meta variable.'@Turn a constraint over de Bruijn indices into a size constraint.'#Turn a term into a size expression.Returns ,, if the term isn't a proper size expression.'&Turn a de size expression into a term.' Only for S.'*An order which ignores the meta arguments.'-An equality which ignores the meta arguments.'$Assumes we are in the right context.'''''''''''''''''''''''''''''','''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''None"#$%+-013457;<=>?ACKNQVZ]^>'Unification succeeded.'Terms are not unifiable.'1Some other error happened, unification got stuck.' Result of '.'Unify indices.In unifyIndices gamma flex us vs,us and vs! are the argument lists to unify,gamma' is the telescope of free variables in us and vs.flex3 is the set of flexible (instantiable) variabes in us and vs.*The result is the most general unifier of us and vs./<4Get the type of the i'th variable in the given state/=Get the k'th equality in the given state. The left- and right-hand sides of the equality live in the varTel telescope, and the type of the equality lives in the varTel++eqTel telescope/>*As getEquality, but with the unraised type/?>Add a list of equations to the front of the equation telescope/@[Instantiate the k'th variable with the given value. Returns Nothing if there is a cycle./A{Solve the k'th equation with the given value, which can depend on regular variables but not on other equation variables./BSimplify the k'th equation with the given value (which can depend on other equation variables). Returns Nothing if there is a cycle./C5Returns true if the variables 0..k-1 don't occur in x/DChecks whether the given term (of the given type) is beta-eta-equivalent to a variable. Returns just the de Bruijn-index of the variable if it is, or nothing otherwise.''''''''''''/E/F/G/H/I/J/K/L/M5/N/O/P/Q/R/S/T/U/V/W/X/Y/Z/[/\/]/^/_/`/a/b/c/d/e/f/g/h/i/j/k/l/m/n/o/p/q/r/s/t/u/v/w/x/y/z/{/|/}/~////////////////''''None"#$+-03457;<=>?ACNQVZ]^ 2'A Covering is the result of splitting a '.'@De Bruijn level (counting dot patterns) of argument we split on.'=Covering clauses, indexed by constructor these clauses share.(Type of variables in scPats.(MThe patterns leading to the currently considered branch of the split tree.(Substitution from (Q to old context. Only needed directly after split on variable: * To update (T * To rename other split variables when splitting on multiple variables. scSubst is not ` transitive'I, i.e., does not record the substitution from the original context to (L over a series of splits. It is freshly computed after each split by computeNeighborhood ; also ( I, which does not split on a variable, should reset it to the identity X, lest it be applied to ( again, leading to Issue 1294.(We need to keep track of the module parameter substitutions for the clause for the purpose of inferring missing instance clauses.('The type of the rhs, living in context (.. This invariant is broken before calls to (  ; there, ( lives in the old context. (  moves (0 to the new context by applying substitution (.(,Project the split clauses out of a covering.(JCreate a split clause from a clause in internal syntax. Used by make-case.(1Top-level function for checking pattern coverage.Effects:3Marks unreachable clauses as such in the signature.0Adds missing instances clauses to the signature.( XTop-level function for eliminating redundant clauses in the interactive case splitter/=cover f cs (SClause _ _ ps _) = return (splitTree, used, pss)%. checks that the list of clauses cs/ covers the given split clause. Returns the  splitTree, the used clauses, and missing cases pss.*Effect: adds missing instance clauses for f to signature./6Append a instance clause to the clauses of a function./_Check that a type is a non-irrelevant datatype or a record with named constructor. Unless the l argument is n" the data type must be inductive.( Update the target type, add more patterns to split clause if target becomes a function type. Returns the domains of the function type (if any)./ BcomputeNeighbourhood delta1 delta2 d pars ixs hix tel ps mpsub con  delta1 Telescope before split point n Name of pattern variable at split point delta2 Telescope after split point d Name of datatype to split at pars Data type parameters ixs Data type indices hix Index of split variable tel Telescope for patterns ps ps Patterns before doing the split mpsub Current module parameter substitutions con Constructor to fit into hole dtype == d pars ixs( Entry point from Interaction.MakeCase.( Entry point from TypeChecking.Empty and Interaction.BasicOps. splitLast CoInductive is used in the refine tactics./$split ind splitClause x = return res splits  splitClause at pattern var x (de Bruijn index).Possible results res are: Left err: Splitting failed.Right covering: A covering set of split clauses, one for each valid constructor. This could be the empty set (denoting an absurd clause)./Convert a de Bruijn index relative to the clause telescope to a de Bruijn level. The result should be the argument position (counted from left, starting with 0) to split at (dot patterns included!)./%split' ind splitClause x = return res splits  splitClause at pattern var x (de Bruijn index).Possible results res are: Left err: Splitting failed.Right (Left splitClause'): Absurd clause (type of x has 0 valid constructors).Right (Right covering)H: A covering set of split clauses, one for each valid constructor.(  splitResult f sc = return resIf the target type of scC is a record type, a covering set of split clauses is returned (sc: extended by all valid projection patterns), otherwise res == NothingV. Note that the empty set of split clauses is returned if the record has no fields.(For debugging only./Function name."Clause to add. Clause hiding (in  ) must be g./ Telescope before split point.(Name of pattern variable at split point.Telescope after split point.Name of datatype to split at.Data type parameters.Data type indices.Index of split variable.Telescope for the patterns. Patterns before doing the split. &Current module parameter substitution. Constructor to fit into hole. New split clause if successful./:Coinductive constructors are allowed if this argument is n./:Coinductive constructors are allowed if this argument is n.If ,2, introduce new trailing variable patterns via ( .$'''''(((((((((( ( ( ( ( '(((((((( ''''((( ( ( ( $//////'''''((((((None"#$+-03457;<=>?ACNQV]^ #9VCheck whether a type is empty. This check may be postponed as emptiness constraint./Generic failure/Failure with informative error/Emptyness check blocked#9#9////None"#$+-03457;<=>?ACNQV]^m(WSplit a problem at the first constructor pattern which is actually of datatype type.Or, if there is no constructor pattern left and the rest type is a record type and the first rest pattern is a projection pattern, split the rest type.,Implicit patterns should have been inserted./#checkConstructorParameters c d pars, checks that the data/record type behind ch is has initial parameters (coming e.g. from a module instantiation) that coincide with an prefix of pars./[Check that given parameters match the parameters of the inferred constructor/projection.(-The definition we are checking at the moment.&The current state of the lhs patterns./ The record(data type name of the chosen constructor projection.<The record/data type name as supplied by the type signature.The parameters.((None"#$+-03457;<=>?ACNQVZ]^+y rewrite b v rules es tries to rewrite v applied to es with the rewrite rules rules. b is the default blocking tag.{Check that the name given to the BUILTIN REWRITE is actually a relation symbol. I.e., its type should be of the form  ! (lhs : A) (rhs : B) ! Set !A. Note: we do not care about hiding/non-hiding of lhs and rhs.(3Get all symbols that a rewrite rule matches against(Deconstructing a type into  ! t ! t' ! core.(The whole telescope , t, t'.(.(t.(t'.(core.(Deconstructing a type into  ! t ! t' ! core . Returns Nothing if not enough argument types.( Add q :  ! rel us lhs rhs as rewrite rule   " lhs ! rhs : B  to the signature where  B = A[us/]. Remember that rel :  ! A ! A ! Set i, so $rel us : (lhs rhs : A[us/]) ! Set i.(!%Append rewrite rules to a definition.("rewriteWith t f es rew tries to rewrite f es : t with rew%, returning the reduct if successful.((((((((((((((( (!("(#(((((((((( (!("(((((('(&(#(((+(*()(%($((((((((((((None"#$+-03457;<=>?ACNQV]^6U(,;Compute the pattern variables of a term or term-like thing.(.Given the type of a constructor (excluding the parameters), decide which arguments are forced. Update the relevance info in the domains accordingly. Precondition: the type is of the form  ! D vs and the vs are in normal form.(/ force s xs t marks the domains xs in function type t# as forced. Domains bigger than s are marked as Y Z, others as Y \X. Counting left-to-right, starting with 0. Precondition: function type is exposed.(0(Assumes that the term is in normal form.(,(-(.(/(.(,(-(1(0(/(,(-None"#$+-03457;<=>?ACNQV]^W* (2TType check a datatype definition. Assumes that the type has already been checked.(3QEnsure that the type is a sort. If it is not directly a sort, compare it to a '.(4=A parameter is small if its sort fits into the data sort.  smallParams9 overapproximates the small parameters (in doubt: small).(5Type check a constructor declaration. Checks that the constructor targets the datatype and that it fits inside the declared sort. Returns the non-linear parameters.(6"Bind the parameters of a datatype.NWe allow omission of hidden parameters at the definition site. Example: P data D {a} (A : Set a) : Set a data D A where c : A -> D A (7Auxiliary function for (6.(8Check that the arguments to a constructor fits inside the sort of the datatype. The first argument is the type of the constructor.6As a side effect, return the arity of the constructor.(9Return the parameters that share variables with the indices nonLinearParameters :: Int -> Type -> TCM [Int] nonLinearParameters nPars t =Check that a type constructs something of the given datatype. The first argument is the number of parameters to the datatype.OAs a side effect, return the parameters that occur free in indices. E.g. in 9data Eq (A : Set)(a : A) : A -> Set where refl : Eq A a a! this would include parameter a , but not A."TODO: what if there's a meta here?(:!Is the type coinductive? Returns ,% if the answer cannot be determined.(5Name of data type.Parameter telescope.#Number of indices of the data type.Sort of the data type.)Constructor declaration (type signature).Non-linear parameters.(7n replicas of type if  LamBindings are  DomainFrees that came from a  DomainFull of n+ binders. Should be comsumed whenever a  DomainFrees are consumed.Bindings from definition site./Pi-type of bindings coming from signature site.Continuation, accepting parameter telescope and rest of type. The parameters are part of the context when the continutation is invoked. (2(3(4(5(6(7(8(9(: (2(3(4(5(6(7(8(9(:None"#$+-03457;<=>?ACNQV]^(;'Result of checking the LHS of a clause.(=QThe number of original module parameters. These are present in the the patterns.(>V : The types of the pattern variables, in internal dependency order. Corresponds to .(? The patterns in internal syntax.(@The type of the body. Is b if  is defined. X8 to indicate the rhs must be checked in irrelevant mode.(ASubstitution version of  lhsPatterns,, only up to the first projection pattern.  |- lhsPatSubst : . Where u is the argument telescope of the function. This is used to update inherited dot patterns in with-function clauses.(BAs-bindings from the left-hand side. Return instead of bound since we want them in where's and right-hand sides, but not in with-clauses (Issue 2303).(DTemporary data structure for checkLeftoverPatterns(EiA pattern is flexible if it is dotted or implicit, or a record pattern with only flexible subpatterns.(H{Compute the set of flexible patterns in a list of patterns. The result is the deBruijn indices of the flexible patterns.(IxUpdate the in patterns according to the given substitution, collecting new dot pattern instantiations in the process.(J`Check if a problem is solved. That is, if the patterns are all variables, and there is no $.(KHCheck if a problem consists only of variable patterns. (Includes the $).(L.For each user-defined pattern variable in the $z, check that the corresponding data type (if any) does not contain a constructor of the same name (which is not in scope); this "shadowing" could indicate an error, and is not allowed.+Precondition: The problem has to be solved.(M4Check that a dot pattern matches it's instantiation.(NChecks whether the dot patterns left over after splitting can be covered by shuffling around the dots from implicit positions. Returns the updated user patterns (without dot patterns).(O6Bind the variables in a left hand side and check that e8 of the patterns matches the hiding info in the type.,Precondition: the patterns should all be , , or \ and the telescope should have the same size as the pattern list. There could also be :s resulting from eta expanded implicit record patterns.(PBind as patterns(QCheck a LHS. Main function.checkLeftHandSide a ps a ret checks that user patterns ps eliminate the type a1 of the defined function, and calls continuation ret if successful.(RUThe loop (tail-recursive): split at a variable in the problem until problem is solved(S>Ensures that we are not performing pattern matching on codata.(T5Type check dot pattern stripped from a with function.(WLists of flexible patterns are $.(IHthe types of the old pattern variables, relative to the new telescopeold in patterns:patterns to be substituted, living in the new telescope(L Trace, e.g., CheckPatternShadowing clause(N.Leftover patterns after splitting is completedHDe Bruijn indices of leftover variable patterns computed by splittingTypes of leftover patterns"Instantiations computed by unifier(Q Trace, e.g. CheckPatternShadowing clause+The name of the definition we are checking. The patterns.The expected type  a =  ! b.4Module parameter substitution from with-abstraction.=Dot patterns that have been stripped away by with-desugaring. Continuation.(R+The name of the definition we are checking.The current state.0The final state after all splitting is completed(;(<(B(A(@(?(>(=(C(D(E(F(G(H(I(J(K(L(M(N(O(P(Q(R(S(T (H(E(F(G(Y(X(W(V(U(I(J(K(L(M(D(C(N(O(P(;(<(=(>(?(@(A(B(Z(Q(R(S(T(;(<(=(>(?(@(A(B(E(F(GNone"#$+-03457;<=>?ACNQVZ]^E1 DOCUMENT ME!=Checking a lambda whose domain type has already been checked."checkArguments' exph r args t0 t k tries checkArguments exph args t0 t . If it succeeds, it continues k with the returned results. If it fails, it registers a postponed typechecking problem and returns the resulting new meta variable.Checks e := ((_ : t0) args) : t.Check a list of arguments: checkArgs args t0 t1 checks that t0 = Delta -> t0' and  args : DeltaT. Inserts hidden arguments to make this happen. Returns the evaluated arguments vs, the remaining type t0' (which should be a subtype of t1) and any constraints cs< that have to be solved for everything to be well-formed.Infer the type of an expression. Implemented by checking against a meta variable. Except for neutrals, for them a polymorphic type is inferred.Type check an expression.<Check that an expression is a type without knowing the sort.([(Flag to control resurrection on domains.(\We are checking a module telescope. We pass into the type world to check the domain type. This resurrects the whole context.(]We are checking a telescope in a Pi-type. We stay in the term world, but add resurrected domains to the context to check the remaining domains and codomain of the Pi-type.(^#Check that an expression is a type.(`?Ensure that a (freshly created) function type does not inhabit . Precondition: When noFunctionsIntoSize t tBlame( is called, we are in the context of tBlame< in order to print it correctly. Not being in context of tK should not matter, as we are only checking whether its sort reduces to .(aBCheck that an expression is a type which is equal to a given type.(cQType check a (module) telescope. Binds the variables defined by the telescope.(dType check the telescope of a dependent function type. Binds the resurrected variables defined by the telescope. The returned telescope is unmodified (not resurrected).(eEType check a telescope. Binds the variables defined by the telescope.(fCheck a typed binding and extends the context with the bound variables. The telescope passed to the continuation is valid in the original context.fParametrized by a flag wether we check a typed lambda or a Pi. This flag is needed for irrelevance.(hType check a lambda expression.(iCheck that irrelevance info in lambda is compatible with irrelevance coming from the function type. If lambda has no user-given relevance, copy that of function type.(kmInsert hidden lambda until the hiding info of the domain type matches the expected hiding info. Throws j(lcheckAbsurdLambda i h e t# checks absurd lambda against type t. Precondition: e = AbsurdLam i h(m%checkExtendedLambda i di qname cs e t/ check pattern matching lambda. Precondition: e = ExtendedLam i di qname cs(nRun a computation.If successful, return Nothing.If IlltypedPattern p a is thrown and type a is blocked on some meta x return Just x.If +SplitError (UnificationStuck c tel us vs _), is thrown and the unification problem us =?= vs : tel is blocked on some meta x return Just x.(If another error was thrown or the type a# is not blocked, reraise the error.nNote that the returned meta might only exists in the state where the error was thrown, thus, be an invalid  in the current state.(pcheckRecordExpression fs e t) checks record construction against type t. Precondition  e = Rec _ fs.(q#checkRecordUpdate ei recexpr fs e t Precondition e = RecUpdate ei recexpr fs.(sVRemove top layers of scope info of expression and set the scope accordingly in the  .(t DOCUMENT ME!(u DOCUMENT ME!(v*Unquote a TCM computation in a given hole.(wCInferring the type of an overloaded projection application. See (y.(xBChecking the type of an overloaded projection application. See (y.(y;Inferring or Checking an overloaded projection application.The overloaded projection is disambiguated by inferring the type of its principal argument, which is the first visible argument.(zcheckApplication hd args e t) checks an application. Precondition: Application hs args = appView echeckApplication1 disambiguates constructors (and continues to (#) and resolves pattern synonyms.({-Check an interaction point without arguments.(|&Check an underscore without arguments.(}Type check a meta variable.(~\Infer the type of a meta variable. If it is a new one, we create a new meta for its type.(Type check a meta variable. If its type is not given, we return its type, or a fresh one, if it is a new meta. If its type is given, we check that the meta has this type, and we return the same type.(tTurn a domain-free binding (e.g. lambda) into a domain-full one, by inserting an underscore for the missing type.(Infer the type of a head thing (variable, function symbol, or constructor). We return a function that applies the head to arguments. This is because in case of a constructor we want to drop the parameters.(Check the type of a constructor application. This is easier than a general application since the implicit arguments can be inserted without looking at the arguments to the constructor.( checkHeadApplication e t hd args checks that e has type t, assuming that e has the form hd args3. The corresponding type-checked term is returned.If the head term hd< is a coinductive constructor, then a top-level definition fresh tel = hd args0 (where the clause is delayed) is added, where tel= corresponds to the current telescope. The returned term is  fresh tel.Precondition: The head hdS has to be unambiguous, and there should not be any need to insert hidden lambdas.(,Check arguments whose value we already know.eThis function can be used to check user-supplied parameters we have already computed by inference.Precondition: The type t of the head has enough domains.(.Check an argument whose value we already know.(Check a single argument.(Check that a list of arguments fits a telescope. Inserts hidden arguments as necessary. Returns the type-checked arguments and the remaining telescope.(Used to check aliases f = e. Switches off + for the checking of top-level application.(?Check whether a de Bruijn index is bound by a module telescope.(=Infer the type of an expression, and if it is of the form  {tel} -> D vs for some datatype DM then insert the hidden arguments. Otherwise, leave the type polymorphic.(kExpected hiding.Expected to be a function type.Continuation on blocked type.QContinuation when expected hiding found. The continuation may assume that the Type is of the form (El _ (Pi _ _)).!Term with hidden lambda inserted.(y7The whole expression which constitutes the application.EThe origin of the projection involved in this projection application.EThe projection name (potentially ambiguous). List must not be empty. The arguments to the projection.(The expected type of the expression (if , , infer it).9The type-checked expression and its type (if successful).(5User-supplied arguments (hidden ones may be missing).+Inferred arguments (including hidden ones).7Type of the head (must be Pi-type with enough domains).-Remaining inferred arguments, remaining type.(User-supplied argument.+Inferred arguments (including hidden ones).7Type of the head (must be Pi-type with enough domains).-Remaining inferred arguments, remaining type.()Eagerly insert trailing hidden arguments?Range of application.Arguments to check.%Telescope to check arguments against.8Checked arguments and remaining telescope if successful.>([(](\(^(_(`(a(b(c(d(e(f(g(h(i(j(k(l(m(n(o(p(q(r(s(t(u(v(w(x(y(z({(|(}(~(((((((((((((((((((>(^(_(`(a(b(c(d([(\(](e(f(g(h(i(j(k(l(m(n(o(p(q(r(s(t(u(v(w(x(y(z({(|(}(~(((((((((((((((((((([(\(]None"#$+-03457;<=>?ACNQV]^n/Checks that builtin with name  b : String of type t : Term, is a data type or inductive record with n : Int; constructors. Returns the name of the data/record type.(bindPostulatedName builtin e m checks that e is a postulated name q, and binds the builtin builtin to the term m q def , where def is the current  of q./'Bind BUILTIN EQUALITY and BUILTIN REFL.(&Bind a builtin thing to an expression.(#Bind a builtin thing to a new name.((((((((((None"#$+-03457;<=>?ACNQV]^!3Binds the FLAT builtin, and changes its definition.!LBinds the SHARP builtin, and changes the definitions of INFINITY and SHARP.!GBinds the INFINITY builtin, but does not change the type's definition.( The type of ".( The type of &o_.( The type of &m.!!!((((((!!!None"#$+-03457;<=>?ACNQV]^&matchCompiledE c es% takes a function given by case tree c and and a spine es$ and tries to apply the function to es.(A stack entry is a triple consisting of 1. the part of the case tree to continue matching, 2. the current argument vector, and 3. a patch function taking the current argument vector back to the original argument vector.(match'- tries to solve the matching problems on the Stack?. In each iteration, the top problem is removed and handled.If the top problem was a Done , we succeed.If the top problem was a Case n and the nXth argument of the problem is not a constructor or literal, we are stuck, thus, fail.If we have a branch for the constructor/literal, we put it on the stack to continue. If we do not have a branch, we fall through to the next problem, which should be the corresponding catch-all branch.\An empty stack is an exception that can come only from an incomplete function definition.((((((None"#$+-03457;<=>?ACNQV]^5 1First argument: allow non-terminating reductions./Case tree with bodies./ Case n bs stands for a match on the n(-th argument (counting from zero) with bs as the case branches. If the n+-th argument is a projection, we have only  with arity 0./ Done xs b stands for the body b where the xs contains hiding and name suggestions for the free variables. This is needed to build lambdas on the right hand side for partial applications which can still reduce./ Absurd case./3We are constructing a record here (copatterns).  lists projections./oMap from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)/!Map from literal to case subtree./'(Possibly additional) catch-all clause./ primForce/9Datatype or record type. Need to know this for primForce./+In this case we fall back to slow reduction//////////////////////////None"#$+-03457;<=>?ACNQV]^V %Process function clauses into case tree. This involves: 1. Coverage checking, generating a split tree. 2. Translation of lhs record patterns into rhs uses of projection. Update the split tree. 3. Generating a case tree from the split tree. Phases 1. and 2. are skipped if Nothing.(Stripped-down version of  used in clause compiler.(8Pattern variables are considered in left-to-right order.(Get the index of the next argument we need to split on. This the number of the first pattern that does a match in the first clause.(DIs is not a variable pattern? And if yes, is it a record pattern?(Is this a variable pattern?Maintain invariant: isVar = isNothing . properSplit!(splitOn single n cs* will force expansion of catch-alls if single.(4Expand catch-alls that appear before actual matches.Example: % true y x false false y will expand the catch-all x to false.Catch-alls need also to be expanded if they come before/after a record pattern, otherwise we get into trouble when we want to eliminate splits on records later.#Another example (see Issue 1650): 8 f (x, (y, z)) true = a f _ false = b  Split tree:  0 (first argument of f) - 1 (second component of the pair) - 3 (last argument of f) -- true -> a - false -> b 1 We would like to get the following case tree:  case 0 of _,_ -> case 1 of _,_ -> case 3 of true -> a; false -> b _ -> case 3 of true -> a; false -> b _ -> case 3 of true -> a; false -> b Example from issue #2168: G f x false = a f false = _ -> b f x true = c  case tree: c f x y = case y of true -> case x of true -> c false -> b false -> a (<Make sure (by eta-expansion) that clause has arity at least n where n) is also the length of the provided list.=Translate record patterns and coverage check with given type?(((((((((((((((((((((((((((((((((((None"#$+-03457;<=>?ACNQV]^d\( 'checkRecDef i name con ps contel fields nameRecord type identifier.con Maybe constructor name and info.psRecord parameters.contel!Approximate type of constructor (fields> -> Set). Does not include record parameters.fieldsList of field signatures.((checkRecordProjections m r q tel ftel fs. m name of the generated moduler name of the record typecon name of the record constructortel )parameters and record variable r ("self")ftel telescope of fieldsfs the fields to be checked(Position and other info.Record type identifier.$Optional: (co)inductive declaration.#Optional: user specified eta/no-etaOptional: constructor name.Record parameters.!Approximate type of constructor (fields0 -> Set). Does not include record parameters.Field signatures.((((None"#$+-03457;<=>?ACNQV]^D traverses the whole 6, and we can use this traversal to modify the term.Infer type of a neutral term.Entry point for term checking./Entry point for e.g. checking WithFunctionType.(The default action is to not change the  at all.(/Called on each subterm before the checker runs.(/Called on each subterm after the type checking.(Called for each ArgInfo. The first U/ is from the type, the second from the term./ Check a type and infer its sort.Necessary because of PTS rule (SizeUniv, Set i, Set i) but SizeUniv is not included in any Set i.This algorithm follows Abel, Coquand, Dybjer, MPC 08, Verifying a Semantic -Conversion Test for Martin-Lf Type Theory/Make sure a constructor is fully applied and infer the type of the constructor. Raises a type error if the constructor does not belong to the given type./checkArgInfo actual expected.The expected ? comes from the type. The actual ?8 comes from the term and can be updated by an action./checkRelevance action term type.The term U can be updated by the actionY. Note that the relevances might not match precisedly, because of the non-semantic Y relevance./$Infer ordinary function application./3Infer possibly projection-like function application/inferSpine t self es checks that spine es eliminates value self of type t^ and returns the remaining type (target of elimination) and the final self (has that type)./Returns both the real term (first) and the transformed term (second). The transformed term is not necessarily a valid term, so it must not be used in types./rType should either be a record type of a type eligible for the principal argument of projection-like functions./Result is in reduced form./Check if sort is well-formed./Check if level is well-formed./Type of a term or sort meta./DUniverse subsumption and type equality (subtyping for sizes, resp.).(Compute the sort of a type./eliminate t self es eliminates value self of type t by spine es1 and returns the remaining value and its type./ Constructor.Constructor arguments.$Type of the constructor application. Name of the data/record type, type of the data/record type, reconstructed parameters, type of the constructor (applied to parameters), full application arguments, types of missing arguments (already added to context), type of the full application./Type of the head self. The head self.The eliminations es.!Expected type of the application self es.*The application after modification by the Action./Type of the head. The head.The arguments.!Expected type of the application.*The application after modification by the Action. ((((( (((((((((None"#$+-03457;<=>?ACNQV]^((((((((((None"#$+-03457;<=>?ACNQV]^Q( subst u . absTerm u == id(isPrefixOf u v = Just es if v == u P es.(abstractType a v b[v] = b where a : v.( )piAbstractTerm v a b[v] = (w : a) -> b[w]( (piAbstract (v, a) b[v] = (w : a) -> b[w]For rewrite, it does something special: JpiAbstract (prf, Eq a v v') b[v,prf] = (w : a) (w' : Eq a w v') -> b[w,w']( This swaps var 0 and var 1. (((((((((((((((((((((((((((((((((((((((((None"#$+-03457;<=>?ACNQVZ]^ޙ(6Split pattern variables according to with-expressions.(Abstract with-expressions vs+ to generate type for with-helper function.Each  EqualityType, coming from a rewrite , will turn into 2 abstractions.(From a list of with and rewrite; expressions and their types, compute the list of final with" expressions (after expanding the rewrites).(FCompute the clauses for the with-function given the original patterns.( >stripWithClausePatterns cxtNames parent f t  qs np  ps = ps' *context bound by lhs of original function.fname of with -function.ttype of the original function.qs(internal patterns for original function.npnumber of module parameters in qspermutation taking vars(qs) to  support().ps*patterns in with clause (eliminating type t).ps'/patterns for with function (presumably of type ).Example: record Stream (A : Set) : Set where coinductive constructor delay field force : A Stream A record SEq (s t : Stream A) : Set where coinductive field ~force : let a , as = force s b , bs = force t in a "a b SEq as bs test : (s : Nat Stream Nat) (t : Stream Nat) ! SEq (delay s) t ! SEq t (delay s) ~force (test (a , as) t p) with force t ~force (test (suc n , as) t p) | b , bs = {!!} With function: @ f : (t : Stream Nat) (w : Nat Stream Nat) (a : Nat) (as : Stream Nat) (p : SEq (delay (a , as)) t) ! (fst w "a a) SEq (snd w) as  = t a as p -- reorder to bring with-relevant (= needed) vars first  = a as t p !  qs = (a , as) t p ~force ps = (suc n , as) t p ~force ps' = (suc n) as t p "Resulting with-function clause is:  f t (b , bs) (suc n) as t p &Note: stripWithClausePatterns factors ps through qs, thus  ps = qs[ps'] where [..]Q is to be understood as substitution. The projection patterns have vanished from ps' (as they are already in qs).(Construct the display form for a with function. It will display applications of the with function as applications to the original function. For instance,  aux a b c as  f (suc a) (suc b) | c (, context of types and with-arguments. " t type of rhs. " as types of with arguments. " vs with arguments. Output:( , ,,t',as',vs') where  :part of context needed for with arguments and their types. >part of context not needed for with arguments and their types.*permutation from  to   as returned by #.   " t'type of rhs under  " as',types with with-arguments depending only on  . " vs'with-arguments under .( 7 context for types of with types. , " vs : raise  as with and rewrite-expressions. " as8 types of with and rewrite-expressions. "  = context extension to type with-expressions.  , " b type of rhs. ! wtel !  2 ! b 2 such that [vs/wtel]wtel = as and [vs/wtel] 2 =   and [vs/wtel]b 2 = b+. Plus the final number of with-arguments.( 6Names of the module parameters of the parent function.Name of the parent function.Name of the with-function.Types of the parent function.Context of parent patterns.Parent patterns..Number of module parameters in parent patterns1Substitution from parent lhs to with function lhsFinal permutation. Number of needed vars. Number of with expressions.  With-clauses. ,With-clauses flattened wrt. parent patterns.( 5Names of the module parameters of the parent functionName of the parent function.Name of with-function.t+ top-level type of the original function.* context of patterns of parent function.qs* internal patterns for original function.npars number of module parameters is qs. permutation taking vars(qs) to  support().ps, patterns in with clause (eliminating type t). ps'0 patterns for with function (presumably of type ).(The name of parent function.The name of the with -function.  The arguments of the with function before the with expressions.  The arguments of the with function after the with expressions.n The number of with expressions.qs The parent patterns.perm7 Permutation to split into needed and unneeded vars.lhsPerm9 Permutation reordering the variables in parent patterns.((((((((((((((((None"#$+-03457;<=>?ACNQVZ]^ !Set " according to termination info in  4, which comes from a possible termination pragma.!)Enter a new section during type-checking.!,Type check a definition by pattern matching.(Parameters for creating a with -function.(Parent function name.(With function name.(Type of the parent function.(Context of the parent patterns.(RTypes of arguments to the with function before the with expressions (needed vars).(STypes of arguments to the with function after the with expressions (unneeded vars).(With and rewrite expressions.(*Types of the with and rewrite expressions.(Type of the right hand side.(Parent patterns.(.Number of module parameters in parent patterns(QPermutation resulting from splitting the telescope into needed and unneeded vars.(;Permutation reordering the variables in the parent pattern.(@Final permutation (including permutation for the parent clause).('The given clauses for the with function(IA single clause without arguments and without type signature is an alias.('Check a trivial definition of the form f = e(,Type check a definition by pattern matching.(@Insert some patterns in the in with-clauses LHS of the given RHS(Type check a function clause.(Type check the with and rewrite lhss and/or the rhs.(Invoked in empty context.(Type check a where clause.(Set the current clause number.!'the type we expect the function to haveis it irrelevant (for instance)2are the clauses delayed (not unfolded willy-nilly)pdoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)Eis it a with function (if so, what's the name of the parent function) range infothe name of the functionthe clauses to check( 'the type we expect the function to haveis it irrelevant (for instance)2are the clauses delayed (not unfolded willy-nilly)pdoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)Eis it a with function (if so, what's the name of the parent function) range infothe name of the functionRsubstitution (from with abstraction) that needs to be applied to module parametersthe clauses to check((Type of function defined by this clause.<Module parameter substitution arising from with-abstraction.Clause.Type-checked clause.( Range of lhs.Name of function.Patterns in lhs.Top-level type of function. Result of type-checking patterns Rhs to check.(Name of function.Name of the with-function.Type of function. Result of type-checking patternsWith-expressions.Types of with-expressions.With-clauses to check.(Where-declarations to check. Continuation.!!!!!(((((((((((((((((((((((((((((!!(((!(!((((((((((((((((((((((((!(((((((((((((((((((None"#$+-03457;<=>?ACKNQV]^ST/(6The call information is stored as free monoid over _. As long as we never look at it, only accumulate it, it does not matter whether we use Set, (nub) list, or TreeC. Internally, due to lazyness, it is anyway a binary tree of -; nodes and singleton leafs. Since we define no order on ! (expensive), we cannot use a SetU or nub list. Performance-wise, I could not see a difference between Set and list.)2True if thing not eligible for structural descent.)Thing.)Extract variables from ;s that could witness a decrease via a SIZELT constraint.These variables must be under an inductive constructor (with no record constructor in the way), or after a coinductive projection (with no inductive one in the way).)Termination monad.)  Termination monad service class.) The termination environment.)AAre we mining dot patterns to find evindence of structal descent?)LDo we assume that record and data type constructors preserve guardedness?)DDo we inline with functions to enhance termination checking of with?)#The name of size successor, if any.)2The name of the delay constructor (sharp), if any.)/Depth at which to cut off the structural order.)3The name of the function we are currently checking.)The names of the functions in the mutual block we are checking. This includes the internally generated functions (with, extendedlambda, coinduction).)rThe list of name actually appearing in the file (abstract syntax). Excludes the internally generated functions.)SDoes the actual clause result from with-inlining? (If yes, it may be ill-typed.))_Target type of the function we are currently termination checking. Only the constructors of )$ are considered guarding.)%Are we checking a delayed definition?)Only consider the )U -l< arguments for establishing termination. See issue #1023.)Only consider guardedness if -l (not masked).) How many SIZELTy relations do we have in the context (= clause telescope). Used to approximate termination for metas in call args.)+The patterns of the clause we are checking.)Number of additional binders we have gone under (and consequently need to raise the patterns to compare to terms). Updated during call graph extraction, hence strict.) ~The current guardedness status. Changes as we go deeper into the term. Updated during call graph extraction, hence strict.)!When extracting usable size variables during construction of the call matrix, can we take the variable for use with SIZELT constraints from the context? Yes, if we are under an inductive constructor. No, if we are under a record constructor. (See issue #1015).)"JPattern variables that can be compared to argument variables using SIZELT.)#The current guardedness level.)$+The target of the function we are checking.)%!The mutual block we are checking.RThe functions are numbered according to their order of appearance in this list.)&!An empty termination environment.Values are set to a safe default meaning that with these initial values the termination checker will not miss termination errors it would have seen with better settings of these values.5Values that do not have a safe default are set to  IMPOSSIBLE.)')Generic run method for termination monad.)(CRun TerM computation in default environment (created from options).)EAShould the codomain part of a function type preserve guardedness?)F Lens for ).)G Lens for )".)J Lens for )!.)M9Compute usable vars from patterns and run subcomputation.)NSet )! when going under constructor c.)OSet )!$ for arguments following projection qx. We disregard j<i after a non-coinductive projection. However, the projection need not be recursive (Issue 1470).)PFor termination checking purposes flat should not be considered a projection. That is, it flat doesn't preserve either structural order or guardedness like other projections do. Andreas, 2012-06-09: the same applies to projections of recursive records.)QCheck whether a projection belongs to a coinductive record and is actually recursive. E.g. @ isCoinductiveProjection (Stream.head) = return False8isCoinductiveProjection (Stream.tail) = return True @)R3How long is the path to the deepest atomic pattern?)SUA dummy pattern used to mask a pattern that cannot be used for structural descent.)V#A very crude way of estimating the SIZELT chains  i > j > k: in context. Returns 3 in this case. Overapproximates.)W*Print masked things in double parentheses.)f*Only show intermediate nodes. (Drop last ).[(((()))))))))) ) ) ) ) ))")!) ))))))))))))))))))#)$)%)&)')()))*)+),)-).)/)0)1)2)3)4)5)6)7)8)9):);)<)=)>)?)@)A)B)C)D)E)F)G)H)I)J)K)L)M)N)O)P)Q)R)S)T)U)Vk)%)$)#) ))))))))))))))))))) )!)")&) ) ) ) ))))e)')()`)_)^)])\)[)Z)Y)))*)+),)-).)/)0)1)2)3)4)5)6)7)8)9):);)<)=)>)?)@)A)B)C)D)E)F)G)H)I)J)K)L)M)N)O)P)Q)R)S)))d)c)b)a)())))T)U)X)W((()f)V(((())))))))) ) ) ) ) ))))))))))))))))))) )!)"None"#$+-03457;<=>?ACNQV]^g2)wReturns ,5 if no inlining happened, otherwise, the new clauses./SReturns the original clause if no inlining happened, otherwise, the new clauses./withExprClauses cl t asA generates a clause containing a fake call to with-expression a for each a in asF that is not a variable (and thus cannot contain a recursive call).Andreas, 2013-11-11: I guess "not a variable" could be generalized to "not containing a call to a mutually defined function".Note that the as) stem from the *unraised* clause body of cl and thus can be simply /ped back there (under all the Bind abstractions).Precondition: we are  ./inlinedClauses f cl t wf& inlines the clauses of with-function wf of type t into the clause cl!. The original function name is f.Precondition: we are  ./The actual work horse. inline f pcl t wf wcl inlines with-clause wcl of with-function wf (of type t) into parent clause pcl (original function being f).)w)x)y)w)x)yNone"#$&'+-03457;<=>?ACKNQVZ]^(/lRemove all non-coinductive projections from an algebraic term (not going under binders). Also, remove s./)Extract recursive calls from expressions./]Convert a term (from a dot pattern) to a pattern for the purposes of the termination checker.SIZESUC is treated as a constructor.)z:The result of termination checking a module. Must be a - and have ./-Call graph with call info for composed calls.){4Entry point: Termination check a single declaration.Precondition: 7 must be set correctly./HTermination check a single declaration (without necessarily ignoring abstract).)|8Entry point: Termination check the current mutual block./ termMutual'D checks all names of the current mutual block, henceforth called allNames, for termination.allNames is taken from Internal` syntax, it contains also the definitions created by the type checker (e.g., with-functions)./Smart constructor for  . Removes  that are not mentioned in ./ reportCalls for debug printing.0Replays the call graph completion for debugging./termFunction name checks name for termination./To process the target type./3Termination check a definition by pattern matching.BTODO: Refactor! As this function may be called twice, once disregarding dot patterns, the second time regarding dot patterns, it is better if we separated bare call extraction from computing the change in structural order. Only the latter depends on the choice whether we consider dot patterns or not./Mask arguments and result for termination checking according to type of function. Only arguments of types ending in data/record or Size are counted in./0Is the current target type among the given ones?/:Convert a term (from a dot pattern) to a DeBruijn pattern.MThe term is first normalized and stripped of all non-coinductive projections./KMasks all non-data/record type patterns if --without-K. See issue #1023./(Extract recursive calls from one clause./7Extract recursive calls from a constructor application.//Handle guardedness preserving type constructor./-Extract calls from with function application./Handles function applications g es./ Rewrite type tel -> Size< u to  tel -> Size./ compareArgs es5Compare the list of de Bruijn patterns (=parameters) pats with a list of arguments esB and create a call maxtrix with |es| rows and |pats| columns.8The guardedness is the number of projection patterns in pats) minus the number of projections in es./Traverse patterns from left to right. When we come to a projection pattern, switch usage of SIZELT constraints: on, if coinductive, off, if inductive.UNUSED/ compareElim e dbpat/In dependent records, the types of later fields may depend on the values of earlier fields. Thus when defining an inhabitant of a dependent record type such as  by copattern matching, a recursive call eliminated by an earlier projection (proj ) might occur in the definition at a later projection (proj ). Thus, earlier projections are considered "smaller" when comparing copattern spines. This is an ok approximation of the actual dependency order. See issues 906, 942.// turns the result of / into a proper call matrix//6 adds guardedness flag in the upper left corner (0,0)./=Compose something with the upper-left corner of a call matrix/Stripping off a record constructor is not counted as decrease, in contrast to a data constructor. A record constructor increases/decreases by 0, a data constructor by 1./$Compute the proper subpatterns of a ./ compareTerm' t dbpat(Precondition: top meta variable resolved/subTerm# computes a size difference (Order)/Compare two variables.@The first variable comes from a term, the second from a pattern.)$Extract recursive calls from a term.)$Extract recursive calls from a type.)*Sorts can contain arbitrary terms of type Level<, so look for recursive calls also in sorts. Ideally, ; would not be its own datatype but just a subgrammar of *, then we would not need this boilerplate.)/Extract recursive calls from level expressions.)|UThe function names defined in this block on top-level. (For error-reporting only.)/Constructor name.>Should the constructor be treated as inductive or coinductive?@All the arguments, and for every argument a boolean which is ,@ iff the argument should be viewed as preserving guardedness.)z){)|){)|)z///////None"#$+-03457;<=>?ACNQVZ]^!@Check an application of a section (top-level function, includes ).! Type check a single declaration.!&Type check a sequence of declarations.)Cached checkDecl)ICheck if there is a inferred eta record type in the mutual block. If yes, repeat the record pattern translation for all function definitions in the block. This is necessary since the original record pattern translation will have skipped record patterns of the new record types (as eta was off for them). See issue  2308 (and 2197).)NRun a reflected TCM computatation expected to define a given list of names.)Instantiate all metas in  associated to  _. Makes sense after freezing metas. Some checks, like free variable analysis, are not in , so they will be more precise (see issue 1099) after meta instantiation. Precondition: name has been added to signature already.)Highlight a declaration.) Termination check a declaration.)+Check a set of mutual names for positivity.)Check that all coinductive records are actually recursive. (Otherwise, one can implement invalid recursion schemes just like for the old coinduction.))7Check a set of mutual names for constructor-headedness.)4Check a set of mutual names for projection likeness.Only a single, non-abstract function can be projection-like. Making an abstract function projection-like would break the invariant that the type of the principle argument of a projection-like function is always inferable.)>Freeze metas created by given computation if in abstract mode.)Type check an axiom.),Type check a primitive function declaration.)Check a pragma.)=Type check a bunch of mutual inductive recursive definitions.XAll definitions which have so far been assigned to the given mutual block are returned.)FType check the type signature of an inductive or recursive definition.)Type check a module.) Helper for !.NMatches the arguments of the module application with the module parameters.dReturns the remaining module parameters as an open telescope. Warning: the returned telescope is notO the final result, an actual instantiation of the parameters does not occur.)"Check an application of a section.)rType check an import declaration. Actually doesn't do anything, since all the work is done when scope checking.!Name m1' of module defined by the module macro.The module macro  tel ! m2 args.Imported names and modules)Name of applied module.The module parameters.(The arguments this module is applied to.>The remaining module parameters (has free de Bruijn indices!).)Name m1' of module defined by the module macro.The module macro  tel ! m2 args.Imported names and modules!!!)))))))))))))))))))))))))))) )!!))))))))))))))))))))))!))))))))FNone"#$+-03457;<=>?ACNQV]^!!)!!)None"#$+-03457;<=>?ACNQV]^)'Takes the name of the data/record type./Doesn't have any type information (other than the name of the data type), so we can't do better than checking if all constructors are present.))))///////0None"#$+-03457;<=>?ACNQV]^/0*Environment for naming of local variables.0;Maps case tree de-bruijn indices to TTerm de-bruijn indices0yTTerm de-bruijn index of the current catch all If an inner case has no catch-all clause, we use the one from its parent.)-Converts compiled clauses to treeless syntax.Note: Do not use any of the concrete names in the returned term for identification purposes! If you wish to do so, first apply the Agda.Compiler.Treeless.NormalizeNames transformation.01Does not require the name to refer to a function.0.Initial environment for expression generation.0%Term variables are de Bruijn indices.0$Case variables are de Bruijn levels.0<Compile a case tree into nested case and record expressions.0 Shrinks or grows the context to the given size. Does not update the catchAll expression, the catchAll expression MUST NOT be used inside cont.0 Adds lambdas until the context has at least the given size. Updates the catchAll expression to take the additional lambdas into account.0 Replace de Bruijn Level x by n new variables.0 Precondition: Map not empty.0 eTranslate the actual Agda terms, with an environment of all the bound variables from patternmatching. Agda terms are in de Bruijn indices, but the expected TTerm de bruijn indexes may differ. This is due to additional let-bindings introduced by the catch-all machinery, so we need to lookup casetree de bruijn indices in the environment as well.0Case tree de bruijn index.TTerm de bruijn index.0case tree de bruijn levelTTerm de bruijn index))))0000None"#$+-03457;<=>?ACNQV]^04Alpha-Equivalence of patterns, ignoring dot patterns0+currently we only support variable patterns0A sequence of decisions b leading to a head a.0the list of choices0?This is a n^2 grouping algorithm which uses only alpha-equality0Expects a sorted list.0 Similar to 0.) s are not renamed.))00000000000000 None"#$&'+-03457;<=>?ACNQV]^'0 $Name sets for classifying a pattern.0!name of defined symbol0"valid constructor names0#valid field names0$Data structure filled in by  buildParsers. The top-level parser pTop is of primary interest, but pArgsK is used to convert module application from concrete to abstract syntax.0%Bills the operator parser.0&Compute all defined names in scope and their fixities/notations. Note that overloaded names (constructors) can have several fixities/notations. Then we  . (See issue 1194.)0'YCompute all names (first component) and operators/notations (second component) in scope.0(`Builds a parser for operator applications from all the operators and function symbols in scope.When parsing a pattern we do not use bound names. The effect is that unqualified operator parts (that are not constructor parts) can be used as atomic names in the pattern (so they can be rebound). See testsucceed OpBind.agda for an example.When parsing a pattern we also disallow the use of sections, mainly because there is little need for sections in patterns. Note that sections are parsed by splitting up names into multiple tokens (_+_ is replaced by _, + and _), and if we were to support sections in patterns, then we would have to accept certain such sequences of tokens as single pattern variables.tThe list of names must include every name part in the expression/pattern to be parsed (excluding name parts inside things like parenthesised subexpressions that are treated as atoms). The list is used to optimise the parser. For instance, a given notation is only included in the generated grammar if all of the notation's name parts are present in the list of names.(The returned list contains all operators notations1sections that were used to generate the grammar.0)View a pattern p as a list p0 .. pn where p04 is the identifier (in most cases a constructor).8Pattern needs to be parsed already (operators resolved).0*$Returns the list of possible parses.0+(The returned list contains all operators notations1sections that were used to generate the grammar.0,(Returns zero or one classified patterns.)JParses a left-hand side, and makes sure that it defined the expected name.)Parses a pattern.0-Helper function for ) and ).0.Helper function for ) and ).0/,Return all qualifiers occuring in a list of As. Each qualifier is returned as a list of names, e.g. for  Data.Nat._+_ we return the list  [Data,Nat].)0Parse a list of expressions into an application.)ZParse an expression into a module application (an identifier plus a list of arguments).))))))))))0 000!0"0#0102030$040506070809 None"#$+-03457;<=>?ACNQV]^)*)) None"#$+-03457;<=>?ACNQV]^Y%0:,The with clauses haven't been translated yet0; rewrite e (many)0<with e (many)0=pthe subclauses spawned by a with (monadic because we need to reset the local vars before checking these clauses))as seen from inside the module)*Temporary data type to scope check a file.)/The file path from which we loaded this module.)gThe expected module name (coming from the import statement that triggered scope checking this file).)The file content.0>$We for now disallow let-bindings in data and recordS telescopes. This due "nested datatypes"; there is no easy interpretation of Z data D (A : Set) (open M A) (b : B) : Set where c : D (A A) b ! D A b  where B is brought in scope by open M A.0?WIf a set is given, then the first name must correspond to one of the names in the set.0@WIf a set is given, then the first name must correspond to one of the names in the set.)PThings that can be translated to abstract syntax are instances of this class.0A.Make sure that each variable occurs only once.0BFMake sure that there are no dot patterns (called on pattern synonyms).0CCCompute the type of the record constructor (with bogus target type)0D BcheckModuleMacro mkApply range access concreteName modapp open dirPreserves local variables.0EThe public) keyword must only be used together with open.0FJComputes the range of all the "to" keywords used in a renaming directive.0GScope check a .0H(This function should be used instead of )a for things that need to keep track of precedences to make sure that we don't forget about it.)aThis operation does not affect the scope, i.e. the original scope is restored upon completion.0ILike )F but returns the scope after the completion of the second argument.0J Peel off  o and represent it as an *.0K Peel off  o and represent it as an 7, throwing away any name.0LBy default, arguments are Relevant.0MAParse a possibly dotted C.Expr as A.Expr. Bool = True if dotted.0NmTranslate concrete expression under at least one binder into nested lambda abstraction in abstract syntax.0O'Scope check extended lambda expression.0P*Scope check a module (top level function).0QACheck whether a telescope has open declarations or module macros.0R,Returns the scope inside the checked module.)The top-level module name.0S@runs Syntax.Concrete.Definitions.niceDeclarations on main module0T An argument  OpApp C.ExprB to an operator can have binders, in case the operator is some syntaxG-notation. For these binders, we have to create lambda-abstractions.0UxTurn an operator application into abstract syntax. Make sure to record the right precedences for the various arguments.*%Top-level declarations are always  (import|open)* -- a bunch of possibly opened imports module ThisModule ... -- the top-level module of this file 0G Arguments of  Arguments of ^0R The concrete name of the module. The abstract name of the module.The module telescope.*The code for checking the module contents.)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))0V)0W0:0X0Y)0Z0;0<0=0[0\0]0^0_0`0a0b0c0d)0e)0f)))))))))0>0g)0h)))0i0j0k)0l0m0n)0?)))0@)0o0p0q)) None"#$+-03457;<=>?ACNQV]^~b*) A subset of *-.*@YModifier for interactive commands, specifying whether safety checks should be ignored.*A8Ignore additional checks, like termination/positivity...*BDon't ignore any checks.*CkModifier for the interactive computation command, specifying the mode of computation and result display.*G[Modifier for interactive commands, specifying the amount of normalization in the output.*MParses an expression.*POAfter a give, redo termination etc. checks for function which was complemented.*QTry to fill hole by expression.LReturns the given expression unchanged (for convenient generalization to *R).*R!Try to refine hole by expression e.)This amounts to successively try to give e, e ?, e ? ?3, ... Returns the successfully given expression.*S9Evaluate the given expression in the current environment *]getSolvedInteractionPoints TrueP returns all solutions, even if just solved by another, non-interaction meta. getSolvedInteractionPoints False5 only returns metas that are solved by a non-meta.*eReturns the type of the expression in the current environment We wake up irrelevant variables just in case the user want to invoke that command in an irrelevant context.*j\Runs the given computation as if in an anonymous goal at the end of the top-level module.+Sets up current module, scope, and context.*k Parse a name.*l8Check whether an expression is a (qualified) identifier.*m3Returns the contents of the given module or record.*n4Returns the contents of the given record identifier.*o)Returns the contents of the given module.*QSkip safety checks?Hole.The expression to give.9If successful, the very expression is returned unchanged.*RSkip safety checks when giving?Hole.'The expression to refine the hole with."The successfully given expression.*m"How should the types be presented?The range of the next argument.The module name.7Module names, names paired up with corresponding types.*n!Amount of normalization in types.%Expression presumably of record type.7Module names, names paired up with corresponding types.*o!Amount of normalization in types. Module name.7Module names, names paired up with corresponding types.H*)***,*+*-*=*<*;*:*9*6*5*4*3*2*1*0*/*.*8*7*>*?*@*B*A*C*F*E*D*G*L*K*J*I*H*M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*[*\*]*^*_*`*a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*pP*M*N*O*P*Q*R*S*T*G*H*I*J*K*L*U*C*D*E*F*V*W*X*@*A*B*>*?*-*.*/*0*1*2*3*4*5*6*7*8*9*:*;*<*=*)***+*,*Y*v*Z*s*[*u*r*t*q*x*w*\*]*^*_*`*a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*)***+*,*-*.*/*0*1*2*3*4*5*6*7*8*9*:*;*<*=*>*?*@*A*B*C*D*E*F*G*H*I*J*K*L None"#$+-03457;<=>?ACNQV]^H**None"#$+-03457;<=>?ACNQV]^X*The interaction loop.*Set 4 to  optInputFile.*>The logo that prints when Agda is started in interactive mode.*The help message**********************************************************None"#$+-03457;<=>?ACNQV]^M*SParse variables (visible or hidden), returning their de Bruijn indices. Used in *.*Lookup the clause for an interaction point in the signature. Returns the CaseContext, the clause itself, and a list of previous clauses*&Entry point for case splitting tactic.*<Mark the variables given by the list of deBruijn indices as M in the '.*2Make clause with no rhs (because of absurd match).**Make a clause with a question mark as rhs.*The function name.-The telescope of the clause we are splitting.,The hole of this function we are working on.The range of this hole.9The words the user entered in this hole (variable names).<The computed de Bruijn indices of the variables to split on.**************None"#$+-03457;<=>?ACNQV]^}-*********************************************8***********************************************************************None"#$+-03457;<=>?ACNQV]^A*6Result type: Progress & potential Message for the user:The of the Auto tactic can be one of the following three: Solutions [(ii,s)] A list of solutions s for interaction ids ii. In particular,  Solutions [] means Agsy found no solution. FunClauses cs0 A list of clauses for the interaction id ii? in which Auto was invoked with case-splitting turned on. Refinement s+ A refinement for the interaction id ii in which Auto was invoked.*#Entry point for Auto tactic (Agsy).If the  autoMessage part of the result is set to Just msg, the message msg2 produced by Agsy should be displayed to the user.0r[Names for the equality reasoning combinators Empty if any of these names is not defined.0sTemplates for error messages ********* *****************None"#$+-03457;<=>?ACNQV]^ޯ$pScope checks the given module. A proper version of the module name (with correct definition sites) is returned.*JAre we loading the interface for the user-loaded file or for an import?*For the main file.+In this case state changes inflicted by + are preserved.*For an imported file.+In this case state changes inflicted by + are not preserved.*JIs the aim to type-check the top-level module, or only to scope-check it?*"Should state changes inflicted by + be preserved?*0Merge an interface into the current proof state.*If the module has already been visited (without warnings), then its interface is returned directly. Otherwise the computation is used to find the interface and the computed interface is stored for potential later use (unless the * is * *).*Type checks the main file of the interaction. This could be the file loaded in the interacting editor (emacs), or the file passed on the command line.4First, the primitive modules are imported. Then,  getInterface' is called to do the main work.If the * is *, then type-checking is not performed, only scope-checking. (This may include type-checking of imported modules.) In this case the generated, partial interface is not stored in the state (n). Note, however, that if the file has already been type-checked, then a complete interface is returned.*Tries to return the interface associated to the given (imported) module. The time stamp of the relevant interface file is also returned. Calls itself recursively for the imports of the given module. May type check the module. An error is raised if a warning is encountered.'Do not use this for the main file, use * instead.*See *.*A more precise variant of *[. If warnings are encountered then they are returned instead of being turned into errors.*xCheck whether interface file exists and is in cache in the correct version (as testified by the interface file hash).*6Try to get the interface from interface file or cache.*7Run the type checker on a file and create an interface.Mostly, this function calls +. But if it is not the main module we check, we do it in a fresh state, suitably initialize, in order to forget some state changes after successful type checking.*Formats and outputs the Checking, Finished and "Loading " messages.+DPrint the highlighting information contained in the given interface.+-Writes the given interface to the given file.+Tries to type check a module and write out its interface. The function only writes out an interface file if it does not encounter any warnings.IIf appropriate this function writes out syntax highlighting information.+Collect all warnings that have accumulated in the state. Depending on the argument, we either respect the flags passed in by the user, or not (for instance when deciding if we are writing an interface file or not)+Reconstruct the  (not serialized) from the  (serialized).+ fBuilds an interface for the current module, which should already have been successfully type checked.+  Returns (iSourceHash, iFullHash)+ uTrue if the first file is newer than the second file. If a file doesn't exist it is considered to be infinitely old.*Module name of file we process.File we process.*Module name of file we process.File we process.Bool' is: do we have to merge the interface?*Module name of file we process.File we process.Bool' is: do we have to merge the interface?*The prefix, like Checking, Finished, Loading .The module name.Optionally: the file name.+The corresponding file.+The file to type check.The expected module name.+ ) for the current module.(Syntax highlighting info for the module.Options set in OPTIONS pragmas.&$************************++++++++++ + + + '*********$*****+ **********++++++++++ + + + *********None"#$+-03457;<=>?ACNQV]^e+MRecords already processed modules and maps them to an internal identifier.+Supply of internal identifiers.+Edges of dependency graph.+AInternal module identifiers for construction of dependency graph.+ Translate a   to an internal + . Returns True if the  d is new, i.e., has not been encountered before and is thus added to the map of processed modules.+%Add an arc from importer to imported.+4Recursively build import graph, starting from given . Modifies the state in + and returns the + of the .+ EGenerate a .dot file for the import graph starting with the given B and write it to the file specified by the command line option. ++++++++++++ ++++++++++++ +++++None"#$+-03457;<=>?ACNQV]^B+.4Copy pasted from MAlonzo.... Move somewhere else!+/$Sets up the compilation environment.+!+#+"+$+%+&+'+(+)+*+++,+-+.+/+0+!+"+#+2+1+$+%+&+'+(+)+*+++,+-+.+/+0+!+"+#None"#$+-03457;<=>?ACNQV]^+5 Classify FOREIGN Haskell code.+63A pragma that must appear before the module header.+7@An import statement. Must appear right after the module header.+81The rest. To appear after the import statements.+CGet content of  FOREIGN GHC pragmas, sorted by +52: file header pragmas, import statements, rest.+D Classify a  FOREIGN GHC declaration.+EIClassify a Haskell pragma into whether it is a file header pragma or not.+FPartition a list by +5 attribute.+5+8+7+6+9+=+<+;+:+>+?+@+A+B+C+D+E+F+9+:+;+<+=+G+>+?+@+A+B+C+5+6+7+8+D+E+F+5+6+7+8+9+:+;+<+=None"#$+-03457;<=>?ACNQV]^+T0Name for definition stripped of unused arguments+x:Can the character be used in a Haskell module name part (conidJ)? This function is more restrictive than what the Haskell report allows./+J+K+L+M+N+O+P+Q+R+S+T+U+V+W+X+Y+Z+[+\+]+^+_+`+a+b+c+d+e+f+g+h+i+j+k+l+m+n+o+p+q+r+s+t+u+v+w+x/+J+K+L+M+N+O+P+Q+R+S+T+U+V+W+X+Y+Z+[+\+]+^+_+`+a+b+c+d+e+f+g+h+i+j+k+l+m+n+o+p+q+r+s+t+u+v+w+xNone"#$+-03457;<=>?ACNQV]^+yyHaskell module names have to satisfy the Haskell (including the hierarchical module namespace extension) lexical syntax: 4modid -> [modid.] large {small | large | digit | ' }+yC is an injective function into the set of module names defined by modid. The function preserves .Ds, and it also preserves module names whose first name part is not +`.3Precondition: The input must not start or end with ., and no two .s may be adjacent.+y+yNone"#$+-03457;<=>?ACNQV]^+z+{+|+}+~++z++++++++{++|+}+++++++++++++~+None"#$+-03457;<=>?ACNQV]^ +7Check that the main function has type IO a, for some a.+,Haskell modules to be imported for BUILT-INs+)Definition bodies for primitive functions ++++++++++ ++++++++++None"#$+-03457;<=>?ACNQV]^ + Note that Inf a b, where Inf, is the INFINITY builtin, is translated to  translationof b7 (assuming that all coinductive builtins are defined). Note that if  haskellType] supported universe polymorphism then the special treatment of INFINITY might not be needed.++++++++++++++++++++++++++++None"#$%+-03457;<=>?ACNQV]^L.0t%The number of the current code block.0uThe current column number.0vQAll alignment columns found on the current line (so far), in reverse order.0wjAll alignment columns found in previous lines (in any code block), with larger columns coming first.0x(The next indentation column identifier.0y5Indentation columns that have actually been used.0z!Count extended grapheme clusters?0{"Alignment and indentation columns.0|The column's code block.0}The column number.0~The column kind. , for alignment columns and , i for indentation columns, where i$ is the column's unique identifier.0+Unique identifiers for indentation columns.0 Column kinds.0nUsed only for indentation (the placement of the first token on a line, relative to tokens on previous lines).0,Used both for indentation and for alignment.0 Output items.0A piece of text.0A column. If it turns out to be an indentation column that is not used to indent or align something, then no column will be generated, only whitespace (0).0The LaTeX monad is a combination of ExceptT, RWST and IO . The error part is just used to keep track whether we finished or not, the reader part isn't used, the writer is where the output goes and the state is for keeping track of the tokens and some other useful info, and the I/O part is used for printing debugging info.0+Says what debug information should printed.0Run function for the LaTeX monad.0Gives the size of the string. If cluster counting is enabled, then the number of extended grapheme clusters is computed (the root locale is used), and otherwise the number of code points.0-Does the string consist solely of whitespace?06Is the character a whitespace character distinct from '\n'?0OReplaces all forms of whitespace, except for new-line characters, with spaces.0Yields the next token, taking special care to begin/end code blocks. Junk occuring before and after the code blocks is separated into separate tokens, this makes it easier to keep track of whether we are in a code block or not.0Merges 0v into 0w , resets 0u and 0v0=Registers a column of the given kind. The column is returned.0ERegisters the given column as used (if it is an indentation column).00Alignment column zero in the current code block.0-Registers column zero as an alignment column.0FChanges to the state that are performed at the start of a code block.0DChanges to the state that are performed at the end of a code block.0VA command that is used when two tokens are put next to each other in the same column.0The column's name.QIndentation columns have unique names, distinct from all alignment column names.0#Opens a column with the given name.0Opens the given column.0DOpens a special column that is only used at the beginning of lines.0iOpens the given column, and inserts an indentation instruction with the given argument at the end of it.0The start state, nonCodeG, prints non-code (the LaTeX part of literate Agda) until it sees a  beginBlock.0Deals with markup02Deals with literate text, which is output verbatim0ZDeals with code blocks. Every token, except spaces, is pretty printed as a LaTeX command.0Every element in the list should consist of either one or more newline characters, or one or more space characters. Two adjacent list elements must not contain the same character.rIf the final element of the list consists of spaces, then these spaces are assumed to not be trailing whitespace.+/Generates a LaTeX file for the given interface.The underlying source file is assumed to match the interface, but this is not checked. TODO: Fix this problem, perhaps by storing the source code in the interface.0&Transforms the source code into LaTeX.0!Count extended grapheme clusters?0!Indentation instruction argument.0!Count extended grapheme clusters?0!Count extended grapheme clusters?++0000000000000t0u0v0w0x0y0z0{00|0}0~000000None"#$+-03457;<=>?ACNQV]^]@ +!The name of the default CSS file.+dGenerates HTML files from all the sources which have been visited during the type checking phase.VThis function should only be called after type checking has completed successfully.+-Prepare information for HTML page generation.The page generator receives the file path of the module, the top level module name of the module and the highlighting information of the module.0;Converts module names to the corresponding HTML file names.+AGenerates a highlighted, hyperlinked version of the given module.0Attach multiple Attributes++Constructs the web page, including headers.+'Constructs token stream ready to print.+(Constructs the HTML displaying the code.+Page generator+ Page renderer#Directory in which to create files.Module to be highlighted.+URL to the CSS file.Module to be highlighted.+The contents of the module.Highlighting information.(position, contents, info)++++++++++++++None"#$&'+,-03457;<=>?ACFNQSTV]^k +0Optional version information to be printed with  --version.+Default options+_Backend-specific command-line flags. Should at minimum contain a flag to enable the backend.+%Unless the backend has been enabled, runAgda- will fall back to vanilla Agda behaviour.+DCalled after type checking completes, but before compilation starts.+3Called after module compilation has completed. The IsMain argument is NotMain if the  --no-main flag is present.+BCalled before compilation of each module. Gets the path to the .agdai_ file to allow up-to-date checking of previously written compilation results. Should return Skip m# if compilation is not required.+;Called after all definitions of a module has been compiled.+Compile a single definition.+True if the backend works if --only-scope-checking is used.!+       01E>FD23456789:;<=?@ABCGHIJKLMNOPQ VW                           ! " # $ % & ' ( n o p q r s t u v w x y z { | } ~  CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()+*,-./RSTUXYZ[\^]_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdegfhijklmnopqrvustwxyz{|}~   !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMcedfghijklmnopqrstuvwxyz{|}~                     " # $ % & ' ( ) * + , - !!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!6!7!8!9!:!;!<!=!>!?!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!f!g!h!i!j!k!l!m!n!o!p!q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!)+!+"+#+++++++++++++++++++!++++++++++++++++++!+"+#)+++!+00++++ ++++++++++++None"#$+-03457;<=>?ACNQV]^wL#Print open metas nicely.+Available backends.+The + monad. 0! state holds the remaining input.+cmd_load m argv loads the module in file m , using argv as the command-line options.+cmd_compile b m argv compiles the module in file m using the backend b, using argv as the command-line options.+aShow unsolved metas. If there are no unsolved metas but unsolved constraints show those instead.+Display all warnings.+eShows all the top-level names in the given module, along with their types. Uses the top-level scope.+^Shows all the top-level names in scope which mention all the given identifiers in their type.+VSolve (all goals / the goal at point) whose values are determined by the constraints.+nParse the given expression (as if it were defined at the top-level of the current module) and infer its type.+{Parse and type check the given expression (as if it were defined at the top-level of the current module) and normalise it.+!cmd_load_highlighting_info source: loads syntax highlighting information for the module in source<, and asks Emacs to apply highlighting info from this file.If the module does not exist, or its module name is malformed or cannot be determined, or the module has not already been visited, or the cached info is out of date, then no highlighting information is printed.RThis command is used to load syntax highlighting information when a new file is opened, and it would probably be annoying if jumping to the definition of an identifier reset the proof state, so this command tries not to do that. One result of this is that the command uses the current include directories, whatever they happen to be.+lTells Agda to compute highlighting information for the expression just spliced into an interaction point.+5Tells Agda whether or not to show implicit arguments.+%Toggle display of implicit arguments.+ Goal commandsIf the range is B, then the string comes from the minibuffer rather than the goal.+&Displays the current goal and context.+&Displays the current goal and context and# infers the type of an expression.+PGrabs the current goal's type and checks the expression in the hole against it.+mShows all the top-level names in the given module, along with their types. Uses the scope of the given goal.+$Displays version of the running Agda+Abort the current computation..Does nothing if no computation is in progress.+An interactive computation.+Command queues., Commands.,An + command.,Stop processing commands.,8An error message for a command that could not be parsed.,4Monad for computing answers to interactive commands., is  extended with state ,.,.Auxiliary state of an interactive computation.,The interaction points of the buffer, in the order in which they appear in the buffer. The interaction points are recorded in  theTCState, but when new interaction points are added by give or refine Agda does not ensure that the ranges of later interaction points are updated., The file which the state applies to. Only stored if the module was successfully type checked (potentially with warnings). The >E is the modification time stamp of the file when it was last loaded., *Reset the options on each reload to these., We remember (the scope of) old interaction points to make it possible to parse and compute highlighting information for the expression that it got replaced by., Command queue.DThe commands in the queue are processed in the order in which they are received. Abort commands do not have precedence over other commands, they only abort the immediately preceding command. (The Emacs mode is expected not to send a new command, other than the abort command, before the previous command has completed.), #Initial auxiliary interaction state, Restore both   and ,.,Restore  , do not touch ,.,Build an opposite action to 0 for state monads., Opposite of 0 for ,1. Use only if main errors are already catched.,?Lift a TCM action transformer to a CommandM action transformer.,Ditto, but restore state.,1Put a response by the callback function given by ., A Lens for ,., A Lens for , .,*Do setup and error handling for a command.,Run an +) value, catch the exceptions, emit output!If an error happens the state of ,p does not change, but stPersistent may change (which contains successfully loaded interfaces for example).,The next command.,Runs the given computation, but if an abort command is encountered (and acted upon), then the computation is interrupted, the persistent state and all options are restored, and some commands are sent to the frontend.,fCreates a command queue, and forks a thread that writes commands to the queue. The queue is returned., Converter from the type of 0 to +O The first paramter is part of the error message in case the parse fails.,"Demand an exact string.,%TCan the command run even if the relevant file has not been loaded into the state?,&Interpret an interaction,' Show warnings,(mSolved goals already instantiated internally The second argument potentially limits it to one specific goal.,)"cmd_load' file argv unsolvedOk cmd loads the module in file file , using argv as the command-line options.\If type checking completes without any exceptions having been encountered then the command cmd r is executed, where r is the result of *.,*Set 4 to ,  , if any.,+)A "give"-like action (give, refine, etc).*give_gen force ii rng s give_ref mk_newtxt acts on interaction point ii occupying range rng-, placing the new content given by string s, and replacing iiW by the newly created interaction points in the state if safety checks pass (unless force is applied).,-/Sorts interaction points based on their ranges.,.,Pretty-prints the type of the meta-variable.,/5Pretty-prints the context of the given meta-variable.,0LCreate type of application of new helper function that would solve the goal.,1JDisplays the current goal, the given document, and the current context.Should not modify the state.,2KShows all the top-level names in the given module, along with their types.,3^Shows all the top-level names in scope which mention all the given identifiers in their type.,4"Explain why something is in scope.,5ASets the command line options and updates the status information.,6!Computes some status information.Does not change the state.,7'Displays or updates status information.Does not change the state.,8 display_info does what  display_info' FalseA does, but additionally displays some status information (see ,6 and ,7).,;Parses and scope checks an expression (using the "inside scope" as the scope), performs the given command with the expression as input, and displays the result.,>LTell to highlight the code using the given highlighting info (unless it is Nothing).,?@Tells the Emacs mode to go to the first error position (if any).,CtNote that the grammar implemented by this instance does not necessarily match the current representation of ranges.,runlift(reverse lift in double negative position,Returns the next command.,)Allow unsolved meta-variables?.Full type-checking, or only scope-checking?,+ Should safety checks be skipped?,/ Normalise?$Print the elements in reverse order?,;The command to perform.5The name to use for the buffer displaying the output.The expression to parse.r#+++++++++++++++++++++++++++++++++++++++++++++++++,,,,,,,,,, , , , , ,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),*,+,,,-,.,/,0,1,2,3,4,5,6,7,8,9,:,;,<,=,>,?y,,,, , , , ,, ,,,,,,,,,,,,,,,,,,,,+,,,++++++++++++++++++++++++++++++++++++++++, ,!,",#,$,D,C,B,A,@,%,&,',(#,),*++++,F,E++++,+,,,-,.,/,0,1,2,3,4,5,6,7,8,9,:,;,<,=,>,?+++++++++++"++++++++++++++++++++++++++++++++++,,,,,,,, , , , None"#$+-03457;<=>?ACNQV]^-,U,UP is a fake ghci interpreter for the Emacs frontend and for interaction tests.,Uc reads the Emacs frontend commands from stdin, interprets them and print the result into stdout.0kGiven strings of goals, warnings and errors, return a pair of the body and the title for the info buffer0FConvert Response to an elisp value for the interactive emacs frontend.0 Adds a "last" tag to a response.0;Show an iteraction point identifier as an elisp expression.,U,UNone"#$+-03457;<=>?ACNQV]^,Y9Environment for naming of local variables. Invariant: reverse ccCxt ++ ccNameSupply,[Supply of fresh names,\Names currently in scope,mQNote that the INFINITY, SHARP and FLAT builtins are translated as follows (if a N is given): X type Infinity a b = b sharp :: a -> a sharp x = x flat :: a -> a flat x = x ,q.Initial environment for expression generation.,r%Term variables are de Bruijn indices.,t'Introduce n variables into the context.,wNExtract Agda term to Haskell expression. Erased arguments are extracted as (). Types are extracted as ().,%Is the type inductive or coinductive?;#,V,W,X,Y,Z,[,\,],^,_,b,a,`,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,{,|,},~,,,,,,,,,,,,,,,,,;,c,d,^,_,`,a,b,e,f,g,h,],i,j,k,l,m,n,Y,Z,[,\,X,W,o,p,q,r,V,s,t,u,v#,w,x,y,z,{,|,},~,,,,,,,,,,,,,,,,,,Y,Z,[,\,^,_,`,a,bNone"#$+-03457;<=>?ACNQV]^+,3Ensure that there is at most one pragma for a name.,*Primitives implemented in the JS Agda RTS.,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,None"#$+-03457;<=>?ACNQV]^,The main function,JRun Agda with parsed command line options and with a custom HTML generator,Print usage information.,Print version information.,What to do for bad options.,6Run a TCM action in IO; catch and pretty print errors.,Main,8Backends only for printing usage and version informationHTML generating actionBackend interaction program nameparsed command line options ,,,,,,,,,,, ,,,,,,,,,,,0GHIGJKGJLGJMGJNGJOGJPGQRGSTGHUGHVGHWGHXGHYZ[\Z[]Z[^Z[_Z[`Z[aZ[bZ[cZ[dZ[eZ[fZ[gZ[hijkijlijmnopnoqnorstuvwxyz{|}~~                   f e  b \ ^                                                %7       !"##$$%&'()*++,-./01234567889:;<=>??@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^^_`abcdefghijkklhmngopfebc\q^rstuvwxyz{|}~      !"#$%&'()*+,-./00123456789:;<#=>?@ABC D D E F G H I J K L M N O P Q R S T U V W X Y Z [ \!]!^!_!`"a"a"b"c"d"e"f"g"h"i#j#f#h#/#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#|#}$~$$*$+$,$-$6$7$8$9$:$<$#$=$>$?$A$$$$$$$q$$%%%%%%%%%%%%%%%%p%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''(((((((((((((((((((((())))) ) ) ) ) ))))))))))))))))))) )!*"*#*$*%*&*'*(*)***+*,*-*-*.*/*0*0*1*2*3*4*5*4*6*7*8*9*:*;*<*=*>*?*@*A*B*C*D*A*E*F*?*G*H*I*J*K*L*M*N*O*P*Q*R*S*T*U*V*W*X*Y*Z*[*\*]*^*_*`*a*b*c*d*e*f*g*h*i*j*k*l*m*n*o*p*q*r*s*t*u*v*w*x*y*z*{*|*}*~***************+++++++++,,e,,,,,,,,,------m-----------............//////////000e00b0000d00^0t0000g00000000111111111111111111111222222222233333333333333333333333333333 3 3 3 3 3333333333333333333 4!4!4"4#4$4%4&4'4(4)4*4+4,4-5.5.5/505152535455565758595:5;6<6=6>6?6@7A7B777C7D7E7F7G7H7I7J7K7LMNOPQRSTUVWXYZ[\]^_`abc@d8e8e8f8g8h8i8j8k8l8m8n8o8p8q9r9s9t9u9v:w:x:y:z:{:a:|:|:}:~:::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; ; ; ; ; ;;;;;;;;;;;;;;;;;;; ;!;";#;$;%;&;';(;);*;+<,<-<.</<0<0<1<2<3<4<5<6<7<8<9<:<;<<<=<><?<@<A<B<C<D<E<F<G<H<I<J<K<L<M<N<O<P<Q<R<S<T<U<V<W<X<Y=Z=[=\=]=^=_=`=`=a=b=c=d=e=f=g=h=i=j=k=l=m=m=n=o=p=q=r=s=t=u=v=w=x=y=z={=|=}==~====================================>>>>>>>>>>>>>>>>>>>>>>>>>>??@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ @ @ @@@@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@-@.@/@0@1@2@3@3@4@5@6@7@8@9@:@;@<@=@>@?@@@@@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@z@{@|@}@~@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ @ @ @ @ @@@@@@@@@@@@@@@@@@@ @!@"@#@$@%@&@'@(@)@*@+@,@-@.@/@0@1@2@3@4@5@6@7@8@9@:@;@<@=@>@?@@@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@[@\@]@^@_@`@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@sAAtAuAvAwAxAyAzAA AAA A A A{A|A}A~BBBBBBBBB7BB7BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBEBBBBBBBBBBBBBBBBBBBBBBBBBBBFBBBCCCCCCCCDDDDD?D?DDDDDDDDDDDDDDDDDDDD DDD DDDD DDD>DDDDDDDDDDDDDDDDDDDDDDEuEEEE,EEE E EE E E E E EbE E F F FFF F F F F F FF F F F F F F F F F GG G G G G G G !G "G #G $G %G &G 'G (G )G *G *G +G ,G ,G -G .G /G 0G 1G 2G 3G 4G 5G 6G 7G 8G 9G :G ;G ;G <G =G >G ?G @G AG BG CG DGGG EG FG GG HG IG JG KG LG GG MG NGG OGG>G PGG QG RG SG TG UG VG WG XG YG ZG ZG [G \G ]G ^G _G `G `G aGG bGG cG dG eG fG gG hG iG jG kG lG mG nG oG pG qG rG sG tG uG vG wG xG yG zG {G |G }G ~G ~G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G HH H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I I !I "I #I $I %I &I 'I (I )I *J +J ,J -J .J /J 0J 1J 2J 3J 4J 5J 6J 7J 8J 9J :J ;J <J =J >J ?J ?J @J AJ BJ CJ DJ EJ FJ GJ HJ IJ JJ KJ LJ MJ NJ OJ PJ QJ RJ SJ TJ UJ VJ WJ XJ YJ ZJ [J \J ]J ^J _J `J aJ bJ cJ dJ eJ fJ gJ hJ iJ jJ kJ lJ mJ nJ oK pK qK rK sK tK uK vK wK xK yK zK {K |K }K ~K K K K K K K K K K K K K K K K K K K L L L L L L L L LL L L L L L L7L7L L LLL L L L L L L L L L L L L L L L L LL L LL LL L L LLLLLLLLL LLEL L L L L L L LL LLLLLLL LLFL L L L L L L L LLCLDL LL L L L L L L L MM M M M M M M M M M M M M M MBM M M N_N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N N !N "N #N $N %N &N 'N (N )N *N +N ,N -N .N /N 0N 1N 2N 3N 4N 5N 6N 7N 8N 9N :N ;N <N =N >N ?N @N AO BP CP DP EP FP GP HP IP TP TP JP KP LP MP NP OP PP QP GP RP SP TPPPPP VPP EP UP FP GPP VP `P `P WP XP YPP P ZP [P \P ]P ^P _P `P aQ bQ cQ dQ eQ fQ gQ hQ iQ jQ kQ lQ mQQ nQ oQ pQ qQ rQ sQ tQ uQ vQ wQ xQ yQ zQ {Q |Q }Q ~Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q Q QQ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? !? "? #? $? %? &? '? (? )? *? +? ,? -? .? /? 0? 1? 2? 3? 4? 5? 6R 7R 7RRR 8R 9RR :R ;RfR <R =R >R ?R @R AR BR CR DR ES FS FS GS HS IS JS JS KS LS MS NS NS OS PS QS RS RS SS TS US VS WS XSS YS ZS [S \S ]S ^S _S\S `S^S aS bSfSeSS cSS dSbSScS eS fS gS hSS iS jS kS lS mS nS oS pS qS rS sS tS uS vS wS xS yS zS {S |S }S ~S S T T T T T T T T T T T T T T T T T T T T T T T T T T T TIT T T JT T T RT T T T T T cT T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T T U U U U U U U U U U U U U U U U U U U U VU U U U U U U U U U U U U U U U U U U U U U U U U V !V !V?V "V #V $V %V &V 'V (V )V *V +V ,V -V .V /V 0V 1V 2V 3V 4V 5V 6V 7V 8V 9V :V ;V <V =V >V ?V @V AV BV2V CV DV EVV FV0V GV=V HV IV<V JV KV LV YV IV MV NV OV?V PV QV "V RV SV TV TV UV VVVVVV WV WV XV YV ZV [V \V ]V ^V _V _V `V aV bV cV dV eV fV gV hV iV jV4V4V kV lV mV nV oV pV qV rV V sV tV uV vV wV xV yV zV zV {V |V }V ~V KV V V V V V V V V V PV V MV OV V VVV V V VV V V V V EV V V V FV MVV V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V V VVVVVVVVVV V V V V VVVVVVVVVVVVVVVVVVV W!W!W"W#W$W%W&W'W(W)W*W+W,W-W.W/W0W1W2W3W4W5W6W7W8W9W:W;W<W=W>W?W@WAWBWCWDWEWFWGWHWIWJWKWLW WMWNWOWPWQWRW ]WSWTWUWVXX|XWXXX NXYXZX[X\X]X^X_X`XaXbXcX RXdXeXfXgXhXXiX GXjXkXlXmXnXoXpXqX2XrXsXtX CXuXvXwXxXyXzX{X|X}X~XYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[ [ X[ W[ C[[?[ Y[ I[0[[ L[[[K[ [[[[[[e[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[\\\\\\\\ \ \ \ \ \\\\\\\\\\\\\\\\\\\\ \!\"\#\$\%\&\'\(\)\*\+\,\-].]/]0]1]2]3]4]4]^]5]6]7]8]]b]\]9]:];]<]=]>]?^@^^r^^A^^B^C^6_D_E_F_G_H_I_J_K_L_M_N_O_P_Q_R_S_T_U_V_W_X_Y_Z_[_\_]_^___`_a_b_c_d_e_f_f_g_h_i_j_j_k_l_m_n_o_o_p_q_r_s_t_u_v_w_x_y_z_{_|_}_}_~_______________________________________________________________________________________________________________________```aaaaaaaaaaaaaaaaaaaaa a a a a aaaaaaaaaaaaaaaaaaaaaa a!a"a#a$a%a&a'a(a)a*a+a,a-a.a/a0a1a2a3a4a5a6a7a8a9a:a;a<a=a>a?a@aAaBaCaDaEaFaGaHaIaJaKaLaMaNaOaPaQaRaSaTaUaVaWaXaYaZa[a\a]a^a_a`aaabacadaeafagahaibjbkb Xblblbmbmbnbnbobpbqbqbrbsbtbubvbwbxbybzb{b|b}bb~bbbbbbbbbbbbbbbbbbbbbbbccccc Vccccccccccccccccccccccccccdddddddddddddddddbd^dddddddddddddddddddddddddeeeee eeee \e^e\ebee ueeeeeeeeeffffgggggggggggggggggggghhhh>hhhhhhhhh h i i j jjjjjjjjjjjjjjjjkkkl l!l"l#l$m%m&m'm(m)m*m+m,m-m.m/m0m1n2n3n4n5n6n7n8n9n:j;j<k=k>o?o@oAoBoCoDoEoFoGoHoIoJoKoLoMoNoOoPoQoRoSoToUoVoWoXoYoZo[o\o -o]o^o_o_o`oaobococodoeo Kofo No Mo Lo Po Oo Qogo To Tohoiojokolomonooopoooqorosotoqouovowoxoyozo{o|o}o~oooofoo Goooooo poooooooooooo `o `ooooo Wo Xo Yoooooo Eoo Voo Fo Gofoo oooooooooooo oooooooooooooooooooooooooooooo ooooooooooooooooooooooooooooooooooooooooooooo \ooooooooooooooooooooooooooooooooo o o o o oooooooooooooooo [oooo o!o"o#o$o%o&o'o(o)o*o+o _o,o-o.o/o0o1o2o `o3o4o5o6o7o8o9o:o;o<o=o>o?o@oAoBoCoDoEo ^oFoGoHoIoJoKoLoMoNoOoPoQoRoSoToUoVoWoXoYoZo[o\o]o^o_o`oaobocodoepfpgphpipjpkplpmqnqnqoqpqqqrqrqsqtquqvqwqxqyqzq{q|q}q~q~qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqr rrrrrrr r rrrrrrrrrrrr rrrrrrrrrrrrrrrrrrrrrrr r rrsss<sss ssssss,sssssssss1ssssssssssssssssssttttttttttttttttttuuu:u u u u u uuuuuuuuuuuuuuuuuuv v!v v"v#v v$v%v&v'v(v)v)vv*v+v,v-v.v/v0v1v2v3v4v5v6v7v8v9v:v;v<v=v>v?v@vAvBvCvDvEvFvGvHvIvJvKvLvMwNwOwPwQwRwSwSwTwUwVwWwXwYwZw[w\w]w^w_w`wawbwcwdwewfwgxhxixjx Kxfx Nx Lx Qxkx x x Mx Px Oxlx xmxnxox `xpx ax bx cx dx ex gx hx4x4xqxrxsxtxtxuxvxwxxx _x _x ^xyxzx{x|x}x~xxx Txx Txxxxxxnxxxxx px sx rx x zx zx ~x |x }x Cx Xx Sxxxxxxx "x #x $xx %x /x (x )x 'x &x *x +x ,x 0x 6x 1x 2x 9x ?x @x Axxxxxx Bx Hx Cx Ix Ixxx Nx "x Mx Dx Ex Exxxx Px Qxxxxxxx Hxxxxxxx xx Vxxx Hx Lxx x x xx x Ex x x Fx x Mxx x x x xx x x x x x x x xxxxxxxxxxxxxxxxxxxxxxxx x x x xxxxxxx x x xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx@xAxBxCxDxxxxxxxxxTxx<xxxxxxxxxxSxxxxxxxxxxx8xxxxxxNxxxxxxxxxxxxxxxxxx x x x x xxxxxxx xxxxxxxxxxxxx x!x"x#x$x%x&x'x(x)x*x+x,x-x.x/x0x1x2x3x4x5y6y7y8y9y:y;y<y=y>y?y@yAy3yByCyDyEyFyGyHyIyJyKyLyMyNyOyPyQyRySyTyUyVyWzzXzzzzYzYz !zZz z[z\z]z^z_z`zazbzczzdzezzfzzgzhzizjzkzlzmzznzzzozzzzz{p{q{r{s{t{u{v{w{x{^{y{z{{{|{}{~{{{{{{{||||||||||||||||||||| |||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ T~ T~~~~~ H~~~~~~~~~~~~~ D~ E~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~E~ ^~~~ ~ ~ ~ ~ ~~~~~~~~56342 nwxyz    !"  <#$-%%&'() R R*+,- S.4/0}EG1?23 ?A 456l789:;<=>? @ABNCDEF GHI xyW JKLMNNOPQRSTUVWXYZ[\ #]]^_`abcdefghijklmnopqrstuvwxyz{|}~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCCUCVCWCXCYCZC[C\C]C^C_C_C`CaCbCbCcCdCeCfCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCC]CCCCCCCCCCCCCCCCCCCCCC %CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C C CCCCCCCC HCCC WC0C XC ICCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCHCICJCJCKCLCMCNCOCPCPCQCRCSCTCUCUC1CVCWCXCYC CCCZC[C\C]C^C_C`CaC CbCcCdCeCfCfCgChCiCjCkClCmCnCnCoCpCqCrCCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC MCCCCCCCCCCCCCCCCCCCCCCCCCCC MCCCCCCCCCCC4CCCCCCCCCCCCCCCC.CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC/CCCCCCCCCCCCC C C C C C CCCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C)C*C+C,C-C.C/C0C1C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@C~CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCbCCCCCCCCCCCCCCCCC CCCCC C C C C CCCCCCCCCCCCCCCCCCC C!C"C#C$C%C&C'C(C)C*C+C,C-C.C/C0C1C)C2C3C4C5C6C7C8C9C:C;C<C=C>C?C@CACBCCCDCECFCGCHCICJCKCLCMCNCOCPCQCRCSCTCUCVCWCXCYCZC[C\C]C^C_C`CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCCsCtCuCvCwCxCyCzC{C|C}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC aCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCGCCCCCCCCCCCCCCCCCCCCCCCCCC      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~        !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Dx{@      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyzYQ{|}~TI      !"#$%&'()*+,-./0123456789:;<=>>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqqrstuvwxyz{|}~G     M !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJTKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~w@TF      #                      ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; <e = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~         !!!!!!!!!! ! ! ! ! !!!!!!!!!!!!!!!!!!!! !!!"!#!$!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3!4!5!6!7!8!9!:!;!<!=!>!?#!@!A!B!C!D!E!F!G!H!I!J!K!L!M!N!O!P!Q!R!S!T!U!V!W!X!Y!Z![!\!]!^!_!`!a!b!c!d!e!e!f!g!h!i!j!k!l!m!n!o!p!q!r!s!t!u!v!w!x!y!z!{!|!}!~!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!a!b!!!!!#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"""""""""" " " " " """"""""""""""?""""" "!"""#"$"%"&"'"(")"*"+","-"."/"0"1"2"3"4"5"6"7"8"8"9":";"<"=">"?"@"A"B"C"D"E"F"G"H"I"J"K"L"M"M"N"O"P"Q"R"S"T"U"V"W"X"Y"Z"["\"\"]"^"_"`"a"`"b"c"d"e"f"g"h"i"j"k"l"m"m"n"o"p"q"r"s"t"u"v"w"xV"y"z"{"|"}"~""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""#"""""" '""""""""""""""""""""""""""""""""""""""""""###  ###### ;## # # # # #################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#D#E#F#G#H#I#J#K#L#M#N#O#P#Q#R#S#T#U#V#W#X#Y#Z#[#\#]#^#_#`E#a#b#c#d#e#f#g#h#i#j#k#l#m#n#o#p#q#r#s#t#u#v#w#x#y#z#{#| N N #}#~###################### R############################### ###"### } ~ ################################## #######################################$$$$$$$$$$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$'$($)$*$+$,$-$.$/$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q$Q$R$S$T$U$V$W  $X$Y$Z$[$\$]$^$_$`$a$b$c$d$e$f$g$h$i$j$k$l$m#$n$o$p$q$r$s$t$u$v$w$x$y$z${A?$|$}$~$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$f$%%%%%%%%%% % % % % %%%%%%%%%%%%%%%%%%% %!%"%#%$%%%&%'%(%)%*%+%,%-%.%/%0%1%2%3%4 %5%6%7%8%9%9%:%;%<%=%>%?%@%A%B%C%D%E%F%G%H%I%J%K%L%M%N%O%P%Q%R%S%T%U%V%W%X%Y%Z%[%\%]%^%_%`%a%b%c%d%e%f%g%h%h%i%j%k%l%m%n""%o%p%q%q%r%s%t%t%u%v%w%x%y%z%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&& & & & & &&&&&&&&&&&&&&&&&&& &!&"&#&$&%&&&'&(&)&*&+&,&-&.&/&0&1&2&3&4&5&6&7&8&9&:&;&<&=&>&?&@&A&B&C&D&E&F&G&G&H&I&J&K&L&M&N&O&P&Q&R&S&T&U&V&W &X&Y&Z&[&\&]&^&_&`&a&b&c&d&e&f&g&h&i&j&k&l&m&n&o&p&q&r&s&t&u&v&w&x&y&z&{&|&}&~&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''' ' ' ' ' ''''''''''''''''''' '!'"'#'$'%'&'''(')'*'+','-'.'/'0'1'2'3'4'5'6'7'8'9':';'<'='>'?'@'A'B'C'D'E'F'G'H'I'J'K'L'M'N'O'P'Q'R'S'T'U'V'W'X'Y'Z'['\']'^'_'`'a'b'c'd'e'f'g'h'i'j'k'l'm'n'o'p'q'r's't'u 'v 'w 'x 'y 'z '{ '| '} '~ ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ! ! ' ' '  ' ' ! ! ' ! ' ' ' ' ! ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '  ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ( ( ( 8 ( ( ( ( ( ( (  (  (  (  (  ( ( ( ( ( ( ( ((((((((?(((( (!("(#($(%(&('(('()&e(*(+(,(-(.(/(0(1(2(3(4(5(6(7(8(9(:(;(<(=(>(?(@J(A(A(B(C(D(E(F (G(H(I(J(K(L(M(N(O(P(Q(R(S(T(U(V(W(X(Y(Z([(\(](^(_(`(a(b(c(d(e(f(g(h(h(i(j(k(l(m(n(o(p(q(r(s(t(t(u#(v(w(x(y(z({(|(}(~((((((((((((((((((((((((((((((((((((((((((((((((((((((( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())) )  )))))) ) ) ) ) )) ))))))))))))))))) )!)")#)$)%)&)')(#|)))*)+),)-).)/)0)1)2)30)4)4 ()5)5)6)7)8)9):);)<)=)>)?)@s)A)B)C)D)E)F)G)H)I)J)K)L)M)N)N)O)P)Q)R)S)T)U)V)W)X)Y)Z)[)\)])^)_)`)a)b)c)d)e)f)g)h)i)j)k)l)m)n)o)p)q)r)s((")t)u)v)v)w)x)y)z){)|)})~))))E)))))))))))))))))))))()))))))))8)))))))))))))))))))))))))))))))))%v))))))))))))))))))))))))))) )))))))) ))))))))))))))))))))))))))))))********** * * * * )*****)**** )))))********** *!*"*#*$*%*#*$*&*'G*(*)G*(***#*$*+G*(*,G*(*-GH*.GH*/GH$X b*0!G*1*2GH*3G$'*4*5*6*4*7A*4*7*8*4*7*4*7e*4*7B*4*7*9*4*7-*4*7u*4*7*:*4*7*;*4*7*4*7*4*7 `*4*7\*4*7*<*4*7*=*4*7*4*5c*4*5b*4*5*>*4*5^*4*5m*4*5h*4*5g*4*5*?*4*5*4*5r*4*5`*4*5*@*4*5*A*4*5*B*4*5*C*4*5*D*4*5*4*5f*4*5s*4*5a*4*5d*4*5nG*EG*F*G*HG*I*JG*K*LG*K*MG*K*NG*K*OG*K*PG*K*QG*I*RG*I*SG*I*TG!*G*UG!-G!*VG!"G!,G!+G!*WG!*XG!*Y*Z*[*V*Z*[$X*Z*[*.*Z*[*/*Z*["*Z*[*X*Z*[*Y*Z*[*W%*\%*]%%*^%*_%*`%#%'%*a*#*$*b*#*c*d''*e'*fG*g*hG*g*i*j*k!*j*k!*j*k*l*j*k*m*j*k*n*j*k)*j*k*o*j*k*p*j*k(*j*k'*j*k&*j*k!*j*k%*j*k!*j*k!*j*k!*j*k+*j*k**j*k!*j*k!*j*k!*j*k*q*j*k*r*j*k*s*j*k*t*j*k*u*j*k*v*j*k$S*j*k*w*j*k*x*j*k*y*j*k*z*j*k*{*j*k*|*j*k!*j*k*}*j*k!*j*k!*j*k*~*j*ku*j*k**j*k**j*k**j*k,*j*k*j***j***j***j***j***j***j***j***j*#*j***j***j***j**)*)**#*$**j*kf)*)*))*)*)*)*)*)*)*)*^)*)*)*)*0*G*U*G*U**#*c*G***#*c*GH*G***#*c*G**6*6*6*6 C6*6*6*6*6*6*6*6*^6*G*F*6*6*6*6*6*6*6*6*6*6*6 C6*7*7*G*U*8*******8*=*^=*>*>*>*>*>*>*>*O*O*O*O*O**#*c*Z*SjS*S*S*Z*BG**S*G**G**G***#*c*G**GHuG$*[*GHGH*G*U************b*b*b*G**b*b*c*c*c*c*GH*e*e*e*h*h*hlhh*i*i*i*i*i+i+i+i+i+m+m+G++m+ m+ m+ m+ m+ m+ m+m+m+m+m+m+n+n+n+n n+n+n#2n+n+n+n+n+n+n+n+n+ n+!n+"n+#n+#n+$n+%n+&n+'n+(n+)n=n Xn+*n++n++j+,j+-j+.j+/j+0k+1r+2r+3r$r$rr+4r+5rbrdr+6r+7r+7r+8}+9}+:}}+;}+9}+<~+=~+>~+?~+@~+A~+B~+C~+D~+E~+F~+G~+H~+I~+J~+K~+L~+M~+N~+O~+P~+Q~+R~+S~+T~+U~+V~+W~+X~+Y~+Z~+[~+\~+]~+^~+_~+`~M~+a~+b~+c~+d~+e~+f~+g~+h~+i~+j~+k~+?~+l~+m~~+n~+o~+p~+I+q+r+s*}+t+u+v+w+3$$+4+5bd+xen+y+y;J;+z;+{;+|;+};+~;+;+++++++++++++++++++++++++++++++++++++++++"+++++++++++++++++++++++++++++++?D+++++++++++++++++++++++++++++$Q$Q+++++++++G+++++++++++++++++++++++++++,,+2+Z,\,,,,,,,, , , *, , , ,,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),),*,+,,,-,.,/,0,1-^,2,3,4,5,6,7,8,9,:,;,<,=,>,?,@,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,Xo,Y,Z,[,\,],^,_,`,a,b,c,d,e,f,g,h,i,j ,k,l,m,n,o#c,p,q,r,s,t,t,u,v,w,x#,y ,z,{,|,},~,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,&+,,,,,,,,,,,,,,GH,,,,,,,,,,,,,,,,,,,,,,,,!Y,,,,,,,,%,,,,,,,d,,,,,,)),,) ,,,,,,,),,,,,,,,,, ,,,,,, , , , , , , , , , , , , , ,  , , , ,  , , , - - - - - - - - ' ' - -  -  -  -  -  - - - - - - - - - - - - - - - '~ -  ] - ' - -  -! -! -" -# -$ -% -% -& ' ' -' ' ' -( -) -* -+ -, ' -- -.-/-0-1-2-3-4-5-6-7-8-9-:-;-<+-=->-?-@-A-B)I-C-Dm-E-F-G-H-I-J-K-L-M-N-O-P-Q-R-S-T-U-V-W-X-Y-Z-[-\-]-^-_-`-? b b,-a-b-b-8-c-d-e-en-f-gn-h QG-i-jG-k-l-m-n-o-p-q!Agda-2.5.3-7LzUTyWQOJsDWpvzgqsgqMAgda.Utils.MonadAgda.Interaction.OptionsAgda.Utils.FunctorAgda.Utils.VarSetAgda.Utils.ExceptAgda.Compiler.BackendAgda.Interaction.Library.BaseAgda.Termination.CutOffAgda.Termination.SemiringAgda.Utils.BiMapAgda.Utils.CharAgda.Utils.ClusterAgda.Utils.EitherAgda.Utils.EnvironmentAgda.Utils.Function"Agda.TypeChecking.SizedTypes.UtilsAgda.Utils.Haskell.Syntax Agda.Utils.IOAgda.Utils.IO.BinaryAgda.Utils.IO.UTF8Agda.Utils.IORefAgda.Utils.ImpossibleAgda.Utils.EmptyAgda.Utils.BagAgda.ImpossibleTestAgda.Auto.NarrowingSearchAgda.Utils.LensAgda.Utils.IndexedListAgda.Auto.OptionsAgda.Utils.Lens.ExamplesAgda.Utils.MaybeAgda.Utils.ListTAgda.Utils.MemoAgda.Utils.MonoidAgda.Utils.NullAgda.Utils.Maybe.StrictAgda.Utils.Parser.ReadPAgda.Utils.PartialOrdAgda.Utils.PointerAgda.Utils.PrettyAgda.Utils.Parser.MemoisedCPS#Agda.TypeChecking.SizedTypes.SyntaxAgda.Utils.SemiRingAgda.Utils.SingletonAgda.Utils.SizeAgda.Utils.SuffixAgda.Utils.ThreeAgda.Utils.TrieAgda.Utils.TupleAgda.Utils.MapAgda.Utils.ListAgda.Utils.StringAgda.Utils.TimeAgda.Interaction.Library.ParseAgda.Interaction.EmacsCommandAgda.Utils.FileNameAgda.Utils.HashAgda.Utils.BenchmarkAgda.Syntax.PositionAgda.Utils.PermutationAgda.Syntax.Parser.MonadAgda.Syntax.Parser.LiterateAgda.Syntax.FixityAgda.Syntax.Common+Agda.Syntax.Concrete.Operators.Parser.MonadAgda.Syntax.Concrete.NameAgda.TypeChecking.Monad.BaseAgda.Compiler.JS.SyntaxAgda.Compiler.JS.SubstitutionAgda.Compiler.JS.PrettyAgda.Auto.SyntaxAgda.Auto.SearchControlAgda.Auto.TypecheckAgda.Auto.CaseSplitAgda.Syntax.NotationAgda.Syntax.Abstract.NameAgda.Syntax.LiteralAgda.Syntax.TreelessAgda.Compiler.Treeless.PrettyAgda.Syntax.ReflectedAgda.Syntax.Parser.Tokens#Agda.Interaction.Highlighting.Range,Agda.Utils.Graph.AdjacencyMap.Unidirectional+Agda.TypeChecking.SizedTypes.WarshallSolver'Agda.TypeChecking.Positivity.OccurrenceAgda.Syntax.ConcreteAgda.Syntax.Concrete.PrettyAgda.Benchmarking%Agda.Syntax.Concrete.Operators.ParserAgda.Syntax.Concrete.Generic%Agda.Interaction.Highlighting.PreciseAgda.Interaction.ResponseAgda.Utils.FavoritesAgda.Utils.AssocListAgda.Syntax.Scope.BaseAgda.Utils.GeniplateAgda.Syntax.InfoAgda.Termination.SparseMatrixAgda.Termination.OrderAgda.Termination.CallMatrixAgda.Termination.CallGraphAgda.Termination.TerminationAgda.Syntax.Parser.AlexAgda.Syntax.Parser.LookAhead!Agda.Syntax.Parser.StringLiteralsAgda.Syntax.Parser.LexActionsAgda.Syntax.Parser.LayoutAgda.Syntax.Parser.CommentsAgda.Syntax.Parser.LexerAgda.Syntax.Parser.ParserAgda.Syntax.Internal%Agda.TypeChecking.Substitute.DeBruijnAgda.TypeChecking.Free.LazyAgda.TypeChecking.Free"Agda.TypeChecking.Substitute.Class$Agda.TypeChecking.Coverage.SplitTreeAgda.Syntax.Internal.Generic Agda.TypeChecking.CompiledClauseAgda.Syntax.Internal.DefsAgda.Syntax.AbstractAgda.Syntax.Internal.PatternAgda.Syntax.Abstract.ViewsAgda.Syntax.Abstract.PatternAgda.Utils.TypeLevelAgda.Utils.Update Agda.Syntax.Concrete.DefinitionsAgda.Syntax.ParserAgda.TypeChecking.Free.OldAgda.Utils.Warshall Agda.VersionAgda.VersionCommitAgda.Interaction.LibraryAgda.Utils.IO.DirectoryAgda.TypeChecking.SubstituteAgda.TypeChecking.TelescopeAgda.Compiler.Treeless.Subst$Agda.Compiler.Treeless.GuardsToPrimsAgda.Compiler.Treeless.CompareAgda.Compiler.Treeless.Uncase!Agda.Compiler.Treeless.AsPatterns Agda.TypeChecking.Serialise.BaseAgda.TypeChecking.Rules.TermAgda.TypeChecking.RewritingAgda.TypeChecking.Reduce.Fast Agda.TypeChecking.ProjectionLikeAgda.TypeChecking.PrettyAgda.TypeChecking.Polarity!Agda.TypeChecking.Monad.SignatureAgda.TypeChecking.Monad.OptionsAgda.TypeChecking.Monad.ImportsAgda.TypeChecking.Monad.EnvAgda.TypeChecking.Monad.DebugAgda.TypeChecking.Monad.ContextAgda.TypeChecking.Monad.OpenAgda.TypeChecking.Monad.BuiltinAgda.TypeChecking.MetaVars"Agda.TypeChecking.LevelConstraintsAgda.TypeChecking.ErrorsAgda.TypeChecking.WarningsAgda.TypeChecking.Monad.StateAgda.TypeChecking.Monad.Mutual!Agda.TypeChecking.Monad.BenchmarkAgda.TypeChecking.Constraints&Agda.TypeChecking.CompiledClause.Match(Agda.TypeChecking.CompiledClause.CompileAgda.TypeChecking.CheckInternalAgda.Syntax.Internal.NamesAgda.Interaction.InteractionTopAgda.Interaction.Imports&Agda.Interaction.Highlighting.GenerateAgda.Interaction.FindFileAgda.Interaction.Options.LensesAgda.TypeChecking.Monad.Trace,Agda.TypeChecking.Serialise.Instances.Common2Agda.TypeChecking.Serialise.Instances.Highlighting"Agda.TypeChecking.Monad.Statistics"Agda.TypeChecking.Monad.SizedTypesAgda.TypeChecking.Monad.SharingAgda.TypeChecking.Monad.Caching*Agda.Syntax.Translation.AbstractToConcreteAgda.Syntax.Scope.MonadAgda.TypeChecking.Monad.LocalAgda.TypeChecking.DatatypesAgda.TypeChecking.Monad.Closure Agda.TypeChecking.Monad.MetaVars#Agda.TypeChecking.Monad.Constraints/Agda.TypeChecking.Serialise.Instances.Compilers.Agda.TypeChecking.Serialise.Instances.Internal.Agda.TypeChecking.Serialise.Instances.Abstract,Agda.TypeChecking.Serialise.Instances.Errors%Agda.TypeChecking.Serialise.InstancesAgda.TypeChecking.SerialiseAgda.TypeChecking.Rules.DefAgda.TypeChecking.Rules.Decl+Agda.TypeChecking.Rules.Builtin.CoinductionAgda.TypeChecking.Reduce.MonadAgda.TypeChecking.Records Agda.TypeChecking.Patterns.Match#Agda.TypeChecking.Patterns.Abstract"Agda.TypeChecking.MetaVars.MentionAgda.TypeChecking.IrrelevanceAgda.TypeChecking.EtaContractAgda.TypeChecking.Reduce#Agda.TypeChecking.SyntacticEqualityAgda.TypeChecking.LevelAgda.TypeChecking.EmptyAgda.TypeChecking.DropArgsAgda.TypeChecking.DisplayFormAgda.TypeChecking.ConversionAgda.Termination.RecCheck Agda.Syntax.Internal.SanityCheckAgda.Syntax.Abstract.Pretty*Agda.Syntax.Translation.InternalToAbstractAgda.Interaction.Monad!Agda.Interaction.Highlighting.Vim#Agda.Interaction.Highlighting.EmacsAgda.Compiler.Treeless.Unused%Agda.Compiler.Treeless.NormalizeNamesAgda.Compiler.Treeless.IdentityAgda.Compiler.Treeless.BuiltinAgda.Compiler.MAlonzo.CompilerAgda.Compiler.CallCompilerAgda.TypeChecking.DeadCode+Agda.Syntax.Translation.ReflectedToAbstractAgda.TypeChecking.SizedTypes#Agda.TypeChecking.Rules.LHS.Problem'Agda.TypeChecking.Rules.LHS.InstantiateAgda.TypeChecking.Rules.Display'Agda.TypeChecking.Rewriting.NonLinMatch Agda.TypeChecking.Coverage.MatchAgda.TypeChecking.QuoteAgda.TypeChecking.Implicit$Agda.TypeChecking.Rules.LHS.Implicit'Agda.TypeChecking.Rules.LHS.ProblemRestAgda.TypeChecking.Functions&Agda.TypeChecking.Rules.LHS.AsPatterns Agda.TypeChecking.RecordPatternsAgda.TypeChecking.PositivityAgda.TypeChecking.PrimitiveAgda.Compiler.Treeless.Simplify/Agda.Compiler.Treeless.EliminateLiteralPatterns(Agda.Compiler.Treeless.EliminateDefaults#Agda.TypeChecking.InstanceArguments!Agda.TypeChecking.MetaVars.OccursAgda.TypeChecking.InjectivityAgda.TypeChecking.Unquote"Agda.TypeChecking.SizedTypes.Solve!Agda.TypeChecking.Rules.LHS.UnifyAgda.TypeChecking.Coverage!Agda.TypeChecking.Rules.LHS.SplitAgda.TypeChecking.ForcingAgda.TypeChecking.Rules.DataAgda.TypeChecking.Rules.LHSAgda.TypeChecking.Rules.BuiltinAgda.TypeChecking.Rules.Record'Agda.TypeChecking.ReconstructParametersAgda.TypeChecking.AbstractAgda.TypeChecking.WithAgda.Termination.MonadAgda.Termination.InliningAgda.Termination.TermCheckAgda.Compiler.Treeless.EraseAgda.Compiler.ToTreelessAgda.Syntax.Abstract.CopatternsAgda.Syntax.Concrete.OperatorsAgda.Syntax.IdiomBrackets*Agda.Syntax.Translation.ConcreteToAbstractAgda.Interaction.BasicOpsAgda.Interaction.SearchAboutAgda.Interaction.CommandLineAgda.Interaction.MakeCaseAgda.Auto.ConvertAgda.Auto.Auto!Agda.Interaction.Highlighting.DotAgda.Compiler.CommonAgda.Compiler.MAlonzo.PragmasAgda.Compiler.MAlonzo.MiscAgda.Compiler.MAlonzo.EncodeAgda.Compiler.MAlonzo.Pretty Agda.Compiler.MAlonzo.Primitives"Agda.Compiler.MAlonzo.HaskellTypes#Agda.Interaction.Highlighting.LaTeX"Agda.Interaction.Highlighting.HTMLAgda.Interaction.EmacsTopAgda.Compiler.JS.Compiler Agda.MainDataChar Data.Maybe fromMaybe fromMaybeMData.TraversableforAgda.Utils.HashMap TraversableforM_Lazy listToMaybe maybeToList catMaybesmapMaybeforMifNullAgda.TypeChecking.SubstitutionliftSAgda.Syntax.Internal.Patterns numberPatVarsLHSData.MapmapKeysMonotonicQName whyInScopeTreefoldTerm Paths_AgdaAbstractSyntax AtTopLevelinteractionLoop localStateAgda.TypeChecking.MonadAgda.TypeChecking.Testsprop_splitTelescopesimplifyLevelConstraint getConTypeAgda.TheTypeCheckerbaseGHC.Base<*>System.Console.GetOptOptionOptDescrOptArgReqArgNoArgArgDescr Control.Monadunless Data.Functor<$>when<$mplusmzero MonadPluscontainers-0.5.10.2Data.IntSet.InternalfromList toDescListtoList isSubsetOf intersection differenceunionunionsdelete singletonemptymembernull mtl-2.2.1-19EL8AGBsN3DnnOhrC9xY3Control.Monad.Error.Class catchError throwError MonadErrortransformers-0.5.2.0Control.Monad.Trans.ExceptExceptT runExceptT mapExceptTBackend AgdaLibFileAgdaLiblibNamelibFile libIncludes libDependsLibNamelibNameForCurrentDir emptyLibFile$fShowAgdaLibFileCutOff DontCutOff $fShowCutOff $fEqCutOff $fOrdCutOffSemiringaddmulzeroHasZero zeroElementintegerSemiring intSemiring boolSemiring $fHasZeroInt$fHasZeroIntegerBiMap biMapThere biMapBacklookup invLookupinsert $fShowBiMap $fOrdBiMap $fEqBiMap UnicodeTest IsControlIsSpaceIsLowerIsUpperIsAlpha IsAlphaNumIsPrintIsDigit IsOctDigit IsHexDigitIsLetterIsMarkIsNumber IsPunctuationIsSymbol IsSeparatordecDigithexDigitoctDigit unicodeTeststestChar$fEqUnicodeTest$fOrdUnicodeTest$fShowUnicodeTestCclustercluster' whileLeft caseEitherM mapEithermapLeftmapRighttraverseEitherisRightisLeftfromLeft fromRight fromLeftM fromRightM maybeLeft maybeRightallLeftallRight maybeToEitherexpandEnvironmentVariables $fEqToken $fShowTokenErrornoMsgstrMsg mkExceptT $fError[] iterWhile repeatWhile repeatWhileMtrampolineWhiletrampolineWhileM trampoline trampolineM iterateUntil iterateUntilMiterate' applyWhen applyUnless applyWhenM applyUnlessMDioidcompose unitComposeMeetSemiLatticemeetPlusplusToptopisTopdebug setDebuggingtracetraceM$fPlusIntIntInt Decoration traverseF distributeF$><.><&>dmapdget$fDecoration(,)$fDecorationCompose$fDecorationIdentity TyVarBind UnkindedVarQOpQVarOpNameIdentSymbolQualUnQual ModuleNameLiteralIntFracStringAltExpVarConLitInfixAppAppLambdaLetIfCase ExpTypeSigNegAppFakeExpStmt Qualifier GeneratorPatPVarPLitPAsPat PWildCardPBangPatPApp PatTypeSigPIrrPatTypeTyForallTyFunTyConTyVarTyAppFakeTypeMatch GuardedRhsRhs UnGuardedRhs GuardedRhssBindsBDeclsDerivingConDecl DataOrNewDataTypeNewTypeDeclTypeDeclDataDeclTypeSigFunBindPatSynFakeDecl ImportSpecIVar ImportDecl importModuleimportQualified importSpecs ModulePragmaLanguagePragma OtherPragmaModuleunit_con $fEqDataOrNew $fEqLiteral$fEqModuleName$fOrdModuleName$fEqName $fEqQName$fEqQOp $fEqTyVarBind$fEqType$fEqPat $fEqConDecl$fEqDecl $fEqMatch$fEqRhs$fEqExp$fEqAlt $fEqBinds$fEqGuardedRhs$fEqStmtCatchIOcatchIO$fCatchIOWriterT $fCatchIOIOreadBinaryFile' readTextFilehPutStr writeFilewriteTextToFilereadModifyIORef' Impossible UnreachablethrowImpossiblecatchImpossible$fExceptionImpossible$fShowImpossibleEmptyabsurd toImpossible $fShowEmpty $fOrdEmpty $fEqEmpty $fDataEmptyBagbagsize! notMembercountgroupskeyselems toAscListmap traverse' $fFoldableBag $fMonoidBag$fSemigroupBag $fShowBag$fEqBag$fOrdBagimpossibleTestChoice LeftDisjunct RightDisjunctSRes HandleSolQPB QPBlockedQPDoubleBlockedPBNotPBPBlockedPDoubleBlockedMBNotBBlockedFailedMetaEnvMMNotMMetaBlkInfo Refinable refinementsMove'MovemoveCostmoveNextCostgetCost RefCreateEnvrunRefCreateEnvUndoRestorePrioMetaNoPrioSubConstraintsscflip sccomcountscsub1scsub2CTree ctpriometactsubctparent cthandlesMetavarmbindmprincipalpresentmobs mcompoint mextrarefsOKMetaOKHandleOKValPropOK AddExtraRefAnd SideconditionOr ConnectHandleTermTravtravPriogetPrio hequalMetavarnewMetainitMetanewCTreenewSubConstraints ureadIORef uwriteIORef umodifyIORefureadmodifyIORefrunUndonewPlaceholder newOKHandledryInstantiatermmmcasemmmcasemmpcase doubleblockmbcasembpcasemmbpcasewaitokmbretmbfailedmpret expandbind topSearchextractblkinfosrecalcsseqcrecalcreccalccalcchoosePrioMeta propagatePriochoose$fRefinableOKValblk$fMonadRefCreateEnv$fApplicativeRefCreateEnv$fFunctorRefCreateEnv $fEqPrioMeta $fEqMetavar $fTravMMblk$fRefinableChoiceblk$fEqPrio $fOrdPrio $fNumPrio $fNumCost$fEqCost $fOrdCostLens'lFstlSnd^.setoveruse.=%=%==%%=viewlocallykeyIndexZeroSucAllNilConsSomewithSomemakeAll forgetAll forgetIndex mapWithIndexlIndex lookupIndex allIndices AutoTokenMRDLTSH AutoOptions autoHints autoTimeOutautoPickautoMode autoHintModeTimeOut getTimeOutHints AutoHintModeAHMNone AHMModuleModeMNormal MCaseSplitMRefineinitAutoOptionsaoHints aoTimeOutaoPickaoMode aoHintMode autoTokens parseArgs $fShowTimeOutRecordfield1field2 lensField1 lensField2 boolToMaybeunionMaybeWith unzipMaybe filterMaybeforMaybe caseMaybeifJustmaybeM caseMaybeMifJustMwhenJust whenNothing whenJustM whenNothingMallJustMListTrunListTnilListT consListTsgListT caseListT foldListT concatListT runMListT consMListTsgMListT mapMListT mapMListT_alt liftListT$fMonadStatesListT$fMonadReaderrListT$fMonadIOListT$fMonadTransListT $fMonadListT$fApplicativeListT$fMonadPlusListT$fAlternativeListT $fMonoidListT$fSemigroupListT$fFunctorListTmemomemoRec memoUnsafe memoUnsafeHMaxNat getMaxNat$fMonoidMaxNat$fSemigroupMaxNat $fNumMaxNat $fEqMaxNat $fOrdMaxNat $fShowMaxNat $fEnumMaxNatNullifNullMwhenNull unlessNull whenNullM unlessNullM $fNullDoc $fNullMaybe $fNullSet $fNullSeq $fNullHashSet $fNullHashMap $fNullMap $fNullIntSet $fNullIntMap $fNullBag$fNull[]$fNullByteString $fNull(,)$fNull()toStricttoLazy $fBinaryMaybe $fNFDataMaybe$fTraversableMaybe$fFoldableMaybe $fMonoidMaybe$fSemigroupMaybe$fGenericMaybe $fDataMaybeReadPparsegetlookpfail+++<++gathersatisfycharstringmunchmunch1choice skipSpacesbetweenoptionoptionalmanymany1skipMany skipMany1sepBysepBy1endByendBy1chainrchainlchainr1chainl1manyTillparse' $fMonadPlusP$fAlternativeP$fMonadP$fApplicativeP$fMonadPlusReadP$fAlternativeReadP $fMonadReadP$fApplicativeReadP$fFunctorReadP $fFunctorP Inclusion inclusion Pointwise pointwise PartialOrd comparable ComparablePartialOrderingPOLTPOLEPOEQPOGEPOGTPOAnyleqPOoppPOorPOseqPO fromOrdering fromOrderings toOrderings comparableOrdrelated$fMonoidPartialOrdering$fSemigroupPartialOrdering$fPartialOrdPartialOrdering$fPartialOrd(,)$fPartialOrdEither$fPartialOrdMaybe$fPartialOrd()$fPartialOrdInteger$fPartialOrdInt$fPartialOrdPointwise$fPartialOrdInclusion$fPartialOrdInclusion0$fEqPartialOrdering$fShowPartialOrdering$fEnumPartialOrdering$fBoundedPartialOrdering $fEqPointwise$fShowPointwise$fFunctorPointwise $fEqInclusion$fOrdInclusion$fShowInclusion$fFunctorInclusionPtrnewPtrderefPtr updatePtrsetPtr updatePtrM $fDataIORef $fNFDataPtr $fHashablePtr$fOrdPtr$fEqPtr$fTraversablePtr $fFoldablePtr $fFunctorPtr $fShowPtr $fDataPtrPrettypretty prettyPrec prettyList prettyShowpwordsfwords prettyList_mparensalign multiLineTextpshow $fDataDoc $fPretty[] $fPrettyMaybe $fPrettyDoc $fPrettyChar$fPrettyInteger $fPrettyInt32 $fPrettyInt $fPrettyBoolDocPParserWithGrammar ParserClassgrammarsat'annotatememoisememoiseIfPrintingParserdocsattokentokbindPchoicePseqPstarPatomP$fAlternativeParser$fApplicativeParser$fFunctorParser $fMonadParser$fParserClassParserkrtok#$fParserClassParserWithGrammarkrtok$fAlternativeParserWithGrammar$fApplicativeParserWithGrammar$fFunctorParserWithGrammar$fMonadParserWithGrammarFlexsflexsRigidsrigidsTruncateOffsettruncateOffset ValidOffset validOffsetCTrans SubstitutesubstSolution theSolution PolaritiesPolarityAssignmentPolarityLeastGreatest Constraint Constraint'leftExprcmp rightExprCmpLtLeSizeExpr SizeExpr'ConstRigidInftyFlexoffsetrigidflexFlexIdflexIdRigidIdrigidIdOffsetOemptyPolaritiespolaritiesFromAssignments getPolarity emptySolution simplify1ifLe compareOffset$fPlusOffsetOffsetOffset$fMeetSemiLatticeOffset$fPrettyOffset $fShowOffset $fPrettyRigid $fShowRigid $fPrettyFlex $fShowFlex$fPrettySizeExpr'$fPlusSizeExpr'OffsetSizeExpr' $fPrettyCmp$fTopCmp$fMeetSemiLatticeCmp$fOrdCmp $fDioidCmp$fPrettyConstraint'$fPrettyPolarity$fPrettyPolarityAssignment$fPrettySolution$fSubstituterfSolution$fSubstituterfMap$fSubstituterf[]$fSubstituterfConstraint'$fSubstituterfSizeExpr'$fValidOffsetSizeExpr'$fValidOffsetOffset$fTruncateOffsetSizeExpr'$fTruncateOffsetOffset$fRigidsrConstraint'$fRigidsrSizeExpr' $fRigidsr[]$fFlexsflexConstraint'$fFlexsflexSizeExpr' $fFlexsflex[] $fEqOffset $fOrdOffset $fNumOffset $fEnumOffset $fEqRigid $fOrdRigid$fEqFlex $fOrdFlex$fShowSizeExpr' $fEqSizeExpr'$fOrdSizeExpr'$fFunctorSizeExpr'$fFoldableSizeExpr'$fTraversableSizeExpr' $fShowCmp$fEqCmp $fBoundedCmp $fEnumCmp$fShowConstraint'$fFunctorConstraint'$fFoldableConstraint'$fTraversableConstraint' $fEqPolarity $fOrdPolarity$fShowSolution$fNullSolution StarSemiRingostarSemiRingozeroooneoplusotimes$fSemiRingMaybe$fStarSemiRingMaybe Singleton$fSingleton(,)HashMap$fSingletonaHashSet$fSingleton(,)IntMap$fSingleton(,)Map$fSingletonIntIntSet$fSingletonaSet$fSingletonaSeq$fSingletona[]$fSingletonaMaybe SizedThingtheSize sizedThingSized sizeThing $fSizedSeq$fSizedHashSet$fSizedHashMap $fSizedSet $fSizedMap $fSizedIntSet $fSizedIntMap $fSized[]$fNullSizedThing$fSizedSizedThingSuffixNoSuffixPrime SubscriptisSubscriptDigittoSubscriptDigitfromSubscriptDigit nextSuffix suffixView addSuffix nameVariantThreeOneTwo partition3 $fEqThree $fOrdThree $fShowThree$fBoundedThree $fEnumThreeTrie everyPrefix unionWith insertWithadjusttoListOrderedBy mapSubTries lookupPath lookupTriefilter $fNullTrie $fShowTrie$fEqTrie $fFunctorTrie$fFoldableTrieList2list2-*-mapFstmapSnd/\swapfst3snd3thd3uncurry3uncurry4mapPairMmapFstMmapSndM$fApplicativeList2 $fEqList2$fFunctorList2$fFoldableList2$fTraversableList2 EitherOrBothB unionWithMinsertWithKeyM allWithKey filterKeysunzipunzip3 PreOrSuffixIsPrefixIsSuffix IsBothfixIsNofixPrefixcaseListlistCase headMaybeheadWithDefault lastMaybelast2unconsmconsinitLast!!!downFrom updateHead updateLastupdateAtdeal takeWhileJustspanJustpartitionMaybe filterAndRestmapMaybeAndRest dropCommon isSublistOf stripPrefixBy preOrSuffixwordsBychopchopWhenholessorteddistinct fastDistinctallEqual duplicatesgroupBy'groupOnsplitExactlyAtgenericElemIndexzipWith'nubOnuniqOn commonSuffix commonPrefixeditDistanceSpec editDistanceStrunStrquote delimiter showIndexaddFinalNewLineindentshowThousandSepltrimrtrimtrim $fShowStr$fEqStrCPUTime ClockTime getClockTimefromMilliseconds getCPUTime measureTime$fPrettyCPUTime $fEqCPUTime $fShowCPUTime $fOrdCPUTime $fNumCPUTime $fRealCPUTime $fEnumCPUTime$fIntegralCPUTime LineNumber parseLibFiletrimLineComment splitCommas$fShowGenericLineLispAQresponse putResponse display_info'display_warningclearRunningInfo clearWarningdisplayRunningInfo $fShowLisp $fPrettyLisp==<<whenMunlessMguardMifMifNotMand2MandMallMor2MorManyMaltM1 orEitherMmapM'forM' mapMaybeM forMaybeM dropWhileM partitionMfinallytryMaybebracket_readM AbsolutePathfilePath mkAbsoluterootPathabsolute===doesFileExistCaseSensitive$fPrettyAbsolutePath$fShowAbsolutePath$fEqAbsolutePath$fOrdAbsolutePath$fDataAbsolutePath$fHashableAbsolutePathHashhashByteStringhashFile combineHashes hashString MonadBench getBenchmark getsBenchmark putBenchmarkmodifyBenchmark Benchmark benchmarkOncurrentAccounttimings BenchmarkOn BenchmarkOff BenchmarkSomeTimingsCurrentAccountAccount isBenchmarkOnmapBenchmarkOnmapCurrentAccount mapTimings addCPUTimesetBenchmarkingswitchBenchmarkingresetbillTo billToCPS billPureTo$fPrettyBenchmark$fNullBenchmark$fMonadBenchaStateT$fMonadBenchaReaderT KillRangeT KillRange killRangeSetRangesetRangeHasRangegetRange PrintRangeRangeRange'NoRangeIntervalWithoutFileInterval Interval'iStartiEndPositionWithoutFilePositionSrcFile Position'PnsrcFileposPosposLineposColpositionInvariantintervalInvariantsetIntervalFilegetIntervalFile posToIntervaliLengthrangeIntervalsintervalsToRangeconsecutiveAndSeparatedrangeInvariant rangeFile rightMargin killRangeMap killRange1 killRange2 killRange3 killRange4 killRange5 killRange6 killRange7 killRange8 killRange9 killRange10 killRange11 killRange12 killRange13 killRange14 killRange15 killRange16 killRange17 killRange18 killRange19 startPos'startPosnoRangemovePosmovePosByString backupPostakeIdropI posToRange' posToRangeintervalToRangerangeToIntervalWithFilerangeToInterval continuouscontinuousPerLinerStart'rStartrEnd'rEnd fuseIntervals fuseRanges fuseRange beginningOfbeginningOfFile withRangeOfinterleaveRanges$fPrettyPosition'$fShowPosition'$fOrdPosition' $fEqPosition'$fPrettyPosition'0$fShowPosition'0$fPrettyInterval'$fShowInterval'$fPrettyInterval'0$fShowInterval'0$fPrettyRange' $fShowRange' $fShowRange'0 $fNullRange'$fHasRangeEither$fHasRangeMaybe$fHasRange(,,,,,,)$fHasRange(,,,,,)$fHasRange(,,,,)$fHasRange(,,,)$fHasRange(,,) $fHasRange(,) $fHasRange[]$fHasRangeBool$fHasRangeRange'$fHasRangeInterval' $fSetRange[]$fSetRangeRange'$fKillRangeEither$fKillRangeMaybe$fKillRange(,,,)$fKillRange(,,)$fKillRange(,)$fKillRangeSet$fKillRangeMap $fKillRange[]$fKillRange[]0$fKillRangeInteger$fKillRangeInt$fKillRangeBool $fKillRange()$fKillRangeVoid$fKillRangeRange'$fPrettyPrintRange$fDataPosition'$fFunctorPosition'$fFoldablePosition'$fTraversablePosition'$fGenericPosition'$fDataInterval' $fEqInterval'$fOrdInterval'$fFunctorInterval'$fFoldableInterval'$fTraversableInterval'$fGenericInterval' $fDataRange' $fEqRange' $fOrdRange'$fFunctorRange'$fFoldableRange'$fTraversableRange'$fGenericRange'$fEqPrintRange$fOrdPrintRange$fHasRangePrintRange$fSetRangePrintRange$fKillRangePrintRangeDoDropdoDropdropMoreunDropDropdropNdropFromInversePermuteinversePermute PermutationPerm permRange permPickspermute safePermuteidPtakePdroppedPliftPcomposePinvertPcompactPreversePflipPexpandPtopoSort$fKillRangePermutation$fNullPermutation$fSizedPermutation$fShowPermutation$fInversePermute(->)[]$fInversePermute[][]$fInversePermute[]IntMap$fInversePermute[][]0$fKillRangeDrop$fDoDropPermutation $fDoDrop[]$fEqPermutation$fDataPermutation$fEqDrop $fOrdDrop $fShowDrop $fDataDrop $fFunctorDrop$fFoldableDrop$fTraversableDrop ParseResultParseOk ParseFailed ParseWarningOverlappingTokensWarning warnRange ParseErrorOverlappingTokensErrorInvalidExtensionError ReadFileError errSrcFileerrPoserrInput errPrevTokenerrMsgerrRangeerrPath errValidExts errIOError ParseFlagsparseKeepComments LayoutContextNoLayoutLayoutLexState ParseStatePState parseSrcFileparsePos parseLastPosparseInp parsePrevCharparsePrevToken parseLayout parseLexState parseFlags initStatedefaultParseFlagsparsePosString parseFile parseFromSrc setParsePos setLastPos setPrevTokengetParseInterval getLexState pushLexState popLexState getParseFlags parseError parseErrorAt parseError'lexError topContext popContext pushContextpushCurrentContext$fHasRangeParseError$fPrettyParseError$fShowParseError$fHasRangeParseWarning$fPrettyParseWarning$fShowParseWarning$fMonadStateParseStateParser$fMonadErrorParseErrorParser$fShowLayoutContext$fShowParseFlags$fShowParseState$fDataParseWarning ProcessorLayersLayer layerRoleinterval layerContent LayerRoleMarkupCommentCode atomizeLayersliterateSrcFileliterateProcessorsisCode isCodeLayer illiterate literateExtsliterateExtsShortList literateTeX literateMd literateRsT$fHasRangeLayer$fShowLayerRole $fEqLayerRole $fShowLayerFixity' noFixity'PositivityCheckTerminationCheckNoTerminationCheckNonTerminating TerminatingTerminationMeasure Renaming'RenamingrenFromrenTo renToRange ImportedName'ImportedModule ImportedNameUsing' UseEverythingUsingImportDirective'ImportDirectiveimportDirRangeusinghiding impRenaming publicOpen InteractionId interactionIdMaybePlaceholder Placeholder NoPlaceholderPositionInName BeginningMiddleEndConstrMetaIdmetaIdNameIdArityNatIsMacroMacroDef NotMacroDef IsInstance InstanceDefNotInstanceDef IsAbstract AbstractDef ConcreteDefAccess PrivateAccess PublicAccess OnlyQualifiedIsInfixInfixDef PrefixDef DataOrRecordIsDataIsRecord ProjOrigin ProjPrefix ProjPostfix ProjSystem ConOrigin ConOSystemConOConConORec ConOSplitRStringRawNameRangedrangeOf rangedThingNamedArgNamed_NamednameOf namedThingDomdomInfounDom Underscore underscore isUnderscoreArgargInfounArg LensArgInfo getArgInfo setArgInfo mapArgInfoArgInfo argInfoHidingargInfoRelevance argInfoOrigin LensOrigin getOrigin setOrigin mapOrigin WithOriginwoOriginwoThingOrigin UserWrittenInserted Reflected CaseSplit LensRelevance getRelevance setRelevance mapRelevance RelevanceRelevant NonStrict IrrelevantForcedBigSmall LensHiding getHiding setHiding mapHiding WithHidingwhHidingwhThingHidingHiddenInstance NotHidden Overlappable YesOverlap NoOverlap Induction Inductive CoInductiveDelayed NotDelayed mergeHidingvisible notVisiblehiddenhidehideOrKeepInstance makeInstance makeInstance'isOverlappable isInstance sameHiding allRelevances isRelevant isIrrelevant moreRelevant irrelevantunusableRelevancecomposeRelevanceinverseComposeRelevance ignoreForcedirrToNonStrictnonStrictToRelnonStrictToIrrdefaultArgInfo defaultArg withArgsFromwithNamedArgsFrom argFromDom domFromArg defaultDomunnamednamednamedArgdefaultNamedArgupdateNamedArg setNamedArgunrangedrawNameToStringstringToRawName bestConInfo noPlaceholderdefaultImportDirisDefaultImportDirsetImportedName$fKillRangeDelayed$fNFDataInduction$fKillRangeInduction$fHasRangeInduction$fShowInduction$fNFDataOverlappable$fMonoidOverlappable$fSemigroupOverlappable$fNFDataHiding$fKillRangeHiding$fMonoidHiding$fSemigroupHiding$fNFDataWithHiding$fKillRangeWithHiding$fSetRangeWithHiding$fHasRangeWithHiding$fApplicativeWithHiding$fDecorationWithHiding$fLensHidingWithHiding$fLensHidingHiding $fNFDataBig$fOrdBig$fNFDataRelevance$fOrdRelevance$fKillRangeRelevance$fLensRelevanceRelevance$fNFDataOrigin$fKillRangeOrigin$fNFDataWithOrigin$fKillRangeWithOrigin$fSetRangeWithOrigin$fHasRangeWithOrigin$fDecorationWithOrigin$fLensOriginWithOrigin$fLensOriginOrigin$fLensOriginArgInfo$fLensRelevanceArgInfo$fLensHidingArgInfo$fNFDataArgInfo$fKillRangeArgInfo$fLensArgInfoArgInfo$fLensArgInfoArg$fLensOriginArg$fLensRelevanceArg$fLensHidingArg $fNFDataArg $fShowArg$fEqArg$fKillRangeArg $fSetRangeArg $fHasRangeArg$fDecorationArg$fUnderscoreDoc$fUnderscoreByteString$fUnderscore[]$fLensOriginDom$fLensArgInfoDom$fLensRelevanceDom$fLensHidingDom $fShowDom$fEqDom$fKillRangeDom $fHasRangeDom$fDecorationDom $fNFDataNamed$fKillRangeNamed$fSetRangeNamed$fHasRangeNamed$fDecorationNamed$fNFDataRanged$fDecorationRanged$fKillRangeRanged$fHasRangeRanged $fOrdRanged $fEqRanged $fShowRanged $fShowNamed$fKillRangeConOrigin$fKillRangeProjOrigin$fKillRangeAccess$fHasRangeAccess$fNFDataAccess$fPrettyAccess$fKillRangeIsAbstract$fNFDataIsInstance$fHasRangeIsInstance$fKillRangeIsInstance$fHasRangeIsMacro$fKillRangeIsMacro$fHashableNameId$fNFDataNameId $fEnumNameId $fShowNameId$fKillRangeNameId$fNFDataMetaId $fShowMetaId$fPrettyMetaId$fNFDataMaybePlaceholder$fKillRangeMaybePlaceholder$fHasRangeMaybePlaceholder$fKillRangeInteractionId$fShowInteractionId$fNFDataImportedName'$fKillRangeImportedName'$fHasRangeImportedName'$fShowImportedName'$fNFDataUsing'$fKillRangeUsing'$fHasRangeUsing'$fMonoidUsing'$fSemigroupUsing'$fNFDataRenaming'$fKillRangeRenaming'$fHasRangeRenaming'$fNFDataImportDirective'$fKillRangeImportDirective'$fHasRangeImportDirective'$fNFDataTerminationCheck$fKillRangeTerminationCheck $fDataDelayed $fShowDelayed $fEqDelayed $fOrdDelayed$fDataInduction $fEqInduction$fOrdInduction$fDataOverlappable$fShowOverlappable$fEqOverlappable$fOrdOverlappable $fDataHiding $fShowHiding $fEqHiding $fOrdHiding$fDataWithHiding$fEqWithHiding$fOrdWithHiding$fShowWithHiding$fFunctorWithHiding$fFoldableWithHiding$fTraversableWithHiding $fDataBig $fShowBig$fEqBig $fEnumBig $fBoundedBig$fDataRelevance$fShowRelevance $fEqRelevance $fDataOrigin $fShowOrigin $fEqOrigin $fOrdOrigin$fDataWithOrigin$fEqWithOrigin$fOrdWithOrigin$fShowWithOrigin$fFunctorWithOrigin$fFoldableWithOrigin$fTraversableWithOrigin $fDataArgInfo $fEqArgInfo $fOrdArgInfo $fShowArgInfo $fDataArg$fOrdArg $fFunctorArg $fFoldableArg$fTraversableArg $fDataDom$fOrdDom $fFunctorDom $fFoldableDom$fTraversableDom $fEqNamed $fOrdNamed $fDataNamed$fFunctorNamed$fFoldableNamed$fTraversableNamed $fDataRanged$fFunctorRanged$fFoldableRanged$fTraversableRanged$fDataConOrigin$fShowConOrigin $fEqConOrigin$fOrdConOrigin$fEnumConOrigin$fBoundedConOrigin$fDataProjOrigin$fShowProjOrigin$fEqProjOrigin$fOrdProjOrigin$fEnumProjOrigin$fBoundedProjOrigin$fDataDataOrRecord$fEqDataOrRecord$fOrdDataOrRecord$fShowDataOrRecord $fDataIsInfix $fShowIsInfix $fEqIsInfix $fOrdIsInfix $fDataAccess $fShowAccess $fEqAccess $fOrdAccess$fDataIsAbstract$fShowIsAbstract$fEqIsAbstract$fOrdIsAbstract$fDataIsInstance$fShowIsInstance$fEqIsInstance$fOrdIsInstance $fDataIsMacro $fShowIsMacro $fEqIsMacro $fOrdIsMacro $fEqNameId $fOrdNameId $fDataNameId$fGenericNameId $fEqMetaId $fOrdMetaId $fNumMetaId $fRealMetaId $fEnumMetaId$fIntegralMetaId $fDataMetaId$fShowPositionInName$fEqPositionInName$fOrdPositionInName$fDataPositionInName$fDataMaybePlaceholder$fEqMaybePlaceholder$fOrdMaybePlaceholder$fFunctorMaybePlaceholder$fFoldableMaybePlaceholder$fTraversableMaybePlaceholder$fShowMaybePlaceholder$fEqInteractionId$fOrdInteractionId$fNumInteractionId$fIntegralInteractionId$fRealInteractionId$fEnumInteractionId$fDataInteractionId$fDataImportedName'$fEqImportedName'$fOrdImportedName' $fDataUsing' $fEqUsing'$fDataRenaming' $fEqRenaming'$fDataImportDirective'$fEqImportDirective'$fDataTerminationCheck$fShowTerminationCheck$fEqTerminationCheck$fFunctorTerminationCheckMemoKeyNodeK PostLeftsK PreRightsKTopKAppKNonfixK$fHashableMemoKey $fEqMemoKey $fShowMemoKey$fGenericMemoKeyIsNoNameisNoNameNumHolesnumHolesTopLevelModuleNamemoduleNameRangemoduleNamePartsNamePartHoleIdNoName nameToRawName namePartsnameStringPartsstringNameParts isOperatorisHoleisPrefix isPostfixisInfixisNonfixqualify unqualify qnameParts isQualifiedtoTopLevelModuleNamemoduleNameToFileName projectRootnoName_noName$fNFDataNamePart$fPrettyNamePart$fShowNamePart $fOrdNamePart $fEqNamePart $fNFDataName$fKillRangeName$fSetRangeName$fHasRangeName $fPrettyName $fShowName $fOrdName$fUnderscoreName $fNFDataQName$fKillRangeQName$fSetRangeQName$fHasRangeQName $fPrettyQName $fShowQName$fUnderscoreQName$fKillRangeTopLevelModuleName$fSetRangeTopLevelModuleName$fHasRangeTopLevelModuleName$fPrettyTopLevelModuleName$fSizedTopLevelModuleName$fOrdTopLevelModuleName$fEqTopLevelModuleName$fNumHolesQName$fNumHolesName $fNumHoles[]$fIsNoNameQName$fIsNoNameName$fIsNoNameByteString $fIsNoName[]$fDataNamePart$fGenericNamePart $fDataName $fDataQName $fOrdQName$fShowTopLevelModuleName$fDataTopLevelModuleNameModuleToSourceTCMTCMTunTCMTCStateTCEnvHighlightingMethodGlobalsglobalsUsesusesmodNameexports postscriptExportexpNamedefnMemberIdGlobalIdLocalIdSelfLocalGlobal UndefinedIntegerDoubleObjectApplyLookupBinOpPreOpPlainJS $fUsesExport $fUsesExp $fUsesMap$fUses[]$fGlobalsModule$fGlobalsExport $fGlobalsExp $fGlobalsMap $fGlobals[] $fEqLocalId $fOrdLocalId $fShowLocalId $fEqGlobalId $fOrdGlobalId$fShowGlobalId $fEqMemberId $fOrdMemberId$fShowMemberId $fShowExp $fShowExport $fShowModuleshift shiftFromshifter substitutermap'subst'applyselffix curriedApply curriedLambdaempvineobjectPrettiesprettiesbrunescape unescapesblockblock'modname variableNameisValidJSIdent$fPrettyModule$fPrettyMemberId$fPrettyGlobalId$fPrettyLocalId $fPretty(,) $fPrettyExp $fPrettiesMap $fPretties[] renameOffsetFreeVarsfreeVarsOffset Weakeningweak' ExpandMetas expandMetas MetaliseOKH metaliseOKHEECtxCActionSubSkipWeakTrBrCExpClosICExp ICArgListCALNil CALConcat HNArgListHNALNilHNALCons HNALConParHNExp'HNAppHNLamHNPiHNSortHNExp WithSeenUIdsseenUIdsrawValueMArgListArgListALNilALConsALProjALConParMExpLamPiSort AbsurdLambdaappUIdappOKappHeadappElimsSet UnknownSortElrConstRef PatConAppPatVarPatExpClauseDeclContDefDatatype Constructor PostulateConstDefcdnamecdorigincdtypecdcont cddeffreevarsAbsMIdNoIdMyMBMyPBRefInfoRIEnv RIMainInfo RIUnifInfo RICopyInfo RIIotaStepRIInferredTypeUnknownRINotConstructor RIUsedVars RIPickSubsvar RIEqRState RICheckElimRICheckProjIndexrieHintsrieDefFreeVarsrieEqReasoningConstsriMainCxtLength riMainType riMainIotaEqReasoningStateEqRSNone EqRSChainEqRSPrf1EqRSPrf2EqRSPrf3EqReasoningConstseqrcId eqrcBegineqrcStepeqrcEndeqrcSymeqrcCongHintModeHMNormal HMRecCallUIdgetVargetConstdontCaredetecteliminanddetectsemiflexcategorizedecl metaliseokhaddtrailingargsclosifysubsubiweakdoclosfreeVarsrename$fMetaliseOKHArgList$fMetaliseOKHExp$fMetaliseOKHAbs$fMetaliseOKHMM$fExpandMetasArgList$fExpandMetasExp$fExpandMetasAbs$fExpandMetasMM$fWeakeningElr$fWeakeningICArgList$fWeakeningClos$fWeakeningTrBr$fFreeVarsArgList $fFreeVarsExp $fFreeVarsElr $fFreeVarsAbs $fFreeVarsMM $fFreeVars(,)$fRenamingArgList $fRenamingExp $fRenamingElr $fRenamingAbs $fRenamingMM $fRenaming(,)$fEqEqReasoningState$fShowEqReasoningState$fEqElr ExpRefInfoeriMaineriUnifseriInfTypeUnknowneriIsEliminand eriUsedVars eriIotaSteperiPickSubsVar eriEqRStateinitExpRefInfogetinfounivarsubsvarsnewAbsnewLamnewPifoldArgsnewArgs'newArgsnewApp'newAppeqStepeqEndeqCongeqSym eqBeginStep2pickUidextrarefcostUnificationIf costIncreasecostUnificationOccurscostUnification costAppVarcostAppVarUsed costAppHintcostAppHintUsedcostAppRecCallcostAppRecCallUsedcostAppConstructorcostAppConstructorSinglecostAppExtraRefcostLam costLamUnfoldcostPicostSort costIotaStepcostInferredTypeUnkown costAbsurdLam costEqStep costEqEnd costEqSym costEqCongprioNoprioTypeUnknownprioTypecheckArgListprioInferredTypeUnknown prioCompBetaprioCompBetaStructured prioCompIotaprioCompChoice prioCompUnif prioCompCopyprioCompareArgList prioNoIotaprioAbsurdLambda prioProjIndex prioTypecheck$fTravArgListRefInfo$fTravExpRefInfo$fTravTrBrRefInfo$fTrav(,)RefInfo $fTrav[]blk$fRefinableIORefRefInfo$fRefinableClosRefInfo$fRefinableArgListRefInfo$fRefinableExpRefInfoCMFlexCMFFlexCMFSemi CMFBlockedCModeCMRigidPEvalPENoPEConAppHNResHNDoneHNMetaHNNBlkstcExp getDatatypeconstructorImpossibleunequalsunequal traversePitcargsaddendcopyargnoblksaddblkhnnhnn_blks hnn_checkstephnn'hnbhnc hnarglistgetNArgs getAllArgsiotastep noiotastepnoiotastep_termcomp'checkeliminandmaybeor iotapossmetameta_not_constructor calcEqRStatepickidtcSearchLocalTerminationEnvsizeAndBoundVarsLiftlift'Unifyunify' notequal' AssignmentsReplacereplace'SolCSPatI CSPatConAppCSPatVarCSPatExpCSWithCSAbsurd CSOmittedArgCSCtxCSPatHI abspatvarnamecostCaseSplitVeryHighcostCaseSplitHighcostCaseSplitLowcostAddVarDepthdrophidcaseSplitSearchcaseSplitSearch' infertypevarreplace betareduce concatargsreplacepunifynotequalunifyVarunifyexplift removevarfindpermfreevars applypermrenseqctx depthofvarlocalTerminationEnvlocalTerminationSidecondgetblks $fRenamingHI$fRenamingCSPatI$fReplaceoArgListArgList $fReplaceoMMu$fReplaceoExpMM$fReplaceoAbsAbs$fUnifyoArgList $fUnifyoExp $fUnifyoAbs $fUnifyoMM $fLiftArgList $fLiftExp$fLiftMM $fLiftAbs$fLocalTerminationEnvMM$fLocalTerminationEnv(,)$fLocalTerminationEnvMM0$fLocalTerminationEnv[]$fLocalTerminationEnvCSPatI$fLocalTerminationEnvHI NotationKind InfixNotationPrefixNotationPostfixNotationNonfixNotation NoNotationGenPartBindHole NormalHoleWildHoleIdPartNotationHoleName LambdaHoleExprHole _bindHoleNameholeName isLambdaHole stringParts holeTargetisAHole isNormalHole isBindingHole notationKind mkNotation noNotation$fNFDataGenPart$fKillRangeGenPart $fDataGenPart $fShowGenPart $fEqGenPart $fOrdGenPart$fEqNotationKind$fShowNotationKindMkNamemkNamemkName_IsProjPisProjPAmbiguousQNameAmbQunAmbQMName mnameToListQNamedqnameqnamed qnameModule qnameNamenameId nameConcretenameBindingSite nameFixityisAnonymousModuleName withRangesOf withRangesOfQ mnameFromList noModuleNamecommonParentModule qnameToList qnameFromList qnameToMName mnameToQName showQNameIdqnameToConcretemnameToConcretequalifyMqualifyQqualify_ isSubModuleOf isInModulenextName$fHashableName$fNFDataModuleName$fSizedModuleName$fKillRangeModuleName$fSetRangeModuleName$fHasRangeModuleName$fPrettyModuleName$fShowModuleName $fSizedQName$fHashableQName$fPrettyQNamed$fKillRangeAmbiguousQName$fHasRangeAmbiguousQName$fPrettyAmbiguousQName$fNumHolesAmbiguousQName$fIsProjPNamed $fIsProjPArg $fMkName[]$fDataModuleName$fFunctorQNamed$fFoldableQNamed$fTraversableQNamed$fEqAmbiguousQName$fOrdAmbiguousQName$fDataAmbiguousQName$fShowAmbiguousQName $fShowQNamedLitNatLitFloat LitStringLitCharLitQNameLitMeta showString' showChar' compareFloat$fNFDataLiteral$fKillRangeLiteral$fSetRangeLiteral$fHasRangeLiteral $fOrdLiteral$fPrettyLiteral $fShowLiteral $fDataLiteral isUnreachableTError TUnreachableTAltTAConTAGuardTALitaConaArityaBodyaGuardaLitCaseTypeCTDataCTNatCTIntCTCharCTStringCTFloatCTQNameTPrimPAddPSubPMulPQuotPRemPGeqPLtPEqIPEqFPEqSPEqCPEqQPIfPSeqTTermTVarTDefTAppTLamTLitTConTLetTCaseTUnitTSortTErasedArgsCompiled cTreeless cArgUsageisPrimEqmkTApptAppViewtLetViewtLamViewmkTLammkLettIntintViewtPlusK tNegPlusK plusKView negPlusKViewtOp tUnreachable tIfThenElse$fKillRangeCompiled$fUnreachableTTerm$fUnreachableTAlt $fDataTPrim $fShowTPrim $fEqTPrim $fOrdTPrim$fDataCaseType$fShowCaseType $fEqCaseType $fOrdCaseType $fDataTError $fShowTError $fEqTError $fOrdTError $fDataTTerm $fShowTTerm $fEqTTerm $fOrdTTerm $fDataTAlt $fShowTAlt$fEqTAlt $fOrdTAlt$fDataCompiled$fShowCompiled $fEqCompiled $fOrdCompiled $fPrettyTTerm DefinitionFunDefDataDef RecordDefDataConstructorAxiom Primitive AbsurdClausePatternConPDotPVarPLitPAbsurdPProjPSetSLitSUnknownSExtLamUnknownElimsElimElim' argsToElims $fShowElim' $fShowAbs $fShowPattern $fShowClause $fShowTerm $fShowSort$fShowDefinitionToken TokKeywordTokIdTokQId TokLiteral TokSymbol TokStringTokSetNTokTeX TokCommentTokDummyTokEOFSymDotSymSemiSymVirtualSemiSymBarSymColonSymArrowSymEqual SymLambda SymUnderscoreSymQuestionMarkSymAs SymOpenParen SymCloseParenSymOpenIdiomBracketSymCloseIdiomBracketSymDoubleOpenBraceSymDoubleCloseBrace SymOpenBrace SymCloseBraceSymOpenVirtualBraceSymCloseVirtualBrace SymOpenPragmaSymClosePragma SymEllipsis SymDotDot SymEndCommentKeywordKwLetKwInKwWhereKwDataKwCoData KwPostulateKwMutual KwAbstract KwPrivate KwInstance KwOverlapKwOpenKwImportKwModule KwPrimitiveKwMacroKwInfixKwInfixLKwInfixRKwWith KwRewriteKwSetKwPropKwForallKwRecord KwConstructorKwField KwInductive KwCoInductiveKwEtaKwNoEtaKwHidingKwUsing KwRenamingKwToKwPublic KwOPTIONS KwBUILTINKwLINEKwCOMPILED_DATAKwCOMPILED_TYPE KwCOMPILEDKwCOMPILED_EXPORT KwHASKELL KwFOREIGN KwCOMPILE KwCOMPILED_JSKwCOMPILED_UHCKwCOMPILED_DATA_UHCKwIMPORT KwIMPORT_UHC KwIMPOSSIBLEKwSTATIC KwINJECTIVEKwINLINEKwETAKwNO_TERMINATION_CHECK KwTERMINATINGKwNON_TERMINATING KwMEASURE KwDISPLAY KwREWRITE KwQuoteGoalKwQuoteContextKwQuote KwQuoteTerm KwUnquote KwUnquoteDecl KwUnquoteDefKwSyntax KwPatternSynKwTactic KwCATCHALLKwNO_POSITIVITY_CHECK KwPOLARITYlayoutKeywords$fHasRangeToken $fEqKeyword $fShowKeyword $fEqSymbol $fShowSymbolPrecedenceStack PrecedenceTopCtxFunctionSpaceDomainCtxLeftOperandCtxRightOperandCtx FunctionCtx ArgumentCtxInsideOperandCtx WithFunCtx WithArgCtx DotPatternCtxFixity fixityRange fixityLevel fixityAssoc AssociativityNonAssoc LeftAssoc RightAssocPrecedenceLevel UnrelatedRelatedNotationSection sectNotationsectKind sectLevel sectIsSection NewNotationnotaName notaNames notaFixitynotationnotaIsOperatorThingWithFixity theFixity theNotation theNameRangenamesToNotationuseDefaultFixity notationNamessyntaxOfmergeNotations noSectionnoFixity defaultFixitypushPrecedenceheadPrecedencehiddenArgumentCtx opBrackets opBrackets' lamBrackets' lamBrackets appBrackets appBrackets'withAppBrackets piBracketsroundFixBrackets _notaFixity _fixityAssoc _fixityLevel$fNFDataFixity$fNFDataFixity'$fKillRangeFixity'$fKillRangeFixity$fHasRangeFixity $fOrdFixity $fEqFixity $fEqFixity'$fKillRangeThingWithFixity$fPrettyPrecedence$fEqPrecedenceLevel$fOrdPrecedenceLevel$fShowPrecedenceLevel$fDataPrecedenceLevel$fEqAssociativity$fOrdAssociativity$fShowAssociativity$fDataAssociativity $fDataFixity $fShowFixity $fDataFixity' $fShowFixity'$fShowNewNotation$fShowNotationSection$fFunctorThingWithFixity$fFoldableThingWithFixity$fTraversableThingWithFixity$fDataThingWithFixity$fShowThingWithFixity$fShowPrecedence$fDataPrecedence$fEqPrecedenceRangesfromtorangesInvariant overlappingrangeToPositionsrangesToPositionsrToRrangeToEndPointsminus $fEqRange $fOrdRange $fShowRange $fEqRanges $fShowRangesDAGdagGraphdagComponentMap dagNodeMapNodessrcNodestgtNodesallNodesEdgesourcetargetlabelGraphgraph transposeEdgeedges edgesFromedgesTodiagonal neighbours neighboursMap sourceNodes targetNodes computeNodesnodes fromNodes fromListWithdiscreteclean insertEdgeinsertEdgeWith unionsWith removeNode removeEdge filterEdges mapWithEdgesccs'sccs dagInvariant oppositeDAG reachablesccDAG'sccDAGacyclic reachableFromwalkSatisfying composeWithcomplete1gaussJordanFloydWarshallMcNaughtonYamadaReference(gaussJordanFloydWarshallMcNaughtonYamada $fPrettyGraph $fPrettyEdge $fEqGraph$fFunctorGraph $fShowGraph$fEqEdge $fOrdEdge $fFunctorEdge $fShowEdgeBounds lowerBounds upperBounds mustBeFiniteBound SetToInfty setToInfty ConGraphsConGraphHypGraphHyp'HypGraphsNodeNodeZero NodeInfty NodeRigidNodeFlexLabelLInflcmploffsetNegativenegativeWeightInfinity LabelledEdgeKeyEdge'srcdest lookupEdge graphToList graphFromListoutgoingincomingsetFoldl transClostoWeight isFlexNode isZeroNode isInftyNodenodeToSizeExpr emptyGraphsmentionsaddEdgereflClosimpliesnodeFromSizeExpredgeFromConstraintgraphFromConstraintsgraphsFromConstraintshypGraphhypConnsimplifyWithHypothesesconstraintGraphconstraintGraphs infinityFlexs emptyBoundedgeToLowerBoundedgeToUpperBoundgraphToLowerBoundsgraphToUpperBoundsboundssmallestlargest commonSuccs commonPredslub'glb'lubglbfindRigidBelow solveGraph solveGraphsverifySolution iterateSolver testSuccstestLub$fPlusSizeExpr'WeightSizeExpr'$fPlusOffsetWeightWeight $fDioidWeight$fPlusWeightOffsetWeight $fNumWeight $fEnumWeight $fTopWeight$fMeetSemiLatticeWeight $fOrdWeight$fPrettyWeight$fNegativeWeight$fNegativeOffset $fNegativeInt$fPlusSizeExpr'LabelSizeExpr' $fDioidLabel $fTopLabel$fMeetSemiLatticeLabel $fPrettyLabel $fOrdLabel $fEqLabel$fNegativeLabel $fPrettyNode $fDioidEdge $fTopEdge$fMeetSemiLatticeEdge$fNegativeEdge$fNegativeGraph $fNegative[]$fSetToInftyfGraph$fSetToInftyfEdge$fSetToInftyfNode $fEqWeight $fShowWeight $fShowLabel $fShowNode$fEqNode $fOrdNode OccurrenceMixedJustNegJustPos StrictPosGuardPosUnusedWhere LeftOfArrowDefArgUnderInfVarArgMetaArg ConArgType IndArgTypeInClauseMatchedInDefOf OccursWhereKnownboundToEverySomeproductOfEdgesInBoundedWalk $fPrettyWhere$fPrettyOccursWhere$fNullOccurrence$fStarSemiRingOccurrence$fSemiRingOccurrence$fKillRangeOccurrence$fNFDataOccurrence$fPrettyOccurrence $fShowWhere $fEqWhere $fOrdWhere $fDataWhere$fShowOccursWhere$fEqOccursWhere$fOrdOccursWhere$fDataOccursWhere$fDataOccurrence$fShowOccurrence$fEqOccurrence$fOrdOccurrence$fEnumOccurrence$fBoundedOccurrenceAppViewPragma OptionsPragma BuiltinPragma RewritePragmaCompiledDataPragmaCompiledTypePragmaCompiledPragmaCompiledExportPragmaCompiledJSPragmaCompiledUHCPragmaCompiledDataUHCPragmaHaskellCodePragma ForeignPragma CompilePragma StaticPragmaInjectivePragma InlinePragma ImportPragmaImportUHCPragmaImpossiblePragma EtaPragmaTerminationCheckPragmaCatchallPragma DisplayPragmaNoPositivityCheckPragmaPolarityPragma OpenShortHandDoOpenDontOpenModuleApplication SectionAppRecordModuleIFS DeclarationField FunClauseDataSig RecordSigInfix PatternSynMutualPrivate InstanceBMacroOpenImport ModuleMacro UnquoteDecl UnquoteDefTypeSignatureOrInstanceBlock TypeSignatureAsNameasNameasRange ExprWhere WhereClause'NoWhereAnyWhere SomeWhere WhereClauseRHS' AbsurdRHSRHSLHSCoreLHSHeadLHSProj lhsDefNamelhsPats lhsDestructor lhsPatsLeftlhsFocus lhsPatsRightWithExpr RewriteEqnEllipsislhsOriginalPatternlhsWithPattern lhsRewriteEqn lhsWithExpr Telescope TypedBinding'TBind TypedBinding BoundNameBName boundName boundLabel bnameFixityTypedBindings' TypedBindings LamBinding' DomainFree DomainFull LamBindingIdentPQuotePAppPRawAppPOpAppPHiddenP InstancePParenPWildPAsPRecPExpr QuestionMarkRawAppOpAppWithApp HiddenArg InstanceArg AbsurdLam ExtendedLamFunSetNRec RecUpdateParen IdiomBracketsAbsurdAsDotETel QuoteGoal QuoteContextQuote QuoteTermTacticUnquoteDontCareEqualRecordAssignmentsRecordAssignmentModuleAssignment _qnameModA _exprModA_importDirModAFieldAssignmentFieldAssignment' _nameFieldA _exprFieldASyntaxBindingLambdaOrdinary fromOrdinary nameFieldA exprFieldA mkBoundName_ mkBoundName countTelVarstopLevelModuleNamespanAllowedBeforeModulemapLhsOriginalPatternappView patternQNames patternNames$fNFDataFieldAssignment'$fKillRangeFieldAssignment'$fHasRangeFieldAssignment'$fNFDataTypedBindings'$fNFDataBoundName$fKillRangeBoundName$fHasRangeBoundName$fNFDataLamBinding' $fNFDataRHS'$fNFDataWhereClause'$fNullWhereClause'$fNFDataAsName$fKillRangeAsName$fHasRangeAsName$fNFDataModuleAssignment $fNFDataLHS $fNFDataOpApp$fNFDataModuleApplication$fNFDataTypedBinding'$fNFDataPragma$fNFDataDeclaration$fNFDataPattern $fNFDataExpr$fKillRangeWhereClause'$fKillRangeTypedBindings'$fKillRangeTypedBinding'$fKillRangeRHS'$fKillRangePragma$fKillRangePattern$fKillRangeOpApp$fKillRangeModuleApplication$fKillRangeLHS$fKillRangeLamBinding'$fKillRangeExpr$fKillRangeDeclaration$fKillRangeModuleAssignment$fSetRangePattern$fSetRangeTypedBindings'$fHasRangePattern$fHasRangePragma$fHasRangeRHS' $fHasRangeLHS$fHasRangeDeclaration$fHasRangeModuleAssignment$fHasRangeModuleApplication$fHasRangeWhereClause'$fHasRangeLamBinding'$fHasRangeTypedBinding'$fHasRangeTypedBindings'$fHasRangeExpr$fHasRangeOpApp$fLensHidingLamBinding'$fLensHidingTypedBindings'$fLensRelevanceTypedBindings'$fHasRangeLHSCore$fDataFieldAssignment'$fFunctorFieldAssignment'$fFoldableFieldAssignment'$fTraversableFieldAssignment'$fShowFieldAssignment'$fEqFieldAssignment'$fDataTypedBindings'$fFunctorTypedBindings'$fFoldableTypedBindings'$fTraversableTypedBindings'$fDataBoundName $fEqBoundName$fShowBoundName$fDataLamBinding'$fFunctorLamBinding'$fFoldableLamBinding'$fTraversableLamBinding' $fDataRHS' $fFunctorRHS'$fFoldableRHS'$fTraversableRHS'$fDataWhereClause'$fFunctorWhereClause'$fFoldableWhereClause'$fTraversableWhereClause' $fDataAsName $fShowAsName$fDataOpenShortHand$fEqOpenShortHand$fShowOpenShortHand $fDataPragma $fDataPattern $fDataExpr$fDataDeclaration$fDataModuleApplication$fDataTypedBinding'$fFunctorTypedBinding'$fFoldableTypedBinding'$fTraversableTypedBinding' $fDataLHS$fDataModuleAssignment $fDataOpApp$fFunctorOpApp$fFoldableOpApp$fTraversableOpAppTelbraces'dbracesbracesAndSemicolonsarrowlambda prettyHidingprettyRelevancesmashTel prettyOpApp$fPrettyImportedName'$fPrettyUsing'$fPrettyImportDirective'$fPrettyPattern $fPrettyNamed $fPrettyArg$fPrettyFixity'$fPrettyGenPart$fPrettyFixity$fPrettyPragma$fPrettyOpenShortHand$fPrettyDeclaration$fPrettyModuleApplication$fShowModuleApplication$fPrettyLHSCore $fShowLHSCore $fPrettyLHS $fShowLHS$fPrettyWhereClause'$fShowWhereClause' $fPrettyRHS'$fPrettyTypedBinding'$fPrettyTypedBindings'$fPrettyLamBinding'$fPrettyBoundName$fPrettyModuleAssignment$fPrettyFieldAssignment'$fPrettyEither$fPrettyMaybePlaceholder $fPrettyOpApp$fPrettyInduction$fPrettyRelevance$fPrettyWithHiding$fPrettyThingWithFixity $fShowRHS' $fShowPragma$fShowImportDirective'$fShowLamBinding'$fShowTypedBindings'$fShowTypedBinding'$fShowDeclaration $fShowExpr $fPrettyTel $fPrettyExprPhaseParsingDeserializationScopingTyping Termination Positivity InjectivityProjectionLikenessCoverage Highlighting SerializationDeadCodeRecCheckReduceLevelCompareWithBuildInterface BinaryEncodeCompress OperatorsExprOperatorsPatternFree OccursCheckCheckLHSCheckRHS UnifyIndicesInverseScopeLookup TopModuleisModuleAccount isDefAccountisInternalAccount benchmarksbillToIO billToPure$fMonadBenchPhaseIO $fPrettyPhase $fEqPhase $fOrdPhase $fShowPhaseNKInPrePostNon OperatorType ParseSectionsDoNotParseSectionsIsExprexprView unExprViewExprViewLocalVWildVOtherVAppVOpAppV HiddenArgV InstanceArgVLamVParenV placeholdermaybePlaceholdersatNoPlaceholderpartPatLeastTwoPartswildOrUnqualifiedNameopPargsPappP$fIsExprPattern $fIsExprExpr$fHasRangeExprView$fEqParseSections$fShowParseSectionsExprLikemapExpr traverseExprfoldExpr$fExprLikeDeclaration$fExprLikeModuleApplication $fExprLikeLHS$fExprLikeTypedBindings'$fExprLikeLamBinding'$fExprLikeOpApp$fExprLikeModuleAssignment$fExprLikeFieldAssignment'$fExprLikeExpr$fExprLike(,,,)$fExprLike(,,) $fExprLike(,)$fExprLikeWhereClause'$fExprLikeRHS'$fExprLikeTypedBinding'$fExprLikeEither$fExprLikeMaybePlaceholder$fExprLikeMaybe $fExprLike[] $fExprLikeArg$fExprLikeNamed$fExprLikeBool$fExprLikeQName$fExprLikeNameCompressedFilerangesHighlightingInfoFilemappingDefinitionSite defSiteModule defSitePos defSiteHere defSiteAnchorAspectsaspect otherAspectsnotedefinitionSite OtherAspect DottedPattern UnsolvedMetaUnsolvedConstraintTerminationProblemPositivityProblemReachabilityProblemCoverageProblemIncompletePatternCatchallClause TypeChecksNameKindFunctionArgumentAspectNumber PrimitiveTypeseveralmerge smallestPostoMapcompressedFileInvariantcompress decompressnoHighlightingInRange singletonCseveralCmergeCsplitAtCselectC smallestPosC$fEqDefinitionSite$fMonoidAspects$fSemigroupAspects $fEqAspects $fMonoidFile$fSemigroupFile$fMonoidCompressedFile$fSemigroupCompressedFile $fEqNameKind$fShowNameKind $fEqAspect $fShowAspect$fEqOtherAspect$fShowOtherAspect$fEnumOtherAspect$fBoundedOtherAspect$fShowDefinitionSite $fShowAspects$fEqFile $fShowFile$fEqCompressedFile$fShowCompressedFileInteractionOutputCallback GiveResult Give_String Give_Paren Give_NoParenStatussShowImplicitArgumentssChecked DisplayInfoInfo_CompilationOkInfo_ConstraintsInfo_AllGoalsWarnings Info_Time Info_Error Info_Intro Info_AutoInfo_ModuleContentsInfo_SearchAboutInfo_WhyInScopeInfo_NormalForm Info_GoalTypeInfo_CurrentGoalInfo_InferredType Info_ContextInfo_HelperFunction Info_VersionMakeCaseVariantExtendedLambdaResponseResp_HighlightingInfo Resp_StatusResp_JumpToErrorResp_InteractionPointsResp_GiveAction Resp_MakeCase Resp_SolveAllResp_DisplayInfoResp_RunningInfoResp_ClearRunningInfoResp_ClearHighlightingResp_DoneAborting defaultInteractionOutputCallback$fShowDisplayInfo CompareResult Dominates IsDominated dominated notDominated dominator FavoritescompareWithFavoritescompareFavorites unionComparedinsertCompared$fMonoidFavorites$fSemigroupFavorites $fEqFavorites$fFoldableFavorites$fShowFavorites$fNullFavorites$fSingletonFavorites AssocListupdate mapWithKey mapWithKeyMAllowAmbiguousNamesAmbiguousAnythingAmbiguousConProjsAmbiguousNothing UsingOrHidingAbstractModule AbsModuleamodName amodLineage AbstractNameAbsName anameName anameKind anameLineage WhyInScopeDefinedOpenedApplied KindOfNameConNameFldNameDefNamePatternSynName MacroName QuotableNameInScope inScopeTag InScopeTagNameTag ModuleTag InScopeSetModulesInScope NamesInScope ThingsInScope NameSpacensNames nsModules nsInScopeLocalVarlocalVar localLetBoundlocalShadowedBy LocalVars ScopeInfo scopeCurrent scopeModules scopeLocalsscopePrecedencescopeInverseNamescopeInverseModule scopeInScopeScopeNameSpaces NameSpaceId PrivateNSPublicNS ImportedNSOnlyQualifiedNSScope scopeName scopeParentsscopeNameSpaces scopeImportsscopeDatatypeModulelocalNameSpacenameSpaceAccessscopeNameSpaceupdateScopeNameSpacesupdateScopeNameSpacesM shadowLocalnotShadowedLocalnotShadowedLocalsupdateScopeLocalssetScopeLocals mapScopeInfo inNameSpaceallKindsOfNames lensAnameName lensAmodName mergeNamesemptyNameSpace mapNameSpace zipNameSpace mapNameSpaceM emptyScopeemptyScopeInfomapScope mapScope_ mapScope' mapScopeM mapScopeM_zipScope zipScope_recomputeInScopeSets filterScopeallNamesInScopeallNamesInScope'exportedNamesInScope namesInScopeallThingsInScope thingsInScope mergeScope mergeScopessetScopeAccess setNameSpacemodifyNameSpaceaddNamesToScopeaddNameToScoperemoveNameFromScopeaddModuleToScope usingOrHidingapplyImportDirectiverenameCanonicalNamesrestrictPrivaterestrictLocalPrivateremoveOnlyQualifiedinScopeBecause publicModules publicNameseverythingInScope flattenScopeconcreteNamesInScope scopeLookup scopeLookup' isNameInScopeinverseScopeLookupinverseScopeLookup'recomputeInverseScopeMapsinverseScopeLookupNameinverseScopeLookupName'inverseScopeLookupModuleprettyNameSpace blockOfLines$fPrettyNameSpaceId$fSetRangeAbstractName$fHasRangeAbstractName$fPrettyAbstractName$fOrdAbstractName$fEqAbstractName$fPrettyLocalVar $fOrdLocalVar $fEqLocalVar$fPrettyAbstractModule$fOrdAbstractModule$fEqAbstractModule$fInScopeAbstractModule$fInScopeAbstractName$fPrettyNameSpace $fPrettyScope$fKillRangeScopeInfo$fPrettyScopeInfo $fEqScopeInfo$fDataNameSpaceId$fEqNameSpaceId$fBoundedNameSpaceId$fEnumNameSpaceId$fShowNameSpaceId$fEqKindOfName$fShowKindOfName$fDataKindOfName$fEnumKindOfName$fBoundedKindOfName$fDataWhyInScope$fShowWhyInScope$fDataAbstractName$fShowAbstractName$fDataLocalVar$fShowLocalVar$fDataAbstractModule$fShowAbstractModule$fDataNameSpace $fEqNameSpace$fShowNameSpace $fDataScope $fEqScope $fShowScope$fDataScopeInfo$fShowScopeInfo$fEqAllowAmbiguousNamesdontDescendIntoinstanceUniverseBiT'instanceTransformBiMT' ConPatInfo patOriginpatInfoPatInfoPatRangeLHSInfoLHSRange MutualInfomutualTermCheckmutualPositivityCheck mutualRangeDeclInfodeclName declRangeDefInfo defFixity defAccess defAbstract defInstancedefMacrodefInfoLetInfoLetRange ModuleInfo minfoRange minfoAsTo minfoAsNameminfoOpenShortminfoDirectiveLamInfolamRange lamOrigin lamParensExprInfo ExprRangeMetaInfo metaRange metaScope metaNumbermetaNameSuggestion emptyMetaInfo exprNoRangedefaultLamInfodefaultLamInfo_ mkDefInfomkDefInfoInstance patNoRange$fKillRangeMetaInfo$fHasRangeMetaInfo$fKillRangeExprInfo$fHasRangeExprInfo$fLensOriginLamInfo$fKillRangeLamInfo$fHasRangeLamInfo$fKillRangeModuleInfo$fSetRangeModuleInfo$fHasRangeModuleInfo$fKillRangeLetInfo$fHasRangeLetInfo$fKillRangeDeclInfo$fSetRangeDeclInfo$fHasRangeDeclInfo$fKillRangeDefInfo$fSetRangeDefInfo$fHasRangeDefInfo$fKillRangeMutualInfo$fHasRangeMutualInfo$fNullMutualInfo$fKillRangeLHSInfo$fHasRangeLHSInfo$fSetRangeConPatInfo$fKillRangeConPatInfo$fHasRangeConPatInfo$fShowConPatInfo$fDataMetaInfo$fShowMetaInfo $fEqMetaInfo$fDataExprInfo$fShowExprInfo $fEqExprInfo$fNullExprInfo $fDataLamInfo $fShowLamInfo $fEqLamInfo $fOrdLamInfo$fDataModuleInfo$fEqModuleInfo $fDataLetInfo $fShowLetInfo $fEqLetInfo $fNullLetInfo$fDataDeclInfo$fShowDeclInfo $fEqDeclInfo $fDataDefInfo $fShowDefInfo $fEqDefInfo$fDataMutualInfo$fShowMutualInfo$fEqMutualInfo $fDataLHSInfo $fShowLHSInfo $fEqLHSInfo $fNullLHSInfo $fDataPatInfo $fEqPatInfo $fNullPatInfo $fShowPatInfo$fHasRangePatInfo$fKillRangePatInfo$fDataConPatInfo$fEqConPatInfo$fShowModuleInfo transposeDiagonalMatrixunMMIxrowcolSizerowscolssquareisEmptysupSize fromIndexList fromLists toSparseRowstoLists isSingleton zipAssocWith zipMatrices intersectWithinterAssocWith addColumnaddRow $fShowMatrix$fPartialOrdMatrix$fDiagonalMatrixb$fPrettyMatrix$fTransposeMatrix$fTransposeMIx$fTransposeSize$fEqSize $fOrdSize $fShowSize$fEqMIx$fOrdMIx $fShowMIx$fIxMIx $fEqMatrix $fOrdMatrix$fFunctorMatrix$fFoldableMatrix$fTraversableMatrixNotWorsenotWorseOrderDecrMatincreasedecrease setUsabilitydecrorderMatisOrderleltunknown nonIncreasing decreasingisDecr.*. collapseOsupremuminfimum orderSemiring $fPrettyOrder$fPartialOrdOrder$fHasZeroOrder$fNotWorseMatrix$fNotWorseOrder $fEqOrder $fOrdOrder $fShowOrderCMSetcmSet CallMatrixAug augCallMatrix augCallInfoCallComb>*< CallMatrix CallMatrix'mat ArgumentIndexnoAug$fDiagonalCallMatrix'a$fPrettyCallMatrix'$fCallCombCallMatrix'$fPrettyCallMatrixAug$fCallCombCallMatrixAug$fNotWorseCallMatrixAug$fPartialOrdCallMatrixAug$fDiagonalCallMatrixAugOrder $fPrettyCMSet$fCallCombCMSet$fEqCallMatrix'$fOrdCallMatrix'$fShowCallMatrix'$fFunctorCallMatrix'$fFoldableCallMatrix'$fTraversableCallMatrix'$fPartialOrdCallMatrix'$fEqCallMatrixAug$fShowCallMatrixAug $fShowCMSet$fSemigroupCMSet $fMonoidCMSet $fNullCMSet$fSingletonCMSet$fNotWorseCallMatrix' CallGraph theCallGraphCall callMatrixSetmkCallmkCall'completionStep$fPrettyCallGraph$fMonoidCallGraph$fSemigroupCallGraph$fNullCallGraph$fCombineNewOldGraph$fCombineNewOldFavorites$fShowCallGraph$fCombineNewOldCMSet terminatesterminatesFilterendos idempotent LexPredicate LexAction TokenLength CurrentInput PreviousInput AlexInput lexSrcFilelexPoslexInput lexPrevChar lensLexInputalexInputPrevChar alexGetChar alexGetByte getLexInput setLexInput.&&..||.not' LookAheadgetInputsetInputnextCharsyncrollback eatNextCharmatchmatch' runLookAhead$fMonadLookAhead$fFunctorLookAhead$fApplicativeLookAhead litStringlitCharinStateeof followedByliteral identifiersymbolkeywordend_begin_endWith beginWithbegin withLayout withInterval' withIntervallexToken emptyLayoutnewLayoutContext offsideRule keepComments keepCommentsM nestedCommenthole skipBlock AlexReturnAlexEOF AlexErrorAlexSkip AlexTokennormallayout empty_layoutbolimp_dirlexercode alexScanUser tokensParser exprParserexprWhereParser moduleParsermoduleNameParser splitOnDots$fEqRecordDirective$fShowRecordDirective$fShowRHSOrTypeSigs withInterval_end openBrace closeBraceTermSizetermSizetsize IsProjElim isProjElimSuggestsuggestSgTelsgTel TelToArgs telToArgsListTelListTel' EqualityView EqualityType OtherTypeeqtSorteqtName eqtParamseqtTypeeqtLhseqtRhsPatternSubstitution Substitution Substitution'IdSEmptyS:# StrengthenWk PatternVars patternVarsConPatternInfo conPRecordconPTypeDeBruijnPatternDBPatVar dbPatVarName dbPatVarIndexPattern' PatVarNameclauseLHSRangeclauseFullRange clauseTelnamedClausePats clauseBody clauseTypeclauseCatchallclauseUnreachableBlocked_ NotBlockedtheBlockingMetaignoreBlockingblockingStatusStuckOn Underapplied AbsurdMatchMissingClausesReallyNotBlocked LevelAtom MetaLevel BlockedLevel NeutralLevelUnreducedLevel PlusLevel ClosedLevelMaxInfSizeUnivDLubTeleEmptyTel ExtendTelLensSortlensSortgetSortType'El_getSortunElNoAbsabsNameunAbsArgNameProjConInfoMetaVShared LensConName getConName setConName mapConNameConHeadconName conInductive conFields NamedArgsargNameToStringstringToArgNameappendArgNames nameToArgNamestuckOn clausePatspatVarNameToStringnameToPatVarNamevarP namedVarP namedDBVarPnoConPatternInfotoConPatternInfofromConPatternInfoproperlyMatchingisEqualityType absurdBody isAbsurdBodyabsurdPatternNameisAbsurdPatternName ignoreSharingignoreSharingTypeshared_updateSharedFM updateSharedM updateShared pointerChaincompressPointerChainvar typeDontCaretopSortsortvarSortsSuclevelSucmkTypeisSortimpossibleTermhackReifyToMetaisHackReifyToMeta mapAbsNamesM mapAbsNamesreplaceEmptyName telFromList' telFromList telToList blockingMetablocked notBlocked stripDontCarearitynotInScopeNameunSpineunSpine'hasElims argFromElim isApplyElim allApplyElimssplitApplyElims dropProjElims argsFromElims allProjElims$fKillRangeConHead$fHasRangeConHead$fPrettyConHead $fOrdConHead $fEqConHead$fLensConNameConHead$fSetRangeConHead$fKillRangeElim'$fLensOriginElim'$fKillRangeAbs $fSizedAbs$fDecorationAbs$fKillRangeTele $fSizedTele $fNullTele$fKillRangeSort$fKillRangeType'$fKillRangeLevelAtom$fKillRangePlusLevel$fKillRangeLevel$fKillRangeTerm$fMonoidNotBlocked$fSemigroupNotBlocked$fDecorationType' $fLensSortAbs $fLensSortDom$fLensSortType'$fKillRangeBlocked$fApplicativeBlocked$fMonoidBlocked$fSemigroupBlocked$fKillRangeDBPatVar$fKillRangeConPatternInfo$fKillRangePattern'$fIsProjPPattern'$fKillRangeClause $fNullClause$fHasRangeClause$fPatternVarsa[]$fPatternVarsaArg$fPatternVarsaArg0$fNullSubstitution'$fKillRangeSubstitution'$fTelToArgsTele $fTelToArgs[] $fSgTelDom $fSgTelDom0 $fSgTel(,)$fSuggestNameAbs$fSuggest[]Abs$fSuggestAbsAbs $fSuggest[][]$fIsProjElimElim'$fTermSizeSubstitution'$fTermSizeLevelAtom$fTermSizePlusLevel$fTermSizeLevel$fTermSizeSort$fTermSizeTerm $fTermSizet $fDataConHead $fShowConHead $fDataElim'$fFunctorElim'$fFoldableElim'$fTraversableElim' $fDataAbs $fFunctorAbs $fFoldableAbs$fTraversableAbs $fDataTele $fShowTele $fFunctorTele$fFoldableTele$fTraversableTele$fShowNotBlocked$fDataNotBlocked $fDataTerm $fShowLevel $fDataLevel$fShowPlusLevel$fDataPlusLevel$fShowLevelAtom$fDataLevelAtom $fDataSort $fDataType' $fShowType'$fFunctorType'$fFoldableType'$fTraversableType' $fShowBlocked$fFunctorBlocked$fFoldableBlocked$fTraversableBlocked$fDataDBPatVar$fShowDBPatVar$fDataConPatternInfo$fShowConPatternInfo$fDataPattern'$fShowPattern'$fFunctorPattern'$fFoldablePattern'$fTraversablePattern' $fDataClause$fShowSubstitution'$fFunctorSubstitution'$fFoldableSubstitution'$fTraversableSubstitution'$fDataSubstitution'$fUniverseBi(,)Pattern'$fUniverseBi[]Pattern'$fUniverseBi[]Pattern'0$fUniverseBi(,)Term$fUniverseBi[]Term$fUniverseBi[]Term0pDom $fNFDataElim'$fNFDataLevelAtom$fNFDataPlusLevel $fNFDataLevel $fNFDataSort $fNFDataType' $fNFDataTerm$fPrettyPattern'$fPrettyDBPatVar $fPrettyElim' $fPrettyType' $fPrettySort$fPrettyLevelAtom$fPrettyPlusLevel $fPrettyLevel $fPrettyTele$fPrettyClause $fPrettyTerm$fPrettySubstitution'$fUniverseBi[]Term1DeBruijn deBruijnVardebruijnNamedVar deBruijnView$fDeBruijnLevel$fDeBruijnPlusLevel$fDeBruijnLevelAtom$fDeBruijnTerm freeVars'FreeM SingleVarVariableFreeEnv feIgnoreSorts feFlexRig feRelevance feSingleton IgnoreSorts IgnoreNotIgnoreInAnnotations IgnoreAllVarMapIsVarSet withVarOccVarOcc varFlexRig varRelevanceFlexRigFlexible WeaklyRigid Unguarded StronglyRigidMetaSetcomposeFlexRig maxVarOcc topVarOcc botVarOcc composeVarOcc initFreeEnvrunFreeMvariablesubVarbindbind'gogoRelunderConstructor$fIsVarSetIntMap$fMonoidReaderT$fSemigroupReaderT$fFreeEqualityView $fFreeClause $fFreeTele $fFreeAbs $fFreeDom $fFreeArg $fFreeElim' $fFree(,) $fFreeMaybe$fFree[]$fFreeLevelAtom$fFreePlusLevel $fFreeLevel $fFreeSort $fFreeType' $fFreeTerm $fEqFlexRig $fOrdFlexRig $fShowFlexRig $fEqVarOcc $fShowVarOcc$fEqIgnoreSorts$fShowIgnoreSorts NoOccurrence IrrelevantlyFVstronglyRigidVars unguardedVarsweaklyRigidVars flexibleVarsirrelevantVars unusedVars rigidVars relevantVarsallVars occurrencerunFreefreeInfreeInIgnoringSortsrelevantInIgnoringSortAnn relevantIn isBinderUsedclosed allFreeVarsallRelevantVarsIgnoringallRelevantVars $fIsVarSetAll $fIsVarSetAny $fIsVarSet[]$fIsVarSetIntSet$fIsVarSetFreeVars$fSingletonIntFreeVars$fMonoidFreeVars$fSemigroupFreeVars$fNullFreeVars$fIsVarSetRelevantIn $fEqFreeVars$fShowFreeVars$fSemigroupRelevantIn$fMonoidRelevantInSubst applySubstabstractapplyEapplysapply1raise raiseFrom strengthen substUnderidSwkSraiseSconsS singletonSinplaceSdropScomposeSsplitS++#prependS parallelScompactS strengthenSlookupSabsApp lazyAbsAppnoabsAppabsBodymkAbsreAbsunderAbs underLambdas$fSubstTermQNameSplitTreeLabellblConstructorName lblSplitArg lblBindings SplitTrees' SplitTree' SplittingDoneSplitAt splitBindingssplitArg splitTrees SplitTrees SplitTreetoTreetoTrees$fPrettySplitTree'$fPrettySplitTreeLabelTermLike traverseTermMcopyTerm$fTermLikeEqualityView$fTermLikeType'$fTermLikeLevelAtom$fTermLikePlusLevel$fTermLikeLevel$fTermLikeTerm$fTermLike(,,,)$fTermLike(,,) $fTermLike(,)$fTermLikeBlocked $fTermLikePtr $fTermLikeAbs$fTermLikeMaybe $fTermLike[] $fTermLikeDom $fTermLikeArg$fTermLikeElim'$fTermLikeQName$fTermLikeChar$fTermLikeInteger $fTermLikeInt$fTermLikeBoolCompiledClausesCompiledClauses'DoneFailBranches projPatterns conBranches litBranchescatchAllBranch WithAritycontentlitCaseconCaseprojCasecatchAll hasCatchAll prettyMap$fTermLikeWithArity$fKillRangeWithArity$fPrettyWithArity$fMonoidWithArity$fSemigroupWithArity$fTermLikeCase$fKillRangeCase $fPrettyCase $fNullCase $fMonoidCase$fSemigroupCase$fTermLikeCompiledClauses'$fKillRangeCompiledClauses'$fPrettyCompiledClauses'$fDataWithArity$fFunctorWithArity$fFoldableWithArity$fTraversableWithArity$fShowWithArity $fDataCase $fFunctorCase$fFoldableCase$fTraversableCase $fShowCase$fDataCompiledClauses'$fFunctorCompiledClauses'$fTraversableCompiledClauses'$fFoldableCompiledClauses'$fShowCompiledClauses'GetDefsgetDefs MonadGetDefsdoDefdoMeta GetDefsEnv lookupMetaembDefGetDefsMgetDefs' $fGetDefs(,) $fGetDefsAbs $fGetDefsDom $fGetDefsArg$fGetDefsElim' $fGetDefs[]$fGetDefsMaybe$fGetDefsLevelAtom$fGetDefsPlusLevel$fGetDefsLevel $fGetDefsSort$fGetDefsType'$fGetDefsMetaId $fGetDefsTerm$fGetDefsClause$fMonadGetDefsReaderTMaybePostfixProjPmaybePostfixProjPPatternsDefP PatternSynP LHSToSpine lhsToSpine spineToLhsLHSCore'lhsInfolhsCore lhsWithPatsSpineLHS spLhsInfo spLhsDefName spLhsPats spLhsWithPatsWithRHS RewriteRHSrhsExpr rhsConcrete rewriteExprs rewriteRHSrewriteWhereDecls SpineClauseClause' clauseLHSclauseNamedDotsclauseStrippedDots clauseRHSclauseWhereDeclsStrippedDotPattern StrippedDotNamedDotPatternNamedDot LetBindingLetBind LetPatBindLetApplyLetOpenLetDeclaredVariableBuiltinNoDefPragma GetDefInfo getDefInfoSectionRecSigRecDef PatternSynDef ScopedDecl ScopeCopyInfo renModulesrenNamesRenFunSigNoFunSig RecordAssigns RecordAssignAssignsAssign ScopedExpr initCopyInfolhsCoreToSpinespineToLhsCore lhsCoreApplhsCoreAddSpinelhsCoreAllPatternslhsCoreToPattern mapLHSHead$fKillRangeScopeCopyInfo$fPrettyScopeCopyInfo$fKillRangeNamedDotPattern$fEqNamedDotPattern$fLHSToSpine[][]$fSetRangePattern'$fHasRangePattern'$fKillRangeLHSCore'$fHasRangeLHSCore'$fKillRangeLetBinding$fKillRangeRHS$fKillRangeStrippedDotPattern$fKillRangeClause'$fKillRangeTypedBinding$fKillRangeTypedBindings$fKillRangeLamBinding$fHasRangeLetBinding $fHasRangeRHS$fHasRangeClause'$fHasRangeTypedBinding$fHasRangeTypedBindings$fHasRangeLamBinding$fLensHidingLamBinding$fLensHidingTypedBindings$fUnderscoreExpr$fEqDeclaration$fEqExpr $fIsProjPExpr$fEqLHS$fEqRHS$fEqStrippedDotPattern$fGetDefInfoDeclaration$fKillRangeSpineLHS$fHasRangeSpineLHS$fLHSToSpineLHSSpineLHS$fLHSToSpineClause'Clause'$fMaybePostfixProjPNamed$fMaybePostfixProjPArg$fMaybePostfixProjPPattern' $fDataAxiom $fEqAxiom $fOrdAxiom $fShowAxiom$fEqScopeCopyInfo$fShowScopeCopyInfo$fDataScopeCopyInfo$fDataNamedDotPattern$fShowNamedDotPattern $fEqPattern'$fDataLHSCore'$fShowLHSCore'$fFunctorLHSCore'$fFoldableLHSCore'$fTraversableLHSCore' $fEqLHSCore' $fDataClause' $fShowClause'$fFunctorClause'$fFoldableClause'$fTraversableClause' $fEqClause' $fDataRHS $fShowRHS$fDataTypedBindings$fShowTypedBindings$fEqTypedBindings$fDataTypedBinding$fShowTypedBinding$fEqTypedBinding$fDataLetBinding$fShowLetBinding$fEqLetBinding$fEqModuleApplication$fDataLamBinding$fShowLamBinding$fEqLamBinding $fEqPragma$fDataStrippedDotPattern$fShowStrippedDotPattern$fDataSpineLHS$fShowSpineLHS $fEqSpineLHS$fUniverseBiDeclarationQName%$fUniverseBiDeclarationAmbiguousQName$fUniverseBiDeclarationExpr!$fUniverseBiDeclarationLetBinding!$fUniverseBiDeclarationLamBinding#$fUniverseBiDeclarationTypedBinding$fUniverseBiDeclarationPattern' $fUniverseBiDeclarationPattern'0"$fUniverseBiDeclarationDeclaration!$fUniverseBiDeclarationModuleName!$fUniverseBiDeclarationModuleInfo SubstExpr substExprPatternSynDefnsPatternSynDefn AnyAbstract anyAbstractAllNamesallNames axiomNamenameExprapp patternToExprlambdaLiftExpr substPatterninsertImplicitPatSynArgs$fUniverseBiDeclarationRanged$fAllNamesModuleApplication$fAllNamesLetBinding$fAllNamesTypedBinding$fAllNamesTypedBindings$fAllNamesLamBinding$fAllNamesExpr $fAllNamesRHS$fAllNamesClause'$fAllNamesDeclaration$fAllNamesQName $fAllNames(,)$fAllNamesNamed $fAllNamesArg$fAllNamesMaybe $fAllNames[]$fAnyAbstractDeclaration$fAnyAbstract[]$fSubstExprTypedBinding$fSubstExprTypedBindings$fSubstExprLetBinding$fSubstExprExpr$fSubstExprFieldAssignment'$fSubstExprModuleName$fSubstExprName$fSubstExprEither$fSubstExpr(,)$fSubstExprNamed$fSubstExprArg $fSubstExpr[] PatternLike foldrPatterntraversePatternM MapNamedArg mapNamedArg LabelPatVars labelPatVarsunlabelPatVarsFunArityfunArity clauseArgs clauseElimsunnumberPatVars dbPatPerm dbPatPerm' clausePerm patternToElimpatternsToElims patternToTerm foldPatternpreTraversePatternMpostTraversePatternM $fFunArity[]$fFunArityClause $fFunArity[]0!$fLabelPatVarsPattern'Pattern'Int$fLabelPatVars[][]i$fLabelPatVarsNamedNamedi$fLabelPatVarsArgArgi$fMapNamedArgPattern'$fPatternLikeaNamed$fPatternLikeaArg$fPatternLikea[]$fPatternLikeaPattern' recurseExprLamView ApplicationmaybeProjTurnPostfix unAppViewlamViewasViewisSetunScope deepUnscopedeepUnscopeDeclsdeepUnscopeDecl$fExprLikeSpineLHS$fExprLikeLHSCore'$fExprLikePragma $fExprLikeRHS$fExprLikeClause'$fExprLikePattern'$fExprLikeLetBinding$fExprLikeTypedBinding$fExprLikeTypedBindings$fExprLikeLamBinding$fExprLikeModuleName$fExprLikeVoid APatternLike foldrAPatterntraverseAPatternMMapNamedArgPatternmapNamedArgPatternNAP foldAPatternpreTraverseAPatternMpostTraverseAPatternMcontainsAPatterncontainsAbsurdPatterncontainsAsPattern$fMapNamedArgPatternMaybe$$fMapNamedArgPatternFieldAssignment'$fMapNamedArgPattern[]$fMapNamedArgPatternArg$fAPatternLikeaFieldAssignment'$fAPatternLikeaMaybe$fAPatternLikea[]$fAPatternLikeaNamed$fAPatternLikeaArg$fAPatternLikeaPattern' Constant1 Constant0Curryinguncurryscurrys CoDomain'CoDomainDomains'DomainsIsBaseProductsArrowsConstantConsMap1ConsMap0MapFoldr'Foldr $fCurrying:b $fCurrying[]bUpdater2updater2updates2update2Updater1updater1updates1update1ChangeUpdater MonadChange tellDirty listenDirty runChange runUpdaterdirtyifDirtysharing$fMonadChangeIdentity$fMonadChangeChangeT$fMonadChangeChange $fUpdater1[]$fUpdater1Maybe$fUpdater2Either $fUpdater2(,)$fFunctorChangeT$fApplicativeChangeT$fMonadChangeT$fMonadTransChangeT$fFunctorChange$fApplicativeChange $fMonadChangeNiceDeclarationWarningUnknownNamesInFixityDeclUnknownNamesInPolarityPragmasPolarityPragmasButNotPostulatesUselessPrivateUselessAbstractUselessInstanceDeclarationExceptionMultipleFixityDeclsMultiplePolarityPragmas InvalidNameDuplicateDefinitionMissingDefinitionMissingWithClausesMissingTypeSignatureMissingDataSignatureWrongDefinitionWrongParametersNotAllowedInMutualCodataDeclarationPanicWrongContentBlockAmbiguousFunClausesInvalidTerminationCheckPragmaInvalidMeasureMutualPragmaNoTerminationCheckInvalidCatchallPragmaUnquoteDefRequiresSignature BadMacroDefInvalidNoPositivityCheckPragmaNiceTypeSignatureNiceConstructorMeasureNiceDeclaration NiceFieldPrimitiveFunction NiceMutual NiceModuleNiceModuleMacroNiceOpen NiceImport NicePragma NiceRecSig NiceDataSig NiceFunClauseNicePatternSynNiceUnquoteDeclNiceUnquoteDefrunNiceniceDeclarationsnotSoNiceDeclarationsniceHasAbstract$fHasRangeNiceDeclaration$fPrettyDeclarationWarning$fHasRangeDeclarationWarning$fShowDataRecOrFun$fEqDataRecOrFun$fPrettyDeclarationException$fHasRangeDeclarationException $fMonoidNice$fSemigroupNice$$fMonadErrorDeclarationExceptionNice$fMonadStateNiceEnvNice $fMonadNice$fApplicativeNice $fFunctorNice$fMakeAbstractWhereClause'$fMakeAbstractClause$fMakeAbstractNiceDeclaration$fMakeAbstractIsAbstract$fMakeAbstract[]$fMakePrivateWhereClause'$fMakePrivateClause$fMakePrivateNiceDeclaration$fMakePrivateAccess$fMakePrivate[]$fDataNiceDeclaration$fShowNiceDeclaration$fDataDeclarationWarning$fShowDeclarationWarning$fDataKindOfBlock$fEqKindOfBlock$fOrdKindOfBlock$fShowKindOfBlock $fEqInMutual$fShowInMutual$fDataDataRecOrFun$fDataDeclarationException$fShowDeclarationException $fEqDeclKind$fShowDeclKindPMunPMrunPMIO parseFile' $fFunctorPM$fApplicativePM $fMonadPM$fMonadErrorPM $fMonadIOPMVarSetsubtractfreeVarsIgnorefreeInIgnoringSortAnnSizeVar SizeConst LegendMatrixmatrixrowdescrcoldescrGM flexScopenodeMapintMapnextNode ConstraintsNewFlexArcNodeIdRConstRVarFiniteInfiniteAdjListwarshall warshallGincinfiniteisBelowemptyConstraints initGraphaddFlexaddNode addConstraint buildGraphmkMatrixextendSolution sizeRigidsolve$fSemiRingWeight$fShowConstraint$fShowLegendMatrix$fShowSizeExprversionversionWithCommitInfo commitInfoLibM VersionViewvvBase vvNumbersgetDefaultLibrariesgetInstalledLibrarieslibraryIncludePathsfindLib' versionView unVersionView$fEqVersionView$fShowVersionView$fShowLibErrorcopyDirContentFlagOptM PragmaOptionsoptShowImplicitoptShowIrrelevant optVerboseoptProofIrrelevanceoptAllowUnsolvedoptDisablePositivityoptTerminationCheckoptTerminationDepthoptCompletenessCheckoptUniverseCheck optSizedTypesoptInjectiveTypeConstructorsoptGuardingTypeConstructorsoptUniversePolymorphismoptIrrelevantProjectionsoptExperimentalIrrelevance optWithoutK optCopatternsoptPatternMatching optExactSplitoptEta optRewritingoptPostfixProjectionsoptInstanceSearchDepthoptSafeoptWarningModeoptCompileNoMainCommandLineOptionsOptionsoptProgramName optInputFileoptIncludePathsoptAbsoluteIncludePaths optLibrariesoptOverrideLibrariesFileoptDefaultLibs optUseLibsoptShowVersion optShowHelpoptInteractiveoptGHCiInteractionoptOptimSmashing optCompileDiroptGenerateVimFileoptGenerateLaTeXoptGenerateHTMLoptDependencyGraph optLaTeXDiroptCountClusters optHTMLDir optCSSFileoptIgnoreInterfaces optForcingoptPragmaOptions optSharing optCachingoptOnlyScopeChecking WarningMode LeaveAloneTurnIntoErrorsIgnoreAllWarnings IgnoreFlags RespectFlags Verbosity isLiteratemapFlagdefaultVerbositydefaultInteractionOptionsdefaultOptionsdefaultPragmaOptions defaultCutOffrunOptM checkOptsunsafePragmaOptions inputFlagstandardOptionsstandardOptions_ getOptSimpleparseStandardOptionsparseStandardOptions'parsePragmaOptionsparsePluginOptionsusage defaultLibDir$fEqIgnoreFlags$fShowWarningMode$fEqWarningMode$fShowPragmaOptions$fEqPragmaOptions$fShowCommandLineOptionsIMMonadTCMliftTCMReduceM unReduceM ReduceEnvredEnvredSt HasOptions pragmaOptionscommandLineOptionsTCErr TypeError Exception IOException PatternErr tcErrState tcErrClosErr LHSOrPatSynIsLHSIsPatSyn InternalErrorNotImplemented NotSupportedCompilationErrorTerminationCheckFailedPropMustBeSingletonDataMustEndInSort#ShouldEndInApplicationOfTheDatatype&ShouldBeAppliedToTheDatatypeParametersShouldBeApplicationOf!ConstructorPatternInWrongDatatype6CantResolveOverloadedConstructorsTargetingSameDatatypeDoesNotConstructAnElementOfDifferentAritiesWrongHidingInLHSWrongHidingInLambdaWrongHidingInApplicationWrongNamedArgumentWrongIrrelevanceInLambdaWrongInstanceDeclarationHidingMismatchRelevanceMismatchUninstantiatedDotPatternIlltypedPatternIllformedProjectionPatternCannotEliminateWithPatternTooManyArgumentsInLHS!WrongNumberOfConstructorArguments ShouldBeEmpty ShouldBeASort ShouldBePiShouldBeRecordTypeShouldBeRecordPatternNotAProjectionPatternNotAProperTermSetOmegaNotValidTypeInvalidTypeSort InvalidTypeFunctionTypeInSizeUnivSplitOnIrrelevantDefinitionIsIrrelevantVariableIsIrrelevant UnequalTerms UnequalTypesUnequalRelevance UnequalHiding UnequalSorts UnequalBecauseOfUniverseConflict NotLeqSortMetaCannotDependOnMetaOccursInItself GenericErrorGenericDocErrorBuiltinMustBeConstructorNoSuchBuiltinNameDuplicateBuiltinBindingNoBindingForBuiltinNoSuchPrimitiveFunctionShadowedModuleBuiltinInParameterisedModuleIllegalLetInTelescopeNoRHSRequiresAbsurdPatternAbsurdPatternRequiresNoRHS TooFewFields TooManyFieldsDuplicateFieldsDuplicateConstructorsWithOnFreeVariableUnexpectedWithPatternsWithClausePatternMismatchFieldOutsideRecordModuleArityMismatch SplitErrorImpossibleConstructorTooManyPolaritiesLocalVsImportedModuleClashSolvedButOpenHolesCyclicModuleDependency FileNotFoundOverlappingProjectsAmbiguousTopLevelModuleNameModuleNameUnexpectedModuleNameDoesntMatchFileNameClashingFileNamesForModuleDefinedInOtherFileBothWithAndRHSAbstractConstructorNotInScope NotInScope NoSuchModule AmbiguousNameAmbiguousModuleUninstantiatedModuleClashingDefinitionClashingModuleClashingImportClashingModuleImportPatternShadowsConstructorModuleDoesntExportDuplicateImportsInvalidPatternRepeatedVariablesInPatternNotAModuleExprNotAnExpressionNotAValidLetBindingNotValidBeforeFieldNothingAppliedToHiddenArgNothingAppliedToInstanceArgBadArgumentsToPatternSynonymTooFewArgumentsToPatternSynonymUnusedVariableInPatternSynonymNoParseForApplicationAmbiguousParseForApplication NoParseForLHSAmbiguousParseForLHSOperatorInformationIFSNoCandidateInScope UnquoteFailedDeBruijnIndexOutOfScopeNeedOptionCopatternsNeedOptionRewritingNonFatalErrorsInstanceSearchDepthExhausted UnquoteError BadVisibilityConInsteadOfDefDefInsteadOfCon NonCanonical BlockedOnMeta UnquotePanicUnificationFailureUnifyIndicesNotVarsUnifyRecursiveEqUnifyReflexiveEqNegativeUnification UnifyConflict UnifyCycle NotADatatypeIrrelevantDatatypeCoinductiveDatatypeUnificationStuckGenericSplitErrorcantSplitConName cantSplitTelcantSplitConIdxcantSplitGivenIdxcantSplitFailuresTerminationErrortermErrFunctions termErrCallsCallInfocallInfoTarget callInfoRange callInfoCall TCWarningtcWarningRange tcWarningtcWarningPrintedWarningWarning NicifierIssueTerminationIssueUnreachableClauses CoverageIssueCoverageNoExactSplitNotStrictlyPositiveUnsolvedMetaVariablesUnsolvedInteractionMetasUnsolvedConstraints OldBuiltinEmptyRewritePragma UselessPublic UselessInlineGenericWarningGenericNonFatalErrorSafeFlagPostulateSafeFlagPragmaSafeFlagNonTerminatingSafeFlagTerminatingSafeFlagPrimTrustMeSafeFlagNoPositivityCheckSafeFlagPolarityDeprecationWarning Candidate candidateTerm candidateType candidateEticandidateOverlappableExplicitToInstanceExplicitStayExplicit ExpandHidden ExpandLastDontExpandLast AbstractMode ConcreteModeIgnoreAbstractMode LetBindingsCtxId ContextEntryctxIdctxEntryContext UnquoteFlags_unquoteNormalise envContextenvLetBindingsenvCurrentModuleenvCurrentPathenvAnonymousModules envImportPathenvMutualBlockenvTerminationCheckenvSolvingConstraintsenvCheckingWhereenvAssignMetasenvActiveProblemsenvAbstractMode envRelevanceenvDisplayFormsEnabledenvRangeenvHighlightingRange envClauseenvCallenvHighlightingLevelenvHighlightingMethodenvModuleNestingLevelenvAllowDestructiveUpdate envExpandLast envAppDefenvSimplificationenvAllowedReductionsenvCompareBlockedenvPrintDomainFreePienvPrintMetasBareenvInsideDotPatternenvUnquoteFlagsenvInstanceDepthModuleParamDictModuleParameters ModuleParamsmpSubstitutionDirectIndirectHighlightingLevelNoneNonInteractive InteractiveBuiltinPrim BuiltinThings BuiltinInfo builtinName builtinDescBuiltinDescriptor BuiltinDataBuiltinDataCons BuiltinPrimBuiltinPostulateBuiltinUnknownTempInstanceTable InstanceTable CheckClause CheckPatternCheckLetBinding InferExpr CheckExprCallCheckDotPatternCheckPatternShadowingCheckProjection IsTypeCallIsType_InferVarInferDefCheckArguments CheckDataDef CheckRecDefCheckConstructor CheckFunDef CheckPragmaCheckPrimitive CheckIsEmptyCheckWithFunctionTypeCheckSectionApplicationScopeCheckExprScopeCheckDeclaration ScopeCheckLHSNoHighlightingModuleContents StatisticsMutualIdMutIdTermHeadSortHeadPiHeadConsHeadFunctionInverse' NotInjectiveInverseFunctionInversePrimFun primFunName primFunArityprimFunImplementationAllowedReductionsAllowedReductionProjectionReductionsInlineReductionsCopatternReductionsFunctionReductionsRecursiveReductionsLevelReductionsUnconfirmedReductionsNonTerminatingReductionsMaybeReducedElimsMaybeReducedArgs MaybeReducedMaybeRed isReduced ignoreReduced IsReduced NotReducedReduced NoReduction YesReductionSimplificationYesSimplificationNoSimplificationFieldsDefn AbstractDefn funClauses funCompiled funTreelessfunInv funMutualfunAbstr funDelayed funProjectionfunFlags funTerminates funExtLamfunWithfunCopatternLHSdataPars dataSmallParsdataNonLinParsdataIxs dataInduction dataClausedataConsdataSort dataMutual dataAbstrrecPars recClause recConHead recNamedCon recFieldsrecTel recMutualrecEtaEquality' recInductionrecAbstrconParsconArity conSrcConconDataconAbstrconInd conErased primAbstrprimName primClauses primCompiled FunctionFlag FunStatic FunInlineFunMacro EtaEquality SpecifiedInferredProjLams getProjLams Projection projProperprojOrig projFromType projIndexprojLams ExtLamInfoextLamNumHiddenextLamNumNonHidCompiledRepresentation BackendNameCompilerPragma Covariant Contravariant Invariant Nonvariant defArgInfodefNamedefType defPolaritydefArgOccurrences defDisplay defMutualdefCompiledRepdefCopy defMatchable defInjectivetheDef RewriteRulerewName rewContextrewHeadrewPatsrewRHSrewType RewriteRulesNLPType nlpTypeLevel nlpTypeUnElPElimsNLPatPWildPDefPLamPPi PBoundVarPTerm DisplayTermDWithAppDConDDefDDotDTermLocalDisplayForm DisplayFormDisplay dfFreeVarsdfPatsdfRHS _secTelescope DisplayFormsRewriteRuleMap DefinitionsSections SignatureSig _sigSections_sigDefinitions_sigRewriteRulesIPClause IPNoClauseipcQName ipcClauseNo ipcClauseInteractionPointsInteractionPointipRangeipMetaipSolvedipClause MetaStore NamedMeta nmSuggestionnmidMetaNameSuggestion miClosRangemiMetaOccursCheckmiNameSuggestionRunMetaOccursCheckDontRunMetaOccursCheck MetaPriorityTypeCheckingProblem CheckExpr CheckArgs CheckLambda UnquoteTacticMetaInstantiationInstVOpenIFS BlockedConstPostponedTypeCheckingProblemFrozen InstantiableListener EtaExpandCheckConstraint MetaVariableMetaVarmvInfo mvPriority mvPermutation mvJudgementmvInstantiation mvListenersmvFrozen JudgementHasTypeIsSortjMetaId jMetaType OpenThingopenThingCtxIds openThingCompareDirectionDirEqDirLeqDirGeq ComparisonCmpEqCmpLeqValueCmpElimCmpTypeCmpTelCmpSortCmpLevelCmpUnBlockGuardedIsEmptyCheckSizeLtSat FindInScopeProblemConstraintPConstrconstraintProblems theConstraintClosure clSignatureclEnvclScopeclModuleParametersclValue Interface iSourceHashiImportedModules iModuleNameiScope iInsideScope iSignature iDisplayFormsiBuiltin iForeignCode iHighlightingiPragmaOptions iPatternSyns iWarnings ForeignCodeDecodedModulesVisitedModules miInterface miWarningsSourceToModule FreshName freshName_ ProblemIdHasFresh freshLens nextFresh'TypeCheckAction EnterSection LeaveSectionPragmasCurrentTypeCheckLogCachedTypeCheckLogLoadedFileCache lfcCached lfcCurrentPersistentTCStatePersistentTCStstDecodedModulesstPersistentOptionsstInteractionOutputCallback stBenchmarkstAccumStatisticsstLoadedFileCachestPersistBackends MutualBlock mutualInfo mutualNamesPostScopeStatestPostSyntaxInfostPostDisambiguatedNamesstPostMetaStorestPostInteractionPointsstPostAwakeConstraintsstPostSleepingConstraints stPostDirtystPostOccursCheckDefsstPostSignaturestPostModuleParametersstPostImportsDisplayFormsstPostCurrentModulestPostInstanceDefsstPostStatisticsstPostTCWarningsstPostMutualBlocksstPostLocalBuiltinsstPostFreshMetaIdstPostFreshMutualIdstPostFreshCtxIdstPostFreshProblemIdstPostFreshIntstPostFreshNameIdDisambiguatedNames PreScopeState stPreTokens stPreImportsstPreImportedModulesstPreModuleToSourcestPreVisitedModules stPreScopestPrePatternSynsstPrePatternSynImportsstPrePragmaOptionsstPreImportedBuiltinsstPreImportedDisplayFormsstPreImportedInstanceDefsstPreForeignCodestPreFreshInteractionId ReadTCState getTCStateTCStstPreScopeStatestPostScopeStatestPersistentStateinitPersistentStateinitPreScopeStateinitPostScopeStatestTokens stImportsstImportedModulesstModuleToSourcestVisitedModulesstScope stPatternSynsstPatternSynImportsstPragmaOptionsstImportedBuiltins stForeignCodestFreshInteractionId stBackends stFreshNameId stSyntaxInfostDisambiguatedNames stMetaStorestInteractionPointsstAwakeConstraintsstSleepingConstraintsstDirtystOccursCheckDefs stSignaturestModuleParametersstImportsDisplayFormsstImportedDisplayFormsstCurrentModulestImportedInstanceDefsstInstanceDefs stStatistics stTCWarningsstMutualBlocksstLocalBuiltins stFreshMetaIdstFreshMutualId stFreshCtxIdstFreshProblemId stFreshIntstBuiltinThings nextFreshfresh freshName freshNoName freshNoName_sourceToModulelookupModuleFromSource iFullHash buildClosurefromCmpflipCmpdirToCmpisGlobalnormalMetaPrioritylowMetaPriorityhighMetaPriority getMetaInfo getMetaScope getMetaEnv getMetaSiggetMetaRelevance sigSectionssigDefinitionssigRewriteRules secTelescopeemptySignaturedefaultDisplayForm defRelevance theDefLens defaultDefn jsBackendNameghcBackendNameuhcBackendName noCompiledRep projDropPars projArgInfoetaEqualityToBoolsetEtaEquality recRecursiverecEtaEquality emptyFunctionfunFlag funStatic funInlinefunMacroisMacroisEmptyFunctionisCopatternLHSrecCon defIsRecorddefIsDataOrRecorddefConstructors notReducedreduced allReductions defClauses defCompiled defParametersdefCompilerPragmas defDelayeddefNonterminatingdefTerminationUnconfirmed"ifTopLevelAndHighlightingLevelIsOr ifTopLevelAndHighlightingLevelIsdefaultModuleParametersinitEnvdisableDestructiveUpdatedefaultUnquoteFlagsunquoteNormaliseeUnquoteNormaliseeContext eLetBindingseCurrentModule eCurrentPatheAnonymousModules eImportPath eMutualBlockeTerminationCheckeSolvingConstraintseCheckingWhere eAssignMetaseActiveProblems eAbstractMode eRelevanceeDisplayFormsEnabledeRangeeHighlightingRangeeCalleHighlightingLeveleHighlightingMethodeModuleNestingLeveleAllowDestructiveUpdate eExpandLasteAppDefeSimplificationeAllowedReductionseCompareBlockedePrintDomainFreePieInsideDotPattern eUnquoteFlagseInstanceDepth aDefToMode aModeToDeftcWarningOriginequalHeadConstructorsgetPartialDefs mapRedEnvmapRedSt mapRedEnvSt fmapReduceapReduce bindReduce runReduceM runReduceFrunIM catchError_finally_mapTCMTpureTCM returnTCMTbindTCMTthenTCMTfmapTCMTapTCMTpatternViolation internalError genericErrorgenericDocError typeError typeError_runTCM runTCMTop runTCMTop' runSafeTCMforkTCMextendedLambdaNameabsurdLambdaNameisAbsurdLambdaName$fPrettyComparison$fPrettyCompareDirection$fKillRangePolarity$fKillRangeExtLamInfo$fKillRangeEtaEquality$fKillRangeFunctionFlag$fMonoidSimplification$fSemigroupSimplification$fNullSimplification$fKillRangeMutualId$fKillRangeDisplayTerm$fKillRangeDisplayForm$fKillRangeLocal$fKillRangeOpen$fKillRangeProjLams$fKillRangeProjection$fKillRangeTermHead$fKillRangeFunctionInverse'$fKillRangeDefn$fKillRangeRewriteRule$fKillRangeNLPType$fKillRangeNLPat$fKillRangeCtxId$fKillRangeDefinition$fKillRangeSection$fKillRangeHashMap$fKillRangeHashMap0$fKillRangeMap0$fKillRangeSignature $fMonoidTCMT$fSemigroupTCMT $fNullTCMT$fMonadBenchPhaseTCMT$fApplicativeTCMT $fFunctorTCMT $fMonadTCMT$fMonadTransTCMT$fMonadStateTCStateTCMT$fMonadReaderTCEnvTCMT$fMonadReaderTCEnvReduceM$fMonadReduceM$fApplicativeReduceM$fFunctorReduceM$fAllNamesCallInfo$fPrettyCallInfo $fEqTCWarning$fHasRangeTCWarning$fFreeCandidate$fHasRangeCall $fPrettyCall$fPrettyTermHead$fIsProjElimMaybeReduced $fPrettyDefn$fPrettyDefinition$fHasRangeCompilerPragma$fPrettyDisplayTerm$fFreeDisplayTerm$fFreeDisplayForm$fPrettySection $fEqIPClause$fEqInteractionPoint$fSetRangeMetaVariable$fSetRangeMetaInfo$fHasRangeMetaVariable$fShowMetaInstantiation $fOrdListener $fEqListener$fShowJudgement$fDecorationLocal$fDecorationOpen$fTermLikeConstraint$fFreeConstraint$fHasRangeConstraint$fHasRangeProblemConstraint$fHasRangeClosure $fShowClosure$fPrettyInterface$fPrettyProblemId$fShowProblemId$fNullMutualBlock $fShowTCState$fHasOptionsWriterT$fHasOptionsStateT$fHasOptionsReaderT$fHasOptionsMaybeT$fHasOptionsListT$fHasOptionsExceptT$fHasOptionsTCMT$fPrettyNamedMeta $fFreshName()$fFreshNameRange' $fFreshName[]$fFreshName(,) $fMonadIOTCMT$fMonadErrorTCErrTCMT$fExceptionTCErr$fHasRangeTCErr $fShowTCErr $fErrorTCErr$fHasFreshProblemId $fHasFreshInt$fHasFreshCtxId$fHasFreshNameId$fHasFreshInteractionId$fHasFreshMutualId$fHasFreshMetaId$fReadTCStateTCMT$fReadTCStateReduceM$fMonadTCMWriterT$fMonadTCMExceptT$fMonadTCMListT$fMonadTCMMaybeT$fMonadTCMTCMT$fMonadErrorTCErrTCMT0$fEqComparison$fDataComparison$fShowComparison$fEqCompareDirection$fShowCompareDirection $fEqFrozen $fShowFrozen$fEqMetaPriority$fOrdMetaPriority$fShowMetaPriority$fEqRunMetaOccursCheck$fOrdRunMetaOccursCheck$fShowRunMetaOccursCheck$fDataPolarity$fShowPolarity$fDataExtLamInfo$fEqExtLamInfo$fOrdExtLamInfo$fShowExtLamInfo$fDataEtaEquality$fShowEtaEquality$fEqEtaEquality$fDataFunctionFlag$fEqFunctionFlag$fOrdFunctionFlag$fEnumFunctionFlag$fShowFunctionFlag$fDataSimplification$fEqSimplification$fShowSimplification$fFunctorReduced$fShowAllowedReduction$fEqAllowedReduction$fOrdAllowedReduction$fEnumAllowedReduction$fBoundedAllowedReduction$fDataAllowedReduction$fDataMutualId $fEqMutualId $fOrdMutualId$fShowMutualId $fNumMutualId$fEnumMutualId$fEqHighlightingLevel$fOrdHighlightingLevel$fShowHighlightingLevel$fReadHighlightingLevel$fDataHighlightingLevel$fEqHighlightingMethod$fShowHighlightingMethod$fReadHighlightingMethod$fDataHighlightingMethod$fDataUnquoteFlags$fDataAbstractMode$fShowAbstractMode$fEqAbstractMode$fEqExpandHidden$fDataExpandHidden$fEqExplicitToInstance$fShowExplicitToInstance$fDataExplicitToInstance$fEqLHSOrPatSyn$fShowLHSOrPatSyn $fDataTCEnv $fDataOpen $fShowOpen $fFunctorOpen$fFoldableOpen$fTraversableOpen $fDataCtxId $fEqCtxId $fOrdCtxId $fShowCtxId $fEnumCtxId $fRealCtxId$fIntegralCtxId $fNumCtxId$fShowInterface$fShowTCWarning $fShowWarning $fDataWarning$fDataTerminationError$fShowTerminationError$fDataCallInfo$fShowCallInfo $fDataClosure$fFunctorClosure$fFoldableClosure$fDataModuleParameters$fShowModuleParameters$fDataSignature$fShowSignature$fDataRewriteRule$fShowRewriteRule $fDataNLPat $fShowNLPat $fDataNLPType $fShowNLPType$fDataDefinition $fDataDefn $fShowDefn$fDataFunctionInverse'$fShowFunctionInverse'$fFunctorFunctionInverse'$fDataTermHead $fEqTermHead $fOrdTermHead$fShowTermHead$fDataProjection$fShowProjection$fDataProjLams$fShowProjLams$fNullProjLams$fDataCompilerPragma$fShowCompilerPragma$fEqCompilerPragma$fDataDisplayForm$fShowDisplayForm$fDataDisplayTerm$fShowDisplayTerm $fDataLocal $fShowLocal$fFunctorLocal$fFoldableLocal$fTraversableLocal $fDataSection $fShowSection$fDataProblemConstraint$fShowProblemConstraint$fDataConstraint$fShowCandidate$fDataCandidate$fDataProblemId $fEqProblemId$fOrdProblemId$fEnumProblemId$fRealProblemId$fIntegralProblemId$fNumProblemId $fShowBuiltin$fFunctorBuiltin$fFoldableBuiltin$fTraversableBuiltin$fShowForeignCode$fFunctorMaybeReduced$fDataIPClause$fShowMutualBlock$fEqMutualBlock$fDataContextEntry $fDataCall$fShowUnquoteError$fShowUnificationFailure$fShowNegativeUnification $fNullFields$fShowSplitError$fShowTypeError TeleNoAbs teleNoAbsTelVtheTeltheCoreTelView canProjectconAppdefApp argToDontCarepiApplytelVars namedTelVars abstractArgsrenaming renamingRrenamePapplyNLPatSubstfromPatternSubstitution applyPatSubstprojDropParsApplytelView' telView'UpTo bindsToTel' bindsToTelbindsWithHidingToTel'bindsWithHidingToTelmkPimkLamtelePi'telePitelePi_teleLamtypeArgsWithTelcompiledClauseBodyptssLubdLublvlViewlevelMaxsortTm levelSortlevelTm unLevelAtom $fOrdElim' $fEqElim'$fOrdAbs$fEqAbs $fOrdTerm$fEqTerm $fOrdType' $fEqType' $fEqLevelAtom$fOrdPlusLevel$fSubstPattern'Pattern'$fDeBruijnPattern'$fSubstTermEqualityView$fSubstTermCandidate $fSubstt(,,,) $fSubstt(,,) $fSubstt(,) $fSubstTerm() $fSubsttMap $fSubstt[] $fSubsttMaybe $fSubsttDom $fSubsttNamed $fSubsttArg $fSubsttAbs $fSubsttElim'$fSubstTermStrippedDotPattern$fSubstTermNamedDotPattern$fSubstTermModuleParameters$fSubstTermConstraint $fSubsttTele$fSubstTermDisplayTerm$fSubstTermDisplayForm$fSubsttBlocked$fSubstNLPatRewriteRule$fSubstNLPatNLPType$fSubstNLPatNLPat$fDeBruijnNLPat$fSubstTermPattern'$fSubstTermConPatternInfo $fSubstTerm[]$fSubstTermName$fSubstTermLevelAtom$fSubstTermPlusLevel$fSubstTermLevel$fSubstTermSort$fSubstTermType' $fSubsttPtr$fSubstTermTerm$fSubstaSubstitution'$fAbstractHashMap $fAbstractMap$fAbstractMaybe $fAbstract[]$fAbstractFunctionInverse'$fAbstractCase$fAbstractWithArity$fAbstractCompiledClauses'$fAbstractClause$fAbstractPrimFun$fAbstractDefn$fAbstractProjLams$fAbstractProjection $fAbstract[]0 $fAbstract[]1$fAbstractRewriteRule$fAbstractDefinition$fAbstractTele$fAbstractSort$fAbstractType'$fAbstractTerm$fAbstractPermutation$fApplyPermutation$fAbstractDrop $fApplyDrop $fApply(,,) $fApply(,)$fApplyHashMap $fApplyMap $fApplyMaybe$fApplyBlocked $fApply[]$fApplyDisplayTerm$fApplyFunctionInverse' $fApplyCase$fApplyWithArity$fApplyCompiledClauses' $fApplyClause$fApplyPrimFun $fApplyDefn$fApplyProjLams$fApplyProjection $fApply[]0 $fApply[]1 $fApply[]2$fApplyRewriteRule$fApplyDefinition $fApplyTele $fApplyPtr $fApplySort $fApplyTerm$fTeleNoAbsTele $fTeleNoAbs[] $fShowTelV $fFunctorTelV $fEqSection$fEqConstraint $fOrdTele$fEqTele $fEqCandidate $fOrdBlocked $fEqBlocked$fOrdNotBlocked$fEqNotBlocked$fOrdLevelAtom $fEqPlusLevel $fOrdLevel $fEqLevel $fOrdSort$fEqSort$fOrdSubstitution'$fEqSubstitution' $fOrdTelV$fEqTelVtelViewpiApplyMInSeqBinderHasFreeOccursSeqArg UnderLambdaonceinSeq underLambdaoccursIn$fSubstTTermTAlt$fSubstTTermTTerm$fDeBruijnTTerm$fMonoidOccurs$fSemigroupOccurs $fHasFree(,) $fHasFree[] $fHasFreeInt $fHasFreeTAlt$fHasFreeBinder$fHasFreeTTerm$fHasFreeInSeq$fEqUnderLambda$fOrdUnderLambda$fShowUnderLambda$fSemigroupUnderLambda$fMonoidUnderLambda $fEqSeqArg $fOrdSeqArg $fShowSeqArg$fSemigroupSeqArg$fMonoidSeqArg $fEqOccurs $fOrdOccurs $fShowOccurs convertGuards equalTerms caseToSeqrecoverAsPatterns $fShowAsPatVALUvaluN' valueArgsICODE icodeArgsEmbPrjicodeicod_valueStnodeEstringEbstringEintegerEdoubleEnodeMemomodFileincludesmkSharedMemoUDictnodeDstringDbstringDintegerDdoubleDtermDnameDqnameDnodeCstringCbstringCintegerCdoubleCtermCnameCqnameCstats collectStatsabsPathDQNameId FreshAndReusefarFreshfarReuse HashTablefarEmpty lensFresh lensReuseqnameId emptyDict malformed tickICode runGetStateicodeX icodeInteger icodeDouble icodeString icodeNode icodeMemovcaseicodeNicodeN'valuNvalueN$fICODE(->)False $fICODEtTrue$fVALU(->)False $fVALUtTrue unquoteTacticcheckPostponedLambdacheckArguments'checkArguments inferExpr checkExprisType_rewriteverifyBuiltinRewrite fastReduceeligibleForProjectionLikemakeProjection PrettyTCM prettyTCM$$<><+>sepfsephsepvcattext composePolcomputePolarity lookupSectioninFreshModuleIfFreeParams VerboseKeyverboseS hasVerbositygetIncludeDirs addImportaddImportCycleCheck getImports isImported getImportPath visitModulesetVisitedModulesgetVisitedModules isVisitedgetVisitedModulegetDecodedModulessetDecodedModulesgetDecodedModulestoreDecodedModuledropDecodedModulewithImportPathcheckForImportCycle currentModulewithCurrentModulegetAnonymousVariableswithAnonymousModulewithEnvgetEnvwithIncreasedModuleNestingLevelwithHighlightingLevel doExpandLastdontExpandLastperformedSimplificationperformedSimplification'getSimplificationupdateAllowedReductionsmodifyAllowedReductionsputAllowedReductionsonlyReduceProjectionsallowAllReductionsallowNonTerminatingReductionsinsideDotPatternisInsideDotPattern MonadDebugdisplayDebugMessagetraceDebugMessageformatDebugMessage reportSDoc reportSLnreportS getContextId getContextmakeOpen makeClosedisClosedgetOpentryOpenCoinductionKit nameOfInf nameOfSharp nameOfFlat HasBuiltinsgetBuiltinThinglitTypesetBuiltinThingsbindBuiltinName bindPrimitive getBuiltin getBuiltin' getPrimitive' getPrimitiveconstructorFormconstructorForm' primIntegerprimIntegerPosprimIntegerNegSuc primFloatprimChar primStringprimBoolprimUnit primUnitUnitprimTrue primFalseprimListprimNilprimConsprimIOprimNatprimSucprimZero primNatPlus primNatMinus primNatTimesprimNatDivSucAuxprimNatModSucAuxprimNatEquality primNatLess primSizeUnivprimSize primSizeLt primSizeSuc primSizeInf primSizeMaxprimInf primSharpprimFlat primEqualityprimRefl primRewrite primLevel primLevelZero primLevelSuc primLevelMax primFromNat primFromNegprimFromString primQNameprimArg primArgArgprimAbs primAbsAbs primAgdaSort primHiding primHidden primInstance primVisible primRelevance primRelevantprimIrrelevant primAssoc primAssocLeftprimAssocRight primAssocNonprimPrecedenceprimPrecRelatedprimPrecUnrelated primFixityprimFixityFixity primArgInfoprimArgArgInfoprimAgdaSortSetprimAgdaSortLitprimAgdaSortUnsupported primAgdaTermprimAgdaTermVarprimAgdaTermLamprimAgdaTermExtLamprimAgdaTermDefprimAgdaTermConprimAgdaTermPiprimAgdaTermSortprimAgdaTermLitprimAgdaTermUnsupportedprimAgdaTermMetaprimAgdaErrorPartprimAgdaErrorPartStringprimAgdaErrorPartTermprimAgdaErrorPartNameprimAgdaLiteralprimAgdaLitNatprimAgdaLitFloatprimAgdaLitCharprimAgdaLitStringprimAgdaLitQNameprimAgdaLitMetaprimAgdaPatternprimAgdaPatConprimAgdaPatVarprimAgdaPatDotprimAgdaPatLitprimAgdaPatProjprimAgdaPatAbsurdprimAgdaClauseprimAgdaClauseClauseprimAgdaClauseAbsurdprimAgdaDefinitionFunDefprimAgdaDefinitionDataDefprimAgdaDefinitionRecordDef!primAgdaDefinitionDataConstructorprimAgdaDefinitionPostulateprimAgdaDefinitionPrimitiveprimAgdaDefinition primAgdaMeta primAgdaTCMprimAgdaTCMReturnprimAgdaTCMBindprimAgdaTCMUnifyprimAgdaTCMTypeErrorprimAgdaTCMInferTypeprimAgdaTCMCheckTypeprimAgdaTCMNormaliseprimAgdaTCMReduceprimAgdaTCMCatchErrorprimAgdaTCMGetContextprimAgdaTCMExtendContextprimAgdaTCMInContextprimAgdaTCMFreshNameprimAgdaTCMDeclareDefprimAgdaTCMDefineFunprimAgdaTCMGetTypeprimAgdaTCMGetDefinitionprimAgdaTCMQuoteTermprimAgdaTCMUnquoteTermprimAgdaTCMBlockOnMetaprimAgdaTCMCommitprimAgdaTCMIsMacroprimAgdaTCMWithNormalisationprimAgdaTCMDebugPrint builtinNat builtinSuc builtinZerobuiltinNatPlusbuiltinNatMinusbuiltinNatTimesbuiltinNatDivSucAuxbuiltinNatModSucAuxbuiltinNatEqualsbuiltinNatLessbuiltinIntegerbuiltinIntegerPosbuiltinIntegerNegSuc builtinFloat builtinChar builtinString builtinUnitbuiltinUnitUnit builtinBool builtinTrue builtinFalse builtinList builtinNil builtinCons builtinIObuiltinSizeUniv builtinSize builtinSizeLtbuiltinSizeSucbuiltinSizeInfbuiltinSizeMax builtinInf builtinSharp builtinFlatbuiltinEquality builtinReflbuiltinRewritebuiltinLevelMax builtinLevelbuiltinLevelZerobuiltinLevelSucbuiltinFromNatbuiltinFromNegbuiltinFromString builtinQNamebuiltinAgdaSortbuiltinAgdaSortSetbuiltinAgdaSortLitbuiltinAgdaSortUnsupported builtinHiding builtinHiddenbuiltinInstancebuiltinVisiblebuiltinRelevancebuiltinRelevantbuiltinIrrelevant builtinAssocbuiltinAssocLeftbuiltinAssocRightbuiltinAssocNonbuiltinPrecedencebuiltinPrecRelatedbuiltinPrecUnrelated builtinFixitybuiltinFixityFixity builtinArgbuiltinArgInfobuiltinArgArgInfo builtinArgArg builtinAbs builtinAbsAbsbuiltinAgdaTermbuiltinAgdaTermVarbuiltinAgdaTermLambuiltinAgdaTermExtLambuiltinAgdaTermDefbuiltinAgdaTermConbuiltinAgdaTermPibuiltinAgdaTermSortbuiltinAgdaTermLitbuiltinAgdaTermUnsupportedbuiltinAgdaTermMetabuiltinAgdaErrorPartbuiltinAgdaErrorPartStringbuiltinAgdaErrorPartTermbuiltinAgdaErrorPartNamebuiltinAgdaLiteralbuiltinAgdaLitNatbuiltinAgdaLitFloatbuiltinAgdaLitCharbuiltinAgdaLitStringbuiltinAgdaLitQNamebuiltinAgdaLitMetabuiltinAgdaClausebuiltinAgdaClauseClausebuiltinAgdaClauseAbsurdbuiltinAgdaPatternbuiltinAgdaPatVarbuiltinAgdaPatConbuiltinAgdaPatDotbuiltinAgdaPatLitbuiltinAgdaPatProjbuiltinAgdaPatAbsurdbuiltinAgdaDefinitionFunDefbuiltinAgdaDefinitionDataDefbuiltinAgdaDefinitionRecordDef$builtinAgdaDefinitionDataConstructorbuiltinAgdaDefinitionPostulatebuiltinAgdaDefinitionPrimitivebuiltinAgdaDefinitionbuiltinAgdaMetabuiltinAgdaTCMbuiltinAgdaTCMReturnbuiltinAgdaTCMBindbuiltinAgdaTCMUnifybuiltinAgdaTCMTypeErrorbuiltinAgdaTCMInferTypebuiltinAgdaTCMCheckTypebuiltinAgdaTCMNormalisebuiltinAgdaTCMReducebuiltinAgdaTCMCatchErrorbuiltinAgdaTCMGetContextbuiltinAgdaTCMExtendContextbuiltinAgdaTCMInContextbuiltinAgdaTCMFreshNamebuiltinAgdaTCMDeclareDefbuiltinAgdaTCMDefineFunbuiltinAgdaTCMGetTypebuiltinAgdaTCMGetDefinitionbuiltinAgdaTCMBlockOnMetabuiltinAgdaTCMCommitbuiltinAgdaTCMQuoteTermbuiltinAgdaTCMUnquoteTermbuiltinAgdaTCMIsMacrobuiltinAgdaTCMWithNormalisationbuiltinAgdaTCMDebugPrint builtinsNoDefcoinductionKit'coinductionKitprimEqualityName equalityViewequalityUnview$fHasBuiltinsTCMT$fHasBuiltinsMaybeT Condition newTelMetanewNamedValueMeta'newNamedValueMeta newValueMeta newIFSMetaassignassignVetaExpandMetaSafe assignTerm newArgsMeta newArgsMeta' $fShowLeq$fEqLeqsayWhen prettyWarning prettyError WhichWarnings ErrorWarnings AllWarningsgenericWarninggenericNonFatalErrorwarning_warningisUnsolvedWarningclassifyWarningclassifyWarningsrunPM$fEqWhichWarnings$fOrdWhichWarnings resetState resetAllState localTCStatelocalTCStateSavingfreshTCMlensPersistentStateupdatePersistentStatemodifyPersistentStatelensAccumStatisticsPlensAccumStatisticsgetScopesetScope modifyScope_ modifyScope withScope withScope_ localScope notInScope printScopemodifySignaturemodifyImportedSignature getSignaturemodifyGlobalDefinition setSignature withSignatureaddRewriteRulesForlookupDefinitionupdateDefinitionsupdateDefinition updateTheDef updateDefTypeupdateDefArgOccurrencesupdateDefPolarityupdateDefCompiledRepaddCompilerPragmaupdateFunClausesupdateCompiledClausesupdateFunCopatternLHSsetTopLevelModulewithTopLevelModuleaddForeignCodeaddDeprecatedForeignCodeaddHaskellImportaddHaskellImportUHCaddInlineHaskellgetInteractionOutputCallbackappInteractionOutputCallbacksetInteractionOutputCallbackgetPatternSynssetPatternSynsmodifyPatternSynsgetPatternSynImportslookupPatternSyn theBenchmarkupdateBenchmarkaddImportedInstancesupdateInstanceDefsmodifyInstanceDefsgetAllInstanceDefsgetAnonInstanceDefsclearAnonInstanceDefsaddUnknownInstanceaddNamedInstance noMutualBlock inMutualBlocksetMutualBlockInfoinsertMutualBlockInfosetMutualBlockcurrentOrFreshMutualBlocklookupMutualBlock mutualBlockOftraceSLn traceSDocverboseBracket$fMonadDebugWriterT$fMonadDebugStateT$fMonadDebugReaderT$fMonadDebugMaybeT$fMonadDebugListT$fMonadDebugExceptT$fMonadDebugTCMTupdateBenchmarkingStatusprintdebugConstraintsguardConstraintifNoConstraints_ noConstraintssolveAwakeConstraints'solveConstraintcatchConstraintmatchCompiledE matchCompiledcompileClausesActioninfercheckInternal' checkInternal checkTypeeraseUnusedAction defaultActionPSynNamesInnamesIn$fNamesInAmbiguousQName$fNamesInPattern'$fNamesInDisplayTerm$fNamesInDisplayForm$fNamesInLocal $fNamesInOpen$fNamesInConHead$fNamesInQName$fNamesInElim'$fNamesInLiteral$fNamesInLevelAtom$fNamesInPlusLevel$fNamesInLevel $fNamesInTerm $fNamesInSort$fNamesInType'$fNamesInPattern'0 $fNamesInCase$fNamesInCompiledClauses'$fNamesInClause $fNamesInDefn$fNamesInDefinition $fNamesIn(,,) $fNamesIn(,)$fNamesInFieldAssignment' $fNamesInTele$fNamesInWithArity $fNamesInAbs$fNamesInNamed $fNamesInDom $fNamesInArg $fNamesIn[]$fNamesInMaybe $fNamesInPSyn showOpenMetasscopeCheckImporthighlightAsTypeCheckedcheckModuleName moduleName' moduleNameLensPersistentVerbositygetPersistentVerbositysetPersistentVerbositymapPersistentVerbosityPersistentVerbosityLensIncludePathsgetIncludePathssetIncludePathsmapIncludePathsgetAbsoluteIncludePathssetAbsoluteIncludePathsmapAbsoluteIncludePaths LensSafeMode getSafeMode setSafeMode mapSafeModeSafeModeLensCommandLineOptionsgetCommandLineOptionssetCommandLineOptionsmapCommandLineOptions LensVerbosity getVerbosity setVerbosity mapVerbosityLensPragmaOptionsgetPragmaOptionssetPragmaOptionsmapPragmaOptionsmodifyPragmaOptionsmodifyVerbosity putVerbositymodifyCommandLineOptionsmodifySafeMode putSafeModemodifyIncludePathsputIncludePathsmodifyAbsoluteIncludePathsputAbsoluteIncludePathsmodifyPersistentVerbosityputPersistentVerbosity$fLensPragmaOptionsTCState%$fLensPragmaOptionsCommandLineOptions$fLensVerbosityTCState$fLensVerbosityPragmaOptions$fLensCommandLineOptionsTCState)$fLensCommandLineOptionsPersistentTCState$fLensSafeModeTCState$fLensSafeModePersistentTCState $fLensSafeModeCommandLineOptions$fLensSafeModePragmaOptions$fLensIncludePathsTCState#$fLensIncludePathsPersistentTCState$$fLensIncludePathsCommandLineOptions $fLensPersistentVerbosityTCState*$fLensPersistentVerbosityPersistentTCState+$fLensPersistentVerbosityCommandLineOptions&$fLensPersistentVerbosityPragmaOptions RelativeTo ProjectRoot CurrentDirsetCommandLineOptions'libToTCMsetLibraryPathssetLibraryIncludesaddDefaultLibrariessetOptionsFromPragmaenableDisplayFormsdisableDisplayFormsdisplayFormsEnabledgetProjectRootsetIncludeDirs setInputFile getInputFile getInputFile' hasInputFileproofIrrelevancehasUniversePolymorphism sharedFunshared sharedType enableCachingshowImplicitArgumentsshowIrrelevantArgumentswithShowAllArgumentswithShowAllArguments'withPragmaOptionsignoreInterfacespositivityCheckEnabled typeInType etaEnabledmaxInstanceSearchDepthhasExactVerbositywhenExactVerbosityinterestingCall traceCallM traceCall traceCallCPS traceCallCPS_getCurrentRangesetCurrentRange FindErrorNotFound AmbiguoustoIFilereplaceModuleExtensionfindErrorToTypeErrorfindFile findFile' findFile''findInterfaceFilerootNameModuleSerialisedRangeunderlyingRange $fEmbPrjEmpty$fEmbPrjImpossible$fEmbPrjDelayed$fEmbPrjIsAbstract$fEmbPrjLiteral$fEmbPrjProjOrigin$fEmbPrjConOrigin$fEmbPrjOrigin$fEmbPrjRelevance$fEmbPrjHiding$fEmbPrjInduction $fEmbPrjDom $fEmbPrjArg$fEmbPrjWithHiding$fEmbPrjHashMap$fEmbPrjNameId$fEmbPrjArgInfo$fEmbPrjRanged $fEmbPrjNamed$fEmbPrjFieldAssignment'$fEmbPrjModuleName$fEmbPrjAmbiguousQName $fEmbPrjQName$fEmbPrjMetaId$fEmbPrjGenPart$fEmbPrjFixity'$fEmbPrjFixity$fEmbPrjPrecedenceLevel$fEmbPrjAssociativity$fEmbPrjQName0$fEmbPrjNamePart $fEmbPrjName$fEmbPrjRange'$fEmbPrjInterval' $fEmbPrjSeq $fEmbPrjTrie $fEmbPrjSet $fEmbPrjMap $fEmbPrjBiMap $fEmbPrj[]$fEmbPrjTopLevelModuleName$fEmbPrjPosition'$fEmbPrjAbsolutePath$fEmbPrjDataOrRecord $fEmbPrjBool $fEmbPrjMaybe$fEmbPrjMaybe0$fEmbPrjEither $fEmbPrj(,,) $fEmbPrj(,) $fEmbPrj() $fEmbPrjVoid$fEmbPrjDouble $fEmbPrjChar $fEmbPrjInt $fEmbPrjInt32$fEmbPrjWord64$fEmbPrjInteger$fEmbPrjByteString $fEmbPrj[]0 $fEmbPrjName0$fEmbPrjSerialisedRange$fEmbPrjCompressedFile$fEmbPrjDefinitionSite$fEmbPrjAspects$fEmbPrjOtherAspect$fEmbPrjAspect$fEmbPrjNameKind $fEmbPrjRange getStatisticsmodifyStatisticsticktickNtickMaxprintStatistics SizeMaxViewSizeViewComparable NotComparableYesAboveYesBelow DeepSizeViewDSizeInfDSizeVar DSizeMeta DOtherSizeSizeViewSizeInfSizeSuc OtherSize IsSizeType isSizeType BoundedSize BoundedLt BoundedNoisSizeTypeTestgetBuiltinDefNamegetBuiltinSizeisSizeNameTestisSizeNameTestRawhaveSizedTypesbuiltinSizeHooksizeSortsizeUniv sizeType_sizeType sizeSucNamesizeSucsizeSuc_sizeMaxsizeViewsizeViewComparable sizeViewSuc_ sizeViewPredsizeViewOffset removeSucs unSizeViewunDeepSizeView maxViewMax maxViewConssizeViewComparableWithMax maxViewSuc_ unMaxView$fIsSizeTypeTerm$fIsSizeTypeType'$fIsSizeType(,)$fIsSizeTypeDom$fEqBoundedSize$fShowBoundedSize$fShowDeepSizeView$fFunctorSizeViewComparableupdateSharedTermupdateSharedTermFupdateSharedTermTforceEqualTerms cachingStartswriteToCurrentLogrestorePostScopeStatenoCacheForImportedModulereadFromCachedLogcleanCachedLogactivateLoadedFileCachecacheCurrentLogRangeAndPragma DontTouchMe ToConcrete toConcretebindToConcreteAbsToConEnvmakeEnv noTakenNames runAbsToConabstractToConcreteEnvabstractToConcreteCtxabstractToConcrete_ toConcreteCtx$fToConcreteNamedMetaExpr$fToConcreteInteractionIdExpr$fToConcreteLHSCore'Pattern$fToConcreteLHSLHS$fToConcreteSpineLHSLHS.$fToConcreteModuleApplicationModuleApplication$fToConcreteConstrDeclaration$fToConcreteMaybeMaybe$fToConcreteRHS(,,,)$fToConcreteLetBinding[]%$fToConcreteTypedBindingTypedBinding'$fToConcreteTypedBindings[]$fToConcreteLamBinding[],$fToConcreteFieldAssignment'FieldAssignment'$fToConcreteExprExpr$fToConcreteModuleNameQName$fToConcreteQNameQName$fToConcreteNameName$fToConcreteNamedNamed $fToConcreteWithHidingWithHiding$fToConcreteArgArg$fToConcrete(,,)(,,)$fToConcrete(,)(,)$fToConcreteEitherEither$fToConcrete[][]$fToConcreteDontTouchMea$fToConcreteClause'[]$$fToConcreteAsWhereDeclsWhereClause' $fToConcreteRangeAndPragmaPragma$fToConcreteDeclaration[]$fToConcreteUserPatternArg$fToConcreteUserPatternPattern'$fToConcretePattern'Pattern$fToConcreteSplitPatternArg $fToConcreteSplitPatternPattern'"$fToConcreteBindingPatternPattern'$fToConcreteFreshNameName ScopeMemo memoNames memoModulesWSM ResolvedNameVarName DefinedName FieldNameConstructorNamePatternSynResName UnknownName resolvedVarresolvedLetBoundScopeMisDatatypeModulegetCurrentModulesetCurrentModulewithCurrentModule' getNamedScopegetCurrentScope createModule modifyScopesmodifyNamedScope setNamedScopemodifyNamedScopeMmodifyCurrentScopemodifyCurrentScopeMmodifyCurrentNameSpacepushContextPrecedencepopContextPrecedencewithContextPrecedence getLocalVarsmodifyLocalVars setLocalVars withLocalVarsfreshAbstractNamefreshAbstractName_freshAbstractQName resolveName resolveName' resolveModule getNotation bindVariablebindName rebindName bindModule bindQModule stripNoNamesmemoToScopeInfo copyScopeapplyImportDirectiveMlookupImportedName mapImportDirmapUsing mapRenaming openModule_$fPrettyResolvedName$fShowResolvedName$fEqResolvedName KeepNames AddContext addContext contextSizemodifyContextEntrymodifyContextEntries modifyContextmkContextEntry inTopContext escapeContextwithModuleParametersupdateModuleParametersweakenModuleParametersgetModuleParameterSubaddCtx unshadowName addContext'dummyDomunderAbstractionunderAbstraction'underAbstraction_ addLetBindinggetContextSizegetContextArgsgetContextTermsgetContextTelescopegetContextNameslookupBV typeOfBV'typeOfBVnameOfBV getVarInfo$fAddContextTele$fAddContext[]$fAddContextName$fAddContextDom$fAddContext(,)$fAddContext(,)0$fAddContext(,)1$fAddContextDom0$fAddContextDom1$fAddContext(,)2$fAddContext[]0$fAddContextKeepNames$fAddContext(,)3 makeLocal makeGlobalgetLocal HasConstInfo getConstInfo getConstInfo'getRewriteRulesForSigError SigUnknown SigAbstractCoreCodeJSCode HaskellType HaskellCode addConstant setTerminatesmodifyFunClauses addClausesmkPragma addPragmaaddDeprecatedPragma dataFormataddHaskellCodeaddHaskellExportaddHaskellTypeaddHaskellData addJSCode addCoreCode addCoreTypegetUniqueCompilerPragmasetFunctionFlag markStatic markInline markInjectiveunionSignatures addSectionsetDefaultModuleParameters getSectionaddDisplayForms applySection applySection'addDisplayFormisLocalgetDisplayFormschaseDisplayFormshasLoopingDisplayForm canonicalNamesameDef whatInductionsingleConstructorTypesigErrordefaultGetRewriteRulesForgetOriginalProjectiondefaultGetConstInfo getConInfo getPolarity' setPolaritygetArgOccurrencesetArgOccurrencesmodifyArgOccurrences setTreelesssetCompiledArgUse getCompiledgetErasedConArgssetErasedConArgs getTreelessgetCompiledArgUse getMutual getMutual_ setMutualmutuallyRecursivedefinitelyNonRecursive_getCurrentModuleFreeVarsgetDefFreeVarsfreeVarsToApplygetModuleFreeVarsmoduleParamsToApplyinstantiateDefinstantiateRewriteRuleinstantiateRewriteRules makeAbstractinAbstractModeinConcreteModeignoreAbstractModeinConcreteOrAbstractModetreatAbstractlytreatAbstractly' typeOfConst relOfConst droppedPars isProjection isProjection_ isStaticFun isInlineFunisProperProjectionprojectionArgsusesCopatternsapplyDef$fHasConstInfoExceptT$fHasConstInfoMaybeT$fHasConstInfoTCMTgetConstructorData getConHead enterClosure withClosure mapClosure UnFreezeMeta unfreezeMetaIsInstantiatedMetaisInstantiatedMetadontAssignMetas getMetaStoremodifyMetaStoremetasCreatedBy updateMetaVargetMetaPriority isSortMeta isSortMeta_ getMetaTypegetMetaTypeInContextisInstantiatedMeta'allMetascreateMetaInfocreateMetaInfo'setValueMetaNamegetMetaNameSuggestionsetMetaNameSuggestionupdateMetaVarRangesetMetaOccursCheckmodifyInteractionPointsregisterInteractionPointfindInteractionPoint_connectInteractionPointremoveInteractionPointgetInteractionPointsgetInteractionMetasgetInteractionIdsAndMetasisInteractionMetalookupInteractionPointlookupInteractionIdlookupInteractionMetalookupInteractionMeta_newMeta'getInteractionRange getMetaRangegetInteractionScope withMetaInfo' withMetaInfogetInstantiatedMetas getOpenMetas isOpenMeta listenToMetaunlistenToMetagetMetaListenersclearMetaListenerswithFreezeMetas freezeMetas freezeMetas' unfreezeMetasunfreezeMetas'isFrozen$fIsInstantiatedMetaAbs$fIsInstantiatedMetaArg$fIsInstantiatedMetaMaybe$fIsInstantiatedMeta[]$fIsInstantiatedMetaLevelAtom$fIsInstantiatedMetaPlusLevel$fIsInstantiatedMetaLevel$fIsInstantiatedMetaTerm$fIsInstantiatedMetaMetaId$fUnFreezeMetaAbs$fUnFreezeMeta[]$fUnFreezeMetaLevelAtom$fUnFreezeMetaPlusLevel$fUnFreezeMetaLevel$fUnFreezeMetaSort$fUnFreezeMetaTerm$fUnFreezeMetaType'$fUnFreezeMetaMetaIdConstraintStatusAwakeConstraintSleepingConstraintstealConstraintssolvingProblemsolvingProblemsisProblemSolvedgetConstraintsForProblemgetAwakeConstraintswakeConstraintsdropConstraintsputConstraintsToSleepputAllConstraintsToSleepholdConstraintstakeAwakeConstraintgetAllConstraintswithConstraintbuildProblemConstraintbuildProblemConstraint_buildConstraintaddConstraint'addAwakeConstraint'addConstraintToaddAwakeConstraintsnowSolvingConstraintsisSolvingConstraintsmapAwakeConstraintsmapSleepingConstraintsmodifyAwakeConstraintsmodifySleepingConstraints$fEqConstraintStatus$fShowConstraintStatus$fEmbPrjForeignCode$fEmbPrjCompilerPragma$fEmbPrjSubstitution'$fEmbPrjBuiltin$fEmbPrjPattern'$fEmbPrjDBPatVar$fEmbPrjConPatternInfo$fEmbPrjClause$fEmbPrjTermHead$fEmbPrjFunctionInverse'$fEmbPrjCompiledClauses' $fEmbPrjCase$fEmbPrjWithArity$fEmbPrjFunctionFlag $fEmbPrjDefn$fEmbPrjEtaEquality$fEmbPrjOccurrence$fEmbPrjPolarity$fEmbPrjExtLamInfo$fEmbPrjProjLams$fEmbPrjProjection$fEmbPrjRewriteRule$fEmbPrjNLPType $fEmbPrjNLPat$fEmbPrjDefinition$fEmbPrjMutualId$fEmbPrjDisplayTerm $fEmbPrjCtxId $fEmbPrjLocal $fEmbPrjOpen$fEmbPrjDisplayForm $fEmbPrjSort$fEmbPrjLevelAtom$fEmbPrjPlusLevel $fEmbPrjLevel $fEmbPrjTerm $fEmbPrjAbs $fEmbPrjType'$fEmbPrjConHead $fEmbPrjElim' $fEmbPrjDrop$fEmbPrjPermutation $fEmbPrjTele$fEmbPrjSection$fEmbPrjSignature$fEmbPrjScopeInfo$fEmbPrjPrecedence$fEmbPrjConPatInfo$fEmbPrjLocalVar$fEmbPrjKindOfName$fEmbPrjAbstractModule$fEmbPrjAbstractName$fEmbPrjWhyInScope$fEmbPrjNameSpace$fEmbPrjAccess$fEmbPrjNameSpaceId $fEmbPrjScope $fEmbPrjDoc$fEmbPrjDeclarationWarning$fEmbPrjWarning$fEmbPrjTCWarning$fEmbPrjInterfaceencodedecodeencodeInterface encodeFiledecodeInterface decodeHashes decodeFile useTerPragma newSection checkFunDef' checkFunDefcheckSectionApplication checkDecl checkDeclsbindBuiltinFlatbindBuiltinSharpbindBuiltinInfaskRapplyWhenVerboseS$fHasConstInfoReduceM$fMonadDebugReduceM$fHasBuiltinsReduceM$fHasOptionsReduceMisRecordConstructorisGeneratedRecordConstructoretaContractRecordgetRecordFieldNames isEtaRecordisRecordYesNoDontKnowmatchCopatterns matchPatternsbuildSubstitutionExpandPatternSynonymsexpandPatternSynonymsexpandLitPatternexpandPatternSynonyms'$fExpandPatternSynonymsPattern''$fExpandPatternSynonymsFieldAssignment'$fExpandPatternSynonymsNamed$fExpandPatternSynonymsArg$fExpandPatternSynonyms[]$fExpandPatternSynonymsMaybe MentionsMeta mentionsMeta$fMentionsMetaConstraint$fMentionsMetaProblemConstraint$fMentionsMetaTele$fMentionsMetaElim'$fMentionsMetaClosure$fMentionsMeta(,,)$fMentionsMeta(,)$fMentionsMetaMaybe$fMentionsMeta[]$fMentionsMetaDom$fMentionsMetaArg$fMentionsMetaAbs$fMentionsMetaSort$fMentionsMetaType'$fMentionsMetaLevelAtom$fMentionsMetaPlusLevel$fMentionsMetaLevel$fMentionsMetaTermhideAndRelParamsinverseApplyRelevanceapplyRelevance workOnTypes workOnTypes'applyRelevanceToContextwakeIrrelevantVars BinAppViewNoApp binAppView etaContractetaOnceInstantiateFullinstantiateFull' Normalise normalise'Simplify simplify'reduce'reduceB' Instantiate instantiate' instantiateinstantiateFullreducereduceB normalisesimplifyisFullyInstantiatedMeta ifBlocked ifBlockedTypemaybeFastReduceTermslowReduceTermunfoldCorecursionEunfoldCorecursionunfoldDefinitionunfoldDefinitionEunfoldDefinition'unfoldDefinitionStep reduceDefCopy reduceHead reduceHead'appDef_appDefE_appDefappDefEappDef'appDefE'simplifyBlocked'$fInstantiateEqualityView$fInstantiateCandidate$fInstantiateMap$fInstantiateConstraint$fInstantiateTele$fInstantiateClosure$fInstantiate(,,)$fInstantiate(,)$fInstantiate[]$fInstantiateDom$fInstantiateArg$fInstantiateAbs$fInstantiateElim'$fInstantiateSort$fInstantiateType'$fInstantiateBlocked$fInstantiateLevelAtom$fInstantiatePlusLevel$fInstantiateLevel$fInstantiateTerm$fReduceEqualityView$fReduceCandidate $fReduceMap$fReduceConstraint $fReduceTele$fReduceClosure $fReduceTerm $fReduce(,,) $fReduce(,) $fReduceDom $fReduceArg $fReduce[] $fReduceAbs$fReduceLevelAtom$fReducePlusLevel $fReduceLevel $fReduceElim' $fReduceType'$fSimplifyEqualityView$fSimplifyCandidate$fSimplifyDisplayForm$fSimplifyBool$fSimplifyConstraint$fSimplifyProblemConstraint$fSimplifyTele$fSimplifyClosure$fSimplify(,,) $fSimplify(,)$fSimplifyMaybe $fSimplifyMap $fSimplify[] $fSimplifyDom$fSimplifyNamed $fSimplifyArg $fSimplifyAbs$fSimplifyLevelAtom$fSimplifyPlusLevel$fSimplifyLevel$fSimplifySort$fSimplifyElim'$fSimplifyType'$fSimplifyTerm$fNormaliseEqualityView$fNormaliseCandidate$fNormaliseMaybe$fNormaliseMap$fNormaliseDisplayForm$fNormalisePattern'$fNormaliseDBPatVar$fNormaliseConPatternInfo$fNormaliseChar$fNormaliseInt$fNormaliseBool$fNormaliseConstraint$fNormaliseProblemConstraint$fNormaliseTele$fNormaliseClosure$fNormalise(,,)$fNormalise(,) $fNormalise[]$fNormaliseDom$fNormaliseNamed$fNormaliseArg$fNormaliseAbs$fNormaliseLevelAtom$fNormalisePlusLevel$fNormaliseLevel$fNormaliseElim'$fNormaliseTerm$fNormaliseType'$fNormaliseSort$fInstantiateFullEqualityView$fInstantiateFullCandidate$fInstantiateFullMaybe$fInstantiateFullQName$fInstantiateFullBuiltin$fInstantiateFullInterface$fInstantiateFullClause!$fInstantiateFullCompiledClauses'$fInstantiateFullCase$fInstantiateFullWithArity!$fInstantiateFullFunctionInverse'$fInstantiateFullDefn$fInstantiateFullDisplayTerm$fInstantiateFullDisplayForm$fInstantiateFullLocal$fInstantiateFullOpen$fInstantiateFullRewriteRule$fInstantiateFullNLPType$fInstantiateFullNLPat$fInstantiateFullDefinition$fInstantiateFullChar$fInstantiateFullTele$fInstantiateFullSection$fInstantiateFullSignature$fInstantiateFullScope$fInstantiateFullModuleName$fInstantiateFullHashMap$fInstantiateFullMap$fInstantiateFullElim'$fInstantiateFullConstraint"$fInstantiateFullProblemConstraint$fInstantiateFullClosure$fInstantiateFull(,,)$fInstantiateFull(,)$fInstantiateFull[]$fInstantiateFullDom$fInstantiateFullNamed$fInstantiateFullArg$fInstantiateFullAbs$fInstantiateFullPattern'$fInstantiateFullDBPatVar$fInstantiateFullConPatternInfo$fInstantiateFullInt$fInstantiateFullBool$fInstantiateFullSubstitution'$fInstantiateFullLevelAtom$fInstantiateFullPlusLevel$fInstantiateFullLevel$fInstantiateFullTerm$fInstantiateFullType'$fInstantiateFullSort$fInstantiateFullName $fReduceSortOutputTypeName OutputTypeVarOutputTypeNameNotYetKnownNoOutputTypeNameSplitTel firstPart secondPart splitPerm flattenTel reorderTel reorderTel_ unflattenTel teleNames teleArgNamesteleArgs teleNamedArgstele2NamedArgs permuteTelvarDependenciessplitTelescopesplitTelescopeExactinstantiateTelescopeexpandTelescopeVar telViewUpTo telViewUpTo'mustBePiifPiifPiTypeifNotPi ifNotPiTypepiApply1 typeAritygetOutputTypeNameaddTypedInstanceresolveUnknownInstanceDefsgetInstanceDefsSynEqcheckSyntacticEquality$fSynEqArgInfo $fSynEqDom $fSynEqArg $fSynEqAbs $fSynEqElim' $fSynEq[] $fSynEqType' $fSynEqSort$fSynEqLevelAtom$fSynEqPlusLevel $fSynEqLevel $fSynEqTermLevelKitlvlTypelvlSuclvlMaxlvlZerotypeNamesucNamemaxNamezeroName levelTypelevelSucFunctionbuiltinLevelKit requireLevelsunLevelreallyUnLevelViewunlevelWithKitunPlusV maybePrimCon maybePrimDef levelView levelView'levelLubsubLevel isEmptyTypeDropArgsdropArgs$fDropArgsCompiledClauses'$fDropArgsFunctionInverse'$fDropArgsClause$fDropArgsPermutation$fDropArgsTele$fDropArgsMaybeSubstWithOriginsubstWithOrigin dtermToTermdisplayFormArities displayFormmatchDisplayForm $fMatchLevel $fMatchSort $fMatchTerm $fMatchElim' $fMatchArg $fMatch[]$fSubstWithOriginArg$fSubstWithOriginDisplayTerm$fSubstWithOriginTerm$fSubstWithOriginArg0$fSubstWithOriginElim'$fSubstWithOrigin[]leqType equalSort equalType equalTerm compareLevel compareSort compareTel compareType compareElims compareArgs compareAtom compareTerm recursiveanyDefssanityCheckVarssanityCheckSubstshowAprettyAprettyAsshowATop prettyATop NamedClauseReifyreify reifyWhen reifyPatterns$fReify(,,,)(,,,)$fReify(,,)(,,) $fReify(,)(,) $fReify[][]$fReifyElim'Elim' $fReifyDomArg $fReifyTele[] $fReifyAbs(,)$fReifyLevelExpr$fReifySortExpr$fReifyType'Expr $fReifyArgArg$fReifyNamedNamed$fReifyTermExpr$fReifyLiteralExpr$fReifyDisplayTermExpr$fReifyMetaIdExpr$fReifyExprExpr$fReifyNameName$fReifyNamedClauseClause'$fReifyQNamedClause'$fMonoidMonoidMap$fSemigroupMonoidMap$fBlankVarsTypedBinding$fBlankVarsTypedBindings$fBlankVarsLamBinding$fBlankVarsRHS$fBlankVarsModuleName$fBlankVarsLHSCore'$fBlankVarsLHS$fBlankVarsStrippedDotPattern$fBlankVarsNamedDotPattern$fBlankVarsEither$fBlankVars(,)$fBlankVarsFieldAssignment'$fBlankVarsPattern' $fBlankVars[]$fBlankVarsNamed$fBlankVarsArg $fBinder(,) $fBinder[] $fBinderNamed $fBinderArg$fBinderFieldAssignment'$fBinderWithHiding$fBinderLetBinding$fBinderTypedBinding$fBinderTypedBindings$fBinderLamBinding$fBinderPattern'$fBinderLHSCore' $fBinderLHS$fBlankVarsExpr$fBlankVarsClause'readlinevimFileescape wordBoundedmatchestoVimgenerateVimFilelispifyHighlightingInfo usedArgumentsstripUnusedArgumentsnormalizeNamesdetectIdentityFunctions$fSemigroupIdentityIntranslateBuiltins closedTerm callCompiler callCompiler'eliminateDeadCode ToAbstract toAbstract WithNamesNameswithNameaskName toAbstract_toAbstractWithoutImplicitmkDefmkSettoAbstractPats$fToAbstract[][]$fToAbstractQNamedClause'$fToAbstractPattern(,)$fToAbstractSortExpr$fToAbstractTermExpr$fToAbstractLiteralExpr$fToAbstractAbs(,)$fToAbstract(,)Expr$fToAbstract(,)Expr0$fToAbstract(,)TypedBindings$fToAbstract[][]0$fToAbstractArgArg$fToAbstractNamedNamedWithNode PrettyContextDoccommacolonequalshcathang$+$nestbracesbracketsparens punctuateprettyTCMPatternsprettyTCMPatternList$fPrettyTCMOccurrence$fPrettyTCMRewriteRule$fPrettyTCMType'$fPrettyTCMElim'$fPrettyTCMNLPType$fPrettyTCMNLPat$fPrettyTCMElim'0$fPrettyTCMPattern'$fPrettyTCMDBPatVar$fPrettyTCMCtxId$fPrettyTCMTele$fPrettyTCMConHead$fPrettyTCMModuleName$fPrettyTCMQName$fPrettyTCMName$fPrettyTCMWithHiding$fPrettyTCMTypeCheckingProblem$fPrettyTCMConstraint$fPrettyTCMProblemConstraint$fPrettyTCMRelevance$fPrettyTCMTypedBinding$fPrettyTCMExpr$fPrettyTCMEqualityView$fPrettyTCMMaybeReduced$fPrettyTCMElim'1 $fPrettyTCM[]$fPrettyTCMMap$fPrettyTCMDom$fPrettyTCMArg$fPrettyTCMNamed$fPrettyTCMBlocked$fPrettyTCMMetaId$fPrettyTCMJudgement$fPrettyTCMClause$fPrettyTCMModuleParameters$fPrettyTCMSubstitution'$fPrettyTCMTerm$fPrettyTCMPolarity$fPrettyTCMPermutation$fPrettyTCMLevel$fPrettyTCMQNamed$fPrettyTCMNamedClause$fPrettyTCMDisplayTerm$fPrettyTCMSort$fPrettyTCMType'0$fPrettyTCMTerm0$fPrettyTCM(,,)$fPrettyTCM(,)$fPrettyTCM[]0$fPrettyTCMClosure$fPrettyTCMRange'$fPrettyTCMProblemId$fPrettyTCMInt$fPrettyTCMLiteral$fPrettyTCMComparison$fPrettyTCMQName0$fPrettyTCMName0$fPrettyTCMBool$fPrettyTCM[]1$fPrettyTCMPrettyContext$fPrettyTCMGraph$fPrettyTCMWithNodeOldSizeConstraintLeq OldSizeExprSizeMetacheckSizeLtSatcheckSizeNeverZerocheckSizeVarNeverZero isBoundedboundedSizeMetaHook trySizeUniv deepSizeView sizeMaxView compareSizescompareMaxViewscompareBelowMaxcompareSizeViewstrivial isSizeProblemisSizeConstrainttakeSizeConstraintsgetSizeConstraints getSizeMetasoldComputeSizeConstraintsoldComputeSizeConstraint oldSizeExprflexibleVariablesoldCanonicalizeSizeConstraintoldSolveSizeConstraints oldSolver$fShowOldSizeExpr$fShowOldSizeConstraint$fEqOldSizeExprLHSState lhsProblemlhsDPIlhsShouldBeEmptyTypes AsBindingAsBDotPatternInstDPIdotPatternNamedotPatternUserExprdotPatternInstdotPatternType SplitProblemSplit SplitRest splitLPats splitFocus splitRPatssplitProjectionsplitProjOrigin splitRestTypeFocusLitFocus AbsurdFocusfocusConfocusPatOrigin focusConArgs focusRange focusOutPat focusDatatype focusParams focusIndices focusTypeabsurdFocusRangeabsurdFocusVarabsurdFocusType ProblemRestrestPatsrestType ProblemPartProblemProblem' problemInPat problemOutPat problemTel problemRest ChooseFlex chooseFlex FlexChoice ChooseLeft ChooseRight ChooseEither ExpandBoth FlexibleVar flexHiding flexOriginflexKindflexPosflexVarFlexibleVarKind RecordFlex ImplicitFlexDotFlex OtherFlex FlexibleVars allFlexVarsconsSplitProblem$fLensOriginFlexibleVar$fLensHidingFlexibleVar$fMonoidFlexChoice$fSemigroupFlexChoice$fChooseFlexFlexibleVar$fChooseFlexInt$fChooseFlexOrigin$fChooseFlexHiding$fChooseFlexMaybe$fChooseFlex[]$fChooseFlexFlexibleVarKind$fNullProblemRest$fSubstTermProblemRest$fNullProblem'$fSubstTermProblem'$fPrettyTCMDotPatternInst$fSubstTermDotPatternInst$fInstantiateFullAsBinding$fPrettyAsBinding$fPrettyTCMAsBinding$fSubstTermAsBinding$fEqFlexibleVarKind$fShowFlexibleVarKind$fEqFlexibleVar$fShowFlexibleVar$fFunctorFlexibleVar$fFoldableFlexibleVar$fTraversableFlexibleVar$fEqFlexChoice$fShowFlexChoice$fShowProblemRest$fShowProblem'instantiateTelnothingToSplitErrorcheckDisplayPragmaNormaliseProjPnormaliseProjPElimTypeArgTProjTprojTRec projTField orderFieldsinsertMissingFields recordModule getRecordDefgetRecordOfFieldrecordFieldNamesfindPossibleRecordsgetRecordFieldTypesgetRecordTypeFieldsgetRecordConstructor isRecordType tryRecordTypeorigProjection getDefType projectTyped typeElimsisEtaConisInductiveRecordisEtaRecordTypeunguardedRecordrecursiveRecordnonRecursiveRecordisRecursiveRecordetaExpandBoundVarexpandRecordVarexpandRecordVarsRecursivelycurryAtetaExpandRecordforceEtaExpandRecordetaExpandRecord'etaExpandRecord_etaExpandRecord'_etaExpandAtRecordTypeisSingletonRecord isSingletonRecordModuloRelevanceisSingletonRecord'isSingletonTypeisSingletonTypeModuloRelevanceisSingletonType'emap$fPrettyTCMElimType$fNormaliseProjPPattern'$fNormaliseProjPNamed$fNormaliseProjPArg$fNormaliseProjP[]$fNormaliseProjPClausePostponedEquationsPostponedEquation eqFreeVarseqLhseqRhsNLMState_nlmSub_nlmEqsNLM PatternFrom patternFromnlmSubnlmEqsliftRedrunNLMmatchingBlockedtellSubtellEq reallyFreemakeSubstitutioncheckPostponedEquations nonLinMatchequal normaliseB'$fPatternFromAbsAbs$fPatternFromTermNLPat$fPatternFromSortNLPat$fPatternFromType'NLPType$fPatternFromDomDom$fPatternFromElim'Elim'$fPatternFromArgArg$fPatternFrom[][]$fNullNLMState$fMatchNLPatTerm$fMatchNLPatLevel $fMatchAbsAbs$fMatchNLPatSort$fMatchNLPTypeType' $fMatchDomDom$fMatchElim'Elim' $fMatchArgArg $fMatch[][]MatchLit BlockingVars BlockingVar blockingVarNoblockingVarConsBlock MatchResult buildPatternisTrivialPatternmapBlockingVarConsclearBlockingVarConszipBlockingVars noMatchLit yesMatchLit matchLits matchClause matchPatsmatchPat$fPrettyBlockingVar $fMonoidMatch$fSemigroupMatch$fShowBlockingVar$fFunctorMatch QuotingKitquoteTermWithKitquoteTypeWithKitquoteClauseWithKitquoteDomWithKitquoteDefnWithKitquoteListWithKit quotingKit quoteString quoteNamequoteNat quoteConName quoteMeta quoteTerm quoteTypequoteDom quoteDefn quoteList HasPolarity polaritiesneg polFromOcc nextPolaritypurgeNonvariantpolarityFromPositivityenablePhantomTypesdependentPolarityrelevantInIgnoringNonvariant sizePolaritycheckSizeIndexpolarity$fHasPolarityLevelAtom$fHasPolarityPlusLevel$fHasPolarityLevel$fHasPolarityTerm$fHasPolarityElim'$fHasPolarityType'$fHasPolarity(,)$fHasPolarity[]$fHasPolarityAbs$fHasPolarityDom$fHasPolarityArgImplicitInsertion ImpInsert BadImplicits NoSuchNameNoInsertNeeded implicitArgsimplicitNamedArgs newMetaArgnewInteractionMetaArg impInsertinsertImplicit$fShowImplicitInsertioninsertImplicitProblemexpandImplicitPatternexpandImplicitPattern' implicitPinsertImplicitPatternsinsertImplicitSizeLtPatternsinsertImplicitPatternsTuseNamesFromPattern useOriginFrom noProblemRestproblemFromPatsupdateProblemRest_updateProblemRestetaExpandClausegetDefConstructorInfoDataCon RecordConHasEtaNoEtaYesEta getConFormgetOrigConHeadgetFullyAppliedConTypegetConstructorInfo isDatatypeisDataOrRecordTypeisDataOrRecordgetNumberOfParametersgetConstructors $fEqHasEtarecordPatternToProjectionstranslateCompiledClausestranslateSplitTreetranslateRecordPatterns $fDropFrom[] $fDropFrom(,)$fDropFromSplitTree'$fPrettyTCM(->) $fPretty(->)$fPrettyTCMEither$fFunctorRecPatM$fApplicativeRecPatM$fMonadRecPatM$fMonadIORecPatM$fMonadTCMRecPatM$fHasOptionsRecPatM$fMonadDebugRecPatM$fMonadReaderRecPatM$fMonadStateRecPatM$fEqKindDefNodeArgNodeComputeOccurrences occurrencesOccMOccEnvvarsinf OccursWheres:++OccurrencesBuilder'Concat' OccursAs' OccursHere'OccurrencesBuilderConcatOccursAs OccursHere OnlyVarsUpTo OccurrencesItemAnArgADefcheckStrictlyPositive getDefArityemptyOB>+< preprocessflattenwithExtendedOccEnvwithExtendedOccEnv'getOccurrencescomputeOccurrencescomputeOccurrences'buildOccurrenceGraph computeEdges$fSizedOccursWhere$fPrettyTCMOccursWhere$fHasRangeItem$fComputeOccurrences(,)$fComputeOccurrencesMaybe$fComputeOccurrences[]$fComputeOccurrencesDom$fComputeOccurrencesArg$fComputeOccurrencesElim'$fComputeOccurrencesAbs$fComputeOccurrencesTele$fComputeOccurrencesType'$fComputeOccurrencesLevelAtom$fComputeOccurrencesPlusLevel$fComputeOccurrencesLevel$fComputeOccurrencesTerm$fComputeOccurrencesClause$fPrettyTCMNode$fStarSemiRingEdge$fSemiRingEdge $fNullEdge$fEqItem $fOrdItem $fShowItemProjectionViewLoneProjectionLike NoProjection projViewProj projViewSelf projViewSpine unProjViewprojViewreduceProjectionLikeelimViewprettyTCWarningsprettyTCWarnings'tcWarningsToErrorapplyFlagsToTCWarnings tcErrString stringTCErrdropTopLevelModule$fPrettyTCMCall$fPrettyTCMUnificationFailure$fPrettyTCMNegativeUnification$fPrettyTCMSplitError$fPrettyTCMCallInfo$fPrettyTCMTCErr$fPrettyTCMWarning$fPrettyTCMTCWarning$fPrettyUnequalType'$fPrettyUnequalTerm$fVerbalizeRelevance$fVerbalizeHiding$fVerbalizeIndefinite$fPrettyTCMTypeErrorPredRelOpFromTermfromTermFromTermFunctionToTermtoTermtoTermRPrimTermprimTermPrimTypeprimTypeLvlunLvlunNat PrimitiveImplPrimImpl buildListredBind redReturnfromReducedTerm fromLiteral primTrustMegetReflArgInfo genPrimForce primForceprimForceLemmamkPrimLevelZeromkPrimLevelSucmkPrimLevelMax mkPrimFun1TCM mkPrimFun1 mkPrimFun2 mkPrimFun4-->.-->..-->garrgpihPinPivarMgApply<@><#>listioeltset tSetOmega sSizeUniv tSizeUnivargNdomNargHdomHprimitiveFunctionsfloatEqfloatLtlookupPrimitiveFunctionlookupPrimitiveFunctionQgetBuiltinName isBuiltin $fShowNat $fTermLikeNat $fIntegralNat $fShowLvl $fPrimTermIO $fPrimTerm[]$fPrimTermFixity'$fPrimTermType'$fPrimTermMetaId$fPrimTermQName $fPrimTermLvl $fPrimTermNat $fPrimTermStr$fPrimTermDouble$fPrimTermChar$fPrimTermBool$fPrimTermInteger $fPrimTypea$fPrimTerm(->) $fToTerm[]$fToTermPrecedenceLevel$fToTermAssociativity$fToTermFixity$fToTermFixity'$fToTermArgInfo $fToTermType' $fToTermTerm $fToTermBool$fToTermInteger$fToTermMetaId $fToTermQName $fToTermStr $fToTermChar$fToTermDouble $fToTermLvl $fToTermNat $fFromTerm[]$fFromTermBool$fFromTermMetaId$fFromTermQName $fFromTermStr$fFromTermChar$fFromTermDouble $fFromTermLvl $fFromTermNat$fFromTermInteger$fEqNat$fOrdNat$fNumNat $fEnumNat $fRealNat$fEqLvl$fOrdLvl simplifyTTerm $fShowAtom$fEqAtom $fOrdAtom BuiltinKitnatinteliminateLiteralPatterns transformeliminateCaseDefaults YesNoMaybeMaybeHellNoinitialIFSCandidates findInScope findInScope'insidePirigidlyConstrainedMetasisRigidareThereNonRigidMetaArgumentsfilterResetingStatedropSameCandidatesisNocheckCandidatesisIFSConstraintapplyDroppingParameters$fShowYesNoMaybe matchedArgs foldMatchmatchCopattern matchPatternyesSimplification $fNullMatch PruneResultNothingToPrune PrunedNothingPrunedSomethingPrunedEverything FoldRigid foldRigidoccurs metaOccursVarsUnfoldStrategy YesUnfoldNoUnfold OccursCtxIrrelmodifyOccursCheckDefsinitOccursCheckdefNeedsCheckingtallyDefdefArgsunfoldleaveTopweaklystronglypatternViolation'abort goIrrelevant allowedVar takeRelevant liftUnderAbs occursCheckprune hasBadRigid isNeutralrigidVarsNotContainedInkillArgs killedType performKill $fOccursMaybe $fOccurs[] $fOccurs(,) $fOccursDom $fOccursArg $fOccursAbs $fOccursElim' $fOccursSort $fOccursType'$fOccursLevelAtom$fOccursPlusLevel $fOccursLevel$fOccursClause $fOccursDefn $fOccursQName$fFoldRigid(,) $fFoldRigid[]$fFoldRigidElim'$fFoldRigidDom$fFoldRigidArg$fFoldRigidAbs$fFoldRigidLevelAtom$fFoldRigidPlusLevel$fFoldRigidLevel$fFoldRigidSort$fFoldRigidType'$fFoldRigidTerm $fOccursTerm $fEqOccursCtx$fShowOccursCtx$fEqUnfoldStrategy$fShowUnfoldStrategy$fEqPruneResult$fShowPruneResult newProblem newProblem_ifNoConstraintswhenConstraintswakeupConstraintswakeupConstraints_solveAwakeConstraintssolveConstraint_checkTypeCheckingProblem InvertExcept CantInvert NeutralArg ProjectedVarRes SubstCandFVs ProjVarExcNoProjectedVarnoProjectedVarMetaKindRecordsSingletonRecordsLevelsfindIdx isBlockedTermisEtaExpandable assignTerm'newSortMetaBelowInf newSortMeta newSortMeta'newSortMetaCtxnewSortMetaCtx' newTypeMeta newTypeMeta_ newIFSMetaCtxnewValueMetaCtx newValueMeta'newValueMetaCtx' trueConditionnewArgsMetaCtxnewArgsMetaCtx' newRecordMetanewRecordMetaCtxnewQuestionMarknewQuestionMark' blockTermblockTermOnProblemblockTypeOnProblemunblockedTesterpostponeTypeCheckingProblem_postponeTypeCheckingProblem problemTypeetaExpandListenerswakeupListener allMetaKinds etaExpandMetaetaExpandBlocked assignWrapper assignMeta assignMeta'subtypingForSizeLtexpandProjectedVarsetaExpandProjectedVarcheckLinearity inverseSubstopenMetasToPostulates$fNoProjectedVar[]$fNoProjectedVarArg$fNoProjectedVarTerm $fEqMetaKind$fEnumMetaKind$fBoundedMetaKind$fShowMetaKindFullPartialprintHighlightingInfogenerateAndPrintSyntaxInfogenerateTokenInfogenerateTokenInfoFromStringprintSyntaxInfoprintErrorInfoerrorHighlightingprintUnsolvedInfocomputeUnsolvedMetaWarningscomputeUnsolvedConstraintsstoreDisambiguatedName MaybeAbortAbort KeepGoingInvViewInvNoInv headSymbolcheckInjectivityfunctionInverseuseInjectivity tryConversiontryConversion'sameVars intersectVars equalAtom convError unifyPointersassignEcompareTermDir compareTerm' etaInequalcompareAtomDircomputeElimHeadType compareDomcompareRelevance antiUnify antiUnifyTypeantiUnifyElimscompareIrrelevantcompareWithPol polFromCmpcoerce coerceSizeleqSortleqLevel equalLevel equalLevel' bothAbsurd ErrorPartStrPartTermPartunquote UnquoteResUnquoteM UnquoteStateDirtyClean agdaTermType agdaTypeType qNameTypeunpackUnquoteM packUnquoteM runUnquoteMliftUliftU1liftU2inOriginalContextisConisDefreduceQuotedTermunquoteN ensureDef ensureConpickName unquoteStringunquoteNStringgetCurrentPath unquoteTCMevalTCM$fUnquoteClause$fUnquotePattern $fUnquoteTerm$fUnquoteLiteral $fUnquoteSort $fUnquoteDom$fUnquoteMetaId $fUnquoteAbs$fUnquoteQName$fUnquoteRelevance$fUnquoteHiding $fUnquote[] $fUnquoteStr $fUnquoteChar$fUnquoteDouble$fUnquoteInteger $fUnquoteBool$fUnquoteElim' $fUnquoteArg$fUnquoteArgInfo$fUnquoteErrorPart$fPrettyTCMErrorPart $fEqDirtyHypSizeConstraint sizeContext sizeHypIdssizeHypothesessizeConstraintSizeConstraint DBSizeExpr sizeMetaId sizeMetaArgs NamedRigid rigidName rigidIndexDefaultToInftyDontDefaultToInftyCCsolveSizeConstraintscastConstraintToCurrentContext'castConstraintToCurrentContextsolveSizeConstraints_ solveClustergetSizeHypothesescanonicalizeSizeConstraintcomputeSizeConstraintsizeExpr unSizeExpr$fPlusNamedRigidIntNamedRigid$fPrettyNamedRigid$fOrdNamedRigid$fEqNamedRigid$fSubstTermSizeExpr'$fSubstTermSizeMeta$fPrettyTCMSizeMeta$fPrettySizeMeta $fOrdSizeMeta $fEqSizeMeta$fPrettyTCMConstraint'$fSubstTermConstraint'$fPrettyTCMHypSizeConstraint $fFlexsSizeMetaHypSizeConstraint$fEqDefaultToInfty$fOrdDefaultToInfty$fShowDefaultToInfty$fShowNamedRigid$fShowSizeMetaUnificationResult'UnifiesNoUnifyUnificationResult unifyIndices$fReduceEquality$fPrettyTCMUnifyState$fNormaliseUnifyState$fReduceUnifyState$fPrettyTCMUnifyStep$fMonoidUnifyOutput$fSemigroupUnifyOutput$fShowUnificationResult'$fFunctorUnificationResult'$fFoldableUnificationResult'$fTraversableUnificationResult'$fShowUnifyState$fShowUnifyStepCovering covSplitArgcovSplitClauses SplitClauseSClausescTelscPatsscSubstscModuleParameterSubscTarget splitClausesclauseToSplitClause coverageCheck isCovered fixTargetsplitClauseWithAbsurd splitLast splitResult$fPrettyTCMSplitClause$fMonoidErrorNonEmpty$fSemigroupErrorNonEmpty splitProblem GetMatchables getMatchables NLPatVarsnlPatVarsUnder nlPatVarsRelView relViewTel relViewDelta relViewType relViewType' relViewCorerequireOptionRewritingrelViewaddRewriteRuleaddRewriteRules rewriteWithrewArity $fFreeNLPType $fFreeNLPat$fNLPatVarsNLPat$fNLPatVarsNLPType $fNLPatVarsf$fGetMatchablesRewriteRule$fGetMatchablesNLPat$fGetMatchablesfForcedVariablesforcedVariablesaddForcingAnnotationsforce$fForcedVariablesTerm$fForcedVariablest checkDataDef forceSort smallParamscheckConstructorbindParametersbindParameters'fitsIn constructs isCoinductive LHSResult lhsParameters lhsVarTele lhsPatterns lhsBodyType lhsPatSubst lhsAsBindings ProjectnsProjectnIsFlexiblePatternmaybeFlexiblePatternisFlexiblePatternflexiblePatternsupdateInPatternsisSolvedProblemproblemAllVariablesnoShadowingOfConstructorscheckDotPatterncheckLeftoverDotPatterns bindLHSVarsbindAsPatternscheckLeftHandSidecheckLHSnoPatternMatchingOnCodatacheckStrippedDotPattern$fIsFlexiblePatternNamed$fIsFlexiblePatternArg$fIsFlexiblePattern[]$fIsFlexiblePatternPattern'$fIsFlexiblePatternPattern'0$fInstantiateFullLHSResultLamOrPiLamNotPiPiNotLamisTypeptsRulenoFunctionsIntoSize isTypeEqualToleqType_checkTelescopecheckPiTelescopecheckTelescope'checkTypedBindingscheckTypedBinding checkLambdalambdaIrrelevanceChecklambdaAddContextinsertHiddenLambdascheckAbsurdLambdacheckExtendedLambda!catchIlltypedPatternBlockedOnMetaexpandModuleAssignscheckRecordExpressioncheckRecordUpdate checkLiteral scopedExpr quoteGoal quoteContextunquoteM inferProjApp checkProjAppinferOrCheckProjAppcheckApplicationcheckQuestionMarkcheckUnderscore checkMeta inferMetacheckOrInferMeta domainFree inferHeadDef inferHeadinferDefcheckConstructorApplicationcheckHeadApplication traceCallEcheckKnownArgumentscheckKnownArgument checkNamedArgcheckArguments_ inferExpr'defOrVarcheckDontExpandLastisModuleFreeVarinferExprForWithcheckLetBindingscheckLetBinding $fEqLamOrPi $fShowLamOrPibindPostulatedName bindBuiltinisUntypedBuiltinbindUntypedBuiltinbindBuiltinNoDef typeOfInf typeOfSharp typeOfFlatStackFrameClsClclPatsclBodycompileWithSplitTreecompile nextSplit properSplitisVarsplitOnsplitCexpandCatchAllsensureNPatterns substBody $fPrettyCl$fShowCl checkRecDefcheckRecordProjections preAction postActionrelevanceAction inferSortreconstructParametersInTypereconstructParametersInTelreconstructParametersInEqViewreconstructParametersdropParametersAbsTermabsTerm IsPrefixOf isPrefixOftypeOf abstractTypepiAbstractTerm piAbstract abstractTermswap01$fIsPrefixOfTerm$fIsPrefixOf[]$fIsPrefixOf[]0 $fAbsTerm(,) $fAbsTermAbs$fAbsTermMaybe $fAbsTerm[] $fAbsTermDom $fAbsTermArg$fAbsTermElim'$fAbsTermLevelAtom$fAbsTermPlusLevel$fAbsTermLevel $fAbsTermSort$fAbsTermType' $fAbsTermPtr $fAbsTermTermsplitTelForWithwithFunctionType countWithArgs withArgumentsbuildWithFunctionstripWithClausePatternswithDisplayForm patsToElimsWithFunctionProblemNoWithFunction WithFunction wfParentNamewfName wfParentType wfParentTel wfBeforeTel wfAfterTelwfExprs wfExprTypes wfRHSType wfParentPatswfParentParams wfPermSplit wfPermParent wfPermFinal wfClausescheckMacroTypeisAlias checkAlias checkFunDefSinsertPatterns checkClausecheckRHS checkWithRHScheckWithFunction checkWhereatClauseCallPath callInfosMaskedgetMask getMaskedMaskedDeBruijnPatternsUsableSizeVarsusableSizeVarsTerMterMMonadTerterAskterLocalterAsksTerEnvterUseDotPatternsterGuardingTypeConstructorsterInlineWithFunctions terSizeSucterSharp terCutOff terCurrent terMutual terUserNamesterHaveInlinedWith terTarget terDelayed terMaskArgs terMaskResult _terSizeDepth terPatternsterPatternsRaise terGuarded terUseSizeLt terUsableVarsTarget MutualNames defaultTerEnvrunTer runTerDefaultterGetGuardingTypeConstructorsterGetInlineWithFunctionsterGetUseDotPatternsterSetUseDotPatterns terGetSizeSuc terGetCurrent terSetCurrent terGetSharp terGetCutOff terGetMutualterGetUserNames terGetTarget terSetTargetterGetHaveInlinedWithterSetHaveInlinedWith terGetDelayed terSetDelayedterGetMaskArgsterSetMaskArgsterGetMaskResultterSetMaskResultterGetPatternsterSetPatternsterRaise terGetGuardedterModifyGuarded terSetGuarded terUnguarded terPiGuarded terSizeDepthterGetUsableVarsterModifyUsableVarsterSetUsableVarsterGetUseSizeLtterModifyUseSizeLtterSetUseSizeLtwithUsableVars conUseSizeLt projUseSizeLtisProjectionButNotCoinductiveisCoinductiveProjection patternDepth unusedVarmasked notMaskedterSetSizeDepth$fPrettyTCMMasked$fDecorationMasked $fMonoidTerM$fSemigroupTerM$fHasConstInfoTerM$fMonadErrorTCErrTerM$fMonadTCMTerM $fMonadIOTerM$fMonadStateTCStateTerM$fMonadReaderTCEnvTerM$fUsableSizeVars[]$fUsableSizeVarsMasked$fUsableSizeVars[]0$fUsableSizeVarsPattern'$fMonadTerTerM$fPrettyCallPath $fEqMasked $fOrdMasked $fShowMasked$fFunctorMasked$fFoldableMasked$fTraversableMasked $fFunctorTerM$fApplicativeTerM $fMonadTerM$fMonadBenchTerM$fHasOptionsTerM$fMonadDebugTerM$fShowCallPath$fSemigroupCallPath$fMonoidCallPath$fAllNamesCallPathinlineWithClausesisWithFunctionexpandWithFunctionCallResulttermDecl termMutual$fTermToPatternTermPattern'$fTermToPatternNamedNamed$fTermToPatternArgArg$fTermToPattern[][]$fExtractCallsLevelAtom$fExtractCallsPlusLevel$fExtractCallsTerm$fExtractCallsType'$fExtractCallsSort$fExtractCalls(,)$fExtractCalls[]$fExtractCallsElim'$fExtractCallsDom$fExtractCallsArg$fExtractCallsAbs$fStripAllProjectionsTerm$fStripAllProjections[]$fStripAllProjections[]0$fStripAllProjectionsArg$fExtractCallsLevelShowHeadshowHead FinalCheckscheckDeclCached mutualChecksrevisitRecordPatternTranslationcheckUnquoteDeclcheckUnquoteDef unquoteTopinstantiateDefinitionType highlight_checkTermination_checkPositivity_checkCoinductiveRecordscheckInjectivity_checkProjectionLikeness_whenAbstractFreezeMetasAfter checkAxiomcheckPrimitiveassertCurrentModule checkPragma checkMutualcheckTypeSignature checkSectioncheckModuleAritycheckSectionApplication' checkImportdebugPrintDecl$fShowHeadDeclarationcomputeErasedConstructorArgs eraseTerms $fEqTypeInfo$fShowTypeInfo toTreelessclosedTermToTreelesstranslateCopatternClauses$fHasRangeProjEntry $fRename(,)$fRenameEither $fRename[] $fRenameNamed $fRenameArg$fRenameDeclaration$fRenamePattern'$fRenameLHSCore' $fRenameLHS $fRenameRHS$fRenameStrippedDotPattern$fRenameNamedDotPattern$fRenameClause'$fRenameTypedBinding$fRenameTypedBindings$fRenameLamBinding$fRenameLetBinding$fRenameFieldAssignment'$fRenameModuleName $fRenameExpr $fRenameName $fRenameQName $fAlpha[] $fAlphaNamed $fAlphaArg $fAlphaLHS$fAlphaLHSCore'$fAlphaPattern' $fAlphaName $fFunctorPath $fEqProjEntry$fOrdProjEntryparseLHS parsePatternparsePatternSynparseApplicationparseModuleApplication $fEqExprKind$fShowExprKindparseIdiomBrackets LeftHandSide AbstractRHS RightHandSideLetDefLetDefs TopLevelInfo topLevelDecls topLevelScopeTopLevel topLevelPathtopLevelExpectedNametopLevelTheThing OldModuleNameNewModuleQName NewModuleNameAPatNamePatNameOldNameOldQNameNewNameconcreteToAbstract_concreteToAbstractlocalToAbstract$fToAbstractPattern'Pattern'$fToAbstractLHSCore'LHSCore' $fToAbstractWithHidingWithHiding'$fToAbstractTypedBindings'TypedBindings,$fToAbstractFieldAssignment'FieldAssignment'$fToAbstractMaybeMaybe$fToAbstractEitherEither$fToAbstract(,,)(,,)$fToAbstract(,)(,)!$fToAbstractLamBinding'LamBinding$fToAbstractNewNameName$fToAbstractNewNameName0$fToAbstractPatternPattern'$fToAbstractOldQNameExpr$fToAbstractLHSCoreLHSCore'$fToAbstractPatNameAPatName$fToAbstractOldNameQName$fToQNameQName $fToQNameName#$fToAbstractNewModuleNameModuleName$$fToAbstractNewModuleQNameModuleName$fToAbstractModuleAssignment(,)#$fToAbstractOldModuleNameModuleName$fEnsureNoLetStms[]$fEnsureNoLetStmsTypedBindings'$fEnsureNoLetStmsLamBinding'$fEnsureNoLetStmsTypedBinding' $fToAbstractTopLevelTopLevelInfo%$fToAbstractTypedBinding'TypedBinding$fToAbstractExprExpr$fToAbstractLetDef[]$fToAbstractLetDefs[]$fToAbstractBlindBlind!$fToAbstractConstrDeclDeclaration&$fToAbstractNiceDeclarationDeclaration$fToAbstractRHS'AbstractRHS$$fToAbstractRightHandSideAbstractRHS$fToAbstractAbstractRHSRHS$fToAbstractLeftHandSideLHS$fToAbstractClauseClause'$fToAbstractPragma[]OutputConstraint'OfType'ofNameofExprOutputConstraintOfType CmpInTypeCmpElimJustTypeCmpTypes CmpLevelsCmpTelesJustSortCmpSortsGuard TypedAssignPostponedCheckArgs IsEmptyType SizeLtSat FindInScopeOF OutputFormUseForce WithForce WithoutForce ComputeModeDefaultComputeIgnoreAbstractUseShowInstanceRewriteAsIs Instantiated HeadNormal Simplified Normalised parseExpr parseExprIngiveExpr redoChecksgiverefine evalInCurrent evalInMeta normalFormcomputeIgnoreAbstractcomputeWrapInput showComputed outputFormIdreifyElimToExprshowComparisongetConstraintsgetSolvedInteractionPoints typeOfMetaMI typeOfMeta typeOfMeta'typesOfVisibleMetastypesOfHiddenMetasmetaHelperType contextOfMeta typeInCurrent typeInMetawithInteractionId withMetaId introTactic atTopLevel parseNameisQNamemoduleContentsgetRecordContentsgetModuleContents,$fToConcreteOutputConstraintOutputConstraint$fShowOutputConstraint!$fReifyConstraintOutputConstraint $fToConcreteOutputFormOutputForm$fShowOutputForm$fReifyProblemConstraintClosure.$fToConcreteOutputConstraint'OutputConstraint'$fPrettyOutputConstraint' $fShowRewrite $fReadRewrite$fShowComputeMode$fReadComputeMode$fEqComputeMode $fEqUseForce$fReadUseForce$fShowUseForce$fFunctorOutputConstraint$fFunctorOutputForm findMentionsCommandExitCodeContinue ContinueInReturn matchCommand interaction continueAfterwithCurrentFileloadFileshowConstraints showMetas showScope metaParseExpr actOnMetagiveMeta refineMetaretryConstraintsevalInevalTermtypeIn showContext splashScreenhelp CaseContextparseVariablesgetClauseForIPmakeCasemakePatternVarsVisiblemakeAbsurdClausemakeAbstractClause ConversionconvertMOTTOMsConstssMetassEqssCurMeta sMainMetaMapSTModeTMAllHinthintIsConstructor hintQNameinitMapSpopMapStomygetdfvgetMetagetEqscopatternsNotImplementedliteralsNotImplementedtomyIneqfmTypefmExpfmExpsfmLevelicnvh frommyExps abslamvarnamemodifyAbstractExprmodifyAbstractClause constructPats frommyClausecontains_constructornegtypefindClauseDeep matchType$fConversionExceptTExpTerm$fConversionExceptTExpType'$fConversionExceptTAbsAbs$fConversionExceptTMMb$fConversionStateT[]MM$fConversionStateTArg(,)$fConversionStateTTermMM$fConversionStateTType'MM$fConversionStateTArgPat$fConversionStateTClauseMaybe$fConversionStateT[][] $fEqTMode AutoResult autoProgress autoMessage AutoProgress Solutions FunClauses Refinementauto MaybeWarningsMaybeWarnings' NoWarnings SomeWarnings MainInterfaceNotMainInterface ScopeCheck TypeCheckincludeStateChangesmergeInterfaceaddImportedThingsapplyFlagsToMaybeWarnings hasWarningsalreadyVisited typeCheckMain getInterface getInterface_ getInterface'isCachedgetStoredInterface typeCheckchaseMsghighlightFromInterface readInterfacewriteInterfaceremovePrivatescreateInterfacegetAllWarnings'getAllWarningserrorWarningsOfTCErrconstructIScopebuildInterfacegetInterfaceFileHashes moduleHash isNewerThan$fNullMaybeWarnings'$fEqMode $fShowMode$fEqMainInterface$fShowMainInterface$fFunctorMaybeWarnings'$fFoldableMaybeWarnings'$fTraversableMaybeWarnings'DotMDotState dsModules dsNameSupply dsConnectionModuleIdinitialDotState addModule addConnectiondottify generateDotIsMainNotMain doCompile setInterfacecurIFcurSigcurMNamecurDefssortDefssigMName compileDirreplconArityAndPars inCompilerEnv$fMonoidIsMain$fSemigroupIsMain $fEqIsMain $fShowIsMainKindOfForeignCodeForeignFileHeaderPragma ForeignImport ForeignOther HaskellPragmaHsDefnHsTypeHsDataHsExport parsePragmaparseHaskellPragmagetHaskellPragmasanityCheckPragmagetHaskellConstructorforeignHaskellclassifyForeignclassifyPragmapartitionByKindOfForeignCode$fHasRangeHaskellPragma$fShowHaskellPragma$fEqHaskellPragmacurHsModihnameunqhnametlmodOfxqualxhqnhsNameconhqnbltQualdnamedunamehsPrimOp hsPrimOpApphsInt hsTypedInthsLethsVarUQ hsAppView hsOpToExphsLambdahsMapAlthsMapRHSmazstrmazNamemazMod'mazModmazerror mazCoerceName mazErasedName mazCoercemazIncompleteMatchrtmIncompleteMatchmazUnreachableErrorrtmUnreachableErrormazRTErtmQualrtmVarrtmErrorunsafeCoerceModfakeDfakeDSfakeDQfakeTypefakeExpfakeDecl emptyBinds isModCharencodeModuleName prettyPrint prettyWhere prettyRhsprettyGuardedRhs prettyQName $fPrettyQOp $fPrettyAlt $fPrettyStmt $fPrettyType$fPrettyTyVarBind$fPrettyDataOrNew $fPrettyBinds $fPrettyPat $fPrettyMatch$fPrettyConDecl $fPrettyDecl$fPrettyImportSpec$fPrettyImportDecl$fPrettyModulePragmaisMainFunctionhasMainFunctioncheckTypeOfMaintreelessPrimNameimportsForPrimxForPrimprimBody noCheckCoverpconNamebltQual' HaskellKindhsStarhsKFunhsFunhsUnithsVarhsApphsForallnotAHaskellType getHsTypegetHsVar haskellType' haskellTypecheckConstructorCount generateLaTeX $fShowKind$fShowAlignmentColumn $fShowOutput $fEqDebug $fShowDebugdefaultCSSFile generateHTMLgenerateHTMLWithPageGen generatePagepage tokenStream RecompileBackend' backendNamebackendVersionoptionscommandLineFlags isEnabled preCompile postCompile preModule postModule compileDefscopeCheckingSuffices callBackendparseBackendOptionsbackendInteraction GiveRefineGiveRefineIntroCompilerBackendLaTeX QuickLaTeX OtherBackendParseIOTCM'IOTCM Interaction'Cmd_load Cmd_compileCmd_constraints Cmd_metas Cmd_warnings!Cmd_show_module_contents_toplevelCmd_search_about_toplevel Cmd_solveAll Cmd_solveOneCmd_infer_toplevelCmd_compute_toplevelCmd_load_highlighting_info Cmd_highlightShowImplicitArgsToggleImplicitArgsCmd_give Cmd_refine Cmd_introCmd_refine_or_introCmd_auto Cmd_contextCmd_helper_function Cmd_infer Cmd_goal_typeCmd_goal_type_contextCmd_goal_type_context_inferCmd_goal_type_context_checkCmd_show_module_contents Cmd_make_case Cmd_computeCmd_why_in_scopeCmd_why_in_scope_toplevelCmd_show_version Cmd_abort Interaction CommandQueueCommandMOldInteractionScopes CommandStatetheInteractionPointstheCurrentFileoptionsOnReloadoldInteractionScopes commandQueueinitCommandStatelocalStateCommandMliftLocalStaterevLift commandMToIO liftCommandMTliftCommandMTLocalStatemodifyTheInteractionPointsmodifyOldInteractionScopesinsertOldInteractionScoperemoveOldInteractionScopegetOldInteractionScopehandleCommand_ handleCommandrunInteraction nextCommand maybeAbortinitialiseCommandQueue readsToParseparseToReadsPrecexact readParseparens' independent interpretinterpretWarningssolveInstantiatedGoals cmd_load'give_gen highlightExprsortInteractionPointsprettyTypeOfMeta prettyContextcmd_helper_functioncmd_goal_type_context_andshowModuleContents searchAboutsetCommandLineOptsstatus displayStatus display_info refreshStr nameModifiersparseAndDoAtToplevel'parseAndDoAtToplevel maybeTimedtellToUpdateHighlightingtellEmacsToJumpToError$fReadPosition'$fReadAbsolutePath$fReadInterval' $fReadRange'$fReadInteractionId$fReadCompilerBackend$fShowCompilerBackend$fEqCompilerBackend$fShowInteraction'$fReadInteraction'$fFunctorInteraction'$fFoldableInteraction'$fTraversableInteraction' $fShowIOTCM' $fReadIOTCM'$fFunctorIOTCM'$fFoldableIOTCM'$fTraversableIOTCM' $fShowCommand$fEqGiveRefine$fShowGiveRefine mimicGHCi CCContext NameSupplyCCEnv ccNameSupplyccCxt GHCModuleEnv GHCOptions optGhcCompile optGhcCallGhc optGhcFlags ghcBackend ghcBackend'defaultGHCOptionsghcCommandLineFlags ghcPreCompileghcPostCompile ghcPreModule ghcPostModule ghcCompileDefimports definitionconstructorCoverageCode mapNameSupply mapContext initCCEnv freshNamesintroscheckConstructorType checkCoverterm compilePrimalthslitlitqname litqnamepat erasedAritycondeclcdeclcompiledcondeclcompiledTypeSynonymtvaldeclinfodeclhsCasthsCast' hsCastApphsCoercecopyRTEModules writeModuleoutFile'outFileoutFile_callGHC JSModuleEnv JSOptions optJSCompile jsBackend jsBackend'defaultJSOptionsjsCommandLineFlags jsPreCompile jsPostCompile jsPreModule jsPostModule jsCompileDefprefixjsMod jsFileNamejsMemberglobal'globalreorderreorder'isTopLevelValue isEmptyObject insertAfter curModulecheckCompilerPragmasdefJSDef definition' compileTerm compileTerm' compileAlt visitorNameflatNamelocal primitivesbuiltinBackendsrunAgdarunAgda'defaultInteractionrunAgdaWithOptions printUsage backendUsage printVersion optionErrorrunTCMPrettyErrorsmainghc-prim GHC.TypesBool integer-gmpGHC.Integer.Type Data.EithereitherEitherTrueRightLeftJustNothingHomeGHC.Num+Functor3unordered-containers-0.2.8.0-4H1ZIlO2rbIFiwyuQdvUPXData.HashMap.BaseHashMapData.HashMap.Strict unionWithKeymapMaybeWithKeyintersectionWithKeyintersectionWithdifferenceWithaltertraverseWithKey lookupDefault foldrWithKeyfoldr foldlWithKey'foldl' filterWithKeyGHC.IO.ExceptionGHC.IOcatchconvertLineEndings GHC.IORefIORef Data.IORefatomicWriteIORefatomicModifyIORef'atomicModifyIORef modifyIORef' modifyIORef mkWeakIORef writeIORef readIORefnewIORefGHC.ListmaybefromJust isNothingisJust#strict-0.3.2-7ZEebv7EabCEjNWrS66TpZData.Strict.Maybe readP_to_S readS_to_PPGetLookFinalOrdering GHC.ClassesOrdptrTagptrRefGHC.ShowShowshowpretty-1.1.3.3Text.PrettyPrint.HughesPJ fullRender renderStylerenderfcatcat doubleQuotesquotesrationaldoublefloatintegerrbracelbracerbracklbrackrparenlparenspacesemi zeroWidthText sizedTextptext#Text.PrettyPrint.Annotated.HughesPJstyleChrPStrStylemode lineLengthribbonsPerLinePageMode ZigZagModeLeftMode OneLineModeDocsPGFalseValueContPospgparserdocsstarDocs prettyKey memoiseDocsunPresults continuationssingletonOrEveryPrefixinitlastEq Data.OldListgroupBy==.sortBycompare System.IOputStrLn GenericLineHeaderContentfName fOptionalfParsefSetgeHeader geContent GenericFile agdaLibFieldsFilePathparseLib fromGeneric fromGeneric' checkFields findField parseGeneric parseLine groupLines GenericEntry stripCommentsdisplayInBufferrunningInfoBufferName dropWhilerootNamedirectory-1.3.0.2System.DirectorycanonicalizePath doesFileExistbyteStringPathmkLayersbleachisBlankbreak1getLine emptyLiteraterexPEnvpPrecpFreshpBound<=Data.Map.Internal discardEmptyremoveSourceNoderemoveTargetNodeData.Map.Strict.InternalGHC.EnummaxBound completeIter Data.Foldablefoldr1orall&&anymapM mergeAspectsMonoid-geniplate-mirror-0.7.5-5wdQhDVfb5iIhDZt2oHFT4Data.Generics.GeniplateinstanceUniverseBiT universeBiinstanceTransformBiMT transformBiM TransposetoBoundsinfSizelengthblowUpSparseVecunionAssocWithcollapseokMmaxOminOmappendcombineNewOldCallGraph CombineNewOld combineNewOld ErrorFunctionErrorFun unLookAheadlitError stringToken lexString lexStringGaplexChar lexEscapereadNum readNumAccsillyEscapeCharspragmaalexScanGHC.Err undefinedAlexAcc AlexAccNone AlexAccSkip AlexAccPredAlexAccSkipPred AlexLastAccAlexNone AlexLastSkipAlexAddrAlexA# happyErrortakeOptionsPragmasfigureOutTopLevelModulemkQName pragmaQNameisNameforallPitLetaddTypeverifyImportDirectivevalidHaskellModuleName exprToLHS exprToPattern exprToName HappyAddrHappyA#HappyStk Happy_IntList HappyCons RHSOrTypeSigsJustRHS TypeSigsRHSRecordDirectiveEta HappyAbsSyn returnEOFskipTonewInputfoolAlex qualified getOffside occurrenceFVflexible irrelevantlyunusedfreeIn' RelevantIn getRelevantInChangeT evalUpdater fromChange fromChangeT MakePrivate MakeAbstractNiceEnv _loneSigs_termChk_posChk _catchallniceWarn DataRecOrFunDataNameRecNameFunNameInMutual NotInMutual KindOfBlockPostulateBlockPrimitiveBlock InstanceBlock FieldBlock DataBlockParamscombineTermChecksmatchParameters initNiceEnvloneSigs addLoneSig removeLoneSiggetSig noLoneSigs checkLoneSigsterminationCheckPragmapositivityCheckPragmacatchallPragmapopCatchallPragma niceWarning getFixity parameters plusFixitiesfixitiesAndPolaritiesFixities NiceWarnings mkPrivate mkAbstractDeclKindLoneSigLoneDefs OtherDeclfixspolsunNice kindPosCheck kindParams parseFileExts withCommentswithoutComments parseLiterateFreeT fcIgnoreSorts fcContext subtractFVFreeConf getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName LibErrorIOLibError LibNotFound AmbiguousLib OtherErrormkLibM getAgdaAppDirdefaultLibraryFiles defaultsFilefindAgdaLibFilesreadDefaultsFilegetLibrariesFile parseLibFilesstripCommentLinesformatLibErrorfindLibhasMatch CopyDirActionMkDirCopyFile performActioncopyDirContentDryRun copyIfChangeddefaultLaTeXDirdefaultHTMLDirdefaultWarningMode splitAltsAsPat)hashtables-1.2.1.1-D9Ul8Z4BRE1FdKMJhpVbqVData.HashTable.IOCuckooHashTableBasicHashTableLinearHashTablematchLeq inequalities:=< benchmarking modifyCounter addBindingunsafeQNameToName bindName'bracket'bracket bracketP_isParenlessLambda withInfixDeclwithAbstractPrivatebindToConcreteCtx toConcreteTopbindToConcreteToptoConcreteHidingbindToConcreteHiding recoverOpAppHdHdVarHdConHdDef FreshenNameBindingPattern BindingPat SplitPattern UserPattern AsWhereDecls takenNames currentScope icodeFileModSynEqMinequalifEqualsynEqsynEq'cyclicrecDef BlankVarsnappsappsnelimselimsreifyDisplayFormreifyDisplayFormPnameFirstIfHiddenstripImplicitstryRecPFromConP varsBoundInblank MonoidMap unMonoidMaptoAtoms showAspects IdentityInIdInisZeroisSucisPosisNegSucisPlusisTimesisLessisEqualisForce Data.MonoidAny conPattern RecordTreeLeafRecConVarPatDotPatKindRecPatMDropFromRecordSplitTreeRecordSplitNodesplitCon splitAritysplitRecordPattern conjColumns insertColumn cutSublistreplaceByProjections isRecordCaserecordSplitTree runRecPatMnextVar projections removeTreetranslatePattern recordTree translateTelData.Sequence.Internal IndefinitedropTopLevelModule'topLevelModuleDropper prettyInEqual Verbalize verbalize PrettyUnequal prettyUnequalAtomNeg FunctionKitmodAuxdivAuxnatMinustruefalseSEnvenvSubst envRewrite NameKindstokenHighlighting nameKindsgenerateConstructorInfowarningHighlightingterminationErrorHighlightingpositivityErrorHighlightinggenerate nameToFile nameToFileA getVarType getEqualitygetEqualityUnraisedaddEqssolveVarsolveEq simplifyEqisHomisEtaVar UnifyOutput unifySubst unifyProofunifyLog UnifyLogEntryUnificationDoneUnificationStep UnifyStepDeletionConflictCycle EtaExpandVarEtaExpandEquation LitConflict StripSizeSucSkipIrrelevantEquationTypeConInjectivitydeleteAt deleteType deleteLeft deleteRight solutionAt solutionType solutionVar solutionTerminjectAt injectTypeinjectDatatypeinjectParameters injectIndicesinjectConstructor conflictAtconflictDatatypeconflictParameters conflictLeft conflictRightcycleAt cycleDatatypecycleParameterscycleVar cycleOccursIn expandVarexpandVarRecordTypeexpandVarParametersexpandAtexpandRecordTypeexpandParameters litConflictAtlitConflictLeftlitConflictRightstripAt stripArgLeft stripArgRightskipIrrelevantAttypeConInjectAttypeConstructortypeConArgsLefttypeConArgsRight UnifyStateUStatevarTelflexVarseqTeleqLHSeqRHSEqualityeqTypeeqLefteqRightcoverinferMissingClausecomputeNeighbourhoodsplitlookupPatternVarsplit' CoverResultcoverSplitTreecoverUsedClausescoverMissingClausescoverNoExactClauses FailBecause ErrorNonEmptycheckConstructorParameterscheckParametersinductiveCheckbindBuiltinEqualityFastCompiledClausesFCaseFDoneFFail fprojPatterns fconBranches flitBranchesfcatchAllBranchCForceCTyConCOtherFastCase FBranches fsucBranch CompactDefnCFunCCon cfunCompiledcfunProjection cconSrcCon CompactDef cdefDelayedcdefNonterminatingcdefDefcdefRewriteRules checkType' fullyApplyCon checkArgInfocheckRelevance inferDef' inferSpine inferSpine'shouldBeProjectible shouldBeSort checkSort checkLevelmetaTypesubtype eliminate checkSpine checkArgsinlineWithClauses'withExprClausesfmapinlinedClausesinlineStripAllProjections ExtractCalls TermToPatternCalls termDecl' termMutual'terminationError reportCalls termFunction typeEndsInDeftermDefsetMasks targetElem termToDBPmaskNonDataArgs termClause constructorguardPresTyCon withFunctionfunction maskSizeLtannotatePatsWithUseSizeLt compareElim compareProjmakeCMaddGuardednesscomposeGuardednessoffsetFromConstructor subPatternssubTerm compareVarVarstripAllProjectionsextract termToPattern isCompleteTypeInfoErasable NotErasableESt_funMap_typeMap ccCatchAll cacheTreeless lookupLevel casetreeTopwithContextSize lambdasUpTo replaceVarmkRecord substTermAlphapatsPEPaththePath groupClauses pathToRecord groupPathesalphaalpha'Renamerename' ProjEntryprojPE theContentPatternCheckConfigtopNameconNamesfldNamesParsers billToParsergetDefinedNames localNames buildParserspatternAppViewparsePat parseLHS'classifyPatternvalidConPatternqualifierModulesExprKind IsPatternpToppApppArgspNonfixpAtomWithRHS' rhsRewriteEqn rhsWithExpr rhsSubclausesEnsureNoLetStmscheckPatternLinearity noDotPatternrecordConstructorTypecheckModuleMacronotPublicWithoutOpen renamingRange checkOpen toAbstractCtxlocalToAbstract' mkNamedArgmkArg'mkArg toAbstractDot toAbstractLamscopeCheckExtendedLamscopeCheckNiceModuletelHasOpenStmsOrModuleMacrosscopeCheckModule niceDeclstoAbstractOpArgtoAbstractOpApp AbsurdRHS' RewriteRHS'rhs rhsWhereDecls ConstrDecl IsRecordConYesRecNoRecBlindunBlindensureNoLetStmsToQNametoQName VarPatName ConPatNamePatternSynPatName newLetBoundnewNamegetEqCombinatorsgenericNotEnough codeBlockcolumncolumns columnsPrevnextId usedColumns countClustersAlignmentColumncolumnCodeBlock columnColumn columnKindIndentationColumnId Indentation AlignmentOutputText MaybeColumn agdaSpacedebugsrunLaTeXisSpacesisSpaceNotNewline replaceSpacesmoveColumnForToken resetColumnregisterColumn useColumn columnZeroregisterColumnZero enterCode leaveCode columnNameptOpen'ptOpenptOpenBeginningOfLine ptOpenIndent processLayers processMarkupprocessComment processCodespacestoLaTeX emptyState processTokensDebug MoveColumnNonCodeSpacesinfoState modToFile!!BackendWithOptsControl.Monad.Trans.State.LazyStateTControl.Monad.Trans.ClassControl.Monad.IO.ClassliftIO Text.ReadreadsformatWarningsAndErrorslispifyResponselastTag showNumIId