!!aY/      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_ ` 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.{.|.}.~..........................////00000000000000001111111111111111111111111111122222222222222222222222222222222222222222 2 2 2 2 2222222222222222222 2!2"2#2$2%2&2'2(2)2*2+2,2-2.2/202122232425262728292:2;2<2=2>2?2@2A2B2C2D2E2F2G2H2I2J2K2L2M2N2O2P2Q3R3S3T3U3V3W3X3Y3Z3[3\4]4^4_4`4a4b4c4d4e4f4g5h5i5j5k5l5m5n5o5p5q5r5s5t5u5v5w5x6y6z6{6|6}6~666666677777777778888888888888888888888888999999999999999999999::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<< < < = = =============>>>>>? ?!?"?#?$?%?&?'?(?)?*?+?,?-?./0123456789:;<=>?@ABCDEFGHI@J@K@L@M@N@O@P@Q@R@S@T@U@V@WAXAYAZA[A\B]B^B_B`BaBbBcBdBeBfBgBhBiBjBkBlBmBnBoBpBqBrBsBtBuBvBwBxByBzB{B|B}C~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CCCCCCCCCCCCDDDDDDD D!D"D#D$D%D&D'D(D)D*D+D,D-D.D/D0D1D2D3D4D5D6D7D8D9D:D;D<D=D>D?D@DADBDCDDDEDFDGDHEIEJEKELEMENEOEPEQERESETEUEVEWEXEYEZE[E\E]E^E_E`EaEbEcEdEeEfEgEhEiEjEkElEmEnEoEpEqErEsEtEuEvEwExEyEzE{E|E}E~EEEEEEEEEEEEEEEEEEEEEEEEFFFFFFFFFFFFFFFFFFFFFFFFFFGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH H H H H HHHHHHHHHHHHHHHHHHH H!H"H#H$H%H&H'H(H)H*H+H,H-H.H/H0H1H2H3H4H5H6H7H8H9H:H;H<H=H>H?H@HAHBHCHDHEHFHGHHHIHJHKHLHMHNHOHPHQHRHSHTHUHVHWHXHYHZH[H\H]H^H_H`HaHbHcHdHeHfHgHhHiHjHkHlHmHnHoHpHqHrHsHtHuHvHwHxHyHzH{H|H}H~HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH H H H H HHHHHHHHHHHHHHHHHHH H!H"H#H$H%H&H'H(H)H*H+H,H-H.H/H0H1H2H3H4H5H6H7H8H9H:H;H<H=H>H?H@HAHBHCHDHEHFHGHHHIHJHKHLHMHNHOHPHQHRHSHTHUHVHWHXHYHZH[H\H]H^H_H`HaHbHcHdHeHfHgHhHiHjHkHlHmHnHoHpHqHrHsHtHuHvHwHxHyHzH{H|H}H~HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIJJJJJJJJJJJJ 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 0J 1J 2J 3J 4J 5J 6J 7J 8J 9J :J ;J <J =J >J ?J @J AJ BJ CJ DK EK FK GK HK IK JK KK LL ML NL OL PL QL RL SL TL UL VL WL XL YL ZL [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 {L |L }L ~L L L L L L L L M M M M M M M M M M M M M M M M M M N N N N N N N N N N N N N N N N N N N N N O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O !O "O #O $O %O &O 'O (O )O *O +O ,O -O .O /O 0O 1O 2O 3O 4O 5O 6O 7O 8O 9O :O ;O <O =O >O ?O @O AO BO CO DO EO FO GO HO IO JO KO LO MO NO OO PO QO RO SO TO UP VP WP XP YP ZP [P \P ]P ^P _P `P aP bP cP dP eP fP gP hP iP jP kP lP mP nP oP pP qP rP sP tP uP vP wP xP yP zP {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 R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R 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 0S 1S 2S 3S 4S 5S 6S 7S 8T 9T :T ;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 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 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 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 )W *W +W ,W -W .W /W 0W 1W 2W 3W 4W 5W 6W 7W 8W 9W :W ;W <W =W >W ?W @W AW BW CW DW EW FW GW HW IW JW KW LW MW NW OW PW QW RW SW TW UW VW WW XW YX ZX [X \X ]X ^X _X `X aX bX cX dX eX fX gX hX iX jX kX lX mX nX oX pX qX rX sX tX uX vX wX xX yX zX {X |X }X ~X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X 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 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 0G 1G 2G 3G 4G 5G 6G 7G 8G 9G :G ;G <G =G >G ?G @G AY BY CY DY EY FY GY HY IY JY KY LY MY NY OY PY QY RY SY TY UZ VZ WZ XZ YZ ZZ [Z \Z ]Z ^Z _Z `Z aZ bZ cZ dZ eZ fZ gZ hZ iZ jZ kZ lZ mZ nZ oZ pZ qZ rZ sZ tZ uZ vZ wZ xZ yZ zZ {Z |Z }Z ~Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z 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]{]|]}]~]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^_________________________________________________```````` ` ` ` ` ``````````````````` `!`"`#`$`%`&`'`(`)`*`+`,a-a.a/a0a1a2a3a4a5a6a7a8a9a:a;a<a=a>a?a@aAaBaCaDaEaFaGaHaIaJaKaLaMaNaOaPaQaRbSbTbUbVbWbXbYbZb[b\b]b^b_b`babbbcbdbebfbgbhbibjbkblbmbnbobpcqcrcsctcucvcwcxcyczc{c|c}c~ccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddddddddeeeeeee e e e e eeeeeeeeeeeefffffff f!f"f#g$g%g&g'g(g)g*g+g,g-g.g/g0g1g2g3g4g5g6g7g8g9g:g;g<g=g>g?g@gAgBgCgDgEgFgGgHgIgJgKgLgMgNgOgPgQgRgSgTgUgVgWgXgYgZg[g\g]g^g_g`gagbgcgdgegfggghgigjgkglgmgngogpgqgrgsgtgugvgwgxgygzg{g|g}g~gggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghhhiiiiiiiiiiiiiiiiiiiiii i i i i iiiiiiiiiiiiiiiiiii i!i"i#i$i%i&i'i(i)i*i+i,i-i.i/i0i1i2i3i4i5i6i7i8i9i:i;i<i=i>i?i@iAiBiCiDiEiFiGiHiIiJiKiLiMiNiOiPiQiRiSiTiUiViWiXiYiZi[i\i]i^i_i`iaibicidieifigihiiijikilimjnjojpjqjrjsjtjujvjwjxjyjzj{j|j}j~jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkklllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmnnnnooooo o o o o ooooooooooopppppppp p!p"p#p$p%p&q'q(r)r*r+r,r-r.r/r0r1r2r3r4r5r6r7r8r9s:s;s<t=t>t?t@tAuBuCuDuEuFuGuHuIuJuKuLuMuNvOvPvQvRvSvTvUvVvWvXrYrZs[s\w]w^w_w`wawbwcwdwewfwgwhwiwjwkwlwmwnwowpwqwrwswtwuwvwwwxwywzw{w|w}w~wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww 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@wAwBwCwDwEwFwGwHwIwJwKwLwMwNwOwPwQwRwSwTwUwVwWwXwYwZw[w\w]w^w_w`wawbwcwdwewfwgwhwiwjwkwlwmwnwowpwqwrwswtwuwvwwwxwywzw{w|w}w~wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz z z z z zzzzzzzzzzzzzzzzzzz z!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|{|||}|~}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`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,{,|,},~,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,---------- - - - - ------------------- -!-"-#-$-%-&-'-(-)-*-+-,---.-/-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]^q_Agda Content of a  .agda-lib file.aAgda!The symbolic name of the library.bAgda Path to this  .agda-lib file (not content of the file).cAgda3Roots where to look for the modules of the library.dAgda Dependencies.eAgdaA symbolic library name.fAgdaThe special name "."S is used to indicated that the current directory should count as a project root. _`dcbaefg ef_`dcbag None"#$+-03457;<=>?ACNQV]^tiAgdaIn ], and -.M we want to know whether we are allowed to insert unicode characters or not.ijklijkl Safe"#$+-03457;<=>?ACNQV]^wmAgdaICut off structural order comparison at some depth in termination checker?nAgdac >= 0( means: record decrease up to including c+1.monmon Safe"#$+-03457;<=>?ACNQV]^!sAgda Semirings.uAgda Addition.vAgdaMultiplication.wAgdaWZero. The one is never used in matrix multiplication , one :: a -- ^ One.xAgdaHasZero 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.|AgdaThe standard semiring on /s.}AgdaThe standard semiring on /s.~AgdaThe standard semiring on /s. stwvuxyz{| xystwvuz{| Safe"#$+-03457;<=>?ACNQV]^AgdaA constant term.AgdaA term with one hole.Agda%A term with many holes (error value).None"#$+-013457;<=>?ACKNQV]^? AgdaFinite bijective map from a to b. There, and back again.AgdaLookup. O(log n).AgdaInverse lookup. O(log n).AgdaEmpty bimap. O(1).AgdaSingleton bimap. O(1).Agda=Insert. Overwrites existing value if present. O(Map.insert).Agda Left-biased Union. O(Map.union).AgdaConstruct from a list of pairs.KDoes not check for actual bijectivity of constructed finite map. O(n log n)AgdaATurn into list, sorted ascendingly by first value. O(Map.toList) Safe"#$+-03457;<=>?ACNQV]^5AgdaUnicode characters are divided into letters, numbers, marks, punctuation, symbols, separators (including spaces) and others (including control characters).These are the tests that /0 offers:AgdaConvert a character in '0'..'9' into the corresponding digit 0..9.AgdaConvert a character in '0'..'9','A'..'F','a'..'f'! into the corresponding digit 0..15.AgdaConvert a character in '0'..'7' into the corresponding digit 0..7.Agda,Test names paired with their implementation.Agda+Find out which tests a character satisfies.None"#$+-03457;<=>?ACNQV]^AgdaCharacteristic identifiers.AgdaGiven 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.AgdaPartition 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.Safe"#$+-03457;<=>?ACNQV]^7Agda Loop while we have an exception.AgdaMonadic version of /$ with a different argument ordering.Agda/ is a bifunctor.Agda'Either _ b' is a functor.Agda'Either a' is a functor.Agda/ is bitraversable.AgdaReturns / iff the argument is / x for some x. Note: from base >= 4.7.0.0 already present in  Data.Either.AgdaReturns / iff the argument is / x for some x. Note: from base >= 4.7.0.0 already present in  Data.Either.Agda Analogue of 12.Agda Analogue of 12.Agda Analogue of '3.Agda Analogue of '3.AgdaSafe projection from /. 8maybeLeft (Left a) = Just a maybeLeft Right{} = NothingAgdaSafe projection from /. <maybeRight (Right b) = Just b maybeRight Left{} = NothingAgdaReturns / input_with_tags_stripped if all elements are to the /, and otherwise /.AgdaReturns / 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 AgdaConvert / to / ().Safe"#$+-03457;<=>?ACNQV]^Safe"#$+-03457;<=>?ACNQV]^/AgdaaError class for backward compatibility (from Control.Monad.Trans.Error in transformers 0.3.0.0).AgdaAWe cannot define data constructors synonymous, so we define the  mkExceptT6 function to be used instead of the data constructor ExceptT.Agda#A string can be thrown as an error. !"# !# "None"#$+-03457;<=>?ACNQV]^mSafe"#$+-03457;<=>?ACNQV]^AgdaRepeat 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)).AgdaRepeat 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).AgdaMonadic version of .Agda%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.AgdaMonadic version of .AgdaUMore general trampoline, which allows some final computation from iteration state a into result type b.AgdaMonadic version of .AgdaIteration 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.AgdaMonadic version of .Agda n f x applies f to x n times and returns the result.)The applications are calculated strictly.AgdaapplyWhen b f a applies f to a when b.AgdaapplyUnless b f a applies f to a unless b.AgdaMonadic version of  applyWhenAgdaMonadic version of  applyUnlessNone"#$+-03457;<=>?ACNQV]^AgdaSemiring with idempotent / == dioidAgdaE.g. +Agdaneutral element of compose , e.g. zeroSafe"#$+-03457;<=>?ACNQV]^ Agda?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.Agda traverseF is the defining property.Agda%Decorations commute into any functor.Agda?Composition: pure function after functorial (monadic) function.AgdaThe true pure for loop. 45 is a misnomer, it should be forA.Agda#Any decoration is traversable with traverse = traverseF. Just like any /6 is a functor, so is any decoration, given by just  traverseF , a functor.AgdaAny decoration is a lens. set is a special case of dmap.Agda0A typical decoration is pairing with some stuff.Agda3Decorations compose. (Thus, they form a category.)Agda%The identity functor is a decoration. 9 6Safe"#$+-03457;<=>?ACNQV]^D(////////////////////////////////////////Safe"#$+-03457;<=>?ACNQV]^GAgda7Unstructured pragma (Andreas, 2017-08-23, issue #2712).Y     $#" !%&'()+*,-./01234657=<;:98>?@ADCBEGFHIJYHIEGF@ADCB>?7=<;:9846523/01.,-)+*'(%&$#" !     JSafe"#$+-03457;<=>?ACNQV]^_AgdaCatch /s.aAgda+Upon exception, the written output is lost.bAgda Alias of / for the IO monad._`_`Safe"#$+-03457;<=>?ACNQV]^2cAgdaAReturns a close function for the file together with the contents.ccSafe"#$+-03457;<=>?ACNQV]^/AgdaaConverts many character sequences which may be interpreted as line or paragraph separators into '\n'.dAgdaKReads a UTF8-encoded text file and converts all Unicode line endings into '\n'.eAgdaWrites 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.fAgdaQWrites a UTF8-encoded text file. The native convention for line endings is used.gAgdaQWrites a UTF8-encoded text file. The native convention for line endings is used.defgdefgSafe"#$+-03457;<=>?ACNQV]^hAgdaRead /+, modify it strictly, and return old value. //////////hhSafe"#$+-013457;<=>?ACNQV]^ iAgdaz"Impossible" errors, annotated with a file name and a line number corresponding to the source code location of the error.jAgda7We reached a program point which should be unreachable.kAgda 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.lAgdanAbort by throwing an "impossible" error. You should not use this function directly. Instead use the macro in  undefined.h.mAgda)Catch an "impossible" error, if possible.ikjlmikjlmSafe"#$+-013457;<=>?ACNQV]^rAgdatoImpossible 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.pqrpqrSafe"#$+-03457;<=>?ACNQV]^'wAgdaYA set with duplicates. Faithfully stores elements which are equal with regard to (==).yAgda%The list contains all occurrences of aN (not just the duplicates!). Hence, the invariant: the list is never empty.zAgdaIs the bag empty?{Agda7Number of elements in the bag. Duplicates count. O(n).|Agda (bag ! a) finds all elements equal to a(. O(log n). Total function, returns [] if none are.}Agda O(log n).~Agda O(log n).AgdaCReturn the multiplicity of the given element. O(log n + count _ _).AgdaO(1)AgdaO(1)Agda "insert a b = union b (singleton a)Agda !fromList = unions . map singletonAgda:Returns the elements of the bag, grouped by equality (==).Agda!Returns the bag, with duplicates.Agda#Returns the bag without duplicates.Agda!Returns the bag, with duplicates.wxyz{|}~wxyz{|}~Safe"#$+-03457;<=>?ACNQV]^ None"#$+-03457;<=>?ACKNQV]^/+AgdaAgsy'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).Agda~Maybe an instantiation (refinement). It is usually shallow, i.e., just one construct(or) with arguments again being metas.AgdaRDoes this meta block a principal constraint (i.e., a type-checking constraint).Agda:List of observers, i.e., constraints blocked by this meta.Agda4Used for experiments with independence of subproofs.Agda Experimental.AgdaResult of type-checking.AgdaSuccess.AgdaDefinite failure.Agda Experimental.Agda$Parallel conjunction of constraints.AgdaExperimental, related to . First arg is sidecondition.AgdalForking proof on something that is not part of the term language. E.g. whether a term will reduce or not.Agda Obsolete.qq Safe"#$+-03457;<=>?ACNQV]^<% AgdaRRepresents a set of integers. Invariants: - All cannot be the argument to / or / - at most one  IntsBelow - at most one  IntsAbove - if `Below lo` and `Below hi`, then `lo < hi` - if `Below lo .. (Some xs)` then `all (> lo) xs` - if `Above hi .. (Some xs)` then `all (< hi - 1) xs`Agda MembershipAgdaAll integers `< n`AgdaAll integers `>= n`AgdaA single integer./AgdaFrom a list of integers.Agda No integers.Agda All integers.Agda'If finite, return the list of elements.Agda Invariant.  !Safe"#$+-03457;<=>?ACNQV]^H\ $AgdaGVan Laarhoven style homogeneous lenses. Mnemoic: "Lens inner outer".'AgdaGet inner part i of structure o as designated by  Lens' i o.(AgdaSet inner part i of structure o as designated by  Lens' i o.)AgdaModify inner part i of structure o using a function i -> i.*Agda8Focus on a part of the state for a stateful computation.+AgdaRead a part of the state.,AgdaWrite a part of the state.-AgdaModify a part of the state..Agda'Modify a part of the state monadically./Agda?Modify a part of the state monadically, and return some result.0Agda#Modify a part of the state locally.1Agda Ask for part of read-only state.2Agda/Modify a part of the state in a subcomputation. !"#$%&'()*+,-./01234!"#$%&'()*+,-./01234 '8,4-4.4/4"Safe"#$&'+,-03457;<=>?ACFNQSTV]^S 5Agda An index into a type-level list.8Agda4Lists 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 .;Agda&Existential wrapper for indexed types.=AgdaUnpacking a wrapped value.>Agda/Constructing an indexed list from a plain list.?Agda/Turning an indexed list back into a plain list.@Agda!Indices are just natural numbers.AAgdaMapping over an indexed list.BAgda>If you have an index you can get a lens for the given element.CAgda)Looking up an element in an indexed list.DAgda!All indices into an indexed list.5768:9;<=>?@ABCD;<=8:9>?576@ABCD#Safe"#$+-03457;<=>?ACNQV]^cYEAgdaThe  WarningNamee data enumeration is meant to have a one-to-one correspondance to existing warnings in the codebase.oAgdaA  WarningMode has two components: a set of warnings to be displayed and a flag stating whether warnings should be turned into fatal errors.uAgdaThe defaultWarningModeY is a curated set of warnings covering non-fatal errors and disabling style-related oneswAgdawarningModeUpdate str computes the action of str over the current  WarningModeu: it may reset the set of warnings, add or remove a specific flag or demand that any warning be turned into an errorxAgdaCommon sets of warningsyAgdalThe flag corresponding to a warning is precisely the name of the constructor minus the trailing underscore.{Agda warningUsage generated using warningNameDescription/Agda WarningNameZ descriptions used for generating usage information Leave String empty to skip that name.7EHFGIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{7opqrstuvwxEHFGIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnzy{$Safe"#$+-03457;<=>?ACNQV]^j/AgdaZList of Help Topics NOTA BENE: You need to add each new topic together with its name to  allHelpTopicsAgdaInterface to the help functionAgdaGeneral usage informationAgda)Specialised usage information about TOPICAgdaUsage information generationAgdaConversion functions to strings%Safe"#$+-03457;<=>?ACNQV]^mMAgdaTokenising the input (makes  cleaner)Agda*Options for Auto, default value and lenses##&Safe"#$+-03457;<=>?ACNQV]^pyAgdaC(View source:) This is how you implement a lens for a record field.'Safe"#$+-03457;<=>?ACNQV]^AgdaRetain object when tag is /.Agda unionWith for collections of size <= 1.Agda Unzipping a list of length <= 1.AgdaFiltering a singleton list. filterMaybe p a = / (/ p [a])Agda Version of /" with different argument ordering.Agda 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 fAgda with flipped branches.AgdaMonadic version of /.AgdaMonadic version of /.AgdaMonadic version of . That is, $ with a different argument ordering.Agda with flipped branches.AgdaA more telling name for 78 for the / collection type. Or:  without the / case.Agda without the / case.Agda without the / case.Agda without the / case.AgdaLazy version of allJust  . sequence. (allJust = mapM for the Maybe/ monad.) Only executes monadic effect while isJust.////////////(Safe"#$+-03457;<=>?ACNQV]^p Agda.Lazy monadic computation of a list of results.AgdaThe empty lazy list.AgdaConsing a value to a lazy list.AgdaSingleton lazy list.Agda Case distinction over lazy list.Agda+Folding a lazy list, effects left-to-right.AgdaThe join operation of the ListT m monad.AgdaWe can `run' a computation of a  as it is monadic itself.Agda Monadic cons.AgdaMonadic singleton.Agda Extending a monadic function to .Agda!Alternative implementation using .Agda Change from one monad to another)None"#$+-03457;<=>?ACNQV]^Agda"Simple, non-reentrant memoisation.AgdaRRecursive memoisation, second argument is the value you get on recursive calls.*None"#$+-03457;<=>?ACKNQV]^Agda/Maximum of on-negative (small) natural numbers.Safe"#$+-013457;<=>?ACNQV]^AgdaReturns the union of the argument lists seen as sets. The order of the elements in the result is not specified. Precondition: arguments contain no duplicates.AgdaZip two nonempty lists.AgdaZip two nonempty lists.Agda9Case on a list, getting a nonempty list in the cons case.AgdaCase on a list, with list last.Agda)Check if an element is present in a list.  5+Safe"#$+-03457;<=>?ACNQV]^Agda Satisfying null empty == True.AgdaA / is ' when it corresponds to the empty list.         ,Safe"#$+-0134567;<=>?ACNQV]^~%Agda Analogous to 9: in  Data.Maybe.&Agda Analogous to 9; in  Data.Maybe.'Agda Analogous to 9< in  Data.Maybe.(Agda Analogous to 9= in  Data.Maybe.)Agda unionWith for collections of size <= 1.*Agda Unzipping a list of length <= 1.+AgdaFiltering a singleton list. filterMaybe p a = % (/ p [a]),Agda Version of (" with different argument ordering.-Agda 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 f.AgdaMonadic version of ./AgdaMonadic version of .0AgdaMonadic version of -. That is, .$ with a different argument ordering.1Agda0 with flipped branches.2AgdaA more telling name for 7> for the   collection type. Or: - without the " case.3Agda0 without the " case. "!#$%&'()*+,-./0123 "!#$%&'()*+,-./0123-None"#$+-03457;<=>?ACDNQV]^!>AgdaGRun a parser on a list of tokens. Returns the list of complete matches.?AgdaLConsumes and returns the next character. Fails if there is no input left.@AgdaPLook-ahead: returns the part of the input that is left, without consuming it.AAgda Always fails.BAgdaSymmetric choice.CAgda}Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.DAgdazTransforms a parser into one that does the same, but in addition returns the exact characters read. IMPORTANT NOTE: D] gives a runtime error if its first argument is built using any occurrences of readS_to_P.EAgdaTConsumes and returns the next character, if it satisfies the specified predicate.FAgda+Parses and returns the specified character.GAgda(Parses and returns the specified string.HAgdaBParses the first zero or more characters satisfying the predicate.IAgdaAParses the first one or more characters satisfying the predicate.JAgda+Combines all parsers in the specified list.KAgdaSkips all whitespace.LAgda count n p parses n occurrences of p/ in sequence. A list of results is returned.MAgdabetween open close p parses open, followed by p and finally close. Only the value of p is returned.NAgda option x p will either parse p or return x without consuming any input.OAgda optional p optionally parses p and always returns ().PAgda4Parses zero or more occurrences of the given parser.QAgda3Parses one or more occurrences of the given parser.RAgdaLike P, but discards the result.SAgdaLike Q, but discards the result.TAgda sepBy p sep$ parses zero or more occurrences of p, separated by sep*. Returns a list of values returned by p.UAgda sepBy1 p sep# parses one or more occurrences of p, separated by sep*. Returns a list of values returned by p.VAgda endBy p sep$ parses zero or more occurrences of p, separated and ended by sep.WAgda endBy p sep# parses one or more occurrences of p, separated and ended by sep.XAgda 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.YAgda 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.ZAgdaLike X(, but parses one or more occurrences of p.[AgdaLike Y(, but parses one or more occurrences of p.\AgdamanyTill p end$ parses zero or more occurrences of p, until end3 succeeds. Returns a list of values returned by p./AgdahConverts a parser into a Haskell ReadS-style function. This is the main way in which you can "run" a =" parser: the expanded type is 1 readP_to_S :: ReadP a -> String -> [(a,String)] /AgdaConverts a Haskell ReadS-style function into a parser. Warning: This introduces local backtracking in the resulting parser, and therefore a possible inefficiency.!=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]!=?@BCD>]AEFGHIKJLMNOPQRSTUVWXY[Z\B5C5.Safe"#$+-03457;<=>?ACNQV]^hAgdaInclusion comparison wrapper.kAgdaPointwise comparison wrapper.nAgdaDecidable partial orderings.qAgda6The result of comparing two things (of the same type).rAgda Less than.sAgdaLess or equal than.tAgdaEqualuAgdaGreater or equal.vAgda Greater than.wAgdaNo information (incomparable).xAgda8Comparing the information content of two elements of q'. More precise information is smaller.Includes equality: x x x == True.yAgda Opposites.related a po b iff related b (oppPO po) a.zAgdarCombining 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.{AgdaChains (transitivity)  x R y S z.seqPO1 is associative, commutative, and idempotent. seqPO has dominant element POAny and neutral element (unit) POEQ.|AgdaEmbed /.}Agda%Represent a non-empty disjunction of /s as q.~AgdaA q! information is a disjunction of / informations.AgdaAny / is a n.Agda+Are two elements related in a specific way? related a o b holds iff comparable a b is contained in o.Agda1Partial ordering forms a monoid under sequencing.Agda.Less is ``less general'' (i.e., more precise).Agda&Pointwise partial ordering for tuples.related (x1,x2) o (y1,y2) iff related x1 o x2 and related y1 o y2.Agda$Partial ordering for disjoint sums: Left _ and Right _ are unrelated.Agda/ and / _ are unrelated.Partial ordering for Maybe a is the same as for  Either () a.Agda4The pointwise ordering for lists of the same length.qThere are other partial orderings for lists, e.g., prefix, sublist, subset, lexicographic, simultaneous order.Agda(Sets are partially ordered by inclusion.AgdaSublist for ordered lists.hijklmnopqwvutsrxyz{|}~qwvutsrxyz{|}~pnoklmhij/Safe"#$+-03457;<=>?ACNQV]^Agda?Completing POMonoids with inverses to form a Galois connection.BLaw: composition and inverse composition form a Galois connection. & related (inverseCompose p x) POLE y  == related x POLE (p <> y) AgdaPartially ordered monoid."Law: composition must be monotone. P related x POLE x' && related y POLE y' ==> related (x <> y) POLE (x' <> y') AgdaPartially ordered semigroup."Law: composition must be monotone. P related x POLE x' && related y POLE y' ==> related (x <> y) POLE (x' <> y') 0None"#$+-013457;<=>?ACNQV]^ FAgdaIf 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]^AgdaWhile /- 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 ....AgdaUse instead of / when printing to world.Agda+Comma separated list, without the brackets.AgdaApply 7 to P if boolean is true.Agdaalign 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.Agda?Handles strings with newlines properly (preserving indentation)Agda a  ? b = hang a 2 bAgda pshow = text . prettyG$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQSRXWVUT]\[ZYG$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQSRXWVUT]\[ZY61Safe"#$+-03457;<=>?ACNQV]^9/AgdamThe 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.Agda(Documents paired with precedence levels.Agda@An extended parser type, with some support for printing parsers./AgdaInvariant: If the boolean is /, then the result must be / something, and if the boolean is /, then the result must be / something.AgdaRuns the parser.Agda&Tries to print the parser, or returns /F, depending on the implementation. This function might not terminate.AgdaOParses a token satisfying the given predicate. The computed value is returned.Agda[Uses the given function to modify the printed representation (if any) of the given parser.AgdaMemoises the given parser./Every memoised parser must be annotated with a uniqueJ key. (Parametrised parsers must use distinct keys for distinct inputs.)AgdaAMemoises 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.)AgdaThe 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.0AgdaMemoised values.0AgdaContinuations.0AgdaState monad used by the parser.0Agda Positions.AgdauUses the given document as the printed representation of the given parser. The document's precedence is taken to be .Agda.Parses a token satisfying the given predicate.AgdaParses a single token.AgdaParses a given token.AgdaPrecedence of >>=.AgdaPrecedence of  |.AgdaPrecedence of  *.AgdaPrecedence of " and +.AgdaPrecedence of atoms.0AgdaA smart constructor.0AgdaExtracts the parser.0AgdaExtracts the documents.0AgdaA helper function.0Agda Pretty-prints a memoisation key.0 AgdaA helper function.2None"#$+-03457;<=>?ACKNQV]^MAgda4The flexibe variables contained in a pice of syntax.Agda2The rigid variables contained in a pice of syntax.Agda)Make offsets non-negative by rounding up.AgdaOffsets + n must be non-negativeAgdaExecuting a substitution.Agda@Partial substitution from flexible variables to size expression.Agda*Type of solution wanted for each flexible.Agda,Assigning a polarity to a flexible variable.Agda)What type of solution are we looking for?Agda<Constraint: an inequation between size expressions, e.g. X < " or  i + 3 "d j.Agda.Comparison operator, e.g. for size expression.Agda<.Agda"d.Agda*Size expressions appearing in constraints.AgdaConstant number n.AgdaVariable plus offset i + n.Agda Infinity ".AgdaMeta variable X + n.AgdaSize meta variables X to solve for. AgdaFixed size variables i. AgdaConstant finite sizes n >= 0.AgdaDefault polarity is .Agda?Returns an error message if we have a contradictory constraint.Agda acts as /,  as /.Agda Interpret  as relation on  .AgdaAdd offset to size expression."AgdaComparison operator is ordered  < .5     5     3Safe"#$+-03457;<=>?ACNQV]^QQAgdaStar semirings ( 5https://en.wikipedia.org/wiki/Semiring#Star_semirings).SAgda Semirings ( &https://en.wikipedia.org/wiki/Semiring).QRSWVUTSWVUTQR4None"#$+-03457;<=>?ACKNQV]^S\]\]5Safe"#$+-03457;<=>?ACNQV]^WwgAgda^Thing decorated with its size. The thing should fit into main memory, thus, the size is an Int.kAgda,The size of a collection (i.e., its length).mAgdaCache the size of an object.wAgdaReturn the cached size.ghijklmklghijm6None"#$+-03457;<=>?ACNQV]^f xAgda&Classification of identifier variants.zAgdaIdentifier ends in Int many primes.{AgdaIdentifier ends in number Int (ordinary digits).|AgdaIdentifier ends in number Int (subscript digits).}Agda3Are we allowed to use unicode supscript characters?~Agda'Is the character one of the subscripts ' '-' '?Agda Converts '0'-'9' to ' '-' '; unless the user doesn't want us to use unicode characters-Precondition: The digit needs to be in range.Agda Converts ' '-' ' to '0'-'9'.-Precondition: The digit needs to be in range.Agda?Increase the suffix by one. If no suffix yet, put a subscript 1.Agda Parse suffix.Agda Print suffix.AgdaAdd first available Suffix to a name.Agda Is the given name already taken?Agda+Name of which we want an available variant.Agda2Name extended by suffix that is not taken already. x|zy{}~ }~x|zy{7Safe"#$+-03457;<=>?ACNQV]^iAgdaEnum type with 3 elements.AgdaPartition a list into 3 groups.)Preserves the relative order or elements.8None"#$+-03457;<=>?ACKNQV]^|AgdaFinite map from [k] to v.With the strict / type,  is also strict in v.0 Agda"Helper function used to implement  and .AgdaSingleton trie.AgdaeveryPrefix k v! is a trie where every prefix of k (including k itself) is mapped to v.AgdaLeft biased union.#union = unionWith ( new old -> new).Agda/Pointwise union with merge function for values.Agda.Insert. Overwrites existing value if present. %insert = insertWith ( new old -> new)Agda6Insert with function merging new value with old value.Agda.Delete value at key, but leave subtree intact.Agda*Adjust value at key, leave subtree intact.AgdaConvert to ascending list.AgdaConvert to ascending list.Agda]Convert to list where nodes at the same level are ordered according to the given ordering.AgdaWCreate new values based on the entire subtrie. Almost, but not quite comonad extend.Agda8Returns the value associated with the given key, if any.Agda%Is the given key present in the trie?Agda&Collect all values along a given path.Agda(Get the subtrie rooted at the given key.AgdaFilter a trie.Agda Key lens.Agda Empty trie.9None"#$+-03457;<=>?ACKNQV]^AgdaBifunctoriality for pairs.Agda mapFst f = f -*- idAgda mapSnd g = id -*- gAgdaLifted pairing.Agda)Swap. (Only in Data.Tuple from base-4.3)AgdaMonadic version of .AgdaMonadic .AgdaMonadic .23:None"#$+-03457;<=>?ACNQV]^Agda3Not very efficient (goes via a list), but it'll do.AgdaBig conjunction over a map.AgdaFilter a map based on the keys.Agda Unzip a map.  ;None"#$+-03457;<=>?ACNQV]^|0Agda Result of .AgdaFirst list is prefix of second.AgdaFirst list is suffix of second.AgdaThe lists are equal.AgdaThe lists are incomparable.Agda4Case distinction for lists, with list first. Cf. +?.Agda+Case distinction for lists, with list last.AgdaHead function (safe).Agda5Head function (safe). Returns a value on empty lists. >headWithDefault 42 [] = 42 headWithDefault 42 [1,2,3] = 1AgdaLast element (safe).AgdaLast two elements (safe).AgdaOpposite of cons (:), safe.AgdaMaybe cons. "mcons ma as = maybeToList ma ++ asAgda0  and 0  in one go, safe.Agda!Lookup function (partially safe).AgdadownFrom n = [n-1,..1,0]Agda1Update the first element of a list, if it exists.Agda0Update the last element of a list, if it exists.AgdaOUpdate nth element of a list, if it exists. Precondition: the index is >= 0.AgdaA generalized version of  partition . (Cf. mapMaybe vs. filter).AgdaA generalized version of  takeWhile . (Cf. mapMaybe vs. filter).AgdaA generalized version of span.AgdaPartition a list into /s and /s. / f = snd . partitionMaybe f.AgdaLike /S, but additionally return the last partition of the list where the predicate is False everywhere.AgdaLike /^, but additionally return the last partition of the list where the function always returns Nothing.Agda=Drops from both lists simultaneously until one list is empty.AgdaSublist relation.AgdaOCheck if a list has a given prefix. If so, return the list minus the prefix.Agda3Compare lists with respect to prefix partial order.AgdaFSplit a list into sublists. Generalisation of the prelude function words. words xs == wordsBy isSpace xsAgda+Chop up a list in chunks of a given length.AgdaFChop 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) == xsAgda-All ways of removing one element from a list.AgdaCheck whether a list is sorted.Assumes that the /% instance implements a partial order.AgdaUCheck whether all elements in a list are distinct from each other. Assumes that the 0 . instance stands for an equivalence relation.AgdaAn optimised version of ./Precondition: The list's length must fit in an /.AgdaDChecks if all the elements in the list are equal. Assumes that the 0 - instance stands for an equivalence relation.AgdaZReturns an (arbitrary) representative for each list element that occurs more than once.Agda A variant of 03 which applies the predicate to consecutive pairs.Agda f = groupBy ((0 ) `on` f) 0 0 (0 `on` f).Agda#splitExactlyAt n xs = Just (ys, zs) iff  xs = ys ++ zs and genericLength ys = n.AgdaA generalised variant of  elemIndex.Agda,Requires both lists to have the same length. Otherwise, Nothing is returned.AgdaLike 0S but keep the rest of the second list as-is (in case the second list is longer). D zipWithKeepRest f as bs == zipWith f as bs ++ drop (length as) bs AgdaEfficient variant of nubBy for finite lists.Specification: )nubOn f xs == 'nubBy' ((==) `'on'` f) xs.AgdaEfficient 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.Agda'Compute the common suffix of two lists.Agda'Compute the common prefix of two lists.55<None"#$+-03457;<=>?ACNQV]^& AgdaI 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 /: > 0 $ / "\x2200" "\8704" > 0 $  "\x2200" """ V(The code examples above have been tested using version 4.2.0.0 of the base library.)AgdaGTurns the string into a Haskell string literal, avoiding escape codes.Agda$Adds hyphens around the given stringputStrLn $ delimiter "Title"<     Title                                                 AgdaShows a non-negative integer using the characters - instead of 0-9 unless the user explicitly asked us to not use any unicode characters.Agda1Adds a final newline if there is not already one.Agda-Indents every line the given number of steps.Agda6Show a number using comma to separate powers of 1,000.AgdaRemove leading whitespace.AgdaRemove trailing whitespace.Agda'Remove leading and trailing whitesapce.  =None"#$+-03457;<=>?ACKNQV]^ Agda"CPU time in pico (10^-12) seconds. Agda Timestamps.AgdaThe current time.AgdaOMeasure the time of a computation. Of course, does not work with exceptions.Agda(Print CPU time in milli (10^-3) seconds.      >None"#$+-03457;<=>?ACNQV]^l0AgdaLines with line numbers.0AgdaJHeader line, like a field name, e.g. "include :". Cannot be indented. String is trimmed.0Agda"Other line. Must be indented. String is trimmed.0Agda(Library file field format format [sic!].0AgdaName of the field.0AgdaIs it optional?0AgdaContent parser for this field.0AgdaSets parsed content in _ structure.0AgdaE.g. field name. trimmed.0AgdaE.g. field content. trimmed.0AgdaIThe config files we parse have the generic structure of a sequence of field : content entries.0 AgdaParser monad: Can throw String error messages.0!Agda .agda-lib& file format with parsers and setters.AgdaParse  .agda-lib file.Sets bY name and turn mentioned include directories into absolute pathes (provided the given 0" is absolute).0#AgdaParse file contents.0$AgdaParse 0 with 0! descriptors.0%AgdaGiven a list of 05 descriptors (with their custom parsers), parse a 0 into the _ structure.LChecks mandatory fields are present; no duplicate fields, no unknown fields.0&AgdaNEnsure that there are no duplicate fields and no mandatory fields are missing.0'AgdaFind 0 with given 0, throw error if unknown.0(AgdaExample:  parseGeneric "name:Main--BLAndepend:--BLAn standard-library--BLAninclude : . --BLAn src more-src n" == Right [("name",[MainE]),("depend",["standard-library"]),("include",[".","src more-src"])] 0)AgdaParse line into 0 and 0 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" ] 0*AgdaCollect 0 and subsequent 0s into 0+.Tailing 0s? That's an error.Agda+Remove leading whitespace and line comment.Agda4Break a comma-separated string. Result strings are trimmed.0,Agda-...and trailing, but not leading, whitespace.?None"#$+-03457;<=>?ACNQV]^ AgdaSimple Emacs Lisp expressions. AgdaAtom."AgdaList.$AgdaFormats a response command. Replaces '\n'= with spaces to ensure that each command is a single line.%Agda-Writes a response command to standard output.0-Agda0displayInBuffer 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.0.Agda$The name of the running info buffer.(AgdaClear the running info buffer.)AgdaClear the warning buffer*AgdaADisplay running information about what the type-checker is up to. # "!$%&'()* # "!$%&'()*None"#$+-03457;<=>?ACNQV]^.Agda Binary bind.1AgdaMonadic guard.2AgdaMonadic if-then-else.3Agda ifNotM mc = ifM (not  $ mc)4AgdaLazy monadic conjunction.7AgdaLazy monadic disjunction.:AgdaLazy monadic disjunction with Either> truth values. Returns the last error message if all fail.;AgdahLazy monadic disjunction with accumulation of errors in a monoid. Errors are discarded if we succeed.<AgdaGeneralized 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.=AgdaGeneralized version of .forM_ :: Monad m => [a] -> (a -> m ()) -> m ()>AgdaA monadic version of / :: (a -> Maybe b) -> [a] -> [b].?AgdaThe for version of >.@AgdaA monadic version of 0/ :: (a -> Bool) -> [a] -> [a].AAgdaA `monadic' version of @ partition# :: (a -> Bool) -> [a] -> ([a],[a])BAgda Translates / to .CAgdaGeneralises the /& function from lists to an arbitrary .DAgdaFinally for the F class. Errors in the finally part take precedence over prior errors.EAgdaTry a computation, return / if an  occurs.FAgda;Bracket without failure. Typically used to preserve state.GAgda Restore state after computation.FAgdaAcquires resource. Run first.AgdaReleases resource. Run last.Agda Computes result. Run in-between.#  ./0123456789:;<=>?@ABCDEFGH#./0123456789:;<=>?@ABCDEFGH  @None"#$+-013457;<=>?ACKNQV]^)OIAgda%Paths which are known to be absolute.Note that the 0  and /S instances do not check if different paths point to the same files or directories.KAgda Extract the I to be used as 0".LAgda Constructs Is.2Precondition: The path must be absolute and valid.00Agdamaps blablabla foo.bar.xxx to foo.bar.NAgdaMakes the path absolute.This function may raise an __IMPOSSIBLE__ error if 01" does not return an absolute path.OAgdaPTries to establish if the two file paths point to the same file (or directory).PAgdaCase-sensitive 02 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.)IJKLMNOPIJKLNOPMO4ANone"#$+-03457;<=>?ACNQV]^+^[Agda-Hashing a module name for unique identifiers.WXYZ[WXYZ[BNone"#$+-03457;<=>?ACNQV]^>\Agda'Monad with access to benchmarking data.aAgdaEWe need to be able to terminate benchmarking in case of an exception.bAgdaqBenchmark structure is a trie, mapping accounts (phases and subphases) to CPU time spent on their performance.dAgdaAre we benchmarking at all?eAgda!What are we billing to currently?fAgda/The accounts and their accumulated timing bill.lAgda3Record when we started billing the current account.mAgda(Account we can bill computation time to.oAgdaSemantic editor combinator.pAgdaSemantic editor combinator.qAgdaSemantic editor combinator.rAgda"Add to specified CPU time account.sAgdaTurn benchmarking on/off.tAgdacBill current account with time up to now. Switch to new account. Return old account (if any).uAgda.Resets the account and the timing information.vAgdafBill a computation to a specific account. Works even if the computation is aborted by an exception.wAgda;Bill a CPS function to an account. Can't handle exceptions.xAgda.Bill a pure computation to a specific account.yAgda2Print benchmark as three-column table with totals.zAgda$Initial benchmark structure (empty).tAgdaMaybe new account.AgdaMaybe old account.\`_^]abcfedgjhiklmnopqrstuvwxmlkgjhinbcfedopqr\`_^]astuvwxCNone"#$+-0134567;<=>?ACKNQV]^9~Agda=Killing the range of an object sets all range information to .Agda;If it is also possible to set the range, this is the class.Instances should satisfy  ( r x) == r.Agda5Things that have a range are instances of this class.Agda1Wrapper to indicate that range should be printed.AgdaA 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: .AgdaAn interval. The iEnd* position is not included in the interval.4Note the invariant which intervals have to satisfy: .Agda 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: .AgdaFile.AgdaPosition, counting from 1.AgdaLine number, counting from 1.AgdaColumn number, counting from 1.Agda Sets the  components of the interval.Agda Gets the P component of the interval. Because of the invariant, they are both the same.Agda6Converts a file name and two positions to an interval.AgdaThe length of an interval.AgdaTThe intervals that make up the range. The intervals are consecutive and separated ().Agda8Turns a file name plus a list of intervals into a range.Precondition: .Agda}Are the intervals consecutive and separated, do they all point to the same file, and do they satisfy the interval invariant?AgdaRange invariant.Agda"The file the range is pointing to.Agda%Conflate a range to its right margin.Agda*Remove ranges in keys and values of a map.Agda;The first position in a file: position 1, line 1, column 1.Agda;The first position in a file: position 1, line 1, column 1.Agda$Ranges between two unknown positionsAgda?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.Agda!Advance the position by a string.  movePosByString = foldl' movePosAgda%Backup the position by one character.(Precondition: The character must not be '\n'.AgdaExtracts 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.AgdaRemoves 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.Agda2Converts a file name and two positions to a range.Agda"Converts two positions to a range.;Precondition: The positions have to point to the same file.Agda0Converts a file name and an interval to a range.Agda-Converts a range to an interval, if possible.AgdagConverts a range to an interval, if possible. Note that the information about the source file is lost.Agda?Returns the shortest continuous range containing the given one.Agda0Removes gaps between intervals on the same line.Agda*The initial position in the range, if any.Agda*The initial position in the range, if any.Agda;The position after the final position in the range, if any.Agda;The position after the final position in the range, if any.Agda4Finds the least interval which covers the arguments.8Precondition: The intervals must point to the same file.AgdafuseRanges 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).AgdaDPrecondition: The ranges must point to the same file (or be empty).Agda 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.AgdabeginningOfFile 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.Agdax `withRangeOf` y sets the range of x to the range of y.Agda*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.AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaZPrecondition: The ranges of the tuple elements must point to the same file (or be empty).AgdaYPrecondition: The ranges of the list elements must point to the same file (or be empty).AgdaYPrecondition: The ranges of the list elements must point to the same file (or be empty).AgdaOverlaps with  KillRange [a].V}~V~}DNone"#$+-013457;<=>?ACNQV]^ǨAgda%Things that support delayed dropping.Agda)Delayed dropping which allows undropping.Agda&Non-negative number of things to drop. AgdaWhere to drop from.!Agda3Invert 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.#AgdaPartial 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 l of the permutation.'Agda'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 n)AgdaIdentity permutation.*Agda"Restrict a permutation to work on n elements, discarding picks >=n.+Agda9Pick the elements that are not picked by the permutation.,AgdaliftP k takes a  Perm {m} n to a Perm {m+k} (n+k). Analogous to @A?, but Permutations operate on de Bruijn LEVELS, not indices.-Agda 2permute (compose p1 p2) == permute p1 . permute p2.Agda invertP err p is the inverse of p) where defined, otherwise defaults to err. composeP p (invertP err p) == p/AgdaITurn a possible non-surjective permutation into a surjective permutation.0Agda ?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.1Agda8permPicks (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 BC.2Agda expandP i n  in the domain of  replace the ith element by n elements.3Agda~Stable topologic sort. The first argument decides whether its first argument is an immediate parent to its second argument.AgdaPerform the dropping.Agda Drop more.AgdaPick up dropped stuff. !"#$&%'()*+,-./0123#$&%'(!")*+,-./0123 ENone"#$+-013457;<=>?ACNQV]^,HAgda The result of parsing something.KAgdaWarnings for parsingLAgda,Parse errors that concern a range in a file.MAgda)The range of the bigger overlapping tokenNAgdaWhat you get if parsing fails.OAgda4Errors that arise at a specific position in the filePAgda,Parse errors that concern a range in a file.QAgda'Parse errors that concern a whole file.SAgda%The file in which the error occurred.TAgdaWhere the error occurred.UAgdaThe remaining input.VAgdaThe previous token.WAgda*Hopefully an explanation of what happened.XAgda)The range of the bigger overlapping tokenYAgda"The file which the error concerns.\Agda,There aren't any parser flags at the moment.^Agda/Should comment tokens be returned by the lexer?_AgdaWe 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.`Agda no layoutaAgdalayout at specified columnbAgda<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.cAgdaRThe parser state. Contains everything the parser and the lexer could ever need.fAgda"position at current input locationgAgdaposition of last tokenhAgdathe current inputiAgdathe character before the inputjAgdathe previous tokenkAgdathe stack of layout contextslAgdaCthe state of the lexer (states can be nested so we need a stack)mAgdacurrently there are no flagsnAgdaThe parse monad. Equivalent to StateT c (Either N)! except for the definition of fail, which builds a suitable N object.pAgdaConstructs 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.qAgdaThe default flags.rAgda.The most general way of parsing a string. The Agda.Syntax.Parser; will define more specialised functions that supply the \ and the b.sAgda.The even more general way of parsing a string.tAgda,The most general way of parsing a file. The Agda.Syntax.Parser; will define more specialised functions that supply the \ and the b.GNote that Agda source files always use the UTF-8 character encoding.uAgdaeParses a string as if it were the contents of the given file Useful for integrating preprocessors.yAgdaIThe parse interval is between the last position and the current position.~Agda parseError = failAgdaFake 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.AgdaUse  or ~ as appropriate.AgdaFor 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.Agda"Return the current layout context.AgdaShould 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.>HIJKLMNOPQRSTUVWXYZ[\]^_a`bcdmefghijklnopqrstuvwxyz{|}~>nHIJcdmefghijklNOPQRSTUVWXYZ[KLMb_a`\]^pqrtsuvwyx}z{|o~FNone"#$%+-03457;<=>?ACNQV]^6Agda/Type of a literate preprocessor: Invariants:  f : Processor f pos s /= []f pos s >>= layerContent == sAgdaA list of contiguous layersAgda8A sequence of characters in a file playing the same roleAgdaRole of a character in the file03Agda7Annotates a tokenized string with position information.Agda[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.AgdaReturns /# if a role corresponds to Agda codeAgdaReturns / a layer contains Agda codeAgdaBlanks 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.04Agda6Replaces non-space characters in a string with spaces.05Agda*Check if a character is a blank character.Agda,Possible extensions for a literate Agda fileAgdaIShort list of extensions for literate Agda files For display purposes.06AgdaFbreak 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])07AgdaXReturns a tuple consisting of the first line of the input, and the rest of the input.08Agda1Canonical decomposition of an empty literate file09AgdadCreate a regular expression that: - Must match the whole string - Works across line boundariesAgdaPreprocessor for literate TeXAgdaPreprocessor for MarkdownAgda!Preprocessor for reStructuredTextHNone"#$+-0134567;<=>?ACKNQV]^hAgda#Positivity check? (Default = True).Agda0Termination check? (Default = TerminationCheck).AgdaRun the termination checker.Agda#Skip termination checking (unsafe).AgdaTreat as non-terminating.Agda/Treat as terminating (unsafe). Same effect as .Agda2Skip termination checking but use measure instead.AgdaRename from this name.Agda#To this one. Must be same kind as .AgdaCThe range of the "to" keyword. Retained for highlighting purposes.Agda2An imported name can be a module or a defined nameAgdaYThe things you are allowed to say when you shuffle names between name spaces (i.e. in import,  namespace, or open declarations).Agda Only for open3. Exports the opened names from the current module.Agda@Placeholders are used to represent the underscores in a section.AgdaYThe second argument is used only (but not always) for name parts other than underscores.Agda4The position of a name part or underscore in a name.Agda;The following underscore is at the beginning of the name: _foo.Agda8The following underscore is in the middle of the name: foo_bar.Agda4The following underscore is at the end of the name: foo_.Agda4A meta variable identifier is just a natural number.AgdaWThe unique identifier of a name. Second argument is the top-level module identifier.AgdaIs this a macro definition?Agda0Is this definition eligible for instance search?AgdaAbstract or concreteAgdaAccess modifier.Agda Store the *p of the private block that lead to this qualifier. This is needed for more faithful printing of declarations.AgdabVisible from outside, but not exported when opening the module Used for qualified constructors.Agda@Functions can be defined in both infix and prefix style. See ]D.Agda"Where does a projection come from?AgdaUser wrote a prefix projection.Agda User wrote a postfix projection.Agda'Projection was generated by the system.AgdaWhere does the ConP or Con come from?Agda8Inserted by system or expanded from an implicit pattern.Agda#User wrote a constructor (pattern).AgdaUser wrote a record (pattern).Agda(Generated by interactive case splitting.AgdaString with range info.AgdaA RawName is some sort of string.AgdaThing with range info.AgdaOnly O arguments can have names.AgdaStandard naming.Agda&Something potentially carrying a name.Agda Similar to  , 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.   is used for actual arguments (Var, Con, Def etc.) and in Abstract syntax and other situations.Agda4A function argument can be hidden and/or irrelevant.AgdaA lens to access the : attribute in data structures. Minimal implementation: getFreeVariables and one of setFreeVariables or mapFreeVariables."AgdaA lens to access the *: attribute in data structures. Minimal implementation:  getOrigin and one of  setOrigin or  mapOrigin.&AgdaDecorating something with * information.*AgdaOrigin of arguments.+Agda/From the source file / user input. (Preserve!),AgdaE.g. inserted hidden arguments.-Agda%Produced by the reflection machinery..Agda&Produced by an interactive case split./AgdaA lens to access the 3: attribute in data structures. Minimal implementation:  getRelevance and one of  setRelevance or  mapRelevance.3Agda:A function argument can be relevant or irrelevant. See Agda.TypeChecking.Irrelevance.4Agda4The argument is (possibly) relevant at compile-time.5AgdaThe argument may never flow into evaluation position. Therefore, it is irrelevant at run-time. It is treated relevantly during equality checking.6Agda3The argument is irrelevant at compile- and runtime.;AgdaQuantity for linearity.<AgdaZero uses, erased at runtime. TODO: | Quantity1 -- ^ Linear use (could be updated destructively). (needs postponable constraints between quantities to compute uses).=AgdaUnrestricted use.BAgdaWe have a tuple of modalities, which might not be fully orthogonal. For instance, irrelevant stuff is also run-time irrelevant.DAgda4Legacy irrelevance. See Pfenning, LiCS 2001; AbelVezzosiWinterhalter, ICFP 2017.EAgda^Cardinality / runtime erasure. See Conor McBride, I got plenty o' nutting, Wadlerfest 2016.FAgdaA lens to access the N: attribute in data structures. Minimal implementation:  getHiding and one of  setHiding or  mapHiding.JAgdaDecorating something with N information.[Agda4Used to specify whether something should be delayed.^AgdaMonoidal composition of N information in some data._AgdaQ arguments are visible.`AgdaP and O arguments are  notVisible.aAgdaO arguments are hidden.hAgdaIgnores R.vAgdaInformation ordering. @Relevant `moreRelevant` NonStrict `moreRelevant` IrrelevantwAgdaunusableRelevance rel == True! iff we cannot use a variable of rel.xAgda3 composition. 6 is dominant, 4 is neutral.yAgdainverseComposeRelevance 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).zAgdaKIrrelevant function arguments may appear non-strictly in the codomain type.{AgdaBApplied when working on types (unless --experimental-irrelevance).Agdaxs `withArgsFrom` args translates xs into a list of  s, using the elements in args to fill in the non- fields.5Precondition: The two lists should have equal length.AgdaGet the content of a .AgdaThe functor instance for 8 would be ambiguous, so we give it another name here.Agda ,setNamedArg a b = updateNamedArg (const b) aAgdaThing with no range info.Agda)Prefer user-written over system-inserted.AgdaAn abbreviation: noPlaceholder =  ".AgdaDefault is directive is private% (use everything, but do not export).Agda Just for the N9 instance. Should never combine different overlapping.AgdaN, is an idempotent partial monoid, with unit Q. P and Q are incompatible.AgdaNote that the order is  "d 0, more relevant is smaller.Agda=In the absense of finite quantities besides 0,  is the unit.Agda+Composition of quantities (multiplication).< is dominant.Agda4 is the unit.Agda3% forms a semigroup under composition.AgdaMore relevant is smaller.AgdaMore relevant is smaller.AgdaDominance ordering.AgdaPointwise unit.AgdaPointwise composition.AgdaIgnores ;, 3, *, and $. Ignores content of argument if 6.AgdaIgnores * and .AgdaRanges are not forced.)Agda(Show non-record version of this newtype.9AgdaRanges are not forced.<AgdaRanges are not forced.     ! "%$#&')(*,+-./21036547:98;=<>A@?BCEDFIHGJKMLNQPORTSUWVXZY[]\^_`abcdefghijklmnopqrstuvwxyz{|}~[]\XZYUWVRTSNQPOJKMLFIHG^_`abcdefghBCEDi>A@?jklmno;=<p7:983654qr/210stuvwxyz{|*,+-.&')("%$#! }~     INone"#$+-034567;<=>?ACNQV]^I AgdaThe parser monad.AgdaMemoisation keys.AgdaRuns the parser.AgdaOParses a token satisfying the given predicate. The computed value is returned.Agda.Parses a token satisfying the given predicate.AgdauUses the given document as the printed representation of the given parser. The document's precedence is taken to be atomP.AgdaMemoises the given parser./Every memoised parser must be annotated with a uniqueI key. (Parametrised parsers must use distinct keys for distinct inputs.)Agda@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.)Agda&Tries to print the parser, or returns /F, depending on the implementation. This function might not terminate.JNone"#$+-0134567;<=>?ACKNQV]^Agda+Check whether a name is the empty name "_".AgdaNumber of holes in a  $ (i.e., arity of a mixfix-operator).AgdaATop-level module names. Used in connection with the file system.&Invariant: The list must not be empty.AgdaQNamee 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).AgdaA.rest.Agdax.Agda<Mixfix identifiers are composed of words and holes, e.g. _+_ or  if_then_else_ or [_/_]. Agda_ part. AgdaIdentifier part. Agda*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. AgdaA (mixfix) identifier. Agda_. AgdavAn open mixfix identifier is either prefix, infix, or suffix. That is to say: at least one of its extremities is a Hole Agda+Parse a string to parts of a concrete name.Note: 5stringNameParts "_" == [Id "_"] == nameParts NoName{} AgdaIs the name an operator? Agda qualify A.B x == A.B.x Agda unqualify A.B.x == xThe range is preserved. Agda qnameParts A.B.x = [A, B, x] AgdaIs the name qualified? AgdaTurns a qualified name into a F. The qualified name is assumed to represent a top-level module name. AgdaFTurns a top-level module name into a file name with the given suffix. AgdapFinds 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. Agda  noName_ =    AgdaRanges are not forced. %AgdaDefine 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%                   %                     LNone"#$+-013457;<=>?ACNQV]^/ pAgdaArbitrary JS code.% L M N O P Q T S R U V X W Y Z [ \ ] ^ _ n p m k j i h c b a ` o l d f g e% _ n p m k j i h c b a ` o l d f g e ] ^ [ \ Y Z U V X W P Q T S R N O L MMNone"#$+-03457;<=>?ACNQV]^E  NNone"#$+-03457;<=>?ACNQV]^ɩ AgdaCheck 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. ONone"#$+-03457;<=>?ACNQV]^V' Agda"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. AgdaInstantation of variable. Agda'For going under a binder, often called Lift. Agda2Shifting substitution (going to a larger context). AgdaAn expression a in an explicit substitution  [CAction a]. AgdaBLazy concatenation of argument lists under explicit substitutions. AgdaHead-normal form of  . First entry is exposed.,Q: Why are there no projection eliminations? AgdaNo more eliminations. AgdaApplication and tail. Agda proj pre args, projfcn idx, tail AgdaConstructor parameter (missing in Agda). Agsy has monomorphic constructors. Inserted to cover glitch of polymorphic constructor applications coming from Agda Agda>"Maybe expression": Expression or reference to meta variable. AgdaAgsy's internal syntax. AgdaLambda with hiding information. AgdaTrue8 if possibly dependent (var not known to not occur). False if non-dependent. Agda&Absurd lambda with hiding information. AgdaUnique identifier of the head. Agda'This application has been type-checked. AgdaHead. Agda Arguments. Agda"Head of application (elimination). Agda Dot pattern. AgdaConstant definitions. AgdaConstant signatures. AgdaFor debug printing. AgdaReference to the Agda constant. AgdaType of constant. AgdaConstant definition. Agda7Free vars of the module where the constant is defined.. AgdaAbstraction with maybe a name.NDifferent from Agda, where there is also info whether function is constant. AgdaThe concrete instance of the blk parameter in 8. I.e., the information passed to the search control. Agda[Nat - deffreevars (to make cost of using module parameters correspond to that of hints). Agda1Size of typing context in which meta was created. Agda!Head normal form of type of meta. AgdaTrue if iota steps performed when normalising target type (used to put cost when traversing a definition by construction instantiation). *Agda;Unique identifiers for variable occurrences in unification. 7AgdaSubstituting for a variable. 8AgdaFreeVars class and instances 9Agda Renaming Typeclass and instances                           & % $ # " ! ' ) ( * + , - . / 0 1 2 3 4 5 6 7 8 9 * ' ) (  & % $ # " !                          + , - . / 0 1 2 3 4 5 6 7 8 9 PNone"#$+-03457;<=>?ACNQV]^ UAgda!Moves A move is composed of a Cost: together with an action computing the refined problem. bAgda univar sub v figures out what the name of v" "outside" of the substitution sub ought to be, if anything. cAgda6List of the variables instantiated by the substitution dAgdaNew 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. hAgda5New spine of arguments potentially using placeholders jAgdaNew App?lication node using a new spine of arguments respecting the Hiding annotation lAgdaEquality reasoning steps The begin token is accompanied by two steps because it does not make sense to have a derivation any shorter than that. qAgdakPick the first unused UId amongst the ones you have seen (GA: ??) Defaults to the head of the seen ones.E U V W _ ^ ] \ [ Z Y X ` 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 V W _ ^ ] \ [ Z Y X ` a b c U d e f g h i j k l m n o p q r t u v w x y z { | } ~  s QNone"#$+-03457;<=>?ACNQV]^o Agda)Typechecker drives the solution of metas.- - RNone"#$+-03457;<=>?ACNQV]^  AgdadSpeculation: Type class computing the size (?) of a pattern and collecting the vars it introduces AgdaITake a list of patterns and returns (is, size, vars) where (speculation):2 2 SNone"#$+-013457;<=>?ACNQV]^" AgdaClassification of notations. AgdaEx:  _bla_blub_. AgdaEx:  _bla_blub. AgdaEx:  bla_blub_. AgdaEx: bla_blub. AgdaPart of a Notation AgdaSArgument is the position of the hole (with binding) where the binding should occur. Agda+Argument is where the expression should go. Agda"An underscore in binding position. !AgdaNotation as provided by the syntax declaration. "Agda8Data type constructed in the Happy parser; converted to  $ before it leaves the Happy code. #Agda x -> y2; 1st argument is the bound name (unused for now). $AgdaSimple named hole with hiding. 'AgdaIs the hole a binder? (Agda2Get a flat list of identifier parts of a notation. )AgdaATarget argument position of a part (Nothing if it is not a hole). *AgdaeIs the part a hole? WildHoles don't count since they don't correspond to anything the user writes. +AgdaIs the part a normal hole? ,AgdaIs the part a binder? -Agda<Classify a notation by presence of leading and/or trailing normal holes. .Agda2From 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 ]            ! " $ # & % ' ( ) * + , - . / " $ # & % ' !     ( ) * + ,       - . /TNone"#$+-013457;<=>?ACKNQV]^SM 8AgdaMake a  K from some kind of string. 9AgdaThe  sets the definition site of the name, not the use site. ;Agda*Check whether we are a projection pattern. =Agda<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 ). @Agda'A module name is just a qualified name.The H instance for module names sets all individual ranges to the given one. CAgda(Something preceeded by a qualified name. GAgdaQualified 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. KAgdaA 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. QAgdaA singleton "ambiguous" name. RAgda%Get the first of the ambiguous names. SAgdaIs a name ambiguous. TAgdaGet the name if unambiguous. UAgdaFA module is anonymous if the qualification path ends in an underscore. VAgdaSets 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. WAgdaLike  Vb, but uses the name parts (qualifier + name) of the qualified name as the list of concrete names. `AgdaTurn 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. bAgda 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. fAgda Convert a  K to a  G (add no module name). gAgdaIs the name an operator? jAgda9Get the next version of the concrete name. For instance, nextName "x" = "x ". The name must not be a NoName. kAgdaThe range is not forced. pAgdaOnly use this show3 function in debugging! To convert an abstract  K into a string use  prettyShow. rAgda8An abstract name is empty if its concrete name is empty. |AgdaOnly use this show3 function in debugging! To convert an abstract  @ into a string use  prettyShow. AgdaOnly use this show3 function in debugging! To convert an abstract  G into a string use  prettyShow. AgdaThe range of an AmbiguousQNameQ is the range of any of its disambiguations (they are the same concrete name). AgdaPWe can have an instance for ambiguous names as all share a common concrete name. AgdaUse  to print names to the user.5 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j5 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i jUNone"#$+-013457;<=>?ACNQV]^V] AgdaRanges are not forced. VNone"#$+-013457;<=>?ACNQV]^em Agda5Checks if the given expression is unreachable or not. Agda 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. AgdaMatches 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) AgdaBinds no variables AgdaCCompiler-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 Agdaintroduces 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. AgdaCase 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. AgdaUsed by the GHC backend Agda,A runtime error, something bad has happened. AgdaIntroduces a new binding 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j         X         WNone"#$+-03457;<=>?ACNQV]^rQ) ) . - , + * / 0 2 1 3 9 8 5 4 6 7 : = < ; > ? E D F @ B G I H A C J K L M N O P Q) P N O M L Q J K ? E D F @ B G I H A C > : = < ; 3 9 8 5 4 6 7 0 2 1 ) . - , + * /XNone"#$+-03457;<=>?ACNQV]^u AgdaA misplaced end-comment "-}".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 { | } ~  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 { | } ~ GNone"#$+-013457;<=>?ACNQV]^ $AgdagThe notation is handled as the fixity in the renamer. Hence, they are grouped together in this type. AgdaWhen 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`. Agda(Precedence is associated with a context. Agda*Do we prefer parens around arguments like  x ! x or not? See  . AgdaFixity of operators. Agda&Range of the whole fixity declaration. AgdaAssociativity. Agda Precedence levels for operators. AgdaNo fixity declared. AgdaFixity level declared as the Integer. Agda-Sections, as well as non-sectioned operators. Agda>For non-sectioned operators this should match the notation's  -. AgdaEffective precedence level. / for closed notations. Agda/ for non-sectioned operators. Agda/All the notation information related to a name. Agda-The names the syntax and/or fixity belong to.AInvariant: The set is non-empty. Every name in the list matches  . Agda3Associativity and precedence (fixity) of the names. Agda!Syntax associated with the names. AgdaPTrue if the notation comes from an operator (rather than a syntax declaration). AgdaDecorating something with Fixity'. Agda`Range of the name in the fixity declaration (used for correct highlighting, see issue #2140). AgdaLIf an operator has no specific notation, then it is computed from its name. AgdaReplace   by  . Agda 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. Agda Create a  !# (without binders) from a concrete   . Does the obvious thing:   s become  s,   s become IdParts. If   has no  s, it returns  /. AgdaMerges  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  K1 may occur in more than one list element. Every   must have the same  .Postcondition: No  K& occurs in more than one list element. Agda'Converts a notation to a (non-)section. Agda#Argument context preferring parens. AgdalDo we need to bracket an operator application of the given fixity in a context with the given precedence. AgdalDo we need to bracket an operator application of the given fixity in a context with the given precedence. AgdaDoes 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). Agda*Does a function application need brackets? Agda*Does a function application need brackets? Agda&Does a with application need brackets? Agda$Does a function space need brackets? AgdaRanges are not forced.H                       H                       YNone"#$+-013457;<=>?ACNQV]^ AAgda.Zero or more consecutive and separated ranges. CAgdaQCharacter ranges. The first character in the file has position 1. Note that the  F4 position is considered to be outside of the range. Invariant:  E 0:  F. GAgdaThe  C invariant. HAgdaThe  A invariant. IAgda/ iff the ranges overlap.)The ranges are assumed to be well-formed. JAgda/ iff the range is empty. KAgda(Converts a range to a list of positions. LAgda/Converts several ranges to a list of positions. MAgda Converts a  to a  A. OAgda 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. A B C D E F G H I J K L M N O C D E F G A B H I J K L M N OZNone"#$+-03457;<=>?ACKNQV]^AA UAgda SCC DAGs.0The maps map SCC indices to and from SCCs/nodes. ZAgdaVarious kinds of nodes. \AgdaNodes with outgoing edges. ]AgdaNodes with incoming edges. ^Agda!All nodes, with or without edges. _AgdaEdges. aAgdaOutgoing node. bAgdaIncoming node. cAgdaEdge label (weight). dAgda Graph n e, is a type of directed graphs with nodes in n and edges in e.lAt most one edge is allowed between any two nodes. Multigraphs can be simulated by letting the edge type e be a collection type.The graphs are represented as adjacency maps (adjacency lists, but using finite maps instead of arrays and lists). This makes it possible to compute a node's outgoing edges in logarithmic time (O(log n)B). However, computing the incoming edges may be more expensive.LNote that neither the number of nodes nor the number of edges may exceed 0; :: /. fAgdaForward edges. gAgdaInternal invariant. hAgdaIf there is an edge from s to t, then  lookup s t g is / e, where e is the edge's label. O(log n). iAgdaThe graph's edges. O(n + e). jAgdaneighbours u g consists of all nodes v" for which there is an edge from u to v in g-, along with the corresponding edge labels.  O(log n + |neighbours u g|). kAgdaneighboursMap u g consists of all nodes v" for which there is an edge from u to v in g-, along with the corresponding edge labels. O(log n). lAgdaedgesFrom g nst is a list containing all edges originating in the given nodes (i.e., all outgoing edges for the given nodes). If nsT does not contain duplicates, then the resulting list does not contain duplicates. O(|ns| log |n| + |edgesFrom g ns|). mAgda edgesTo g nsn is a list containing all edges ending in the given nodes (i.e., all incoming edges for the given nodes). If nsU does not contain duplicates, then the resulting list does not contain duplicates. O(|ns | n log n). nAgdaAll self-loops.  O(n log n). oAgda All nodes. O(n). pAgdaNodes with outgoing edges. O(n). qAgdaNodes with incoming edges. O(n + e log n). rAgda Constructs a  Z structure. O(n + e log n). sAgda*Nodes without incoming or outgoing edges. O(n + e log n). tAgdaFChecks whether the graph is discrete (containing no edges other than  edges). O(n + e). uAgdaReturns True iff the graph is acyclic. vAgdaJConstructs a completely disconnected graph containing the given nodes.  O(n log n). wAgdaJConstructs a completely disconnected graph containing the given nodes. O(n). xAgda fromEdges es$ is a graph containing the edges in es=, with the caveat that later edges overwrite earlier edges. O(|es| log n). yAgdafromEdgesWith f es$ is a graph containing the edges in esM. Later edges are combined with earlier edges using the supplied function. O(|es| log n). zAgda"Empty graph (no nodes, no edges). O(1). {Agda5A graph with two nodes and a single connecting edge. O(1). |Agda Inserts an edge into the graph. O(log n). }Agda Inserts an edge into the graph. O(log n). ~AgdainsertWith f s t new inserts an edge from s to t3 into the graph. If there is already an edge from s to t with label old6, then this edge gets replaced by an edge with label  f new old%, and otherwise the edge's label is new. O(log n). Agda A variant of  ~. O(log n). AgdaLeft-biased union.Time complexity: See  . AgdaUnion. The function is used to combine edge labels for edges that occur in both graphs (labels from the first graph are given as the first argument to the function).Time complexity:  O(n log (n n + 1) + e log e , where Pn / is the number of nodes in the graph with the smallest number of nodes and n 0 is the number of nodes in the other graph, and e M is the number of edges in the graph with the smallest number of edges and e + is the number of edges in the other graph."Less complicated time complexity: O((n + e) log n (where n and e refer to the resulting graph). AgdaUnion. O((n + e) log n (where n and e refer to the resulting graph). Agda\Union. The function is used to combine edge labels for edges that occur in several graphs. O((n + e) log n (where n and e refer to the resulting graph). Agda A variant of 0<< that provides extra information to the function argument. O(n + e). AgdaReverses an edge. O(1). Agda.The opposite graph (with all edges reversed). O((n + e) log n). AgdaRemoves  edges. O(n + e). AgdaremoveNodes ns g removes the nodes in ns% (and all corresponding edges) from g. O((n + e) log |ns|). AgdaremoveNode n g removes the node n% (and all corresponding edges) from g. O(n + e). AgdaremoveEdge s t g removes the edge going from s to t , if any. O(log n). Agda0Keep only the edges that satisfy the predicate. O(n + e). AgdaUnzips the graph. O(n + e). AgdacomposeWith 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 look up all edges starting with t in g'.>Precondition: The two graphs must have exactly the same nodes. AgdaIThe graph's strongly connected components, in reverse topological order. AgdaIThe graph's strongly connected components, in reverse topological order. Agda U invariant. AgdaThe opposite DAG. Agda'The nodes reachable from the given SCC. AgdaGConstructs a DAG containing the graph's strongly connected components. AgdaGConstructs a DAG containing the graph's strongly connected components. AgdareachableFrom 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 0; :: /.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. AgdareachableFromSet g ns/ is a set containing all nodes reachable from ns in g.Precondition: Every node in ns must be a node in g<. The number of nodes in the graph must not be larger than 0; :: /.KAmortised time complexity (assuming that comparisons take constant time): O((|ns | + e) log n).0=AgdaUsed to implement   and  . Agda#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 0; :: /.iAmortised time complexity (assuming that comparisons and the predicates take constant time to compute): O(n + e log n). AgdaTransitive closure ported from Agda.Termination.CallGraph.%Relatively efficient, see Issue 1560. Agda Version of  ~ 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 Agda-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  ! is likely to be more efficient. Agda-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  d, 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. Agda*The graph's strongly connected components.G U V W X Y Z [ \ ] ^ _ ` c a b d e f g h i j k l m n o p q r s t u v w x y z { | } ~  G d e f g _ ` c a b h i j k l m n o p q s Z [ \ ] ^ r t u v w x y z { | ~ }  U V W X Y [None"#$+-03457;<=>?ACNQV]^}'% AgdaThese metas are < ". Agda,Lower or upper bound for a flexible variable AgdaA graph forest. Agda 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. ] AgdaNodes not connected. Agda4Test for negativity, used to detect negative cycles. Agda1Compute list of edges that start in a given node. Agda/Compute list of edges that target a given node.9Note: expensive for unidirectional graph representations. Agda Set.foldl* does not exist in legacy versions of the  containers package. AgdaFloyd-Warshall algorithm. Agda5Convert a label to a weight, decrementing in case of . AgdaSplit 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". AgdaTAdd an edge to a graph forest. Graphs that share a node with the edge are joined. AgdaReflexive closure. Add edges 0 -> n -> n -> oo for all nodes n. Agdah   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. Agda2Build a graph from list of simplified constraints. Agda2Build a graph from list of simplified constraints. AgdaIf we have an edge  X + n <= X (with n >= 0), we must set X = oo. Agda2Compute a lower bound for a flexible from an edge. Agda3Compute an upper bound for a flexible from an edge. Agda6Compute the lower bounds for all flexibles in a graph. Agda6Compute the upper bounds for all flexibles in a graph. Agda0Compute the bounds for all flexibles in a graph. AgdacCompute the relative minima in a set of nodes (those that do not have a predecessor in the set). AgdaaCompute the relative maxima in a set of nodes (those that do not have a successor in the set). AgdaGiven 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. AgdaGiven 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. AgdaBCompute the sup of two different rigids or a rigid and a constant. AgdaBCompute the inf of two different rigids or a rigid and a constant. Agda$Compute the least upper bound (sup). Agda]Compute the greatest lower bound (inf) of size expressions relative to a hypotheses graph. AgdahSolve a forest of constraint graphs relative to a hypotheses graph. Concatenate individual solutions. AgdaXCheck that after substitution of the solution, constraints are implied by hypotheses. Agda1Iterate 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. AgdaPartial implementation of Num.Agda$An edge is negative if its label is.Agda A graph is  U if it contains a negative loop (diagonal edge). Makes sense on transitive graphs. Agda;Meta variable polarities (prefer lower or upper solution?).AgdaBHypotheses (assumed to have no metas, so, fixed during iteration).AgdaConstraints to solve.Agda7Previous substitution (already applied to constraints).AgdaAccumulated substition.U U \None"#$+-013457;<=>?ACNQV]^AgdawSubterm occurrences for positivity checking. The constructors are listed in increasing information they provide: 3Mixed <= JustPos <= StrictPos <= GuardPos <= Unused Mixed <= JustNeg <= Unused. Agda-Arbitrary occurrence (positive and negative).!AgdaNegative occurrence."Agda/Positive occurrence, but not strictly positive.#AgdaStrictly positive occurrence.$AgdaVGuarded strictly positive occurrence (i.e., under "). For checking recursive records.&Agda-One part of the description of an occurrence.(Agda(in the nth argument of a define constant)Agda'in the principal argument of built-in "*Agda"as an argument to a bound variable+Agda as an argument of a metavariable,Agdain the type of a constructor-Agda$in a datatype index of a constructor.Agda'in the nth clause of a defined function/Agda1matched against in a clause of a defined function0Agdain the definition of a constant1AgdaDescription of an occurrence.2Agda)an unknown position (treated as negative)3AgdaXThe elements of the sequence, from left to right, explain how to get to the occurrence.4Agda&The map contains bindings of the form  bound |-> ess?, satisfying the following property: for every non-empty list w, 0> W w 0: bound iff 0? [ 0@ every w 0A 0B some w | (every, some) <- ess ].5Agda+productOfEdgesInBoundedWalk occ g u v bound returns a value distinct from / iff there is a walk c (a list of edges) in g, from u to v, for which the product 0> W (0C occ c) 0: bound&. In this case the returned value is / (0> W c) for one such walk c.Preconditions: u and v must belong to g, and bound must belong to the domain of boundToEverySome.:Agda* is a complete lattice with least element   and greatest element %.&It forms a commutative semiring where V is meet (glb) and W0 is composition. Both operations are idempotent.For V, % is neutral (zero) and   is dominant. For W, # is neutral (one) and % is dominant.% !"#$&'()*+,-./012345% !"#$123&'()*+,-./045]None"#$+-013457;<=>?ACNQV]^ LAgdaThe  is not an application.OAgda(Extended content of an interaction hole.PAgda eQAgda rewrite e0 | ... | enRAgda=Modules: Top-level pragmas plus other top-level declarations._Agdafirst string is backend name`Agdafirst string is backend namecAgdaINLINE or NOINLINEdAgda:Invariant: The string must be a valid Haskell module name.eAgda&same as above, but for the UHC backendfAgda.Throws an internal error in the scope checker.gAgda:For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop).hAgdaApplies to the following function (and all that are mutually recursive with it) or to the functions in the following mutual block.iAgdaApplies to the named functionjAgda)Applies to the following function clause.lAgda:Applies to the following data/record type or mutual block.rAgda  tel. M argssAgda  M {{...}}tAgda~The representation type of a declaration. The comments indicate which type in the intended family the constructor targets.uAgdaDAxioms and functions can be irrelevant. (Hiding should be NotHidden)vAgda.Record field, can be hidden and/or irrelevant.xAgda#lone data signature in mutual blockzAgda%lone record signature in mutual block{Agda7The optional name is a name for the record constructor.}Agdanotation declaration for a nameAgdaIn  Agda.Syntax.Concrete.Definitions~ we generate private blocks temporarily, which should be treated different that user-declared private blocks. Thus the *.Agda(Just type signatures or instance blocks.AgdaJust type signatures.AgdaThe "as" name.AgdaCThe range of the "as" keyword. Retained for highlighting purposes.Agda3An imported name can be a module or a defined name.AgdaYThe things you are allowed to say when you shuffle names between name spaces (i.e. in import,  namespace, or open declarations).AgdavAn expression followed by a where clause. Currently only used to give better a better error message in interaction.Agdaalways  (see parser)AgdaNo where clauses.Agda Ordinary where.Agda Named where: module M where . The  flag applies to the  J (not the module contents!) and is propagated from the parent function.Agda+No right hand side because of absurd match.Agda:Processed (operator-parsed) intermediate form of the core f ps of . Corresponds to .Agda fAgda psAgdaRecord projection.Agda-Patterns for record indices (currently none).AgdaMain argument.AgdaNon-empty; at least one (| p).Agda;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.AgdaSOriginal pattern (including with-patterns), rewrite equations and with-expressions.Agdae.g.  f ps | wpsAgda rewrite e (many)Agdawith e (many)Agda\A telescope is a sequence of typed bindings. Bound variables are in scope in later types.AgdaBinding (x1 ... xn : A).Agda Let binding (let Ds) or  (open M args).AgdaA typed binding.AgdaHfor implicit function types the label matters and can't be alpha-renamedAgda. (xs : e) or {xs : e} or something like  (x {y} _ : e).Agda}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 N in  TypedBindings must be the unit Q.Agda. x or {x} or .x or .{x} or {.x}Agda. (xs : e) or {xs : e}Agda0A lambda binding is either domain free or typed.Agda p ! e where csAgda9Concrete patterns. No literals in patterns at the moment.Agdac or xAgda quoteAgdap p' or  p {x = p'}Agdap1..pn before parsing operatorsAgdaeg: p => p' for operator _=>_ The Q is possibly ambiguous, but it must correspond to one of the names in the set.Agda{p} or {x = p}Agda{{p}} or  {{x = p}}Agda (p)Agda _Agda ()Agdax@p unusedAgda .eAgda0, 1, etc.Agda record {x = p; y = q}Agda..., only as left-most pattern.Agda| p, for with-patterns.AgdaCConcrete expressions. Should represent exactly what the user wrote.Agdaex: xAgdaex: 1 or "foo"Agdaex: ? or  {! ... !}Agdaex: _ or _A_5Agdabefore parsing operatorsAgdaex: e e, e {e}, or  e {x = e}Agdaex: e + e The S is possibly ambiguous, but it must correspond to one of the names in the set.Agdaex: e | e1 | .. | enAgdaex: {e} or {x=e}Agdaex: {{e}} or {{x=e}}Agdaex:  \x {y} -> e or \(x:A){y:B} -> eAgdaex: \ ()Agdaex: .\ { p11 .. p1a -> e1 ; .. ; pn1 .. pnz -> en }Agdaex: e -> e or .e -> e (NYI: {e} -> e)Agdaex:  (xs:e) -> e or  {xs:e} -> eAgdaex: SetAgdaex: PropAgdaex: Set0, Set1, ..Agdaex: record {x = a; y = b}, or record { x = a; M1; M2 }Agdaex: record e {x = a; y = b}Agdaex:  let Ds in e+, missing body when parsing do-notation letAgdaex: (e)Agdaex: (| e |)Agdaex: do x <- m1; m2Agdaex: () or {}, only in patternsAgdaex: x@p, only in patternsAgdaex: .p, only in patternsAgda!only used for printing telescopesAgdaex: quoteGoal x in eAgdaex:  quoteContextAgdaex: quote, should be applied to a nameAgdaex:  quoteTerm, should be applied to a termAgda 'tactic solve | subgoal1 | .. | subgoalNAgdaex: unquote&, should be applied to a term of type TermAgdato print irrelevant thingsAgdaex: a = b, used internally in the parserAgda...$, used internally to parse patterns.Agda\An abstraction inside a special syntax declaration (see Issue 358 why we introduce this).Agda#Computes the top-level module name.Precondition: The R has to be well-formed. This means that there are only allowed declarations before the first module declaration, typically import declarations. See .AgdaSplits off allowed (= import) declarations before the first non-allowed declaration. After successful parsing, the first non-allowed declaration should be a module declaration.!AgdaRanges are not forced.(AgdaA  is  when the whereG keyword is absent. An empty list of declarations does not count as  here.)AgdaRanges are not forced./AgdaRanges are not forced.0AgdaRanges are not forced.1AgdaRanges are not forced.2AgdaRanges are not forced.3AgdaRanges are not forced.4AgdaRanges are not forced.5AgdaRanges are not forced.6AgdaRanges are not forced.                    LMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrsty|}{uvwxz~     LM     ty|}{uvwxz~qrsnopSTUVWXYZ[\]^_`abcdefghijklmR NOPQ^None"#$+-03457;<=>?ACNQV]^ AgdaPicking the appropriate set of special characters depending on whether we are allowed to use unicode or have to limit ourselves to ascii.AgdaprettyHiding 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._None"#$+-03457;<=>?ACNQV]^ )%AgdaPhases to allocate CPU time to.Agda#Happy parsing and operator parsing.AgdaImport chasing.AgdaReading interface files.Agda2Scope checking and translation to abstract syntax.Agda1Type checking and translation to internal syntax.AgdaTermination checking.Agda-Positivity checking and polarity computation.AgdaInjectivity checking.Agda!Checking for projection likeness.Agda0Coverage checking and compilation to case trees.AgdaGenerating highlighting info.AgdaWriting interface files.AgdaDeac code elimination.Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for .Agda Subphase for : free variable computation.Agda Subphase for !: occurs check for solving metas.Agda Subphase for : checking the LHSAgda Subphase for : checking the RHSAgda Subphase for : checking a type signatureAgda Subphase for : unification of the indicesAgdaPretty printing names.Agda.Global variable to store benchmark statistics.Agda=Benchmark an IO computation and bill it to the given account.Agda>Benchmark a pure computation and bill it to the given account.,,`None"#$+-03457;<=>?ACFNQTV]^ JAgdaGeneric pattern traversal.See E.Agda Fold pattern.Agda<Traverse pattern with option of post-traversal modification.AgdaTraverse pattern.AgdaThe next patterns are ...(This view discards PatInfo.)Agda&Application patterns (non-empty list).AgdaHWith patterns (non-empty list). These patterns are not prefixed with .AgdaCheck for with-pattern | p. Agda*Has the lhs an occurrence of the ellipsis ...? AgdaCheck for ellipsis ....AgdaConstruct the " of the given list (if not empty).+Return the view and the remaining patterns.AgdaKAdd applicative patterns (non-projection / non-with patterns) to the right.AgdaAdd with-patterns to the right.AgdaAppend patterns to ), separating with patterns from the rest.Agda Modify the  component in .AgdaEffectfully modify the  component in .Agda)Does the LHS contain projection patterns?AgdaHCompute a value from each subpattern and collect all values in a monoid.AgdaETraverse pattern(s) with a modification before the recursive descent.AgdaDTraverse pattern(s) with a modification after the recursive descent.Agda?Map pattern(s) with a modification after the recursive descent.Agda<Get all the identifiers in a pattern in left-to-right order.#Implemented using difference lists.Agda<Get all the identifiers in a pattern in left-to-right order.Agda9Does the pattern contain a with-pattern? (Shortcutting.)AgdaIs ?Agda2Count the number of with-subpatterns in a pattern?AgdasCompute the context in which the ellipsis occurs, if at all. If there are several occurrences, this is an error.AgdaIs the pattern just ...? Agda!Does the lhs contain an ellipsis?Agda>Combine a pattern and the value computed from its subpatterns.Agda;Combine a pattern and the its recursively computed version.Agdapre : Modification before recursion.Agdapost: Modification after recursion.Agdapre : Modification before recursion.Agdapost: Modification after recursion.          aNone"#$&'+-03457;<=>?ACFNQTV]^ ]Z ,AgdaA singleton type for   (except for the constructor  ).1Agda"Used to define the return type of I.2AgdaShould sections be parsed?=AgdaThe O is possibly ambiguous, but it must correspond to one of the names in the set.EAgdaRuns 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.FAgda)Parse a specific identifier as a NamePartGAgdaKParses 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.HAgdaEither a wildcard (_E), or an unqualified name (possibly containing multiple name parts).IAgda0Parse 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.!,0/.-12435768A@?>=<;:9BCDEFGHIJKL!BCD8A@?>=<;:9576243EFGH1,0/.-IJKLbNone"#$+-03457;<=>?ACNQV]^ aRAgda,Generic traversals for concrete expressions. Note: does not go into patterns!SAgdaThis corresponds to 0C.TAgdaThis corresponds to 0D.UAgdaThis is a reduce.RUTSRUTScNone"#$+-013457;<=>?ACNQV]^ -pAgda A compressed t0, in which consecutive positions with the same  are stored together.sAgda Syntax highlighting information.tAgdaA t6 is a mapping from file positions to meta information.,The first position in the file has number 1.wAgdaRIs the highlighting "token-based", i.e. based only on information from the lexer?|AgdaThe defining module.}Agda!The file position in that module.~Agda Has this DefinitionSite/ been created at the defining site of the name?Agda#A pretty name for the HTML linking.AgdaKMeta information which can be associated with a character/character range.AgdaThis 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).AgdajThe definition site of the annotated thing, if applicable and known. File positions are counted from 1.AgdaIs this entry token-based?AgdaZOther aspects, generated by type checking. (These can overlap with each other and with s.)AgdahUnsolved constraint not connected to meta-variable. This could for instance be an emptyness constraint.AgdaGWhen this constructor is used it is probably a good idea to include a * explaining why the pattern is incomplete.Agda!Code which is being type-checked.AgdaNameKind(s are figured out during scope checking.AgdaBound variable.Agda%Inductive or coinductive constructor.Agda Record field.Agda Module name.Agda Primitive.Agda Record type.Agda!Named argument, like x in {x = v}AgdaMacro.AgdaSyntactic aspects of the code. (These cannot overlap.) They can be obtained from the lexed tokens already, except for the .Agda Symbols like forall, =, ->, etc.AgdaThings like Set and Prop.AgdaIs the name an operator part?Agda A variant of 0E with  set to y.Agda rs m( is a file whose positions are those in rs2, and in which every position is associated with m.AgdaLike , but with several  A instead of only one.0FAgdaMerges meta information.Agda Merges files.Agda.Returns the smallest position, if any, in the t.Agda Convert the tE to a map from file positions (counting from 1) to meta information.AgdaInvariant 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.AgdacCompresses a file by merging consecutive positions with equal meta information into longer ranges.AgdaDecompresses a compressed file.AgdaClear any highlighting info for the given ranges. Used to make sure unsolved meta highlighting overrides error highlighting.Agda rs m( is a file whose positions are those in rs2, and in which every position is associated with m.AgdaLike  singletonR, but with a list of  A instead of a single one.AgdaMerges compressed files.Agda 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.Agda.Returns the smallest position, if any, in the p.Hpqrstuvwxyz{|}~Hz{|}~wxytuvspqrdNone"#$+-03457;<=>?ACNQV]^ AgdaYCallback 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 0Gg 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).AgdaGive 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 ).AgdaStatus information.Agda!Are implicit arguments displayed?Agda.Has the module been successfully type checked?Agda4Info to display at the end of an interactive commandAgda3Strings are the warnings and the (non-fatal) errorsAgda>Strings are the goals, the warnings and the (non-fatal) errorsAgdaWhen an error message is displayed this constructor should be used, if appropriate. | Info_Warning String --FNF: currently unusedAgdaV denotes two different types of errors TODO: split these into separate constructorsAgda, denotes either an error or a success (when < is present) TODO: split these into separate constructorsAgda,There are two kinds of "make case" commands.AgdaShould token-based highlighting be removed in conjunction with the application of new highlighting (in order to reduce the risk of flicker)?Agda7Yes, remove all token-based highlighting from the file.AgdaNo.Agda'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.Agda(Solution for one or more meta-variables.Agda)The integer is the message's debug level.Agda%Clear highlighting of the given kind.AgdaAA command sent when an abort command has completed successfully.Agda The default S function prints certain things to stdout (other things generate internal errors).//eNone"#$+-03457;<=>?ACKNQV]^ Agda;Result of comparing a candidate with the current favorites.AgdaxGreat, 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.Agda.Sorry, but you are dominated by that favorite.Agda!A list of incomparable favorites. AgdaGosh, 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.) AgdaCompare 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')Agda)After comparing, do the actual insertion.Agda%Compare, then insert accordingly. :insert a l = insertCompared a l (compareWithFavorites a l)Agda=Insert all the favorites from the first list into the second.AgdaConstruct 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.Agda forms a 0H under  and 'union.AgdaLEquality checking is a bit expensive, since we need to sort! Maybe use a Set! of favorites in the first place?          fNone"#$+-03457;<=>?ACNQV]^ Agda,A finite map, represented as a set of pairs.%Invariant: at most one value per key.AgdaO(n). Reexport 0I.Agda9O(n). Get the domain (list of keys) of the finite map.AgdaJO(1). Add a new binding. Assumes the binding is not yet in the list.AgdaO(n). Update the value at a key. The key must be in the domain of the finite map. Otherwise, an internal error is raised.AgdayO(n). Delete a binding. The key must be in the domain of the finite map. Otherwise, an internal error is raised.AgdaO(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. Agda<O(n). Map over an association list, preserving the order.!Agda{O(n). If called with a effect-producing function, violation of the invariant could matter here (duplicating effects)."AgdaO(n). Named in analogy to FGu. To preserve the invariant, it is sufficient that the key transformation is injective (rather than monotonic).  !"  !"gNone"#$&'+-013457;<=>?ACNQV]^ G|e$AgdanUsed for instance arguments to check whether a name is in scope, but we do not care whether is is ambiguous%Agda9Ambiguous constructors, projections, or pattern synonyms.)Agda9Local variable bound by , , module telescope, pattern, let.*Agda&Function, data/record type, postulate.+AgdaBRecord field name. Needs to be distinguished to parse copatterns.,Agda Data or record constructor name.-AgdaName of pattern synonym..Agda Unbound name.0AgdaWhat kind of binder?1Agda-A decoration of abstract syntax module names.3AgdaThe resolved module name.4Agda&Explanation where this name came from.5AgdaA decoration of TH.7AgdaThe resolved qualified name.8Agda6The kind (definition, constructor, record field etc.).9Agda&Explanation where this name came from.:AgdaWhere does a name come from?=This information is solely for reporting to the user, see I.;AgdaDefined in this module.<AgdaImported from another module.=Agda!Imported by a module application.>AgdaqFor the sake of parsing left-hand sides, we distinguish constructor and record field names from defined names.?AgdaConstructor name.@AgdaRecord field name.AAgdaOrdinary defined name.BAgdaName of a pattern synonym.CAgdaName of a macroDAgdaA name that can only be quoted.EAgda-Type class for some dependent-types trickery.GAgda#Set of types consisting of exactly 5 and 1..A GADT just for some dependent-types trickery.NAgdaA  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.PAgda0Maps concrete names to a list of abstract names.QAgda>Maps concrete module names to a list of abstract module names.SAgdaA local variable can be shadowed by an import. In case of reference to a shadowed variable, we want to report a scope error.UAgdaUnique ID of local variable.VAgda/Kind of binder used to introduce the variable (, let, ...).WAgdaTIf this list is not empty, the local variable is shadowed by one or more imports.XAgdajFor each bound variable, we want to know whether it was bound by a , , module telescope, pattern, or let.YAgda (currently also used for  and module parameters)ZAgda f ... =[Agda  let ... in\AgdaLocal variables.]AgdaThe complete information about the scope at a particular program point includes the scope stack, the local variables, and the context precedence.hAgdaSee .iAgda#Things not exported by this module.jAgda+Things defined and exported by this module.kAgda1Things from open public, exported by this module.lAgdauVisible (as qualified) from outside, but not exported when opening the module. Used for qualified constructors.mAgdaTA scope is a named collection of names partitioned into public and private names.vAgdaGet a N from m.wAgda A lens for qxAgda`Monadic' lens (Functor sufficient).yAgda3Shadow a local name by a non-empty list of imports.zAgda*Project name of unshadowed local variable.{Agda%Get all locals that are not shadowed  by imports.|Agda Lens for a.~Agda Lens for b.Agda inNameSpace> selects either the name map or the module name map from a NX. What is selected is determined by result type (using the dependent-type trickery).Agda!A list containing all name kinds.AgdaVan Laarhoven lens on 7.AgdaVan Laarhoven lens on 3.AgdaThe empty name space.Agda9Map functions over the names and modules in a name space.AgdaZip together two name spaces.Agda&Map monadic function over a namespace.AgdaThe empty scope.AgdaThe empty scope info.Agda4Map functions over the names and modules in a scope.AgdaSame as 2 but applies the same function to all name spaces.AgdaSame as 7 but applies the function only on the given name space.Agda<Map monadic functions over the names and modules in a scope.AgdaSame as M but applies the same function to both the public and private name spaces.AgdaUZip together two scopes. The resulting scope has the same name as the first scope.AgdaSame as M but applies the same function to both the public and private name spaces.Agda&Recompute the inScope sets of a scope.AgdaFilter a scope keeping only concrete names matching the predicates. The first predicate is applied to the names and the second to the modules.AgdaReturn all names in a scope.Agda&Returns the scope's non-private names.Agda=Merge two scopes. The result has the name of the first scope.Agda\Merge a non-empty list of scopes. The result has the name of the first scope in the list.AgdaaMove all names in a scope to the given name space (except never move from Imported to Public).AgdaUpdate a particular name space.AgdaModify a particular name space.AgdaAdd names to a scope.AgdaAdd a name to a scope.AgdaRemove 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).AgdaAdd a module to a scope.Agda Apply an  to a scope.Agda%Rename the abstract names in a scope.Agda%Remove private name space of a scope.Should be a right identity for . >exportedNamesInScope . restrictPrivate == exportedNamesInScope.Agda9Remove private things from the given module from a scope.AgdaCRemove names that can only be used qualified (when opening a scope)Agda.Add an explanation to why things are in scope.Agda5Get the public parts of the public modules of a scopeAgdaoCompute a flattened scope. Only include unqualified names or names qualified by modules in the first argument.Agda:Get all concrete names in scope. Includes bound variables.AgdaLook up a name in the scopeAgdahFind the concrete names that map (uniquely) to a given abstract name. Sort by length, shortest first.AgdarFind the concrete names that map (uniquely) to a given abstract qualified name. Sort by length, shortest first.AgdaoFind the concrete names that map (uniquely) to a given abstract module name. Sort by length, shortest first.Agda+Add first string only if list is non-empty.AgdaAWe show shadowed variables as prefixed by a ".", as not in scope.#&%$'(.-,+*)0/124356987:<;=>DCBA@?EFGIHJKLMNORQPSTWVUX[ZY\]^fedcba`_ghlkjimnsrqpotuvwxyz{|}~mnsrqpohlkjigtuvwx]^fedcba`_\X[ZYSTWVUyz{|}~NORQPMLKJGIHEF>DCBA@?:<;=569871243(.-,+*)0/'#&%$hNone"#$+-03457;<=>?ACNQV]^ R~Agda.Types which Geniplate should not descend into.AgdaA localised instance of 0J. The generated 0K. functions neither descend into the types in *, nor into the types in the list argument.AgdaA localised instance of 0L. The generated 0M. functions neither descend into the types in *, nor into the types in the list argument.iNone"#$+-013457;<=>?ACKNQV]^ ^d AgdaConstructor pattern info.AgdaEDoes this pattern come form the eta-expansion of an implicit pattern?Agda;For a general pattern we remember the source code position.AgdaUThe range of the "as" and "to" keywords, if any. Retained for highlighting purposes.AgdaAThe "as" module name, if any. Retained for highlighting purposes.Agda Retained for abstractToConcrete of .AgdaInformation about applicationAgda6Do we prefer a appbda argument with or without parens?%Agda-Default is system inserted and prefer parens.&Agda with no range information.(AgdaSame as  mkDefInfo but where we can also give the  IsInstance)AgdaEmpty range for patterns.>AgdaDefault value for .7     "! #$%&'()7"! #$%&     '()jNone"#$+-03457;<=>?ACNQV]^ $0NAgdaTransposable things.nAgdao m extracts the diagonal of m.fFor non-square matrices, the length of the diagonal is the minimum of the dimensions of the matrix.pAgda6Type of matrices, parameterised on the type of values.aSparse matrices are implemented as an ordered association list, mapping coordinates to values.rAgdaDimensions of the matrix.sAgda!Association of indices to values.tAgda%Type of matrix indices (row, column).vAgda Row index, 1 <= row <= rows.wAgda Column index 1 <= col <= cols.xAgdaSize of a matrix.zAgdaNumber of rows, >= 0.{AgdaNumber of columns, >= 0.0OAgda Convert a xI to a set of bounds suitable for use with the matrices in this module.|Agda/ iff the matrix is square.}AgdaReturns / iff the matrix is empty.~Agda5Compute the matrix size of the union of two matrices.0PAgda<Compute the matrix size of the intersection of two matrices.Agda#Constructs a matrix from a list of (index, value) -pairs. O(n) where n is size of the list.!Precondition: indices are unique.Agda sz rsL constructs a matrix from a list of lists of values (a list of rows). O(size) where size = rows cols.Precondition: 0Q rs 0 z sz and 0@ (({ sz 0) . 0Q) rs.Agda6Converts 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.0RAgda`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.Agda-Converts a matrix to a list of row lists. O(size) where size = rows cols.Agda<Returns 'Just b' iff it is a 1x1 matrix with just one entry b. O(1).AgdaAGeneral 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.0SAgda Instance of $ which keeps longer assoc lists.  O(n1 + n2).Agda?General pointwise combination function for sparse matrices.  O(n1 + n2).Agda (+) m1 m2 adds m1 and m2, using (+) to add values.  O(n1 + n2).Returns a matrix of size ~ m1 m2.Agda 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.Agda"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.Agda 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.Agda 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.Agda 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.AgdaNPointwise comparison. Only matrices with the same dimension are comparable.AgdaDiagonal of sparse matrix.O(n) where n2 is the number of non-zero elements in the matrix.AgdaMatrix transposition. O(n log n) where n2 is the number of non-zero elements in the matrix.AgdaTransposing coordinates.AgdaSize of transposed matrix.AgdaOnly left map remaining.AgdaOnly right map remaining.Agda!Element only present in left map.Agda"Element only present in right map.AgdaElement present in both maps.0SAgda!Element only present in left map.Agda"Element only present in right map.AgdaElement present in both maps.Agda$Element only present in left matrix.Agda%Element only present in right matrix.Agda!Element present in both matrices.AgdaResult counts as zero?mnopqrstuvwxyz{|}~pqsxyz{tuvwr|}mno~kNone"#$+-03457;<=>?ACNQV]^ #Agda\A partial order, aimed at deciding whether a call graph gets worse during the completion.Agda:In the paper referred to above, there is an order R with  0: Le 0: Lt.This is generalized to  0: '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.Agda2Decrease 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.AgdaENo relation, infinite increase, or increase beyond termination depth.Agda&Matrix-shaped order, currently UNUSED.Agda$Raw increase which does not cut off.Agda$Raw decrease which does not cut off.AgdaSmart constructor for Decr k :: Order which cuts off too big values.Possible values for k:  - ?cutoff 0: k 0: ?cutoff + 1.AgdaRSmart constructor for matrix shaped orders, avoiding empty and singleton matrices.Agdale, lt,  decreasing, unknown4: for backwards compatibility, and for external use.AgdaUsable decrease.AgdaDecreasing and usable?AgdaHMatrix-shaped order is decreasing if any diagonal element is decreasing.AgdaMultiplication of .s. (Corresponds to sequential composition.)0TAgda 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.0UAgda'Can two matrices be multplied together?Agda+The supremum of a (possibly empty) list of ;s. More information (i.e., more decrease) is bigger. # is no information, thus, smallest.0VAgda(, 0V, ) forms a semiring, with  as zero and Le as one.Agda%The infimum of a (non empty) list of $s. Gets the worst information. & is the least element, thus, dominant.0WAgdaPick the worst information.AgdaWe use a record for semiring instead of a type class since implicit arguments cannot occur in instance constraints, like +instance (?cutoff :: Int) => SemiRing Order.AgdaInformation 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).Agda/We assume the matrices have the same dimension.AgdaIt does not get worse then ` increase'C. If we are still decreasing, it can get worse: less decreasing.lNone"#$+-03457;<=>?ACKNQV]^ AgdaVSets of incomparable call matrices augmented with path information. Use overloaded , , ], 0X.Agda,Call matrix augmented with path information.Agda"The matrix of the (composed call).AgdaMeta info, like call path.Agda0Call matrix multiplication and call combination.AgdaCall 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.Agda0Call matrix indices = function argument indices.Machine integer /^ is sufficient, since we cannot index more arguments than we have addresses on our machine.AgdaNon-augmented call matrix.AgdaInsert into a call matrix set.AgdaUnion two call matrix sets.Agda/Convert into a list of augmented call matrices.AgdaCall 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).Agda%Augmented call matrix multiplication.Agda1Call matrix set product is the Cartesian product.mNone"#$+-03457;<=>?ACKNQV]^ *AgdagA call graph is a set of calls. Every call also has some associated meta information, which should be 0Hbal so that the meta information for different calls can be combined when the calls are combined.AgdaCalls are edges in the call graph. It can be labelled with several call matrices if there are several pathes from one function to another.AgdaCall graph nodes.Machine integer /T is sufficient, since we cannot index more than we have addresses on our machine.Agda!Make a call with a single matrix.AgdaMake a call with empty cinfo.Agda@Returns all the nodes with incoming edges. Somewhat expensive. O(e).AgdaMConverts a call graph to a list of calls with associated meta information.AgdaMConverts a list of calls with associated meta information to a call graph.Agda#Takes the union of two call graphs.Agda!Inserts a call into a call graph.0YAgdaCall graph combination.Application of  to all pairs (c1,c2) for which  a c1 =  b c2.)Agda"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.Agda?Displays the recursion behaviour corresponding to a call graph.Agda is a monoid under .Agda: checks whether the call graph is completely disconnected. b a a bnNone"#$+-03457;<=>?ACNQV]^ >Agda2TODO: 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).AgdaA call c! is idempotent if it is an endo ( a ==  b) 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.oNone"#$+-03457;<=>?ACNQV]^ KAgdaSometimes 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.AgdanIn the lexer, regular expressions are associated with lex actions who's task it is to construct the tokens. Agda#This is what the lexer manipulates. AgdaFile. AgdaCurrent position. AgdaCurrent input.AgdaPreviously read character.Agda A lens for  .Agda,Get the previously lexed character. Same as L. Alex needs this to be defined to handle "patterns with a left-context".AgdaLex a character. No surprises. This function is used by Alex 2.Agda A variant of . This function is used by Alex 3.AgdaConjunction of s.AgdaDisjunction of s.Agda Negation of s.          pNone"#$+-03457;<=>?ACKNQV]^ ]t AgdaIThe LookAhead monad is basically a state monad keeping with an extra  , wrapped around the n monad.Agda$Get the current look-ahead position.AgdaSet the look-ahead position.AgdaLift a computation in the n monad to the  monad.AgdaBLook at the next character. Fails if there are no more characters.AgdaAConsume all the characters up to the current look-ahead position.Agda-Undo look-ahead. Restores the input from the c.Agda!Consume the next character. Does  followed by . AgdaDo 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.!AgdaSame 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."AgdaRun a 7 computation. The first argument is the error function.  !" " !qNone"#$+-03457;<=>?ACNQV]^ pS &AgdaALex a string literal. Assumes that a double quote has been lexed.'AgdazLex 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.0ZAgdaCustom error function.0[AgdamThe general function to lex a string or character literal token. The character argument is the delimiter (" for strings and ' for characters).0\AgdaoThis is where the work happens. The string argument is an accumulating parameter for the string being lexed.0]AgdaA string gap consists of whitespace (possibly including line breaks) enclosed in backslashes. The gap is not part of the resulting string.0^AgdaLex a single character.0_Agda?Lex an escaped character. Assumes the backslash has been lexed.0`Agda$Read a number in the specified base.0aAgdaSame as 0`$ but with an accumulating parameter.0bAgdaThe escape codes.&'&'tNone"#$+-03457;<=>?ACNQV]^ x<Agda Should comment tokens be output?=Agda Should comment tokens be output?>Agda,Manually lexing a block comment. Assumes an  open comment< has been lexed. In the end the comment is discarded and 8" is called to lex a real token.?Agda Lex a hole ( {! ... !}#). Holes can be nested. Returns  ^  o.@AgdaSkip 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.<=>?@<=>?@uNone"#$+-03457;<=>?ACDNQV]^ FAgdaCThis is the initial state for parsing a regular, non-literate file.GAgda8The layout state. Entered when we see a layout keyword (43) and exited either when seeing an open brace ( openBrace) or at the next token (:)./Update: we don't use braces for layout anymore.0cAgdaThe state inside a pragma.0dAgdayThe state inside a FOREIGN pragma. This needs to be different so that we don't lex further strings as pragma keywords.HAgdaWe enter this state from : 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 9] is executed, generating the closing brace. The open brace is generated when entering by :.IAgdaThis 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 ;.JAgda]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.KAgdaHReturn the next token. This is the function used by Happy in the parser.  lexer k = 8 >>= k0eAgda&Do not use this function; it sets the \ to 0f.MAgda3This is the main lexing function generated by Alex. ABCDEFGHIJKLM KFLGHIJABCDEMvNone"#$+-03457;<=>?ACDNQV]^f LNAgda1Parse the token stream. Used by the TeX compiler.OAgda3Parse an expression. Could be used in interactions.PAgdaNParse an expression followed by a where clause. Could be used in interactions.QAgdaParse a module.0gAgdaRequired by Happy.0hAgdaGrab leading OPTIONS pragmas.0iAgdaInsert 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).0jAgdaCreate a name from a string.0kAgda.Create a qualified name from a list of strings0lAgdaCreate a qualified name from a string (used in pragmas). Range of each name component is range of whole string. TODO: precise ranges!0mAgdaPolarity parser.0nAgdaMatch a particular name.0oAgda'Build a forall pi (forall x y z -> ...)0pAgda Build a telescoping let (let Ds)0qAgda+Converts lambda bindings to typed bindings.0rAgdaBuild a do-statement0sAgda=Check that an import directive doesn't contain repeated namesTAgdapBreaks up a string into substrings. Returns every maximal subsequence of zero or more characters distinct from 0. splitOnDots "" == [""] splitOnDots "foo.bar" == ["foo", "bar"] splitOnDots ".foo.bar" == ["", "foo", "bar"] splitOnDots "foo.bar." == ["foo", "bar", ""] splitOnDots "foo..bar" == ["foo", "", "bar"]0tAgdaReturns /= iff the name is a valid Haskell (hierarchical) module name.0uAgda)Turn an expression into a left hand side.0vAgdaUTurn an expression into a pattern. Fails if the expression is not a valid pattern.0wAgdaUTurn an expression into a name. Fails if the expression is not a valid identifier.NOPQRSTQROPNST0x9 0y9 rNone"#$+-03457;<=>?ACNQV]^ Ω(Agda<True if the given state appears somewhere on the state stack)Agda&True if we are at the end of the file.*AgdaHTrue when the given character is the next character of the input string.+AgdaParse a literal.,Agda7Parse an identifier. Identifiers can be qualified (see Name). Example:  Foo.Bar.f-AgdaParse a  e token..AgdaParse a   token, triggers layout for  ./Agda8Exit the current state throwing away the current lexeme.0Agda3Enter a new state throwing away the current lexeme.1Agda4Exit the current state and perform the given action.2Agda/Enter a new state and perform the given action.3Agda.Enter a new state without consuming any input.4Agda)Executed for layout keywords. Enters the G( state and performs the given action.5AgdaLike 6', but applies a function to the string.6AgdaParse a token from an  and the lexed string.7Agda(The most general way of parsing a token.8Agda-Scan the input to find the next token. Calls ML. This is the main lexing function where all the work happens. The function KB, used by the parser is the continuation version of this function.0zAgda%Called at the end of a file. Returns  d.0{Agda1Set the current input and lex a new token (calls 8).0|AgdaUse 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).0}AgdamAlex 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  .XAgda3Return a token without looking at the lexed string.YAgda2Exit the current state without consuming any input0~Agda Parse a possibly qualified name.()*+,-./012345678XY8765X43Y210/.-,+*)(sNone"#$+-03457;<=>?ACNQV]^ 89Agda&This action is only executed from the H/ state. It will exit this state, enter the I\ state, and return a virtual close brace (closing the empty layout block started by :).:AgdaJStart a new layout context. This is one of two ways to get out of the G state (the other is Z#). 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 HU 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.;Agda/Executed for the first token in each line (see Ic). 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 I state). same column : Exit the I/ state and return a virtual semi colon. to the right : Exit the I state and continue lexing.DIf the current block doesn't use layout (i.e. it was started by Z%) all positions are considered to be  to the right.ZAgda$Executed upon lexing an open brace ('{'). Enters the ` context.[Agda$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.0AgdaMCompute the relative position of a location to the current layout context.49:;Z[Z[4;:9wNone"#$+-013457;<=>?ACKNQV]^ M~\AgdaThe 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.aAgdaKPick the better name suggestion, i.e., the one that is not just underscore.cAgda#Constructing a singleton telescope.eAgda Drop the types from a telescope.hAgdaTelescope as list.iAgdaView type as equality type.kAgdareducedlAgdaSort of this type.mAgdaBuiltin EQUALITY.nAgdaHidden. Empty or Level.oAgdaHiddenpAgda NotHiddenqAgda NotHiddentAgdaSubstitutions.uAgdaIdentity substitution.   " IdS : vAgdaDEmpty 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 : ()wAgdaSubstitution extension, `cons'. S  " u : A  "  :  ----------------------  " u :#  : , A xAgda/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 yAgda8Weakning substitution, lifts to an extended context. I  "  :  ------------------- ,  " Wk ||  :  zAgda9Lifting substitution. Use this to go under a binder. Lift 1  == var 0 :# Wk 1 . X  "  :  ------------------------- ,  " Lift ||  : ,  {Agda7Extract pattern variables in left-to-right order. A + is also treated as variable (see docu for ).}AgdaThe ConPatternInfo= states whether the constructor belongs to a record type (Just) or data type (Nothing). In the former case, the  PatOrigin` 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 ().AgdaNothing if data constructor. Just if record constructor.AgdaAThe 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.Agda;Lazy patterns are generated by the forcing translation (J@) and are dropped by the clause compiler (TODO: not yet) (K) when the variables they bind are unused. The GHC backend compiles lazy matches to lazy patterns in Haskell (TODO: not yet).Agda+Type used when numbering pattern variables.Agda7Patterns 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.Agda xAgda .tAgdac ps= The subpatterns do not contain any projection copatterns.AgdaE.g. 5, "hello".Agda1Projection copattern. Can only appear by itself.Agda@Origin of the pattern: what did the user write in this position?AgdaPattern inserted by the systemAgdaPattern generated by case splitAgdaUser wrote a variable patternAgdaUser wrote a dot patternAgdaUser wrote a wildcard patternAgda User wrote a constructor patternAgdaUser wrote a record patternAgdaUser wrote a literal patternAgdaUser wrote an absurd patternAgdaPattern variables.Agda3A 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!Agda9: The types of the pattern variables in dependency order.Agda " ps". The de Bruijn indices refer to .AgdaJust v with  " v for a regular clause, or Nothing for an absurd one.Agda " t. The type of the rhs under  clauseTel. Used, e.g., by  TermCheck . Can be 6B if we encountered an irrelevant projection pattern on the lhs.Agda%Clause has been labelled as CATCHALL.AgdaDClause 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.Agda t without the t.Agda4Something where a meta variable may block reduction.AgdaEven if we are not stuck on a meta during reduction we can fail to reduce a definition by pattern matching for another reason.AgdaThe ' is neutral and blocks a pattern match.Agda<Not enough arguments were supplied to complete the matching.Agda2We matched an absurd clause, results in a neutral .AgdaWe 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.AgdaRReduction was not blocked, we reached a whnf which can be anything but a stuck .AgdaAn atomic term of type Level.AgdaA meta variable targeting Level under some eliminations.AgdaA term of type Level& whose reduction is blocked by a meta.AgdaA neutral term of type Level.AgdaIntroduced by  instantiate , removed by reduce.Agdan, to represent Set .Agdan + !.Agda(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.AgdaSorts.AgdaSet !.Agda Dummy sort.AgdaSet.AgdaSizeUniv, a sort inhabited by type Size.AgdaSort of the pi type.AgdaSort of another sort.AgdaVSequence of types. An argument of the first type is bound in later types and so on.Agda is never .Agda'Types are terms with a sort annotation.Agda 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.Agda6The body has (at least) one free variable. Danger: ! doesn't shift variables properlyAgdaNames in binders and arguments.Agda5Eliminations, subsuming applications and projections.Agda Application.Agda Projection.  G is name of a record projection.Agda 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.Agdax es neutralAgda+Terms are beta normal. Relevance is ignoredAgdaf es, possibly a delta/iota-redexAgdac es or record { fs = es } esU allows only Apply and IApply eliminations, and IApply only for data constructors.Agda)dependent or non-dependent function spaceAgdaIrrelevant stuff in relevant position, but created in an irrelevant context. Basically, an internal version of the irrelevance axiom .irrAx : .A -> A.AgdaStore the names of the record fields in the constructor. This allows reduction of projection redexes outside of TCM. For instance, during substitution and application.AgdaThe name of the constructor.Agda'Record constructors can be coinductive.AgdaGThe name of the record fields. Empty list for data constructors.  B is not needed here since it is stored in the constructor args.AgdaType of argument lists.AgdaWhen 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.)AgdaBuild partial } from AgdaBuild  from }.Agda Retrieve the origin of a patternAgda1Does the pattern perform a match that could fail?AgdaQAbsurd lambdas are internally represented as identity with variable name "()".AgdaAn unapplied variable.AgdaAdd  is it is not already a DontCare.Agda A dummy type. AgdaTop sort (Setomega).Agda)A traversal for the names in a telescope.Agda(Convert a list telescope to a telescope.Agda%Convert a telescope to its list form.AgdaRemoving a topmost  constructor.AgdaDoesn't do any reduction.Agda!Make a name that is not in scope.AgdaRemove the dot from a notInScopeName. This is used when printing function types that have abstracted over not-in-scope names.Agda>Convert top-level postfix projections into prefix projections. AgdaConvert / projection eliminations according to their  into  projection applications.!Agda#A view distinguishing the neutrals Var, Def, and MetaV which can be projected."AgdaDrop  constructor. (Unsafe!)#AgdaDrop  constructor. (Safe)%AgdaDrop  constructors. (Safe)&AgdaSplit at first non-'AgdaDiscard Proj f entries.(Agda Discards Proj f entries.)AgdaDrop  constructors. (Safe)2AgdaThis instance cheats on , use with care. s are always assumed to be +, since they have no .8Agda2The size of a telescope is its length (as a list).AAgda is the unit.  is dominant. {}1 should be propagated, if tied, we take the left.GAgdaBlocking by a meta is dominant.PAgdaA L clause is one with no patterns and no rhs. Should not exist in practice.AgdaThe  PatVarName is a name suggestion.Agda#eliminations ordered left-to-right. 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j\]^_`abcdefghijklmnopqrstzuvwxy{|}~      !"#$%&'()\]^_`abcdefghijklmnopqrstzuvwxy{|}~      !"#$%&'()w4xNone"#$+-03457;<=>?ACNQV]^ AgdayThings we can substitute for a variable. Needs to be able to represent variables, e.g. for substituting under binders.Agda+Produce a variable without name suggestion.Agda(Produce a variable with name suggestion.Agda=Are we dealing with a variable? If yes, what is its index?AgdaWe can substitute Terms for variables.yNone"#$+-03457;<=>?ACFNQTV]^ 1zNone"#$+-03457;<=>?ACKNQV]^ 2Agda&Gather free variables in a collection.AgdaThe current context.AgdaIgnore free variables in sorts.AgdaAre we flexible or rigid?AgdaWhat is the current relevance?Agda#Method to return a single variable.Agda5Where should we skip sorts in free variable analysis?Agda Do not skip.AgdaSkip when annotation to a type.AgdaSkip unconditionally.AgdaAny 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`.Agda#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 ```AgdaXOccurrence of free variables is classified by several dimensions. Currently, we have  and 3.AgdaDepending 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).Agda7In arguments of metas. The set of metas is used by 'L/ to generate the right blocking information.Agda*In arguments to variables and definitions.Agda=In top position, or only under inductive record constructors.Agda3Under at least one and only inductive constructors.Agda: 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.AgdaJWhen we extract information about occurrence, we care most about about  4 occurrences.Agda?First argument is the outer occurrence and second is the inner.AgdaThe initial context.AgdaRun function for FreeM.AgdaBase case: a variable.Agda3Subtract, but return Nothing if result is negative.AgdaGoing under a binder.Agda Changing the  context.Agda Changing the 3.Agda<What happens to the variables occurring under a constructor?AgdaProper monoid instance for VarMapf rather than inheriting the broken one from IntMap. We combine two occurrences of a variable using ...{None"#$+-03457;<=>?ACKNQV]^ (Agda3Under at least one and only inductive constructors.)Agda=In top position, or only under inductive record constructors.*Agda*In arguments to variables and definitions.+AgdaIn arguments of metas.,AgdaFree variables of a term, (disjointly) partitioned into strongly and and weakly rigid variables, flexible variables and irrelevant variables..Agda?Variables under only and at least one inductive constructor(s)./AgdaVariables 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.0AgdaGOrdinary rigid variables, e.g., in arguments of variables or functions.1AgdaVariables 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.2Agda.Variables in irrelevant arguments and under a DontCare#, i.e., in irrelevant positions.3AgdaCRigid variables: either strongly rigid, unguarded, or weakly rigid.4Agda!All but the irrelevant variables.5Agda allVars fv includes irrelevant variables.6AgdaICompute an occurrence of a single variable in a piece of internal syntax.0AgdaEExtract occurrence of a single variable from computed free variables.0AgdaGMark variables as flexible. Useful when traversing arguments of metas.0AgdaUMark rigid variables as non-strongly. Useful when traversing arguments of variables.0AgdahMark unguarded variables as strongly rigid. Useful when traversing arguments of inductive constructors.0Agda<What happens to the variables occurring under a constructor?0Agda&Mark all free variables as irrelevant.0AgdaPointwise union.0Agda delete x fv deletes variable x from variable set fv.7Agda\Doesn't go inside solved metas, but collects the variables from a metavariable application X ts as  flexibleVars.8AgdaCompute free variables.0Agda5Check if a variable is free, possibly ignoring sorts.=Agda7Is the variable bound by the abstraction actually used?>Agda0Is the term entirely closed (no free variables)??AgdaCollect all free variables.@AgdaLCollect all free variables together with information about their occurrence.AAgda=Collect all relevant free variables, possibly ignoring sorts.BAgdaACollect all relevant free variables, excluding the "unused" ones.JAgda'Free variable sets form a monoid under 0.-"#$%+*)(&',-./0123456789:;<=>?@AB-,-./012"#$8345?@BA9:=<;%+*)(&'6>7|None"#$+-03457;<=>?ACNQV]^ WAgdaApply a substitution.YAgda(abstract args v) \ args --> v[args].[AgdamApply something to a bunch of arguments. Preserves blocking tags (application can never resolve blocking).^Agda Apply to some default arguments._Agda#Apply to a single default argument.bAgdaReplace de Bruijn index i by a  in something.dAgdaBReplace what is now de Bruijn index 0, but go under n binders. %substUnder n u == subst n (raise n u).iAgdaTo replace index n by term u, do applySubst (singletonS n u). l ,  " u : A --------------------------------- ,  " singletonS || u : , A,  jAgda@Single substitution without disturbing any deBruijn indices. m , A,  " u : A --------------------------------- , A,  " inplace || u : , A,  kAgda$Lift a substitution under k binders.lAgda I  "  : ,  -------------------  " dropS ||  :  mAgda applySubst ( m& ) v == applySubst  (applySubst  v)pAgda   "  :   " reverse vs :  ----------------------------- (treating Nothing as having any type)  " prependS vs  : ,  sAgda " (strengthenS " ||) : ,uAgda/Instantiate an abstraction. Strict in the term.vAgdaFInstantiate 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 w. Used in Apply.wAgda9Instantiate an abstraction that doesn't use its argument.{AgdaunderAbs 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.|AgdaunderLambdas 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.&WXYZ[]\^_`abcdefghijklmnopqrstuvwxyz{|&[]\^_YZWX`abcdefghijklmnopqrstuvwxyz{|o4}None"#$+-03457;<=>?ACFNQTV]^ !|~AgdaGeneric term traversal.ONote: ignores sorts in terms! (Does not traverse into or collect from them.)Agda?Generic traversal with post-traversal action. Ignores sorts.AgdaGeneric fold, ignoring sorts.Agda5Put it in a monad to make it possible to do strictly.~~~None"#$+-013457;<=>?ACNQV]^ 6AgdaCase tree with bodies.Agda 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.Agda 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.Agda Absurd case.AgdaBranches in a case tree.Agda3We are constructing a record here (copatterns).  lists projections.AgdaoMap from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)Agda~Eta-expand with the given (eta record) constructor. If this is present, there should not be any conBranches or litBranches.Agda!Map from literal to case subtree.Agda'(Possibly additional) catch-all clause.AgdadLazy pattern match. Requires single (non-copattern) branch with no lit branches and no catch-all.AgdaqCheck that the requirements on lazy matching (single inductive case) are met, and set lazy to False otherwise.Agda1Check whether a case tree has a catch-all clause.Agda5Check whether a case tree has any projection patternsNone"#$+-03457;<=>?ACFNQTV]^ AAgdaGetting the used definitions.Note: in contrast to }M getDefsF also collects from sorts in terms. Thus, this is not an instance of foldTerm.Agda*What it takes to get the used definitions.AgdaInputs to and outputs of getDefs' are organized as a monad.AgdagetDefs' 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.  None"#$+-013457;<=>?ACKNQV]^ oAgda,Parameterised over the type of dot patterns.AgdaDestructor pattern d.Agda%Defined pattern: function definition f psw. It is also abused to convert destructor patterns into concrete syntax thus, we put AmbiguousQName here as well.Agda\Underscore pattern entered by user. Or generated at type checking for implicit arguments.Agda Dot pattern .eAgda| p, for with-patterns.AgdaXThe lhs in projection-application and with-pattern view. Parameterised over the type e of dot patterns.Agda&The head applied to ordinary patterns.Agda Projection.AgdaWith patterns.AgdaHead f.AgdaApplied to patterns ps.AgdaRecord projection identifier.AgdaMain argument of projection.Agda E.g. the .AgdaApplied to with patterns | p1 | ... | pn*. These patterns are not prefixed with WithP!AgdatThe lhs of a clause in focused (projection-application) view (outside-in). Projection patters are represented as s. AgdaRange. Agda Copatterns. AgdaXThe lhs of a clause in spine view (inside-out). Projection patterns are contained in  spLhsPats, represented as ProjP d. AgdaRange.Agda!Name of function we are defining.Agda3Elimination by pattern, projections, with-patterns.AgdaThe  G" is the name of the with function.AgdasWe store the original concrete expression in case we have to reproduce it during interactive case splitting. / for internally generated rhss.AgdaThe  GAs are the names of the generated with functions, one for each x.AgdacThe patterns stripped by with-desugaring. These are only present if this rewrite follows a with.AgdaThe RHS should not be another  RewriteRHS.Agda&The where clauses are attached to the  RewriteRHS by!AgdaWe 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.$AgdaOnly in with-clauses where we inherit some already checked patterns from the parent. These live in the context of the parent clause left-hand side.(AgdaA user pattern together with an internal term that it should be equal to after splitting is complete. Special cases: * User pattern is a variable but internal term isn't: this will be turned into an as pattern. * User pattern is a dot pattern: this pattern won't trigger any splitting but will be checked for equality after all splitting is complete and as patterns have been bound. * User pattern is an absurd pattern: emptiness of the type will be checked after splitting is complete..AgdaA 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./AgdaAs in telescope  (x y z : A) or type (x y z : A) -> B.0AgdaE.g.  (let x = e) or  (let open M).1Agda'Typed bindings with hiding information.2Agda. (xs : e) or {xs : e}3Agda0A lambda binding is either domain free or typed.4Agda. x or {x} or .x or .{x}5Agda. (xs:e) or {xs:e} or (let Ds)8AgdaOnly qs.9AgdaBindings that are valid in a let.:Agda LetBind info rel name type defn;AgdaIrrefutable pattern binding.<Agda*LetApply mi newM (oldM args) renamings dir. The ImportDirective is for highlighting purposes.=Agda,only for highlighting and abstractToConcrete>Agda?Only used for highlighting. Refers to the first occurrence of x in let x : A; x = e.AAgda( is not .:. Name can be ambiguous e.g. for built-in constructors.BAgdaWBuiltins that do not come with a definition, but declare a name for an Agda concept.MAgda:For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop).RAgda tel. M args : applies M to args and abstracts tel.SAgda  M {{...}}ZAgda3Type signature (can be irrelevant, but not hidden).PThe fourth argument contains an optional assignment of polarities to arguments.[Agda record field\Agdaprimitive function]Agda)a bunch of mutually recursive definitions_AgdaThe ImportDirective is for highlighting purposes.`AgdaThe ImportDirective is for highlighting purposes.bAgda'only retained for highlighting purposescAgdasequence of function clausesdAgdalone data signatureeAgdathe 3s are 4) and bind the parameters of the datatype.fAgdalone record signaturegAgdaThe 3s are 41 and bind the parameters of the datatype. The x' gives the constructor type telescope, (x1 : A1)..(xn : An) -> Prop5, and the optional name is the constructor's name.hAgdaOnly for highlighting purposeskAgdascope annotationpAgdaRenaming (generic).qAgdaIs a type signature a  postulate or a function signature?rAgdaA function signature.sAgdayNot a function signature, i.e., a postulate (in user input) or another (e.g. data/record) type signature (internally).wAgdaRecord field assignment f = e.xAgdaDExpressions after scope checking (operators parsed, names resolved).yAgdaBound variable.zAgda/Constant: axiom, function, data or record type.{AgdaProjection (overloaded).|AgdaConstructor (overloaded).}AgdaPattern synonym.~AgdaMacro.AgdaLiteral.Agda&Meta variable for interaction. The " is usually identical with the ! of B. However, if you want to print an interaction meta as just ? instead of ?n, you should set the ! to / while keeping the .Agda=Meta variable for hidden argument (must be inferred locally).Agda.e, for postfix projection.AgdaOrdinary (binary) application.AgdaWith application.Agda bs ! e.Agda() or {}.AgdaDependent function space  ! A.AgdaNon-dependent function space.AgdaSet, Set1, Set2, ...AgdaProp+ (no longer supported, used as dummy type).Agda let bs in e.Agda#Only used when printing telescopes.AgdaRecord construction.AgdaRecord update.AgdaScope annotation.AgdaBinds Name to current type in Expr.AgdaReturns the current context.AgdaQuote an identifier  G.Agda Quote a term.Agda#The splicing construct: unquote ...Agda  tactic e x1 .. xn | y1 | .. | ynAgda For printing DontCare from Syntax.Internal.AgdaDoes not compare ] fields.AgdaDoes not compare ]H fields. Does not distinguish between prefix and postfix projections.AgdaIgnore  when comparing s.AgdaIgnore  when comparing s.AgdaAre we in an abstract block?)In that case some definition is abstract. Agda/Extracts all the names which are declared in a Y. This does not include open public or let expressions, but it does include local modules, where clauses and the names of extended lambdas."Agda$The name defined by the given axiom.3Precondition: The declaration has to be a (scoped) q.;AgdaAssumes name is not ..<AgdaTurn an 5 to an expression. 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j      !"'#$%&()*+,-.0/123456789:;<=>?@ACHGEFIJKDLNOMPBQRSTUVWXYa_\b][ceZd`ij^fghklmnopqrstuvwx|zy}~{ !"#$%&'      !"'#$%&()*+,-.0/123456789:;<=>?@ACHGEFIJKDLNOMPBQRSTUVWXYa_\b][ceZd`ij^fghklmnopqrstuvwx|zy}~{ !"#$%&' 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i jNone"#$+-03457;<=>?ACFNQTV]^ JAgda<Get the list of pattern variables annotated with modalities.MAgdaGeneric pattern traversal.KPre-applies a pattern modification, recurses, and post-applies another one.NAgda Fold pattern.OAgdaTraverse pattern.RAgdayLabel the pattern variables from left to right using one label for each variable pattern and one for each dot pattern.TAgdaJIntended, but unpractical due to the absence of type-level lambda, is: @labelPatVars :: f (Pattern' x) -> State [i] (f (Pattern' (i,x)))UAgda+Arity of a function, computed from clauses.WAgda\Translate the clause patterns to terms with free variables bound by the clause telescope.%Precondition: no projection patterns.XAgdakTranslate the clause patterns to an elimination spine with free variables bound by the clause telescope.YAgda5Augment pattern variables with their de Bruijn index.\AgdaOComputes 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.]AgdaOComputes 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.^AgdaTurn a pattern into a term. Projection patterns are turned into projection eliminations, other patterns into apply elimination.aAgdaFCompute from each subpattern a value and collect them all in a monoid.bAgdaETraverse pattern(s) with a modification before the recursive descent.cAgdaDTraverse pattern(s) with a modification after the recursive descent.dAgda!Get the number of common initial  patterns in a list of clauses.eAgdaGet the number of initial  patterns in a clause.fAgdaGet the number of initial  patterns.lAgdaModify 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.NAgda>Combine a pattern and the value computed from its subpatterns.OAgdapre : Modification before recursion.Agdapost: Modification after recursion.bAgdapre : Modification before recursion.cAgdapost: Modification after recursion.IJKLMONPQRTSUVWXYZ[\]^_`abcWXUVRTSYZ[\]^_`PQMONabcKLIJNone"#$&'+-03457;<=>?ACNQV]^ lzAgdaIApply an expression rewriting to every subexpression, inside-out. See Agda.Syntax.Internal.Generic.{AgdaEThe first expression is pre-traversal, the second one post-traversal.AgdaCollects plain lambdas.Agda-Gather applications to expose head and spine.ENote: everything is an application, possibly of itself to 0 argumentsAgdaGather top-level %atterns to expose underlying pattern.Agda-Check whether we are dealing with a universe.Agda Remove top  wrappers.AgdaRemove  wrappers everywhere.!NB: Unless the implementation of zF for clauses has been finished, this does not work for clauses yet.z{|}~z{|}~None"#$+-03457;<=>?ACNQV]^ DAgdaMerge a list of pattern synonym definitions. Fails unless all definitions have the same shape (i.e. equal up to renaming of variables and constructor names).Agda.Match an expression against a pattern synonym.Agda*Match a pattern against a pattern synonym.None"#$+-03457;<=>?ACFNQTV]^.Agda-Convert a focused lhs to spine view and back.AgdaThe next patterns are ...(This view discards .)Agda&Application patterns (non-empty list).Agda6A projection pattern. Is also stored unmodified here.AgdaHWith patterns (non-empty list). These patterns are not prefixed with .AgdaGeneric pattern traversal.Agda Fold pattern.AgdaTraverse pattern.AgdaFCompute from each subpattern a value and collect them all in a monoid.AgdaETraverse pattern(s) with a modification before the recursive descent.AgdaDTraverse pattern(s) with a modification after the recursive descent.Agda?Map pattern(s) with a modification after the recursive descent.Agda9Collect pattern variables in left-to-right textual order.Agda4Check if a pattern contains a specific (sub)pattern.Agda@Check if a pattern contains an absurd pattern. For instance, suc () , does so.+Precondition: contains no pattern synonyms.Agda)Check if a pattern contains an @-pattern.+Precondition: contains no pattern synonyms.AgdajCheck if any user-written pattern variables occur more than once, and throw the given error if they do.AgdaPattern substitution.gFor the embedded expression, the given pattern substitution is turned into an expression substitution.AgdaUPattern substitution, parametrized by substitution function for embedded expressions.Agda7Split patterns into (patterns, trailing with-patterns).Agda1Get the tail of with-patterns of a pattern spine.AgdaConstruct the " of the given list (if not empty).+Return the view and the remaining patterns.AgdaKAdd applicative patterns (non-projection / non-with patterns) to the right.AgdaAdd with-patterns to the right.Agda<Add projection, with, and applicative patterns to the right.Agda$Used for checking pattern linearity.Agda Used in 'NO. Returns a .AgdaCheck for with-pattern.Agda LHS instance.AgdaList instance (for clauses).AgdaClause instance.Agda>Combine a pattern and the value computed from its subpatterns.Agdapre : Modification before recursion.Agdapost: Modification after recursion.Agdapre : Modification before recursion.Agdapost: Modification after recursion.Agda&Substitution function for expressions.Agda(Parallel) substitution.AgdaInput pattern.$$None "#$&'+,-03457;<=>?ACFNQSTV]^+Agda 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.AgdaUsing 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 exposedAgdaIsBase t is 'True whenever t is *not* a function space.AgdaArrows [a1,..,an] r corresponds to a1 -> .. -> an -> r | Products [a1,..,an] corresponds to (a1, (..,( an, ())..))Agda Version of FoldrV taking a defunctionalised argument so that we can use partially applied functions.AgdaOn ListsAgda On BooleansAgdaAll 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]^5 AgdaLike  Bifunctor, but preserving sharing.AgdaLike /, but preserving sharing.AgdaThe Change monad.0AgdaThe ChangeT monad transformer.AgdaThe class of change monads.AgdaRun a 0 computation, returning result plus change flag.AgdaBlindly run an updater.AgdaMark a computation as dirty. AgdaFReplace result of updating with original input if nothing has changed.0AgdaEval an updater (using  ). AgdaA mock change monad.Agda = sharing . updater1Agda-Mark computation as having changed something.  None"#$&'+-013457;<=>?ACNQV]^|E0AgdaMake 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.0AgdaMake 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.0AgdaNicifier state.0Agda4Lone type signatures that wait for their definition.0Agda5Termination checking pragma waiting for a definition.0Agda4Positivity checking pragma waiting for a definition.0Agda.Catchall pragma waiting for a function clause.0Agda(Stack of warnings. Head is last warning.AgdaANicifier monad. Preserve the state when throwing an exception.0Agda@The kind of the forward declaration, remembering the parameters.0Agda$Name of a data type with parameters.0Agda&Name of a record type with parameters.0AgdaName of a function.0Agdawe are nicifying a mutual block0Agda,we are nicifying decls not in a mutual block0AgdaQSeveral declarations expect only type signatures as sub-declarations. These are:0Agda  postulate0Agda primitive. Ensured by parser.0AgdainstanceE. Actually, here all kinds of sub-declarations are allowed a priori.0Agdafield. Ensured by parser.0Agdadata ... where=. Here we got a bad error message for Agda-2.5 (Issue 1698).Agda,Non-fatal errors encountered in the Nicifier!AgdaEmpty mutual block."AgdaEmpty abstract block.#AgdaEmpty private block.$AgdaEmpty instance block%AgdaEmpty macro block.&AgdaEmpty  postulate block.'AgdaA {- TERMINATING  -} and {- NON_TERMINATING 1-} pragma that does not apply to any function.(AgdaA {- NO_POSITIVITY_CHECK <-} pragma that does not apply to any data or record type.)AgdaA {- CATCHALL 5-} pragma that does not precede a function clause.*AgdaThe exception type.3Agda  of symbol, 0 of signature, 0 of definition.8Agda7in a mutual block, a clause could belong to any of the [Name] type signatures9AgdaRIn a mutual block, all or none need a MEASURE pragma. Range is of mutual block.:AgdaPragma {- NO_TERMINATION_CHECK -} has been replaced by {- TERMINATING  -} and {- NON_TERMINATING -}.=AgdaDOne clause in a function definition. There is no guarantee that the  actually declares the  #. We will have to check that later.?AgdaOnly Cs.@AgdaOnly Cs.AAgda1Termination measure is, for now, a variable name.BAgdaThe 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 ...)CAgda: argument: We record whether a declaration was made in an abstract block.@ argument: Axioms and functions can be declared irrelevant. (N should be Q.)Maybe [Occurrence]5 argument: Polarities can be assigned to identifiers.NAgdaAn uncategorized function clause, could be a function clause without type signature or a pattern lhs (e.g. for irrefutable let). The t is the actual w.PAgdaKBlock of function clauses (we have seen the type signature before). The tAs are the original declarations that were processed into this P 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.0AgdaCheck that declarations in a mutual block are consistently equipped with MEASURE pragmas, or whether there is a NO_TERMINATION_CHECK pragma.0AgdaoCheck 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).WAgdaSRun a Nicifier computation, return result and warnings (in chronological order).0AgdaInitial nicifier state.0AgdaLens for field 0.0Agda%Adding a lone signature to the state.0Agda'Remove a lone signature from the state.0Agda"Search for forward type signature.0Agda4Check that no lone signatures are left in the state.0AgdaBEnsure that all forward declarations have been given a definition.0AgdaLens for field 0.0AgdaLens for field 0.0AgdaLens for field 0.0Agda>Get current catchall pragma, and reset it for the next clause.0AgdaAdd a new warning.0Agda4Check whether name is not "_" and return its fixity.0AgdaFail if the name is _Q. Otherwise the name's polarity, if any, is removed from the state and returned.0Agda?Compute parameters of a data or record signature or definition.XAgdaMain.0AgdaAdd more fixities. Throw an exception for multiple fixity declarations. OR: Disjoint union of fixity maps. Throws exception if not disjoint.0AgdaGet 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.YAgda(Approximately) convert a B back to a list of ts.ZAgdaHas the B a field of type ?cAgdaWhile 0~ 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.iAgdaContents of a where& clause are abstract if the parent is.0Agda(Stack of warnings. Head is last warning.0AgdaThe data/record name.AgdaThe data/record signature.Agda6The parameters as given in the data/record definition.C !"#$%&'()*+,-./0123456789:;<=>?@ABPQCORDEFGHIJKLMNSTUVWXYZCBPQCORDEFGHIJKLMNSTU@?=>*+,-./0123456789:;< !"#$%&'()WXYZAVNone"#$+-013457;<=>?ACKNQV]^V AgdaWrapped Parser type.Agda"A monad for handling parse results0AgdaExtensions supported by AgdaParses a module.AgdaParses a module name.AgdaParses an expression.Agda0Parses an expression followed by a where clause.AgdaBParses an expression or some other content of an interaction hole.Agda3Gives the parsed token stream (including comments).0Agda9Keep comments in the token stream generated by the lexer.0Agda@Do not keep comments in the token stream generated by the lexer.KLMNOPQRSTUVWXYZ[NOPQRSTUVWXYZ[KLMSafe"#$+-03457;<=>?ACNQV]^<None"#$+-03457;<=>?ACNQV]^c#0Agda Return type of fold over syntax.0AgdaIgnore free variables in sorts.0Agda'Under how many binders have we stepped?Agda5Where should we skip sorts in free variable analysis?Agda Do not skip.AgdaSkip when annotation to a type.AgdaSkip unconditionally.Agda3Under at least one and only inductive constructors.Agda=In top position, or only under inductive record constructors.Agda*In arguments to variables and definitions.AgdaIn arguments of metas.AgdaFree variables of a term, (disjointly) partitioned into strongly and and weakly rigid variables, flexible variables and irrelevant variables.Agda?Variables under only and at least one inductive constructor(s).AgdaVariables 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.Agda:Ordinary rigid variables, e.g., in arguments of variables.Agda~Variables occuring in arguments of metas. These are only potentially free, depending how the meta variable is instantiated.Agda.Variables in irrelevant arguments and under a DontCare#, i.e., in irrelevant positions.AgdaCRigid variables: either strongly rigid, unguarded, or weakly rigid.Agda!All but the irrelevant variables.Agda allVars fv includes irrelevant variables.0AgdaGMark variables as flexible. Useful when traversing arguments of metas.0AgdaUMark rigid variables as non-strongly. Useful when traversion arguments of variables.0AgdahMark unguarded variables as strongly rigid. Useful when traversion arguments of inductive constructors.0Agda<What happens to the variables occurring under a constructor?0Agda&Mark all free variables as irrelevant.0AgdaPointwise union.0Agda delete x fv deletes variable x from variable set fv.0AgdasubtractFV n fv* subtracts $n$ from each free variable in fv.0AgdaA single unguarded variable.Agda\Doesn't go inside solved metas, but collects the variables from a metavariable application X ts as  flexibleVars.0AgdaBase case: a variable.0AgdaGoing under a binder.0AgdaGoing under n binders.Agda7Is the variable bound by the abstraction actually used?Agda'Free variable sets form a monoid under 0.None"#$+-03457;<=>?ACKNQV]^mAgda e.g. x + 5Agdaa number or infinityAgdabA solution assigns to each flexible variable a size expression which is either a constant or a v + n for a rigid variable v.Agda"A matrix with row descriptions in b and column descriptions in c.Agda6The Graph Monad, for constructing a graph iteratively.AgdaScope for each flexible var.AgdaNode labels to node numbers.AgdaNode numbers to node labels.AgdaNumber of nodes n.AgdaThe edges (restrict to [0..n[).Agda%A constraint is an edge in the graph.AgdaFor  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.Agda3Which rigid variables a flex may be instatiated to.AgdaQNodes 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).Agda.Edge weight in the graph, forming a semi ring.AgdaAWarshall's algorithm on a graph represented as an adjacency list.AgdaisBelow 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.AgdaEThe empty graph: no nodes, edges are all undefined (infinity weight).AgdaAdd a size meta node.AgdaBLookup identifier of a node. If not present, it is added first.AgdaaddEdge n1 k n2 improves the weight of egde n1->n2 to be at most k(. Also adds nodes if not yet present.Agda sizeRigid r n. returns the size expression corresponding to r + n55Safe"#$+-03457;<=>?ACFNQTV]^#  PSafe"#$+-03457;<=>?ACNQV]^i00000000Safe"#$+-03457;<=>?ACNQV]^%AgdaThe version of Agda.%%None"#$+-03457;<=>?ACNQV]^'Agda?Information about current git commit, generated at compile time&'&'None"#$+-03457;<=>?ACNQV]^2f(AgdaThrows P exceptions.0Agda Collects 0s.0Agda0Collected errors while processing library files.0AgdaFRaised when a library name could no successfully be resolved to an  .agda-lib file.0Agda1Raised when a library name is defined in several .agda-lib files.0AgdaGeneric error.)AgdaYLibrary names are structured into the base name and a suffix of version numbers, e.g.  mylib-1.2.3". The version suffix is optional.+AgdaActual library name.,AgdaMajor version, minor version, subminor version, etc., all non-negative. Note: a priori, there is no reason why the version numbers should be Ints.0AgdaE.g. ~.agda libraries.0Agda_The libraries file might not exist, but we may print its assumed location in error messages.0AgdaRaise collected  LibErrors as exception.0AgdaGet 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).)0AgdaThe ~.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.0AgdaThe  defaultsFileA contains a list of library names relevant for each Agda project.0AgdaGet pathes of  .agda-lib files in given project root.EIf there are none, look in the parent directories until one is found.-Agda:Get dependencies and include paths for given project root: Look for  .agda-lib files according to 0?. If none are found, use default dependencies (according to defaults/ file) and current directory (project root).0Agda/Return list of libraries to be used by default. None if the defaults file does not exist.0AgdaReturns the path of the  libraries1 file which lists the libraries Agda knows about.Note: file may not exist..Agda9Parse the descriptions of the libraries Agda knows about.Returns none if there is no  libraries file.0AgdaParse the given library files.0Agda.Remove trailing white space and line comments.0Agda Pretty-print 0./Agda6Get all include pathes for a list of libraries to use.0AgdafindLib 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 0.0AgdaGeneralized version of 0 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" ] == []0Agdax 0 y if x and y have the same vvBase and either x5 has no version qualifier or the versions also match.1AgdaASplit 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.)2AgdaPrint a  VersionView , inverse of  versionView (modulo leading zeros).0Agda Project root.Agda Pathes of  .agda-lib! files for this project (if any).-Agda Project root.AgdaUse defaults if no  .agda-lib file exists for this project?Agda The returned LibNames are all non-empty strings.0AgdaOverride the default  libraries file?.AgdaOverride the default  libraries file?Agda-Content of library files. (Might have empty LibNames.)0AgdaName of  libraries file for error reporting.Agda/Library files paired with their line number in  libraries.Agda-Content of library files. (Might have empty LibNames.)/Agda libraries file (error reporting only).AgdaLibraries Agda knows about.Agda>(Non-empty) library names to be resolved to (lists of) pathes.Agda2Resolved pathes (no duplicates). Contains "." if  [LibName] does. e()*+,-./012 -./e()*+,120Safe"#$+-03457;<=>?ACNQV]^>0Agda=Action to be carried out for copying a directory recursively.0AgdaCreate directory if missing.0AgdaCopy file if changed.7AgdacopyDirContent 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.)0AgdaPerform scheduled 0.0AgdacopyDirContentDryRun src dest; creates a to-do list for recursively copying directory src onto dest.0AgdacopyIfChanged src dst makes sure that dst' exists and has the same content as dst.77None"#$+-03457;<=>?ACNQV]^c8Agdaf :: 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 record:AgdaThe 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.;Agda%Options which can be set in a pragma.EAgdaICut off structural order comparison at some depth in termination checker?MAgda+irrelevant levels, irrelevant data matchingOAgda(Allow definitions by copattern matching?PAgda0Is pattern matching allowed in the current file?SAgda$Can rewrite rules be added and used?TAgda$Should system generated projections  ProjSystem0 be printed postfix (True) or prefix (False).[AgdaPCount extended grapheme clusters rather than code points when generating LaTeX.\AgdaSAutomatic compile-time inlining for simple definitions (unless marked NOINLINE).eAgda-Use this (if Just) instead of .agda/librariesfAgdaUse ~.agdadefaultsgAgdalook for .agda-lib filesmAgda2In the absence of a path the project root is used.xAgdaKShould the top-level module only be scope-checked, and not type-checked?}Agda'This should probably go somewhere else.~AgdaMap a function over the long options. Also removes the short options. Will be used to add the plugin name to the plugin options.AgdaThe default termination depth.0Agda'The default output directory for LaTeX.0Agda&The default output directory for HTML.Agda-Checks that the given options are consistent.Agda;Check for unsafe pramas. Gives a list of used unsafe flags.AgdaUsed for printing usage info.AgdagSimple interface for System.Console.GetOpt Could be moved to Agda.Utils.Options (does not exist yet)AgdaParse the standard options.Agda%Parse options from an options pragma.AgdaParse options for a plugin.AgdaLThe usage info message. The argument is the program name (probably agda).Agda_Returns the absolute default lib dir. This directory is used to store the Primitive.agda file.Agdacommand line argument wordsAgdaoptions handlersAgda,handler of non-options (only one is allowed)Agda(combined opts data structure transformerAgdaPragma options.Agda-Command-line options which should be updated.copqr89:;<TIN=>?@ABCDEFGHJKLMOPQRSUVWXYZ[\]^_mf`abcdeghijklnopqrstuvwxyz{|}~c^_mf`abcdeghijklnopqrstuvwxyz{;<TIN=>?@ABCDEFGHJKLMOPQRSUVWXYZ[\]:89|opqr}~KNone"#$+-013457;<=>?ACKNQV]^V DAgdaDMaps top-level module names to the corresponding source file names. KAgda6How should highlighting be sent to the user interface?AgdaInteraction monad.Agda Environment of the reduce monad.Agda Read only access to environment.Agda0Read only access to state (signature, metas...).Agda9Returns the pragma options which are currently in effect.Agda?Returns the command line options which are currently in effect.AgdaType-checking errors.Agda?The first argument is the state in which the error was raised.Agda\The exception which is usually caught. Raised for pattern violations during unification (assignV=) but also in other situations where we want to backtrack.Agda(The state in which the error was raised.Agda<The environment in which the error as raised plus the error.AgdaDDistinguish error message when parsing lhs or pattern synonym, resp.AgdaGThe target of a constructor isn't an application of its datatype. The  records what it does target.AgdaThe 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.Agda>Expected a type to be an application of a particular datatype.Agdaconstructor, datatypeAgdaDatatype, constructors.Agdaconstructor, typeAgda+Varying number of arguments for a function.AgdaeThe left hand side of a function definition has a hidden argument where a non-hidden was expected.Agda9Expected a non-hidden function and found a hidden lambda.AgdaKA function is applied to a hidden argument where a non-hidden was expected.AgdaBA function is applied to a hidden named argument it does not have.Agda0Wrong user-given relevance annotation in lambda.Agda6A term is declared as an instance but it s not allowedAgda<The given hiding does not correspond to the expected hiding.AgdaAThe given relevance does not correspond to the expected relevane.Agda'The given type should have been a sort.Agda%The given type should have been a pi.Agda#This sort is not a type expression.Agda#This term is not a type expression.Agda4This term, a function type constructor, lives in SizeUniv, which is not allowed.Agda0The two function types have different relevance.Agda-The two function types have different hiding.AgdawThe arguments are the meta variable, the parameters it can depend on and the paratemeter that it wants to depend on.AgdaOSome 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.Agda(Found module name, expected module name.AgdapModule name, file from which it was loaded, file which the include path says contains the module. Scope errorsAgdahThe expr was used in the right hand side of an implicit module definition, but it wasn't of the form m Delta.2Agda>Failed to apply injectivity to constructor of indexed datatype3Agda=Can't solve equation because variable occurs in (type of) lhs4Agda=Can't solve reflexive equation because --without-K is enabled8AgdaKError when splitting a pattern variable into possible constructor patterns.9AgdaNeither data type nor record.:Agda&Data type, but in irrelevant position.;AgdatSplit on codata not allowed. UNUSED, but keep! -- | NoRecordConstructor Type -- ^ record type, but no constructor>Agda Constructor.?AgdaContext for indices.@Agda,Inferred indices (from type of constructor).AAgda)Expected indices (from checking pattern).BAgda$Reason(s) why unification got stuck.CAgdaMInformation about a mutual block which did not pass the termination checker.EAgdaZThe functions which failed to check. (May not include automatically generated functions.)FAgdaThe problematic call sites.GAgdaInformation about a call.IAgdaTarget function name.JAgdaRange of the target function.KAgda+To be formatted representation of the call.NAgda"Range where the warning was raisedOAgdaThe warning itselfPAgdaDThe warning printed in the state and environment where it was raisedQAgda*Should the warning be affected by caching.RAgdazA non-fatal error is an error which does not prevent us from checking the document further and interacting with the user.VAgda!`CoverageIssue f pss` means that pss are not covered in fYAgdaDo not use directly with warningZAgdaDo not use directly with warning[AgdaDo not use directly with warning\AgdaAIn `OldBuiltin old new`, the BUILTIN old has been replaced by new]AgdaIf the user wrote just {- REWRITE -}.^AgdaQIf the user opens a module public before the module header. (See issue #2377.)`Agda&The --inversion-max-depth was reached.aAgda'Harmless generic warning (not an error)bAgdaOGeneric error which doesn't abort proceedings (not a warning) Safe flag errorskAgda)`DeprecationWarning old new version`: old is deprecated, use new( instead. This will be an error in Agda version.lAgda@User-defined warning (e.g. to mention that a name is deprecated)mAgdaA 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.tAgda7Explicit arguments are considered as instance argumentswAgdaAAdd implicit arguments in the end until type is no longer hidden .xAgda!Do not append implicit arguments.zAgda6Abstract things in the current module can be accessed.{Agda#No abstract things can be accessed.|Agda$All abstract things can be accessed.AgdaThe Context is a stack of ~s.Agda=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).Agda4anonymous modules and their number of free variablesAgdato detect import cyclesAgda!the current (if any) mutual blockAgda/are we inside the scope of a termination pragmaAgda>Are we currently in the process of solving active constraints?AgdaOHave we stepped into the where-declarations of a clause? Everything under a where# will be checked with this flag on.Agda&Are we working on types? Turned on by  workOnTypes.AgdaAre we allowed to assign metas?AgdaWhen 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.Agda*Are we checking an irrelevant argument? (= IrrelevantE) Then top-level irrelevant declarations are enabled. Other value: Relevant&, then only relevant decls. are avail.Agda+Sometimes we want to disable display forms.Agda8Interactive highlighting uses this range rather than .AgdajWhat is the current clause we are type-checking? Will be recorded in interaction points in this clause.Agdawhat we're doing at the momentAgdaSet to + when imported modules are type-checked.AgdaJThis 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.Agda 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.AgdaWhen type-checking an alias f=e, we do not want to insert hidden arguments in the end, because these will become unsolved metas.Agda]We are reducing an application of this function. (For debugging of incomplete matches only.)AgdaYDid we encounter a simplification (proper match) during the current reduction process?AgdaDInjectivity can cause non-termination for unsolvable contraints (431, @3067). Keep a limit on the nesting depth of injectivity uses.Agda`Can we compare blocked things during conversion? No by default. Yes for rewriting feature.AgdaWhen TrueI, types will be omitted from printed pi types if they can be inferred.AgdaWhen 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.AgdaUsed by the scope checker to make sure that certain forms of expressions are not used inside dot patterns: extended lambdas and let-expressions.AgdarUntil we get a termination checker for instance search (#1743) we limit the search depth to ensure termination.Agda#3004: pattern lambdas with copatterns may refer to themselves. We don't have a good story for what to do in this case, but at least printing shouldn't loop. Here we keep track of which pattern lambdas we are currently in the process of printing.Agda+Use call-by-need evaluation for reductions.AgdahCheckpoints track the evolution of the context as we go under binders or refine it by pattern matching.AgdaOKeeps the substitution from each previous checkpoint to the current context.Agda Via stdout.AgdaBoth via files and via stdout.Agda;How much highlighting should be sent to the user interface?AgdaThis includes both non-interactive highlighting and interactive highlighting of the expression that is currently being type-checked.Agda-Builtin of any kind. Type can be checked (Just t) or inferred (NothingD). The second argument is the hook for the verification function.Agda2When 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.AgdaThe instance table is a Map' associating to every name of record data typepostulate its list of instancesAgda*Interaction command: show module contents.Agdaused by setCurrentRangeAgda Controlling reduce.Agda:(Projection and) projection-like functions may be reduced.Agda'Functions marked INLINE may be reduced.Agda%Copattern definitions may be reduced.Agda6Non-recursive functions and primitives may be reduced.Agda(Even recursive functions may be reduced.AgdaReduce  terms.Agda9Functions whose termination has not (yet) been confirmed.Agda0Functions that have failed termination checking.AgdaNThree cases: 1. not reduced, 2. reduced, but blocked, 3. reduced, not blocked. Agda"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?Agda Postulate.Agda Returned by  getConstInfo if definition is abstract.AgdaPrimitive or builtin functions.Agda/* while function is still type-checked. Just ccC after type and coverage checking and translation to case trees.Agda2Intermediate representation for compiler backends.AgdaMutually recursive functions, datas and recordEs. Does include this function. Empty list if not recursive. Nothing- if not yet computed (by positivity checker).Agda+Are the clauses of this definition delayed?Agda(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. Agda9Has this function been termination checked? Did it pass?!AgdaIs this function generated from an extended lambda? If yes, then return the number of hidden and non-hidden lambda-lifted arguments"AgdaZIs this a generated with-function? If yes, then what's the name of the parent function.#Agda)Is this a function defined by copatterns?$AgdaNumber of parameters.%AgdaNumber of indices.&Agdadata or codata (legacy).'Agda(This might be in an instantiated module.(AgdaConstructor names.*AgdaMutually recursive functions, datas and recordAs. Does include this data type. Empty if not recursive. Nothing- if not yet computed (by positivity checker).,AgdaNumber of parameters.-AgdaWas this record type created by a module application? If yes, the clause is its definition (linking back to the original record type)..AgdaConstructor name and fields./AgdaDoes this record have a  constructor?0AgdaThe record field names.1AgdaCThe record field telescope. (Includes record parameters.) Note: $TelV recTel _ == telView' recConType . Thus, recTel is redundant.2AgdaMutually recursive functions, datas and record>s. Does include this record. Empty if not recursive. Nothing- if not yet computed (by positivity checker).3Agda#Eta-expand at this record type? False` for unguarded recursive records and coinductive records unless the user specifies otherwise.4AgdaV or W*? Matters only for recursive records. /T means that the user did not specify it, which is an error for recursive records.6AgdaNumber of parameters.7Agda+Number of arguments (excluding parameters).8AgdaPName of (original) constructor and fields. (This might be in a module instance.)9Agda Name of datatype or record type.;AgdaInductive or coinductive?<AgdaLWhich arguments are forced (i.e. determined by the type of the constructor)?=AgdaOWhich arguments are erased at runtime (computed during compilation to treeless)@Agda for primitive functions, not null for builtin functions.AAgdaKBuiltin functions can have inverses. For instance, natural number addition.BAgda/ for primitive functions, / something for builtin functions.DAgda<Should calls to this function be normalised at compile-time?EAgda9Should calls to this function be inlined by the compiler?FAgdaIs this function a macro?GAgda(Should a record type admit eta-equality?HAgdaUser specifed 'eta-equality' or 'no-eta-equality'.IAgda0Positivity checker inferred whether eta is safe.KAgda@Abstractions to build projection function (dropping parameters).NAgda&Additional information for projection s.PAgdaNothing 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.QAgdaPThe original projection name (current name could be from module application).RAgda-Type projected from. Original record type if projProper = Just{}. Also stores ArgInfoM of the principal argument. This field is unchanged by module application.SAgdaIndex 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.TAgdaTerm 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 SX.) In case of a projection-like function, just the function symbol is returned as : t = pars -> f.UAgda,Additional information for extended lambdas.WAgda.For complicated reasons the scope checker decides the QName of a pattern lambda, and thus its module. We really need to decide the module during type checking though, since if the lambda appears in a refined context the module picked by the scope checker has very much the wrong parameters.ZAgda;The backends are responsible for parsing their own pragmas.\AgdaJInformation about whether an argument is forced by the type of a function._Agda+Polarity for equality and subtype checking.`AgdamonotoneaAgdaantitonebAgdano information (mixed variance)cAgdaconstantfAgdaHiding should not be used.hAgdaType of the lifted definition.iAgdaVariance information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.jAgdaPositivity information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.nAgdaJust q/ when this definition is an instance of class qoAgda:Has this function been created by a module instantiation?pAgda-Is the def matched against in a rewrite rule?qAgdaGShould the def be treated as injective by the pattern matching unifier?sAgda?Rewrite rules can be added independently from function clauses.uAgdaName of rewrite rule q :  ! f ps "a rhs where "a is the rewrite relation.vAgda.wAgdaf.xAgda  " f ps : t.yAgda  " rhs : t.zAgda " t.Agda1Non-linear (non-constructor) first-order pattern.AgdapMatches anything (modulo non-linearity) that only contains bound variables that occur in the given arguments.Agda)Matches anything (e.g. irrelevant terms).AgdaMatches f esAgdaMatches  x ! tAgdaMatches  (x : A) ! BAgdaMatches x es# where x is a lambda-bound variableAgda'Matches the term modulo  (ideally ).AgdaA structured presentation of a  for reification into QR.Agda(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).Agdac vs.Agdad vs.Agda.v.Agdav.AgdaA  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 QR. 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.AgdaNumber n of free variables in .AgdaLeft hand side patterns, where var 04 stands for a pattern variable. There should be n occurrences of var0 in  . The  is ignored in these patterns.AgdaRight hand side, with n free variables.Agda'The rewrite rules defined in this file.Agda0Which clause is an interaction point located in?Agda4The interaction point is not in the rhs of a clause.AgdaThe name of the function.Agda*The number of the clause of this function.AgdaThe original AST clause rhs.Agda/Data structure managing the interaction points.DWe never remove interaction points from this map, only set their  to True. (Issue #2368)AgdaInteraction 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.Agda&The position of the interaction point.Agda0The meta variable, if any, holding the type etc.Agda/Has this interaction point already been solved?AgdaIThe clause of the interaction point (if any). Used for case splitting.Agda8For printing, we couple a meta with its name suggestion.AgdaEName suggestion for meta variable. Empty string means no suggestion.AgdaMetaInfo4 is cloned from one meta to the next during pruning.Agda7Run the extended occurs check that goes in definitions?AgdaUsed for printing. Just x8 if meta-variable comes from omitted argument with name x.AgdapMeta variable priority: When we have an equation between meta-variables, which one should be instantiated?6Higher value means higher priority to be instantiated.Agda( (xs : t ) ! e) : t This is not an instance of T 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 x.AgdaCFirst argument is computation and the others are hole and goal typeAgda Solving a p constraint may or may not check the target type. If it did, it returns a handle to any unsolved constraints.Agda4solved by term (abstracted over some free variables)AgdaunsolvedAgda1open, to be instantiated as "implicit from scope"Agda(solution blocked by unsolved constraintsAgdaFrozen 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).AgdaDo not instantiate.Agda4some metavariables are more eager to be instantiatedAgdaa metavariable doesn't have to depend on all variables in the context, this "permutation" will throw away the ones it does not depend onAgdaBmeta variables scheduled for eta-expansion but blocked by this oneAgdaBare we past the point where we can instantiate this meta variable?AgdaFParametrized since it is used without MetaId when creating a new meta.Agda-A thing tagged with the context it came from.AgdaAn extension of  to >=.Agda,the two types are for the error message onlyAgda+The range is the one of the absurd pattern.AgdaCheck that the . is either not a SIZELT or a non-empty SIZELT.Agdathe 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)AgdaHash of the source code. Agda"Imported modules and their hashes. AgdaModule name of this interface. AgdaScope 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  . Agda1Scope after we loaded this interface. Used in S and T.Agda-Display forms added for imported identifiers.Agda&User warnings for imported identifiersAgdaPragma options set in the file.Agda/@ if warnings were encountered when the module was type checked.AgdaDMaps source file names to the corresponding top-level module names.AgdaCreate a fresh name from a.(Agda0A 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.+AgdaNever a Section or ScopeDecl-AgdaLike .y, but storing the log for an ongoing type checking of a module. Stored in reverse order (last performed action first)..AgdaA log of what the type checker does and states after the action is completed. The cached version is stored first executed action first.3AgdaYA part of the state which is not reverted when an error is thrown or the state is reset.7AgdawCallback function to call when there is a response to give to the interactive frontend. See the documentation of .8AgdawStructure to track how much CPU time was spent on which Agda phase. Needs to be a strict field to avoid space leaks!9AgdaShould be strict field.:Agda`Cached typechecking state from the last loaded file. Should be Nothing when checking imports.;Agda#Current backends with their options<Agda)A mutual block of names in the signature.>Agda&The original info of the mutual block.BAgdaHighlighting info.CAgdajDisambiguation carried out by the type checker. Maps position of first name character to disambiguated  G for each  =$ already passed by the type checker.HAgdaTDirty when a constraint is added, used to prevent pointer update. Currently unused.IAgdaDefinitions 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.JAgdaeDeclared identifiers of the current file. These will be serialized after successful type checking.KAgdaiFor each module remember the checkpoint corresponding to the orignal context of the module parameters.LAgda-Display forms we add for imported identifiersMAgda@The current module is available after it has been type checked.OAgdaZCounters to collect various statistics about meta variables etc. Only for current file.]AgdaUHighlighting info for tokens (but not those tokens for which highlighting exists in ).^Agda?Imported declared identifiers. Those most not be serialized!cAgda2Pattern synonyms of the current file. Serialized.dAgda3Imported pattern synonyms. Must not be serialized!eAgda&Options applying to the current file. OPTIONS! pragmas only affect this field.gAgda;Display forms added by someone else to imported identifiersiAgda{- FOREIGN -}b code that should be included in the compiled output. Does not include code for imported modules.oAgda/The state which is frozen after scope checking.pAgda1The state which is modified after scope checking.qAgda'State which is forever, like a diamond.rAgdaEmpty persistent state.sAgdaEmpty state of type checker.Agda Creates a  map based on y. O(n log n).For a single reverse lookup in y, rather use lookupModuleFromSourse.Agda Lookup an I in .O(n).AgdaGCombines the source hash and the (full) hashes of the imported modules.AgdaEmbed  into .Agda!Flip the direction of comparison.AgdaTurn a  function into a  function. Property:  dirToCmp f (fromCmp cmp) = f cmpAgda$By default, we have no display form.Agda+Create a definition with sensible defaults.Agda>Building the projection function (which drops the parameters).Agda,The info of the principal (record) argument.Agda3Make sure we do not overwrite a user specification.AgdaIs the record type recursive?AgdaA template for creating % definitions, with sensible defaults.AgdaBChecking whether we are dealing with a function yet to be defined.Agda:Not quite all reductions (skip non-terminating reductions)Agda+Are the clauses of this definition delayed?Agda2Has the definition failed the termination checker?AgdaAHas the definition not termination checked or did the check fail?Agda&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 /.Agda$ifTopLevelAndHighlightingLevelIs l m runs mO when we're type-checking the top-level module and the highlighting level is at least l.Agda.Preserve the state of the failing computation.AgdaExecute 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.,Agda4Running the type checking monad (most general form).-AgdaARunning the type checking monad on toplevel (with initial state)./Agda/ runs a safe  E action (a  E9 action which cannot fail) in the initial environment.0Agda6Runs 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.1Agda&Base name for extended lambda patterns2Agda!Name of absurdLambda definitions.3Agda:Check whether we have an definition from an absurd lambda.sAgdaWe only / the name of the callee.~Agda)Short-cutting disjunction forms a monoid.AgdaaWe store benchmark statistics in an IORef. This enables benchmarking pure computation, see Agda.Benchmarking. D E F G H Inqpo J K)('&%$#"!      *0/.-,+14325768=<;:9BA@?>CDFEGHKJILMQPONRlkihgfedcba`_^]\[ZYXWVUTSjmnrqposutvxwy|{z}~     BA@?>=<;:9876543210/.-,+*)('&%$#"! CFEDGIHJKLMNOTSRQPUVWXYZ[\^]_cb`aderqpomlkjihgfnstzyxwvu{|}~      !"#$%'&(*)+,-./02134;:98765<=?>@AYXWVUTSRQPONMLKJIHGFEDCBZ[\kjihgfedcba`_^]lmrstuvwxyz{|}~      !"#$%&'()*+,-./0123 Inqpolm[\kjihgfedcba`_^]Z@AYXWVUTSRQPONMLKJIHGFEDCB<=?>34;:98765/021.-(*)+,rstuvwxyz{|}~%'&#$!" D     |}~{stzyxwvuderqpomlkjihgfn_cb`a\^]Z[YXUVWNOTSRQPKLMGIHJCFEDBA@?>=<;:9876543210/.-,+*)('&%$#"!       K J  ~}y|{z  vxwsutmnrqpoRlkihgfedcba`_^]\[ZYXWVUTSj LMQPONGHKJICDFE8=<;:9BA@?>5761432*0/.-,+)('&%$#"!       F G H E !"#$%&'()*+,-./0123None"#$+-013457;<=>?ACNQV]^cBAgdaPerforms void (noAbs) abstraction over telescope.IAgdaIf $v$ is a record value, canProject f v returns its field f.JAgdaEliminate a constructed term.KAgdadefApp 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.MAgda  (x:A)->B(x) M [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.QAgdaIf permute  : [a] -> [a], then ,applySubst (renaming _ ) : Term  -> Term RAgdaIf permute  : [a] -> [a], then +applySubst (renamingR ) : Term  -> Term SAgdaNThe permutation should permute the corresponding context. (right-to-left list)XAgda  projDropParsApply proj o args =  proj o `apply' argssThis function is an optimization, saving us from construction lambdas we immediately remove through application.YAgdalTakes off all exposed function domains from the given type. This means that it does not reduce to expose Pi-types.ZAgdatelView'UpTo n t takes off the first n exposed function types of t#. Takes off all (exposed ones) if n < 0.[AgdaTurn a typed binding (x1 .. xn : A) into a telescope.]AgdaTurn a typed binding (x1 .. xn : A) into a telescope._Agda )mkPi dom t = telePi (telFromList [dom]) tbAgda)Uses free variable analysis to introduce  bindings.cAgdaEverything will be an .dAgda]Abstract over a telescope in a term, producing lambdas. Dumb abstraction: Always produces , never .$The implementation is sound because  does not use .eAgdaGiven arguments vs : tel= (vector typing), extract their individual types. Returns Nothing is tel is not long enough.fAgdaIn compiled clauses, the variables in the clause body are relative to the pattern variables (including dot patterns) instead of the clause telescope.gAgdaGet the next higher sort.iAgdaQCompute the sort of a function type from the sorts of its domain and codomain.kAgdaKCompute the sort of a pi type from the sorts of its domain and codomain.tAgdazEquality of binders relies on weakening which is a special case of renaming which is a special case of substitution.vAgda Syntactic  equality, ignores stuff below DontCare and sharing.xAgda Syntactic $ equality, ignores sort annotations.Agdatel " ( " 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'.Agda)Make sure we only drop variable patterns.astzuvwxyWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop7BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnoptzuvwxysNone"#$+-03457;<=>?ACKNQV]^g7AgdaStrenghtening.None"#$+-03457;<=>?ACNQV]^i0Agda0Don't generate fresh names for unused variables.None"#$+-03457;<=>?ACNQV]^kO0Agda,Split alts into TAGuard alts and other alts.None"#$+-03457;<=>?ACNQV]^lENone"#$+-03457;<=>?ACNQV]^mCNone"#$+-03457;<=>?ACNQV]^oAgdaPWe lose track of @-patterns in the internal syntax. This pass puts them back.None"#$+-03457;<=>?ACFNQSTV]^(AgdaicodeArgs proxy (a1, ..., an) maps icode over a1, ..., an* and returns the corresponding list of Int32.$AgdaMonad used by the decoder.TCMJ is not used because the associated overheads would make decoding slower.%AgdaMonad used by the encoder.&AgdaState of the decoder.(AgdaObtained from interface file.)AgdaObtained from interface file.*AgdaObtained from interface file.+AgdaObtained from interface file.,AgdaObtained from interface file.-AgdaZCreated and modified by decoder. Used to introduce sharing while deserializing objects..Agda<Maps module names to file names. Constructed by the decoder./AgdaThe include directories.0Agda=Univeral memo structure, to introduce sharing during decoding1Agda!Universal type, wraps everything.3AgdaState of the the encoder.5AgdaWritten to interface file.6AgdaWritten to interface file.7AgdaWritten to interface file.8AgdaWritten to interface file.9AgdavWritten to interface file. Dicitionaries which are not serialized, but provide short cuts to speed up serialization::Agda~Not written to interface file. Andreas, Makoto, AIM XXI Memoizing A.Name does not buy us much if we already memoize A.QName.;AgdaNot written to interface file.<Agda@Not written to interface file. Fresh UIDs and reuse statistics:FAgdaIf True collect in stats the quantities of calls to icode for each  Typeable a.GAgdaNot written to interface file.HAgdaTwo  Gs are equal if their QNameId is equal.IAgdazStructure providing fresh identifiers for hash map and counting hash map hits (i.e. when no fresh identifier required).KAgdaNumber of hash map misses.LAgdaNumber of hash map hits.MAgda+The type of hashtables used in this module.0A very limited amount of testing indicates that 0 is somewhat slower than 0 , and that 0 and the hashtables from Data.Hashtable are much slower.NAgda5Constructor tag (maybe omitted) and argument indices.RAgda(Computing a qualified names composed ID.SAgdaCreates an empty dictionary.TAgdaEThrows an error which is suitable when the data stream is malformed.UAgdaIncrease entry for a in E.VAgda 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.\Agdaicode# only if thing has not seen before.]Agdavcase 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.^AgdaicodeN 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]_AgdaicodeN' is the same as icodeN except that there is no tag!AgdaSerialization (wrapper)."AgdaSerialization (worker).#AgdaDeserialization.SAgdaCollect statistics for icode calls?\Agda Memo structure for thing of key a.Agda Statistics.AgdaKey to the thing.Agda)Fallback computation to encode the thing.AgdaEncoded thing.G !"#$%&'/.-,+*()01234GFEDCBA@?>=<;:98765HIJLKMNOPQRSTUVWXYZ[\]^_`aGNMIJLKOPQHR34GFEDCBA@?>=<;:98765S120&'/.-,+*()%$T !"#UVWXYZ[\]^_`aNone"#$+-03457;<=>?ACNQV]^AAgdaWAssumes that the first module in the import path is the module we are worried about.None"#$+-03457;<=>?ACNQV]^Agda+Get the name of the current module, if any.Agda#Set the name of the current module.Agda7Get the number of variables bound by anonymous modules.Agda+Add variables bound by an anonymous module.Agda(Set the current environment to the givenAgdaGet the current environmentAgdaDIncreases the module nesting level by one in the given computation.AgdaSet highlighting levelAgdaRestore setting for w to default.AgdaoIf the reduced did a proper match (constructor or literal pattern), then record this as simplification step.Agda Lens for .AgdaReduce Def f vs only if f is a projection.AgdaDAllow all reductions except for non-terminating functions (default).Agda9Allow all reductions including non-terminating functions.Agda<Don't use call-by-need evaluation for the given computation.None"#$+-03457;<=>?ACNQV]^Agda+Create an open term in the current context.Agda`Extract the value from an open term. The checkpoint at which it was created must be in scope.Agda-Extract the value from an open term. Returns /> if the checkpoint at which it was created is not in scope.AgdaAn " is closed if it has checkpoint 0.None"#$+-03457;<=>?ACNQV]^ZAgdaThe coinductive primitives.Agda2Rewrite a literal to constructor form if possible. AgdaBuiltins 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. AgdaTries to build a . Agda"Get the name of the equality type. AgdacCheck whether the type is actually an equality (lhs "a rhs) and extract lhs, rhs, and their type.Precondition: type is reduced. Agda Revert the i.Postcondition: type is reduced.-                           ! " # $ % & ' ( ) * + , - . / 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 { | } ~  -              ! " #           $ % & ' ) ( * +    < 6 7 8 : ; 9 3 4 5 , - . / 0 1 2 = > ? @ 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 c d e b f g h i j k l m n o p q r s t u v w x y z { | } ~   None"#$+-03457;<=>?ACNQV]^  AgdasimplifyLevelConstraint 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.0AgdaICheck if two inequality constraints are the same up to variable renaming.0AgdaGTurn a level constraint into a list of level inequalities, if possible.  None"#$+-03457;<=>?ACNQV]^>AgdaConditionally render debug P and print it.Agda#Conditionally println debug string.Agda!Conditionally print debug string.!AgdaConditionally render debug P, print it, and then continue.!Agda=Print brackets around debug messages issued by a computation.  !!  !!None"#$+-03457;<=>?ACNQV]^! Agda/To be called before any write or restore calls.! Agda Writes a (( to the current log, using the current @! AgdaThe 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.!Agda>Reads the next entry in the cached type check log, if present.!AgdaCEmpties the "to read" CachedState. To be used when it gets invalid.!AgdaMakes 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.!AgdacCaches the current type check log. Discardes the old cache. Does nothing if caching is inactive. ! ! ! ! ! !!!! ! !!!!! ! ! ! None"#$+-03457;<=>?ACNQV]^!AgdaDClassifying warnings: some are benign, others are (non-fatal) errors!Agda(warnings that will be turned into errors!Agdauall warnings, including errors and benign ones Note: order of constructors is important for the derived Ord instance!AgdaapplyWarningModeg filters out the warnings the user has not requested Users are not allowed to ignore non-fatal errors.!Agda;Should we only emit a single warning with this constructor.! Agdarunning the Parse monad!!!!!!!!!!!!!!! !!!!!!!!!!!!!!! None"#$+-03457;<=>?ACNQV]^ !#Agda:Resets the non-persistent part of the type checking state.!$Agda&Resets all of the type checking state. Keep only  and backend information.!%AgdaRestore  I! after performing subcomputation.In contrast to U, the * info from the subcomputation is saved.!&AgdaSame as !%I but also returns the state in which we were just before reverting it.!'AgdaA 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.)!+Agda Lens for 9.!-AgdaGet the current scope.!.AgdaSet the current scope.!/Agda;Modify the current scope without updating the inverse maps.!0AgdaModify the current scope.!1Agda#Run a computation in a local scope.!2AgdaSame as !1-, but discard the scope from the computation.!3Agda2Discard any changes to the scope by a computation.!4Agda Scope error.!5AgdaDebug print the scope.!9Agda 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.!;AgdaJRun some computation in a different signature, restore original signature.!IAgdaZSet the top-level module. This affects the global module id of freshly generated names.!JAgdagUse a different top-level module for a computation. Used when generating names for imported modules.!MAgda5Tell the compiler to import the given Haskell module.!NAgda5Tell the compiler to import the given Haskell module.!UAgda Lens for |.!WAgda,Get both local and imported pattern synonyms!ZAgdaLens getter for  from  I.![Agda Lens map for .!\AgdaLens getter for  from  E.!]AgdaLens modify for .!^Agda>Look through the signature and reconstruct the instance table.!_Agda Lens for .!cAgda4Remove all instances whose type is still unresolved.!dAgda/Add an instance whose type is still unresolved.!eAgdaAdd instance to some `class'.!eAgdaName of the instance.AgdaName of the class.C!#!$!%!&!'!(!)!*!+!,!-!.!/!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!eC!#!$!%!&!'!(!)!*!+!,!-!.!/!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!eNone"#$+-03457;<=>?ACNQV]^#!gAgdaaPass the current mutual block id or create a new mutual block if we are not already inside on.!hAgdaPSet the mutual block info for a block, possibly overwriting the existing one.!iAgda6Set the mutual block info for a block if non-existing.!jAgda&Set the mutual block for a definition.!kAgdaRGet the current mutual block, if any, otherwise a fresh mutual block is returned.!mAgda0Reverse lookup of a mutual block id for a names.!f!g!h!i!j!k!l!m!f!g!h!i!j!k!l!mNone"#$+-03457;<=>?ACNQV]^(f!nAgdaIWhen verbosity is set or changes, we need to turn benchmarking on or off.0Agda(Check whether benchmarking is activated.!oAgdaaPrints the accumulated benchmark results. Does nothing if profiling is not activated at level 7.4\]uvwx!n!o\]!nvxwu!oNone"#$+-03457;<=>?ACNQV]^3^!pAgda:When making a function projection-like, we drop the first n arguments.!rAgdaTo 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.!sAgdamUse for dropping initial lambdas in clause bodies. NOTE: does not reduce term, need lambdas to be present.!uAgda,NOTE: does not work for recursive functions.!wAgda=NOTE: This creates telescopes with unbound de Bruijn indices.!p!q!p!qNone"#$+-03457;<=>?ACFNQTV]^4!!!!!!!!None"#$+-03457;<=>?ACNQV]^6!AgdaGMark a definition to be inlined if it satisfies the inlining criterion.!!None"#$+-03457;<=>?ACNQV]^7)!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!)!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!None"#$+-03457;<=>?ACNQV]^YAgda<Run a computation if a certain verbosity level is activated.-Precondition: The level must be non-negative.Agda5Check whether a certain verbosity level is activated.-Precondition: The level must be non-negative.AgdaGets the include directories.Precondition: c must be nonempty (i.e. ! must have run).!Agda?Which directory should form the base of relative include paths?!AgdaThe root directory of the "project" containing the given file. The file needs to be syntactically correct, with a module name matching the file name.!AgdaThe current working directory.!AgdaSets the pragma options.!AgdaPSets 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 ["."].!AgdaDisable display forms.!AgdaDisable display forms.!Agda#Check if display forms are enabled."AgdaMMakes 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 7). An empty list is interpreted as ["."]."AgdaShould only be run if "."Agda Return the a as I , if any." AgdamSwitch 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." AgdaChange ;* for a computation and restore afterwards."Agda%Retrieve the current verbosity level."AgdaCCheck whether a certain verbosity level is activated (exact match)."AgdaJRun a computation if a certain verbosity level is activated (exact match)."AgdaVerbosity lens."AgdaNew include directories.Agda)How should relative paths be interpreted?+!!!!!!!!!!!!!!"""""""""" " " " " """"""""""+!!!!!!!!!!!!!!"""""""""" " " " " """"""""""None"#$+-03457;<=>?ACNQV]^^"Agda$Record a function call in the trace."AgdaSets 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]^|J !AgdaEnsures 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.!AgdaCComputes 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  E to raise errors.!Agda 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)."Agda9Errors which can arise when trying to find a source file."Invariant: All paths are absolute."AgdaHThe file was not found. It should have had one of the given file names."Agda"Several matching files were found.AInvariant: The list of matching files has at least two elements." AgdaEConverts an Agda file name to the corresponding interface file name.""AgdaKGiven the module name which the error applies to this function converts a " to a ."#AgdagFinds 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."$AgdaqTries to find the source file corresponding to a given top-level module name. The returned paths are absolute.SIDE EFFECT: Updates y."%Agda A variant of "$ which does not require  E."&AgdajFinds 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.!AgdaThe name of the module.Agda"The file from which it was loaded.Agda3The expected name, coming from an import statement."%AgdaInclude paths.AgdaCached invocations of "%. An updated copy is returned.!!!"""" "!"""#"$"%"&"'" """"""#"$"%"&!!!"'"!None"#$+-013457;<=>?ACNQV]^)"(Agda*Ranges that should be serialised properly."OAgda"Ranges are always deserialised as ."(")"*"(")"*None"#$+-03457;<=>?ACNQV]^/None"#$+-03457;<=>?ACNQV]^"wAgdaGet the statistics."xAgda)Modify the statistics via given function."yAgdaIncrease specified counter by 1."zAgdaIncrease specified counter by n."{AgdaBSet the specified counter to the maximum of its current value and n.0Agda'Modify specified counter by a function f."|AgdaAPrint the given statistics if verbosity "profile.ticks" is given."w"x"y"z"{"|"y"z"{"w"x"|None"#$+-03457;<=>?ACNQV]^"AgdaA deep view on sizes."AgdaA useful view on sizes."AgdaCheck if a type is the  type. The argument should be reduced."Agda)Result of querying whether size variable i is bounded by another size."Agdayes  i : Size< t"AgdaQTest whether OPTIONS --sized-types and whether the size built-ins are defined."Agda+Test whether the SIZELT builtin is defined."Agda$Add polarity info to a SIZE builtin."AgdaThe sort of built-in types SIZE and SIZELT."AgdaThe type of built-in types SIZE and SIZELT."AgdaThe built-in type SIZE with user-given name."AgdaThe built-in type SIZE."Agda The name of SIZESUC."Agda>Transform list of terms into a term build from binary maximum."AgdaExpects argument to be reduced."AgdasizeViewComparable v w checks whether v >= w (then Left) or v <= w (then Right ). If uncomparable, it returns  NotComparable."AgdasizeViewPred k v decrements v by k (must be possible!)."AgdasizeViewOffset v8 returns the number of successors or Nothing when infty."Agda'Remove successors common to both sides."AgdaTurn a size view into a term."AgdamaxViewCons v ws = max v ws. It only adds v to ws+ if it is not subsumed by an element of ws."AgdasizeViewComparableWithMax v ws tries to find w in ws that compares with v+ and singles this out. Precondition:  v /= DSizeInv.1"}"~"""""""""""""""""""""""""""""""""""""""""""""""1"""""""""""""""""""""""""""""""""~"""""""""""}"""""None"#$+-03457;<=>?ACNQV]^"AgdaAWe put the translation into TCM in order to print debug messages.0AgdaCertain builtins (like fromNat) have special printing0AgdaPreserve interaction point ids0AgdaCBind a concrete name to an abstract in the translation environment.0AgdaJGet a function to check if a name refers to a particular builtin function.0Agda|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...0AgdaQAdd a abstract name to the scope and produce an available concrete version of it.0AgdaLike 00, but do not care whether name is already taken.0AgdaGeneral bracketing function.0AgdaExpression bracketing0AgdaPattern bracketing0AgdarApplications where the argument is a lambda without parentheses need parens more often than other applications.0Agda|If a name is defined with a fixity that differs from the default, we have to generate a fixity declaration for that name.0AgdaAdd abstract, private, instance modifiers."Agda9Translate something in a context of the given precedence.1Agda9Translate something in a context of the given precedence.1Agda'Translate something in the top context.1Agda'Translate something in the top context.1Agda.Translate something in a context indicated by N info.1Agda.Translate something in a context indicated by N info.1Agda)Recover pattern synonyms for expressions.1Agda%Recover pattern synonyms in patterns.1AgdaCGeneral pattern synonym recovery parameterised over expression type"AgdaAssumes name is not ..0Agdathe bracketing functionAgda?Should we bracket things which have the given precedence?1AgdaCheck for lambdasAgda/ for sections""""""""""""""""""""""""""""""""""None"#$+-03457;<=>?ACNQVZ]^V"AgdaBool: 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."AgdaTo simplify interaction between scope checking and type checking (in particular when chasing imports), we use the same monad."Agda-Create a new module with an empty scope. (Just' if it is a datatype or record module.)"Agda"Apply a function to the scope map."Agda$Apply a function to the given scope.#Agda*Apply a monadic function to the top scope.#Agda&Apply a function to the current scope.#Agda5Apply a function to the public or private name space.# Agda7Run a computation without changing the local variables.#Agda]After collecting some variable names in the scopeVarsToBind, bind them all simultaneously.#Agda2Create 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  O of the abstract name.#Agda 0freshAbstractName_ = freshAbstractName noFixity'#Agda'Create a fresh abstract qualified name.#Agda?Look up the abstract name referred to by a given concrete name.#AgdaVLook 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.)#AgdaLook up a module in the scope.#Agda?Get the notation of a name. The name is assumed to be in scope.#AgdaBind a variable.#Agda;Temporarily unbind a variable. Used for non-recursive lets.#Agda.Bind a defined name. Must not shadow anything.#Agda}Rebind a name. Use with care! Ulf, 2014-06-29: Currently used to rebind the name defined by an unquoteDecl, which is a D in the body, but a * later on.#AgdaBind a module name.#AgdaHBind a qualified module name. Adds it to the imports field of the scope.#Agda Clear the scope of any no names.#AgdaCreate 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.#AgdaSApply an import directive and check that all the names mentioned actually exist.# AgdaA finite map for  ImportedNames.#!AgdaTranslation of ImportDirective.#"AgdaTranslation of Using or Hiding.##AgdaTranslation of Renaming.#$AgdaOpen a module.#Agda9The name must correspond to one of the names in this set.#Agda, , let, ...?AgdaConcrete name.AgdaAbstract name.#!AgdaTranslation of imported names.Agda,Translation of names defined by this import.#"AgdaTranslation of names in using or hiding list.##AgdaTranslation of  names.AgdaTranslation of rento names.6"""""""""""""""""########## # # # # ################### #!#"###$6""""""""""""########## # # # # ###############"""""#### #!#"###$None"#$+-03457;<=>?ACNQV]^&AgdaSGet the substitution from the context at a given checkpoint to the current context.#%Agda#Wrapper to tell 'addContext not to #3[s. Used when adding a user-provided, but already type checked, telescope to the context.#'AgdaVarious specializations of addCtx.#*Agda Modify a  in a computation.#+Agda7Change to top (=empty) context. Resets the checkpoints.#,AgdaVChange to top (=empty) context, but don't update the checkpoints. Totally not safe!#-AgdaDelete the last n bindings from the context.jDoesn't update checkpoints!! Use `updateContext rho (drop n)` instead, for an appropriate substitution rho.#.Agda*Add a new checkpoint. Do not use directly!#/AgdaOUpdate the context. Requires a substitution from the old context to the new.#0AgdaGet substitution   "  : m where  is the current context and m- is the module parameter telescope of module m.+In case the we don't have a checkpoint for m] we return the identity substitution. This is ok for instance if we are outside module mX (in which case we have to supply all module parameters to any symbol defined within m we want to refer).#1AgdaaddCtx x arg cont add a variable to the context.Chooses an unused  K.7Warning: Does not update module parameter substitution!#2AgdaDPick a concrete name that doesn't shadow anything in the given list.#3AgdaAPick a concrete name that doesn't shadow anything in the context.#4Agda4Context entries without a type have this dummy type.#5AgdaGo under an abstraction.#7AgdaKGo under an abstract without worrying about the type to add to the context.#8AgdaAdd a let bound variable.#9AgdaGet the current context.#:Agda$Get the size of the current context.#;Agda Generate [var (n - 1), ..., var 0]% for all declarations in the context.#<Agda Generate [var (n - 1), ..., var 0]% for all declarations in the context.#=AgdaGet the current context as a .#>Agda1Get the names of all declarations in the context.#?Agda0get type of bound variable (i.e. deBruijn index)#CAgdaGet 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. #%#&#'#)#(#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C #*#+#,#-#.#/#0#1#2#3#'#)#(#%#&#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#CNone"#$+-03457;<=>?ACNQVZ]^kR8#RAgdaoLookup the definition of a name. The result is a closed thing, all free variables have been abstracted over.#SAgda Version that reports exceptions:#TAgda4Lookup the rewrite rules with the given head symbol.#UAgdaSignature lookup errors.#VAgda8The name is not in the signature; default error message.#WAgda0The name is not available, since it is abstract.#\AgdaCAdd a constant to the signature. Lifts the definition to top level.#]Agda2Set termination info of a defined function symbol.#^Agda!Modify the clauses of a function.#_AgdaPLifts clauses to the top-level and adds them to definition. Also adjusts the # field if necessary.#aAgdaAdd a compiler pragma `{-! COMPILE <backend> <name> <text> -}`#qAgdaAdd a section to the signature.[The current context will be stored as the cumulative module parameters for this section.#rAgdaCSets the checkpoint for the given module to the current checkpoint.#sAgdaGet 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.#tAgdaLookup a section telescope._If it doesn't exist, like in hierarchical top-level modules, the section telescope is empty.#vAgda>Module application (followed by module parameter abstraction).#xAgdaLAdd a display form to a definition (could be in this or imported signature).#{AgdaCFind all names used (recursively) by display forms of a given name.#|Agda#Check if a display form is looping.#AgdaNCan be called on either a (co)datatype, a record type or a (co)constructor.#Agda?Does the given constructor come from a single-constructor type?5Precondition: The name has to refer to a constructor.#AgdaStandard eliminator for #U.#Agda`Get the original name of the projection (the current one could be from a module application).#Agda%Look up the polarity of a definition.#AgdaMLook up polarity of a definition and compose with polarity represented by .#Agda!Set the polarity of a definition.#Agda-Look up the forced arguments of a definition.#Agda*Get argument occurrence info for argument i of definition d (never fails).#Agda Sets the jI for the given identifier (which should already exist in the signature).#AgdaFGet the mutually recursive identifiers of a symbol from the signature.#Agda.Get the mutually recursive identifiers from a d.#Agda'Set the mutually recursive identifiers.#Agda5Check whether two definitions are mutually recursive.#Agda A functiondataVrecord definition is nonRecursive if it is not even mutually recursive with itself.#Agda3Get the number of parameters to the current module.#AgdaCompute 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).#Agda7Compute 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.) Example:  module M  where module M  where f = ... module M  where ... M .M .f [insert  raised by ] #AgdaUnless 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.#AgdaPInstantiate a closed definition with the correct part of the current context.#Agda'Give the abstract view of a definition.#AgdaOEnter abstract mode. Abstract definition in the current module are transparent.#Agda:Not in abstract mode. All abstract definitions are opaque.#Agda?Ignore abstract mode. All abstract definitions are transparent.#AgdaeEnter concrete or abstract mode depending on whether the given identifier is concrete or abstract.#AgdaMCheck 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.#AgdaAndreas, 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.#Agda<Get type of a constant, instantiated to the current context.#AgdaGet relevance of a constant.#AgdapThe number of dropped parameters for a definition. 0 except for projection(-like) functions and constructors.#Agda&Is it the name of a record projection?#AgdaIs it a function marked STATIC?#AgdaIs it a function marked INLINE?#AgdaReturns 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).#AgdaDNumber of dropped initial arguments of a projection(-like) function.#Agda+Check whether a definition uses copatterns.#AgdaApply a function fF to its first argument, producing the proper postfix projection if f is a projection.#vAgda/Name of new module defined by the module macro.AgdaParameters of new module.Agda(Name of old module applied to arguments.Agda Arguments of module application.AgdaImported names and modulesd#Q#T#S#R#U#W#V#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#{#|#}#~######################################################d#\#]#^#_#`#a#[#Z#Y#X#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#{#|#}#~###U#W#V##Q#T#S#R###################################################None"#$+-03457;<=>?ACNQV]^o`######None"#$+-03457;<=>?ACNQVZ]^!#AgdacUnfreeze meta and its type if this is a meta again. Does not unfreeze deep occurrences of metas.#AgdapCheck whether all metas are instantiated. Precondition: argument is a meta (in some form) or a list of metas.#AgdaSwitch off assignment of metas.#AgdaGet the meta store.#Agda8Run a computation and record which new metas it created.#AgdaLookup a meta variable#Agda=Given a meta, return the type applied to the current context.#AgdaOReturns every meta-variable occurrence in the given type, except for those in s.#AgdaCreate  in the current environment.#AgdafRegister an interaction point during scope checking. If there is no interaction id yet, create one.#AgdaFind an interaction point by  by searching the whole map.<O(n): linear in the number of registered interaction points.#Agda+Hook up meta variable to interaction point.#Agda$Mark an interaction point as solved.#AgdaGet a list of interaction ids.#Agda:Get all metas that correspond to unsolved interaction ids.#Agda:Get all metas that correspond to unsolved interaction ids.#Agda:Does the meta variable correspond to an interaction point?Time: O(n) where n$ is the number of interaction metas.#Agda7Get the information associated to an interaction point.#AgdaGet K for an interaction point. Precondition: interaction point is connected.#AgdaKCheck whether an interaction id is already associated with a meta variable.#AgdaGenerate new meta variable.#AgdajGenerate a new meta variable with some instantiation given. For instance, the instantiation could be a .#AgdaGet the  for an interaction point.#AgdaGet the  for a meta variable.#AgdalistenToMeta l m : register l as a listener to m3. This is done when the type of l is blocked by m.#AgdaUnregister a listener.#AgdaGet the listeners to a meta.#AgdaKFreeze all so far unfrozen metas for the duration of the given computation.#AgdaGFreeze all meta variables and return the list of metas that got frozen.#AgdaHFreeze some meta variables and return the list of metas that got frozen.#AgdaThaw all meta variables.#Agda6Thaw some metas, as indicated by the passed condition.#AgdaDoes not worry about raising.9#########################################################9#########################################################None"#$+-03457;<=>?ACNQV]^$ AgdaMAdd all constraints belonging to the given problem to the current problem(s).$AgdaGet the awake constraints$AgdaSuspend 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.$AgdaAdd new a constraint$ AgdaAdd already awake constraints$!AgdaStart solving constraints$ $ $ $ $ $$$$$$$$$$$$$$$$$$$ $!$"$#$$$%$&$ $ $$$$$$$$$ $ $ $$$$$$$$$$$ $!$"$#$$$%$&VNone"#$+-03457;<=>?ACNQV]^v D E F G H Inopq J K      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRjSTUVWXYZ[\]^_`abcdefghiklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_a`bcdenfghijklmopqrstuvwxyz{|}~      !"#$%&'(,+)*-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmrstuvwxyz{|}~      !"#$%&'()*+,-./0123 !!! ! ! ! ! !!!!!#!$!%!&!'!(!)!*!+!,!-!.!/!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!!!!!!!!!!!!!!"""""""""" " " " " """"""""""""""""w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""""""""""""""""""""#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#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]^None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^None"#$+-03457;<=>?ACNQV]^|None"#$+-03457;<=>?ACNQV]^$lAgdadEncodes something. To ensure relocatability file paths in positions are replaced with module names.$mAgda: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.$oAgdadEncodes something. To ensure relocatability file paths in positions are replaced with module names.$pAgda: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.1 AgdaStore 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.1 Agda{Maps file names to the corresponding module names. Must contain a mapping for every file name that is later encountered. $l$m$n$o$p$q$r$l$o$n$m$r$p$q None"#$+-03457;<=>?ACNQV]^$Agda;Apply a function if a certain verbosity level is activated.-Precondition: The level must be non-negative.#R$z${$|$}$~$$${$|$}#R$$~$z$None"#$+-03457;<=>?ACFNQTV]^4$AgdaBExpand literal integer pattern into suc/zero constructor patterns.$Agda7Expand away (deeply) all pattern synonyms in a pattern.$$$$$$$$None"#$+-03457;<=>?ACNQV]^B$$$$None"#$+-03457;<=>?ACNQV]^ص$Agda3Contracts all eta-redexes it sees without reducing.$Agda5If record constructor, call eta-contraction function.$Agda%Try to contract a lambda-abstraction Lam i (Abs x b).$AgdaConstructor name c.AgdaConstructor info ci.AgdaConstructor arguments args.Agda9Eta-contraction workhorse, gets also name of record type.AgdaReturns  Con c ci args or its eta-contraction.$AgdaInfo i of the .AgdaName x of the abstraction.AgdaBody () b of the .AgdaLam i (Abs x b), eta-contracted if possible.$$$$$$$$$$$$$$$$None"#$+-03457;<=>?ACNQVZ]^ $AgdainstantiateFull' $5s metas everywhere (and recursively) but does not $.$AgdauOnly unfold definitions if this leads to simplification which means that a constructor/literal pattern is matched.$AgdaInstantiate 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).$Agda+Meaning no metas left in the instantiation.$AgdaCase 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.$Agda;Case on whether a type is blocked on a meta (or is a meta).$AgdaIf the first argument is /0, then a single delayed clause may be unfolded.$AgdaIReduce a non-primitive definition if it is a copy linking to another def.$Agda*Reduce simple (single clause) definitions.$Agda!Unfold a single inlined function.$AgdapApply a definition using the compiled clauses, or fall back to ordinary clauses if no compiled clauses exist.$AgdaApply a defined function to it's arguments, using the compiled clauses. The original term is the first argument applied to the third.$AgdaGApply a defined function to it's arguments, using the original clauses.,$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$,$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$None"#$+-03457;<=>?ACNQV]^-Agda+Gather leading s of a type in a telescope.AgdaA safe variant of piApply.%yAgdaA telescope split in two.%}Agda;The permutation takes us from the original telescope to firstPart ++ secondPart.%~Agda(Flatten telescope: ( : Tel) -> [Type ]%AgdaYOrder a flattened telescope in the correct dependeny order:  -> Permutation ( -> ~)Since reorderTel tel( uses free variable analysis of type in tel, the telescope should be $d.%Agda\Unflatten: turns a flattened telescope into a proper telescope. Must be properly ordered.%Agda(Get the suggested names from a telescope%Agda 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.%Agda.Split the telescope at the specified position.%AgdaPermute 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) %AgdaRecursively computes dependencies of a set of variables in a given telescope. Any dependencies outside of the telescope are ignored.%Agda^Split a telescope into the part that defines the given variables and the part that doesn't.See WX.%Agda|As splitTelescope, but fails if any additional variables or reordering would be needed to make the first part well-typed.%AgdaTry 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.%AgdaQTry to eta-expand one variable in the telescope (given by its de Bruijn level)%AgdatelViewUpTo n t takes off the first n function types of t. Takes off all if n < 0.%AgdatelViewUpTo' n p t takes off $t$ the first n (or arbitrary many if n < 0-) function domains as long as they satify p.%AgdaDecomposing a function type.%AgdaIf 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.%AgdaIf 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.%Agda&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.%Agda&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.%AgdaCompute type arity%AgdaAStrips all Pi's and return the head definition name, if possible.%AgdaTry 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.%AgdaA set of de Bruijn indices.AgdaOriginal telescope.Agda firstPart mentions the given variables,  secondPart not.%AgdaA list of de Bruijn indicesAgdaThe telescope to splitAgda firstPart5 mentions the given variables in the given order,  secondPart contains all other variables%Agda" Agda  " var k : AAgda  " u : A*%t%x%w%v%u%y%z%}%|%{%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%*%~%%%%%%%%%%%%%y%z%}%|%{%%%%%%%%%%%%%%t%x%w%v%u%%%%None"#$+-03457;<=>?ACNQV]^8f%Agda,Instantiate full as long as things are equal1 Agda%Monad for checking syntactic equality%Agda'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.1 AgdaReturn, flagging inequalty.1 Agda0If inequality is flagged, return, else continue.%Agda!Syntactic equality ignores sorts.%Agda Syntactic term equality ignores  stuff.%%%%None"#$&'+-03457;<=>?ACNQV]^:%Agda:Convert a term (from a dot pattern) to a DeBruijn pattern.%%%%%%None"#$+-03457;<=>?ACNQV]^=%AgdaGet the  as a .%Agda-Raises an error if no level kit is available.%Agda,Checks whether level kit is fully available.%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%None"#$+-03457;<=>?ACNQV]^TE%AgdaaSubstitute 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.%AgdaClass 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).%Agda Convert a  into a .%Agda0Get the arities of all display forms for a name.%Agda!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.%AgdaMatch a  q ps = v against q es. Return the  v[us]' if the match was successful, i.e., es / ps = Just us.%%%%%%%%%%%%%%%%None"#$+-03457;<=>?ACNQV]^Ym1 Agda=A graph is cyclic if it has any strongly connected component.1AgdarecDef names name returns all definitions from names! that are used in the body of name.%AgdaanysDef names a returns all definitions from names that are used in a.%%%%None"#$+-03457;<=>?ACNQV]^Z%Agda Check that   "  : .%%%%None"#$+-03457;<=>?ACNQV]^]%Agda Variant of %- which does not insert outermost parentheses.%Agda Variant of %- which does not insert outermost parentheses.%%%%%%%%%%None"#$+-03457;<=>?ACFKNQTVZ]^1Agda0Collect the binders in some abstract syntax lhs.1Agda 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).%AgdaJAlso tracks whether module parameters should be dropped from the patterns.1Agda.Drops hidden arguments unless --show-implicit.1Agda.Drops hidden arguments unless --show-implicit.1Agda.Drops hidden arguments unless --show-implicit.1AgdaQIf we are inside a record definition, the record value (self) is a variable with name "". In this case, we need to use a prefix-projection. (Issue #2868.) Prefix projections magically print correctly since the thing we are projecting from has a null name, so vanishes in the visible world. We love hacks, don't we? Sigh.1Agda.Drops hidden arguments unless --show-implicit.1AgdareifyDisplayForm f vs fallback tries to rewrite f vs with a display form for fK. If successful, reifies the resulting display term, otherwise, does fallback.1AgdareifyDisplayFormP; tries to recursively rewrite a lhs with a display form.=Note: we are not necessarily in the empty context upon entry!1Agda -nameFirstIfHidden (x:a) ({e} es) = {x = e} es1AgdaRemoves 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.%AgdatAssumes that pattern variables have been added to the context already. Picks pattern variable names from context.1AgdaIf the record constructor is generated or the user wrote a record pattern, turn constructor pattern into record pattern. Otherwise, keep constructor pattern.&AgdaBSkip reification of implicit and irrelevant args if option is off.1AgdaLHS head symbolAgda7Patterns to be taken into account to find display form.Agda.Remaining trailing patterns ("with patterns").Agda!New head symbol and new patterns.%%%%%%%%%%%%None"#$+-03457;<=>?ACNQV]^&2AgdaELine reader. The line reader history is not stored between sessions.&2&2None"#$+-03457;<=>?ACNQV]^&3&4&5&6&7&8&9&:&3&4&5&6&7&8&9&:None"#$+-03457;<=>?ACNQV]^<1Agda Converts the  and 2 fields to atoms readable by the Emacs interface.1AgdaJShows meta information in such a way that it can easily be read by Emacs.&;Agda Formats the w1 tag for the Emacs backend. No quotes are added.&<AgdaDTurns syntax highlighting information into a list of S-expressions.1Agda@Must contain a mapping for the definition site's module, if any.&<Agda:Must contain a mapping for every definition site's module.&;&<&<&;None"#$+-03457;<=>?ACNQV]^:&=&>&=&>None"#$+-03457;<=>?ACNQV]^@&?&?None"#$+-03457;<=>?ACNQV]^6&@&@None"#$+-03457;<=>?ACNQV]^4&B&BNone"#$+-03457;<=>?ACNQV]^&DAgda$Insert unsafeCoerce (in the form of  C) everywhere it's needed in the right-hand side of a definition.&D&DNone"#$+-03457;<=>?ACNQV]^c&EAgdaCalls 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.&FAgdaGeneralisation of  callCompiler) where the raised exception is returned.&EAgda$Should we actually call the compilerAgdaThe path to the compilerAgdaCommand-line arguments.&FAgdaThe path to the compilerAgdaCommand-line arguments.&E&F&E&FNone"#$+-03457;<=>?ACNQV]^W&GAgdauRun before serialisation to remove any definitions that are not reachable from the public interface to the module.&G&GNone"#$+-03457;<=>?ACNQV]^&LAgda.Adds a new unique name to the current context.&MAgda@Returns the name of the variable with the given de Bruijn index.&NAgda^Translate reflected syntax to abstract, using the names from the current typechecking context.&OAgda5Drop implicit arguments unless --show-implicit is on. &H&I&J&K&L&M&N&O&P&Q&R &K&J&L&M&H&I&N&O&P&Q&RNone"#$+-03457;<=>?ACNQV]^&`Agda2Pairing something with a node (for printing only).&xAgda!Comma-separated list in brackets.&yAgda&x without the brackets.&{Agda,Pretty print with a given context precedence&|Agda#Proper pretty printing of patterns:(xyz{|}~&`&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&{&|&}(&d&e&f&g&h&i&j&k&l&m}~&n&oz&p{|&q&r&s&t&u&v&w&x&y&zxy&{&b&c&|&}&`&az5{6|6&p5&q6None"#$+-03457;<=>?ACNQVZ]^&AgdaSize constraints we can solve.&Agda Leq a +n b represents  a =< b + n.  Leq a -n b represents  a + n =< b.&AgdaAtomic size expressions.&Agda)A size meta applied to de Bruijn indices.&AgdaA de Bruijn index.&AgdaJCheck whether a type is either not a SIZELT or a SIZELT that is non-empty.&Agda;Precondition: Term is reduced and not blocked. Throws a & if undecided&Agda-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.&AgdaOCheck whether a variable in the context is bounded by a size expression. If  x : Size< a, then a is returned.&AgdaXWhenever we create a bounded size meta, add a constraint expressing the bound. In boundedSizeMetaHook v tel a, tel includes the current context.&Agda#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.&AgdaOCompute the deep size view of a term. Precondition: sized types are enabled.&AgdaCompare two sizes.&AgdaCompare two sizes in max view.&AgdacompareBelowMax u vs checks  u <= max vs. Precondition:  size vs >= 2&Agda3Checked whether a size constraint is trivial (like X <= X+1).&Agda9Test whether a problem consists only of size constraints.&Agda(Test is a constraint speaks about sizes.&Agda(Take out all size constraints (DANGER!).&AgdaFind the size constraints.&Agda.Return a list of size metas and their context.&AgdaCompute 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. Y&Agda@Turn a constraint over de Bruijn indices into a size constraint.&AgdaFTurn a term with de Bruijn indices into a size expression with offset. Throws a &, if the term isn't a proper size expression.&AgdaUCompute list of size metavariables with their arguments appearing in a constraint.&AgdaKConvert 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.&AgdaAMain 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&Agda&Old solver for size constraints using Agda.Utils.Warshall6. This solver does not smartly use size hypotheses  j : Size< i.&AgdaSize metas and their arity.Agda(Size constraints (in preprocessed form).AgdaReturns False if solver fails.&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&None"#$+-03457;<=>?ACNQV]^&AgdaWState worked on during the main loop of checking a lhs. [Ulf Norell's PhD, page. 35]&Agda#The types of the pattern variables.&AgdaPatterns after splitting. The de Bruijn indices refer to positions in the list of abstract syntax patterns in the problem, counted from the back (right-to-left).&AgdaUser patterns of supposed type delta.&AgdaType eliminated by ' in the problem. Can be 6x to indicate that we came by an irrelevant projection and, hence, the rhs must be type-checked in irrelevant mode.&Agda,The user patterns we still have to split on.&AgdaUser patterns.&AgdaCList of user patterns which could not yet be typed. 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 G problemEqs = [false = b] problemRestPats = [zero]  As we instantiate b to false, the  targetType reduces to  Nat -> Nat and we can move pattern zero over to  problemEqs.&AgdaFlexible variables are equipped with information where they come from, in order to make a choice which one to assign when two flexibles are unified.&AgdaWhen 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...&AgdaFrom a record pattern (). Saves the & of its subpatterns.&Agda-From a hidden formal argument or underscore (WildP).&AgdaFrom a dot pattern ().&Agda*From a non-record constructor or literal ( or ).3()*+,&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''' 3'&&&&&&&&&&&&'&&&&&&&()*+,&&&&&''''&&&&&&&&&&&&'''' None"#$+-03457;<=>?ACNQV]^')')None"#$+-03457;<=>?ACNQVZ]^S,$AgdaTCheck if a name refers to a record constructor. If yes, return record definition.$AgdaKCheck if a constructor name is the internally generated record constructor.%Works also for abstract constructors.$Agda,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.$Agda Get the field names of a record.$Agda3Check if a name refers to an eta expandable record.$AgdaHCheck if a name refers to a record. If yes, return record definition.'*Agda8Replace projection patterns by the original projections.',AgdaTyping of an elimination.'-AgdaType of the argument.'/Agda+The type of the record which is eliminated.'0AgdaThe type of the field.'2AgdaYOrder the fields of a record construction. Use the second argument for missing fields.'3AgdaA 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.'4Agda1The name of the module corresponding to a record.'5AgdayGet the definition for a record. Throws an exception if the name does not refer to a record or the record is abstract.'6Agda.Get the record name belonging to a field name.'8Agda0Find all records with at least the given fields.'9Agda Get the field types of a record.':Agda/Get the field names belonging to a record type.';AgdaHReturns the given record type's constructor name (with an empty range).'<AgdaReduce 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.'=AgdaReduce 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).'>Agda*Get the original projection info for name.'?AgdagetDefType 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: Z'@AgdaThe analogue of M. 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.'AAgdaAGiven a head and its type, compute the types of the eliminations.'CAgdadCheck if a name refers to a record which is not coinductive. (Projections are then size-preserving)'DAgda`Check if a type is an eta expandable record and return the record identifier and the parameters.'EAgdaYTurn off eta for unguarded recursive records. Projections do not preserve guardedness.'FAgda`Turn on eta for inductive guarded recursive records. Projections do not preserve guardedness.'GAgdaETurn on eta for non-recursive record, unless user declared otherwise.'HAgda1Check whether record type is marked as recursive.9Precondition: record type identifier exists in signature.'IAgda 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   "  : .'JAgda #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   "  : .'KAgdaCPrecondition: variable list is ordered descendingly. Can be empty.'LAgda 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 .'MAgdaetaExpand 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.'NAgdaDEta expand a record regardless of whether it's an eta-record or not.'SAgdaVIs 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.'UAgdaReturn the unique (closed) inhabitant if exists. In case of counting irrelevance in, the returned inhabitant contains garbage.'VAgda[Check whether a type has a unique inhabitant and return it. Can be blocked by a metavar.'WAgdahCheck whether a type has a unique inhabitant (irrelevant parts ignored). Can be blocked by a metavar.'YAgdaChecks 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.'ZAgdaAuxiliary function.'3Agda*Name of record type (for error reporting).Agda=Function to generate a placeholder for missing visible field.Agda Given fields.AgdaAll record field names with .AgdaBGiven fields enriched by placeholders for missing explicit fields.':Agda"Record type. Need not be reduced.'@AgdaHead (record value).Agda Its type.Agda Projection.7$$$$$$'*'+','.'-'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'Z7'1'2'3'4'5'6$'7'8'9':';$'<'='>'?'@','.'-'0'/'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]^lA 'aAgdaOMatch a non-linear pattern against a neutral term, returning a substitution.'dAgdaMatching against a term produces a constraint which we have to verify after applying the substitution computed by matching.'fAgda+Telescope of free variables in the equation'gAgda-Term from pattern, living in pattern context.'hAgdaBTerm from scrutinee, living in context where matching was invoked.'nAgdaMonad for non-linear matching.'oAgda@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).'vAgdaAdd substitution i |-> v to result of matching.'|AgdaPUntyped -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)'}AgdamNormalise the given term but also preserve blocking tags TODO: implement a more efficient version of this.'bAgda3Are we currently matching in an irrelevant context?Agda"The telescope of pattern variablesAgda'The telescope of lambda-bound variablesAgdaThe pattern to matchAgda*The term to be matched against the pattern'a'b'c'd'e'h'g'f'i'j'k'm'l'n'o'p'q'r's't'u'v'w'x'y'z'{'|'}'o'p'n'j'k'm'l'q'r's't'u'v'w'i'd'e'h'g'f'c'a'b'x'y'z'{'|'}None"#$+-03457;<=>?ACNQV]^n''''''''''''''''''''''''''''''''''''''None"#$+-03457;<=>?ACNQV]^lAgda/What is the polarity of a function composition?AgdaMain function of this module.'Agdapolarities i a4 computes the list of polarities of de Bruijn index i in syntactic entity a.'Agda'Infimum on the information lattice. b" is bottom (dominant for inf), c is top (neutral for inf).'Agda_* negation, swapping monotone and antitone.'Agda#Get the next polarity from a list, b if empty.'AgdaReplace c by `&. (Arbitrary bias, but better than b, see issue 1596).'Agda6A quick transliterations of occurrences to polarities.'Agda|Data and record parameters are used as phantom arguments all over the test suite (and possibly in user developments). enablePhantomTypes turns c parameters to ` to enable phantoms.'AgdaMake arguments b if the type of a not-cK later argument depends on it. Also, enable phantom types by turning cb 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.'AgdahCheck whether a variable is relevant in a type expression, ignoring domains of non-variant arguments.'AgdaoHack 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.'AgdacheckSizeIndex 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.'Agda polarity i a* computes the polarity of de Bruijn index i in syntactic entity a by taking the infimum of all '.''''''''''''''''''''''''''''None"#$+-03457;<=>?ACNQV]^)'AgdaICheck whether something can be used in a position of the given relevance.'AgdaZPrepare parts of a parameter telescope for abstraction in constructors and projections.'Agda)Used to modify context when going into a rel argument.'AgdarCompose two relevance flags. This function is used to update the relevance information on pattern variables a! after a match against something rel.'AgdasModify the context whenever going from the l.h.s. (term side) of the typing judgement to the r.h.s. (type side).'AgdaTInternal workhorse, expects value of --experimental-irrelevance flag as argument.'Agda(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.'Agda 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 6. 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). ''''''''' '''''''''None"#$+-03457;<=>?ACNQV]^'AgdasInfer the sort of another sort. If we can compute the bigger sort straight away, return that. Otherwise, return  UnivSort sF and add a constraint to ensure we can compute the sort eventually.'AgdaiInfer the sort of a pi type. If we can compute the sort straight away, return that. Otherwise, return  PiSort s1 s2F and add a constraint to ensure we can compute the sort eventually.'AgdaAs  inferPiSort', but for a nondependent function type.'Agda Non-dependent version of ptsRule'Agda@Recursively check that an iterated function type constructed by telePi is well-sorted. ''''''''' '''''''''None"#$+-03457;<=>?ACNQV]^'Agda'this many implicits have to be inserted'Agda=hidden argument where there should have been a non-hidden arg'Agdabad named argument'AgdaimplicitArgs 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).'Agda 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).'Agda'Create a metavariable according to the N info.'Agda'Create a questionmark according to the N info.'AgdaThe list should be non-empty.'AgdaKind/relevance of meta.AgdaName suggestion for meta.Agda Type of meta.Agda#The created meta as id and as term.'AgdaKind/relevance of meta.AgdaName suggestion for meta.Agda Type of meta.Agda#The created meta as id and as term. ''''''''''' '''''''''''None"#$+-03457;<=>?ACNQV]^)'Agda;Insert implicit patterns in a list of patterns. Even if x(, trailing SIZELT patterns are inserted.'Agda(Insert trailing SizeLt patterns, if any.'Agda;Insert implicit patterns in a list of patterns. Even if x(, trailing SIZELT patterns are inserted.''''''''None"#$+-03457;<=>?ACNQV]^q'AgdaIRename the variables in a telescope using the names from a given pattern.If there are not at least as many patterns as entries as in the telescope, the names of the remaining entries in the telescope are unchanged. If there are too many patterns, there should be a type error later.'Agda)Are there any untyped user patterns left?'AgdaConstruct an initial &% 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: E lhsTel = [A : Set, m : Maybe A] lhsOutPat = [Ax, "m"] lhsProblem = Problem ["_", "just a"] [] [] [] lhsTarget = "Case m Bool (Maybe A -> Bool)" @'AgdaTry to move patterns from the problem rest into the problem. Possible if type of problem rest has been updated to a function type.'AgdaThe initial telescope delta of parameters.AgdaBThe problem equations inherited from the parent clause (living in delta).AgdaThe user patterns.Agda0The type the user patterns eliminate (living in delta).Agda8Continuation for when checking the patterns is complete.Agda9The initial LHS state constructed from the user patterns.''''''''''None"#$+-03457;<=>?ACNQV]^ 'AgdakExpand a clause to the maximal arity, by inserting variable patterns and applying the body to variables.'AgdaMGet the name of defined symbol of the head normal form of a term. Returns / if no such head exists.''''None"#$+-03457;<=>?ACFNQTV]^'Agda;Compute the pattern variables of a term or term-like thing.'AgdaGiven the type of a constructor (excluding the parameters), decide which arguments are forced. Precondition: the type is of the form  ! D vs and the vs are in normal form.'Agda9Move bindings for forced variables to unforced positions.'AgdanApplies the forcing translation in order to update modalities of forced arguments in the telescope. This is used before checking a right-hand side in order to make sure all uses of forced arguments agree with the relevance of the position where the variable will ultimately be bound. Precondition: the telescope types the bound variables of the patterns.'AgdacRebind a forced pattern in a non-forced position. The forced pattern has already been dotted by ', so the remaining task is to find a dot pattern in an unforced position that can be turned into a proper match of the forced pattern.<For instance (with patterns prettified to ease readability):FrebindForcedPattern [.(suc n), cons .n x xs] n = [suc n, cons .n x xs]'AgdaDot all forced patterns and return a list of patterns that need to be undotted elsewhere. Patterns that need to be undotted are those that bind variables or does some actual (non-eta) matching.'Agda(Assumes that the term is in normal form. ''''''''' '''''''''None"#$+-03457;<=>?ACNQV]^#AgdazGet the name of the datatype constructed by a given constructor. Precondition: The argument must refer to a constructor#Agda(Get true constructor with record fields.'AgdaArity.(AgdaList of field names.(AgdaTGet true constructor with fields, expanding literals to constructors if possible.(AgdasAugment constructor with record fields (preserve constructor name). The true constructor might only surface via reduce.(AgdagetConType 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.(AgdagetFullyAppliedConType 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.(AgdarReturn 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.(AgdaJCheck if a name refers to a datatype or a record with a named constructor.(Agda1Check if a name refers to a datatype or a record.(Agda Precodition:  is reduced.( Agda,Precondition: Name is a data or record type.( Agda/! if not data or record type name.( Agda/" if not data or record definition.( Agda,Precondition: Name is a data or record type.(Agda/! if not data or record type name.(Agda/" if not data or record definition.(Agda Constructor.AgdaEnding in data/record type.AgdaNothing$ 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.(Agda Constructor.Agda.Reduced type of the fully applied constructor.AgdaNothing 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.##'('((((((((( ( ( ( ( ((#((#(('('((((( ( ( ( ( ((None"#$+-03457;<=>?ACNQV]^G(Agda%Edge labels for the positivity graph.(Agda Monad for computing occurrences.(Agda"Context for computing occurrences.(Agda*Items corresponding to the free variables.=Potential invariant: It seems as if the list has the form genericReplicate n / ++ 0C (/ . (*) is, for some n and is, where is! is decreasing (non-strictly).(AgdaName for " builtin.(AgdaA type used locally in (3.(AgdaUsed to build (( and occurrence graphs.(#AgdaUsed to build (( and occurrence graphs.('AgdaOnlyVarsUpTo n occs* discards occurrences of de Bruijn index >= n.(-AgdahCheck 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.(2AgdaRemoves (' entries and adds 1 entries.=WARNING: There can be lots of sharing between the generated 1D entries. Traversing all of these entries could be expensive. (See (: for an example.)(3AgdaAn interpreter for (#.=WARNING: There can be lots of sharing between the generated 1D entries. Traversing all of these entries could be expensive. (See (: for an example.)(6AgdaRunning the monad(7Agda1Computes the occurrences in the given definition.2WARNING: There can be lots of sharing between the 1E entries. Traversing all of these entries could be expensive. (See (: for an example.)(8Agda1Computes the occurrences in the given definition.(9Agda2WARNING: There can be lots of sharing between the 1R entries in the edges. Traversing all of these entries could be expensive. (See (: for an example.)(:AgdaComputes all non-T2 occurrence graph edges represented by the given (#.2WARNING: There can be lots of sharing between the 1l 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 1 elements:3 (1 [0 F, . 0]),3 (1 [0 F, . 0, ']),3 (1 [0 F, . 0, ', ']),3 (1 [0 F, . 0, ', ', ']), and so on.(NAgdaAs 1 does not have an V. we cannot do something meaningful for the  OccursWhere here.E.g. 'ostar (Edge JustNeg w) = Edge Mixed (w V (w >*< w))1 would probably more sense, if we could do it.(OAgdaFThese operations form a semiring if we quotient by the relation "the  components are equal".(:Agda&The names in the current mutual block.AgdaThe current name.+((((((((((((((((("(!( (#('(&(%($((()(+(*(,(-(.(/(0(1(2(3(4(5(6(7(8(9(:+(,(-(.(/()(+(*(((#('(&(%($(("(!( (0(1(2((((3((((((4(5(6(((7(8((((((9(:None"#$+-03457;<=>?ACNQV]^nP vAgdaWhich DefOtypes are eligible for the principle argument of a projection-like function?wAgdaBTurn 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 v: 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(ZAgda View for a Def f (Apply a : es) where isProjection f. Used for projection-like fs.([AgdaNA projection or projection-like function, applied to its principal argument(\AgdasJust a lone projection-like function, missing its principal argument (from which we could infer the parameters).(]Agda*Not a projection or projection-like thing.(aAgda Semantics of (Z.(bAgda Top-level (Z (no reduction).(cAgdaReduce 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.)(dAgdaTurn 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 / , it will be returned unaltered.No precondition. Preserves constructorForm, since it really does only something on (applications of) projection-like functions. vw(Z(](\([(`(_(^(a(b(c(d (Z(](\([(`(_(^(a(b(c(dvwNone"#$+-03457;<=>?ACNQVZ]^w1AgdaIndefinite article.(gAgdaTurns all warnings into errors.(hAgdaEDepending which flags are set, one may happily ignore some warnings.1Agda?Drops given amount of leading components of the qualified name.(kAgda3Drops the filename component of the qualified name.1 AgdaMProduces a function which drops the filename component of the qualified name.1!AgdaPrint two terms that are supposedly unequal. If they print to the same identifier, add some explanation why they are different nevertheless. (e(f(g(h(i(j(k (i(f(e(g(h(k(j None"#$+-03457;<=>?ACKNQV]^(AgdabuildList A ts builds a list of type List A. Assumes that the terms ts all have type A.(AgdaConceptually: 2redBind m f k = either (return . Left . f) k =<< m(Agda 4trustMe : {a : Level} {A : Set a} {x y : A} -> x "a y(AgdaGet 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 (AgdaUsed for both  primForce and primForceLemma.(AgdaAbbreviation: argN =   .(AgdaAbbreviation: argH = b   .A(z({(|(}(~((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((A((((((((((((((((((~(((((((((((((((((((((((((((((((((((((((}(|({(z((((((4(4(4(9 (9 None"#$+-03457;<=>?ACNQV]^d((None"#$+-03457;<=>?ACNQV]^b((((((((((((None"#$+-03457;<=>?ACNQV]^((None"#$+-03457;<=>?ACNQVZ]^ )Agda*Compute a list of instance candidates. /I if type is a meta, error if type is not eligible for instance search.)AgdafindInScope 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.)AgdaResult says whether we need to add constraint, and if so, the set of remaining candidates and an eventual blocking metavariable.)Agda?Precondition: type is spine reduced and ends in a Def or a Var.)AgdaA 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.) Agda(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).) AgdaApply 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.) Agda Given a meta m of type t and a list of candidates cands, checkCandidates m t cands, returns a refined list of valid candidates.)AgdaTo 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 6a arguments. See Issue670a. Andreas, 2013-11-07 Also do this for projections, see Issue670b.())()))))))) ) ) ) ) ))))))))) ) ) ())()) ) ))None"#$+-03457;<=>?ACNQVZ]^$AgdaIf matching is inconclusive (DontKnowE) we want to know whether it is due to a particular meta variable.$AgdamatchCopatterns 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).$AgdaIBuilds a proper substitution from an IntMap produced by match(Co)patterns)Agda Instead of zipWithMQ, we need to use this lazy version of combining pattern matching computations.)AgdaMatch a single copattern.)AgdaMatch a single pattern. $$$$$$$))))) $$$$)$)$)$))None"#$+-03457;<=>?ACNQVZ]^;)Agdathe kill list is empty or only Falses)Agda0there is no possible kill (because of type dep.))Agda%managed to kill some args in the list)Agda$all prescribed kills where performed)AgdarCollect the *definitely* rigid variables in a monoid. We need to successively reduce the expression to do this.)AgdaExtended occurs check.)"AgdaIDistinguish relevant, irrelevant and nonstrict variables in occurs check.)'AgdaWe are in arguments of a meta.)(Agda2We are not in arguments of a meta but a bound var.))Agda9We are at the start or in the arguments of a constructor.)*Agda!We are in an irrelevant argument.),AgdaXSet the names of definitions to be looked at to the defs in the current mutual block.)-Agda,Is a def in the list of stuff to be checked?).Agda3Remove a def from the list of defs to be looked at.)1Agda"Leave the strongly rigid position.);AgdaWhen assigning  m xs := v , check that m does not occur in v# and that the free variables of v are contained in xs.)<Agdaprune 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.)=AgdahasBadRigid 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.))>AgdaCheck whether a term Def f esD is finally stuck. Currently, we give only a crude approximation.)?AgdaCheck 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.)@AgdakillArgs [k1,...,kn] X prunes argument i from metavar X if ki==TrueA. Pruning is carried out whenever > 0 arguments can be pruned.)AAgda/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.)BAgdadInstantiate a meta variable with a new one that only takes the arguments which are not pruneable.)BAgda9Arguments to old meta var in left to right order with Bool' indicating whether they can be pruned.Agda$The old meta var to receive pruning.Agda$The pruned type of the new meta var.+)))))))))!) )")#)%)$)&)*)))')()+),)-).)/)0)1)2)3)4)5)6)7)8)9):);)<)=)>)?)@)A)B+)+),)-).)&)*)))')()#)%)$)/)0)1)2)3)4)")5)6)7)8)9):))!) );)<)=)>)?))))))))@)A)BNone"#$+-03457;<=>?ACNQV]^! )gAgda/ for root of split tree)jAgdaTag for labeling branches of a split tree. Each branch is associated to either a constructor or a literal, or is a catchall branch (currently only used for splitting on a literal type).)nAgdaSplit 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.)oAgdaAbstract case tree shape.)pAgda@No more splits coming. We are at a single, all-variable clause.)qAgdaA split is necessary.)rAgda+The number of variables bound in the clause)sAgdaArg. no to split at.)tAgdaSub split trees.)wAgdaConvert a split tree into a /[ (for printing).)e)f)i)h)g)j)m)l)k)n)o)q)p)t)s)r)u)v)w)x)v)u)o)q)p)t)s)r)n)j)m)l)k)e)f)i)h)g)w)xNone"#$+-03457;<=>?ACKNQV]^A1"AgdaRecord pattern trees.1#AgdaICorresponds to variable and dot patterns; contains the original pattern.1$Agda 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.1%Agda/ 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 1& variables, and n 1'E dot patterns, should be removed, and a new variable, with the name x5, inserted instead. The type of the new variable is t.1(AgdaVarPat# stands for variable patterns, and DotPat for dot patterns.1)Agda*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.1*Agda dropFrom i n drops arguments j with  j < i + n and j >= i . NOTE: n7 can be negative, in which case arguments are inserted.1+Agda4Split tree annotated for record pattern translation.1,AgdaSplit tree annotation.1-Agda)Constructor name/literal for this branch.1.AgdaArity of the constructor.1/Agda$Should we translate this split away?)AgdaTake 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.10Agda]Take a matrix of booleans (at least one row!) and summarize the columns using conjunction.11AgdainsertColumn i a m inserts a column before the ith column in matrix m and fills it with value a.12Agda#cutSublist i n xs = (xs', ys, xs'') cuts out a sublist ys of width n from xs, starting at column i.13AgdaTransform definitions returning record expressions to use copatterns instead. This prevents terms from blowing up when reduced.14AgdareplaceByProjections 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 lower15AgdaRCheck if a split is on a record constructor, and return the projections if yes.16Agda+Bottom-up procedure to annotate split tree.)Agda;Bottom-up procedure to record-pattern-translate split tree.)AgdaReplaces 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.17AgdaRuns a computation in the 1) monad.18Agda>Returns the next pattern variable, and the corresponding term.19Agda 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.1:AgdagConverts a record tree to a single pattern along with information about the deleted pattern variables.1;Agda*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.1<Agda2Traverses 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 1;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.1=AgdaTranslates the telescope.1=AgdaiExplanation of how the telescope should be changed. Types should be in the context of the old telescope.Agda:Old telescope, flattened, in textual left-to-right order.Agda;New telescope, flattened, in textual left-to-right order. /3 is used to indicate the locations of dot patterns.))))))))None"#$+-03457;<=>?ACNQV]^)AgdaVariable blocking a match.)Agda/De Bruijn index of variable blocking the match.)AgdaConstructors in this position.)AgdaLiterals in this position.)AgdaGTrue if at least one clause has a variable pattern in this position.)AgdaIf matching is inconclusive (Block<) we want to know which variables are blocking the match.)AgdaMatches unconditionally.)AgdaDefinitely does not match.)Agda%True if the clause has a result split)AgdaBlockingVar i cs ls o means variable i is blocked on constructors cs and literals ls.)Agda|If matching succeeds, we return the instantiation of the clause pattern vector to obtain the split clause pattern vector.)AgdaFor each variable in the patterns of a split clause, we remember the de Bruijn-index and the literals excluded by previous matches.)AgdaGiven 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)Agda-A pattern that matches anything (modulo eta).)Agda Lens for ).)Agda Lens for ).)Agda%Left dominant merge of blocking vars.)Agda 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.)AgdamatchClause qs i c checks whether clause c( covers a split clause with patterns qs.)AgdamatchPats 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 [].)Agda matchPat 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. BlockLit [x] means p is a proper instance of q) and could become a cover if variable /x@ is instantiated with an appropriate literal.)Agda]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.)AgdaSplit clause patterns qs.AgdaClause c to cover split clause.AgdaResult. If ) the instantiation rs such that (namedClausePats c)[rs] == qs.)AgdaClause pattern vector ps( (to cover split clause pattern vector).AgdaSplit clause pattern vector qs* (to be covered by clause pattern vector).AgdaResult. If ) the instantiation rs such that  ps[rs] == qs.)AgdaClause pattern p! (to cover split clause pattern).AgdaSplit clause pattern q# (to be covered by clause pattern).AgdaResult. If ), also the instantiation rsI of the clause pattern variables to produce the split clause pattern,  p[rs] = q.*))))))))))))))))))))))))))))))))))))))))))*))))))))))))))))))))))))))))))))))))))))))None"#$+-03457;<=>?ACNQVZ]^!zAgdaguardConstraint 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.!|Agda4Don't allow the argument to produce any constraints.!Agda7Catches pattern violation errors and adds a constraint.)Agda,Create a fresh problem for the given action.)Agda4Wake up the constraints depending on the given meta.)AgdaWake up all constraints.!y!z!{!|!}!~!!)))))))))!!!|)))!{!z))))!}!~))!yNone"#$&'+-03457;<=>?ACNQVZ]^- Agda1Create a sort meta that may be instantiated with  (Set). AgdaGCreate a new value meta with specific dependencies without -expanding. AgdaXCreate a new value meta with specific dependencies, possibly -expanding in the process. Agda?Create a new metavariable, possibly -expanding in the process. AgdanewIFSMeta s t candsP creates a new "implicit from scope" metavariable of type the output type of t with name suggestion s. AgdaMiller 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. AgdaAssign 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. Agda!Do safe eta-expansions for meta (SingletonRecords,Levels). Agda(Performing the meta variable assignment.#The instantiation should not be an  and the  should point to something  or a +. Further, the meta variable may not be .)Agda7Exceptions raised when substitution cannot be inverted.)AgdaCannot recover.)Agda=A potentially neutral arg: can't invert, but can try pruning.)Agda&Try to eta-expand var to remove projs.)Agda?Normalize just far enough to be able to eta-contract maximally.)Agda6Check whether one of the meta args is a projected var.)AgdaVarious kinds of metavariables.)AgdaMeta variables of record type.)Agda7Meta variables of "hereditarily singleton" record type.)Agda;Meta variables of level type, if type-in-type is activated.)AgdaaFind 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.)AgdaCCheck whether a meta variable is a place holder for a blocked term.)Agda8Skip frozen check. Used for eta expanding frozen metas.)Agda4Create a sort meta that cannot be instantiated with  (Set).)Agda1Create a sort meta that may be instantiated with  (Set).)Agda,Create a new value meta without -expanding.)Agda3Create a new value meta with specific dependencies.)AgdaZCreate a metavariable of record type. This is actually one metavariable for each field.)Agda6Construct a blocked constant if there are constraints.)AgdaunblockedTester t returns False if t is a meta or a blocked term.?Auxiliary function to create a postponed type checking problem.)Agda)Create a postponed type checking problem e : t that waits for type tA to unblock (become instantiated or its constraints resolved).)Agda)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.)Agda1Type of the term that is produced by solving the .)Agda7Eta expand metavariables listening on the current meta.)Agda/Wake up a meta listener and let it do its thing*Agda All possible metavariable kinds.*AgdavEta expand a metavariable, if it is of the specified kind. Don't do anything if the metavariable is a blocked term.*AgdaPEta expand blocking metavariables of record type, and reduce the blocked thing.*AgdaassignMeta 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.*AgdaassignMeta' 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.*AgdaTurn the assignment problem _X args <= SizeLt u into _X args = SizeLt (_Y args) and constraint  _Y args <= u.*Agda Eta-expand bound variables like z in  X (fst z).*AgdaJEta-expand a de Bruijn index of record type in context and passed term(s).* Agda_Turn non-det substitution into proper substitution, if possible. Otherwise, raise the error.* AgdaCheck 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.* Agda Turn open metas into postulates.Preconditions: We are #,. is set to the top-level module.)Agda)a possibly non-deterministic substitution*Agda dirAgdaThe meta variable x.AgdaIts associated information mvar <- lookupMeta x.Agda Its type  t = jMetaType $ mvJudgement mvarAgdaIts arguments.AgdaIts to-be-assigned value v , such that x args dir v.Agda0Continuation taking its possibly assigned value.*AgdaMeta variable arguments.AgdaRight hand side.H )))))))))))))))))))))))))))))))))))))))))))))))********** * * H))) )) ))))) ) ))) ) ))))))))))))))) ))))*** * *****))))))))* )))))* * None"#$+-03457;<=>?ACNQV]^ D!AgdahighlightAsTypeChecked 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.1>Agda<A function mapping names to the kind of name they stand for.*AgdaHighlighting levels.*AgdaXFull highlighting. Should only be used after typechecking has completed successfully.*AgdaBHighlighting without disambiguation of overloaded constructors.*Agda5Lispify and print the given highlighting information.*AgdawGenerate 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 vU (that corresponding to the interval covered by the declaration). If the boolean is /B, then this token highlighting info is additionally removed from v.*AgdaZGenerate and return the syntax highlighting information for the tokens in the given file.*AgdaSame as ** but takes a string instead of a filename.1?Agda1Compute syntax highlighting for the given tokens.1@Agda Builds a 1> function.1AAgdaGenerates 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.*Agda-Prints syntax highlighting info for an error.*AgdaRGenerate highlighting for error. Does something special for termination errors.* Agda*Generate syntax highlighting for warnings.1BAgda4Generate syntax highlighting for termination errors.1CAgdaNGenerate syntax highlighting for not-strictly-positive inductive definitions.*!AgdasGenerates and prints syntax highlighting information for unsolved meta-variables and certain unsolved constraints.*"AgdaGGenerates syntax highlighting information for unsolved meta variables.*#Agda{Generates syntax highlighting information for unsolved constraints (ideally: that are not connected to a meta variable).1DAgda8Generates a suitable file for a possibly ambiguous name.1EAgdaConverts names to suitable ts.1FAgda A variant of 1E for qualified abstract names.*$AgdafRemember a name disambiguation (during type checking). To be used later during syntax highlighting.*AgdaUpdate the state?*AgdaThe module to highlight.1@AgdaThis should only be *@ if type-checking completed successfully (without any errors).1AAgda'Maps source file paths to module names.AgdaThe module to highlight.1DAgda'Maps source file paths to module names.AgdaThe module to highlight.1EAgda'Maps source file paths to module names.AgdaDThe file name of the current module. Used for consistency checking.Agda"The name qualifier (may be empty).AgdaThe base name.AgdaThe  C0 of the name in its fixity declaration (if any).AgdaBMeta information to be associated with the name. The argument is / iff the name is an operator.AgdarThe definition site of the name. The calculated meta information is extended with this information, if possible.1FAgda'Maps source file paths to module names.AgdaDThe file name of the current module. Used for consistency checking.Agda The name.Agda0Should the binding site be included in the file?AgdaDMeta information to be associated with the name. ^ The argument is / iff the name is an operator.!*********** *!*"*#*$**********!*!* *"*#*$None"#$+-03457;<=>?ACNQV]^2X *,AgdaDo a full whnf and treat neutral terms as rigid. Used on the arguments to an injective functions and to the right-hand side.*-AgdajDoes deBruijn variable i correspond to a top-level argument, and if so which one (index from the left).*.AgdaJoin a list of inversion maps.*/Agda%Update the heads of an inversion map.*1AgdaIf a clause is over-applied we can't trust the head (Issue 2944). For instance, the clause might be `f ps = u , v` and the actual call `f vs .fst`. In this case the head will be the head of u rather than `_,_`.*2AgdakTurn variable heads, referring to top-level argument positions, into proper heads. These might still be {, but in that case they refer to deBruijn variables. Checks that the instantiated heads are still rigid and distinct.*3Agda,Argument should be in weak head normal form.*4AgdaaPrecondition: The first argument must be blocked and the second must be neutral.*5AgdarThe second argument should be a blocked application and the third argument the inverse of the applied function.*%*'*&*(*)***+*,*-*.*/*0*1*2*3*4*5*6*+*,*-*.*/*0*1*2*3*(*)***%*'*&*4*5*6None"#$+-03457;<=>?ACNQVZ]^o~%Agda.Check that the first sort equal to the second.%AgdacompareTel t1 t2 cmp tel1 tel1 checks whether pointwise tel1 `cmp` tel2 and complains that  t2 `cmp` t1 failed if not.%AgdaEquality on Types%AgdacompareElims pols a v els1 els2: performs type-directed equality on eliminator spines. t is the type of the head v.%Agda(Type-directed equality on argument lists%Agda)Syntax directed equality on atomic values%Agda!Type directed equality on values.*7AgdaTry whether a computation runs without errors or new constraints (may create new metas, though). Restores state upon failure.*8AgdanTry 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.*9AgdaqCheck if to lists of arguments are the same (and all variables). Precondition: the lists have the same length.*:AgdaintersectVars 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.*<Agda$Ignore errors in irrelevant context.*>Agda_Try to assign meta. If meta is projected, try to eta-expand and run conversion check again.*AAgdaRaise  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.*CAgdaCompute the head type of an elimination. For projection-like functions this requires inferring the type of the principal argument.*DAgdaCheck whether a1 cmp a2% and continue in context extended by a1.*FAgdaWhen 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.*IAgdaCompare 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...)*LAgda 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.*MAgdaAccount 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.*NAgda9Check 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.*OAgdaPrecondition: levels are $d.*DAgdacmp The comparison directionAgdaa1 The smaller domain.Agdaa2 The other domain.Agdab1 The smaller codomain.Agdab2 The bigger codomain.AgdaContinuation if mismatch in N.AgdaContinuation if mismatch in 3.Agda)Continuation if comparison is successful.(%%%%%%%%%%%%%%*7*8*9*:*;*<*=*>*?*@*A*B*C*D*E*F*G*H*I*J*K*L*M*N*O*P(*7*8*9*:%*;%*<%*=*>*?*@%*A*B*C%*D*E*F*G*H%*I*J*K%%%*L*M%%*N%%*O%*PNone"#$+-03457;<=>?ACNQV]^u*rAgda"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).#*Q*S*R*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#*]*^*_*Z*\*[*Y*X*W*`*a*b*c*d*e*f*g*h*i*U*V*j*k*l*m*n*o*p*Q*S*R*T*q*r*sNone"#$+-03457;<=>?ACNQVZ]^e*Agda'Size constraint with de Bruijn indices.*AgdaDeBruijn indices*Agda Living in Context.*Agda Living in Context.*Agda'Size expression with de Bruijn indices.*AgdaSize metas in size expressions.*AgdaDe Bruijn indices.*Agda Identifiers for rigid variables.*Agda$Name for printing in debug messages.*AgdaDe Bruijn index.*Agda,Flag to control the behavior of size solver.*Agda2Instantiate all unconstrained size variables to ".*Agda,Leave unconstrained size variables unsolved.*Agda,Solve size constraints involving hypotheses.*Agda"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.)*Agda0A hazardous hack, may the Gods have mercy on us.STo cast to the current context, we match the context of the given constraint by CtxId,, and as fallback, by variable name (douh!).%This hack lets issue 2046 go through.*AgdaTReturn the size metas occurring in the simplified constraints. A constraint like ! _j =< " : Size simplifies to nothing, so _j would not be in this set.*Agda2Solve a cluster of constraints sharing some metas.*AgdaICollect constraints from a typing context, looking for SIZELT hypotheses.*AgdaKConvert 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.*Agda@Turn a constraint over de Bruijn indices into a size constraint.*Agda#Turn a term into a size expression.Returns /, if the term isn't a proper size expression.*Agda&Turn a de size expression into a term.*Agda Only for `.*Agda*An order which ignores the meta arguments.*Agda-An equality which ignores the meta arguments.*Agda$Assumes we are in the right context.************************************************************None"#$+-013457;<=>?ACKNQVZ]^ *AgdaUnification succeeded.*AgdaTerms are not unifiable.*Agda1Some other error happened, unification got stuck.*Agda Result of *.*AgdaUnify 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.1GAgda4Get the type of the i'th variable in the given state1HAgdaGet 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 telescope1IAgda*As getEquality, but with the unraised type1JAgda>Add a list of equations to the front of the equation telescope1KAgda[Instantiate the k'th variable with the given value. Returns Nothing if there is a cycle.1LAgda{Solve the k'th equation with the given value, which can depend on regular variables but not on other equation variables.1MAgdaSimplify the k'th equation with the given value (which can depend on other equation variables). Returns Nothing if there is a cycle.1NAgda5Returns true if the variables 0..k-1 don't occur in x1KAgdaIndex kAgda Solution u************None"#$+-03457;<=>?ACNQV]^#*AgdaTType check a datatype definition. Assumes that the type has already been checked.*AgdaQEnsure that the type is a sort. If it is not directly a sort, compare it to a ).*AgdaType check a constructor declaration. Checks that the constructor targets the datatype and that it fits inside the declared sort. Returns the non-linear parameters.*Agda"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 *AgdaAuxiliary function for *.*AgdaCheck 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.*AgdaReturn 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.*Agda!Is the type coinductive? Returns /% if the answer cannot be determined.*AgdaName of data type.AgdaParameter telescope.Agda#Number of indices of the data type.AgdaSort of the data type.Agda)Constructor declaration (type signature).*Agdan replicas of type if  LamBindings are  DomainFrees that came from a  DomainFull of n+ binders. Should be comsumed whenever a  DomainFrees are consumed.AgdaBindings from definition site.Agda/Pi-type of bindings coming from signature site.AgdaContinuation, accepting parameter telescope and rest of type. The parameters are part of the context when the continutation is invoked.****************None"#$+-03457;<=>?ACNQVZ]^O rAgdarewrite b v rules es tries to rewrite v applied to es with the rewrite rules rules. b is the default blocking tag.sAgda{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.*Agda3Get all symbols that a rewrite rule matches against*AgdaDeconstructing a type into  ! t ! t' ! core.*AgdaThe whole telescope , t, t'.*Agda.*Agdat.*Agdat'.*Agdacore.*AgdaDeconstructing a type into  ! t ! t' ! core . Returns Nothing if not enough argument types.*AgdaAdd 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.*Agda%Append rewrite rules to a definition.*AgdarewriteWith t f es rew tries to rewrite f es : t with rew%, returning the reduct if successful.rs*******************s***********r******None"#$+-03457;<=>?ACNQV]^<!AgdamatchCompiledE c es% takes a function given by case tree c and and a spine es$ and tries to apply the function to es.*AgdaA 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.*Agdamatch'- 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;<=>?ACFNQTV]^e:uAgda)The entry point to the reduction machine.1OAgda<Control frames are continuations that act on value closures.1PAgda CaseK f i bs spine0 spine1 stack/. Pattern match on the focus (with arg info i ) using the bs case tree. f8 is the name of the function doing the matching, and spine0 and spine1 are the values bound to the pattern variables to the left and right (respectively) of the focus. The match stack contains catch-all cases we need to consider if this match fails.1QAgda ArgK cl cxt. Used when computing full normal forms. The closure is the head and the context is the spine with the current focus removed.1RAgdaAIndicates that the focus should be evaluated to full normal form.1SAgdaForceK f spine0 spine1 . Evaluating  primForce of the focus. f is the name of  primForce> and is used to build the result if evaluation gets stuck. spine0& are the level and type arguments and spine1P contains (if not empty) the continuation and any additional eliminations.1TAgda TrustMeK f spine0 spine1 spine2  . Evaluating  primTrustMe;. The first spine contain the level and type arguments. spine1 and spine25 contain at most one argument between them. If in spine1J it's the value closure of the first argument to be compared and if in spine28 it's the unevaluated closure of the second argument.1UAgda NatSucK n. Add nx to the focus. If the focus computes to a natural number literal this returns a new literal, otherwise it constructs n calls to suc.1VAgdaPrimOpK f op lits es cc". Evaluate the primitive function f using the Haskell function op. opH gets a list of literal values in reverse order for the arguments of f] and computes the result as a term. The already computed arguments (in reverse order) are lits and es are the arguments that should be computed after the current focus. In case of built-in functions with corresponding Agda implementations, cc contains the case tree.1WAgdaUpdateThunk ps. Update the pointers ps( with the value of the current focus.1XAgda ApplyK spine1. Apply the current focus to the eliminations in spine_. This is used when a thunk needs to be updated with a partial application of a function.1YAgda)A spine with a single hole for a pointer.1ZAgdaCatchAll cc spine. Case trees are not fully expanded, that is, inner matches can be partial and covered by a catch-all at a higher level. This catch-all is represented on the match stack as a CatchAll. cc, is the case tree in the catch-all case and spineH is the value of the pattern variables at the point of the catch-all.1[AgdayThe control stack for matching. Contains a list of CatchAllFrame's and the closure to return in case of a stuck match.1\AgdalThe control stack contains a list of continuations, i.e. what to do with the result of the current focus.1]Agda*The abstract machine state has two states 1^ and 1_ that determine what the machine is currently working on: evaluating a closure in the Eval state and matching a spine against a case tree in the Match state. Both states contain a 1\R of continuations for what to do next. The heap is maintained implicitly using 1` s, hence the s parameter.1^AgdaHEvaluate the given closure (the focus) to weak-head normal form. If the 1a field of the closure is 1b we look at the control stack for what to do. Being strict in the control stack is important! We can spend a lot of steps with unevaluated closures (where we update, but don't look at the control stack). For instance, long chains of suc constructors.1_AgdaMatch f cc spine stack ctrl Match the arguments spine against the case tree cc6. The match stack contains a (possibly empty) list of 1Z< frames and a closure to return in case of a stuck match.1cAgdaAThe environment of a closure binds pointers to deBruijn indicies.1dAgda3A thunk is either a black hole or contains a value.1eAgdaWSpines and environments contain pointers to closures to enable call-by-need evaluation.1fAgda_Not a pointer. Used for closures that do not need to be shared to avoid unnecessary updates.1gAgdaAn actual pointer is an 1` to a 1d. The thunk is set to 1hI during the evaluation of its contents to make debugging loops easier.1iAgdaOThe spine is a list of eliminations. Application eliminations contain pointers.1aAgdaUsed to track if a closure is  Unevaluated or a ValueG (in weak-head normal form), and if so why it cannot reduce further.1jAgda?The abstract machine represents terms as closures containing a , an environment, and a spine of eliminations. Note that the environment doesn't necessarily bind all variables in the term. The variables in the context in which the abstract machine is started are free in closures. The 1aA argument tracks whether the closure is in weak-head normal form.1kAgdaThe environment applies to the F argument. The spine contains closures with their own environments.1lAgdaCase tree with bodies.1mAgda 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.1nAgdaxMatch on record constructor. Can still have a catch-all though. Just contains the fields, not the actual constructor.1oAgda 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.1pAgda Absurd case.1qAgda3We are constructing a record here (copatterns).  lists projections.1rAgdaoMap from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)1sAgda!Map from literal to case subtree.1tAgda'(Possibly additional) catch-all clause.1uAgda primForce1vAgda primTrustMe1wAgda9Datatype or record type. Need to know this for primForce.1xAgdaAxiom or abstract defn1yAgda"Literals in reverse argument order1zAgda+In this case we fall back to slow reduction1{Agda Compute a 1| from a regular definition.1}AgdaQApply a closure to a spine of eliminations. Note that this does not preserve the 1a field.1~Agda+Apply a closure to a spine, preserving the 1aV field. Use with care, since usually eliminations do not preserve the value status.1AgdaFIn most cases pointers that we dereference do not contain black holes.1AgdaOnly use for debug printing!1AgdaCreate a thunk. If the closure is a naked variable we can reuse the pointer from the environment to avoid creating long pointer chains.1Agda-Create a thunk that is not shared or updated.1AgdaUnsafe.1AgdaThe initial abstract machine state. Wrap the term to be evaluated in an empty closure. Note that free variables of the term are treated as constants by the abstract machine. If computing full normal form we start off the control stack with a 1R continuation.1AgdagThe abstract machine treats uninstantiated meta-variables as blocked, but the rest of Agda does not.1AgdaYNote: it's important to be lazy in the spine and environment when decoding. Hence the 1 here and in 1, and the special version of q in 1.1AgdaUTurning an abstract machine closure back into a term. This happens in three cases: * when reduction is finished and we return the weak-head normal term to the outside world. * when the abstract machine encounters something it cannot handle and falls back to the slow reduction engine * when there are rewrite rules to apply1AgdasTurn a list of internal syntax eliminations into a spine. This builds closures and allocates thunks for all the [ elims.1AgdafTrim unused entries from an environment. Currently only trims closed terms for performance reasons.1Agda Build an environment for a body with some given free variables from a spine of arguments. Returns a triple containing * the left-over variable names (in case of partial application) * the environment * the remaining spine (in case of over-application)1AgdaeEvaluating a term in the abstract machine. It gets the type checking state and environment in the 1 argument, some precomputed built-in mappings in 1, the memoised #R function, a couple of flags (allow non-terminating function unfolding, and whether rewriting is enabled), and a term to reduce. The result is the weak-head normal form of the term with an attached blocking tag.tuut1212None"#$+-03457;<=>?ACNQV]^!Agda! traverses the whole 6, and we can use this traversal to modify the term.!AgdaInfer type of a neutral term.!AgdaEntry point for term checking.!Agda/Entry point for e.g. checking WithFunctionType.!Agda(The default action is to not change the  at all.+ Agda/Called on each subterm before the checker runs.+ Agda/Called on each subterm after the type checking.+ AgdaCalled for each ArgInfo. The first 3/ is from the type, the second from the term.1Agda 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 Theory1AgdaMake 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.1AgdacheckArgInfo actual expected.The expected  comes from the type. The actual 8 comes from the term and can be updated by an action.1AgdacheckRelevance action term type.The term 3 can be updated by the action.1Agda$Infer ordinary function application.1Agda3Infer possibly projection-like function application1AgdainferSpine 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).1AgdaReturns 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.1AgdarType should either be a record type of a type eligible for the principal argument of projection-like functions.1AgdaResult is in reduced form.1AgdaCheck if sort is well-formed.1AgdaCheck if level is well-formed.1AgdaType of a term or sort meta.1AgdaDUniverse subsumption and type equality (subtyping for sizes, resp.).+ AgdaCompute the sort of a type.1Agdaeliminate t self es eliminates value self of type t by spine es1 and returns the remaining value and its type.1Agda Constructor.AgdaConstructor arguments.Agda$Type of the constructor application.Agda 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.1AgdaType of the head self.Agda The head self.AgdaThe eliminations es.Agda!Expected type of the application self es.Agda*The application after modification by the Action.1AgdaType of the head.Agda The head.AgdaThe arguments.Agda!Expected type of the application.Agda*The application after modification by the Action. !+ + + + !!!!!!+ !!!!+ + + + !!!+ None"#$+-03457;<=>?ACNQVZ]^ $+Agda'Result of checking the LHS of a clause.+AgdaQThe number of original module parameters. These are present in the the patterns.+AgdaV : The types of the pattern variables, in internal dependency order. Corresponds to .+Agda The patterns in internal syntax.+Agda0Whether the LHS has at least one absurd pattern.+AgdaThe type of the body. Is b if  is defined. 68 to indicate the rhs must be checked in irrelevant mode.+AgdaSubstitution 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.+AgdaAs-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).+AgdaiA pattern is flexible if it is dotted or implicit, or a record pattern with only flexible subpatterns.1Agda{Compute the set of flexible patterns in a list of patterns. The result is the deBruijn indices of the flexible patterns.1AgdalUpdate the user patterns in the given problem, simplifying equations between constructors where possible.1Agda`Check if a problem is solved. That is, if the patterns are all variables, and there is no  problemRest.1AgdaHCheck if a problem consists only of variable patterns. (Includes the  problemRest).1Agda.For each user-defined pattern variable in the &, 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.1Agda4Check that a dot pattern matches it's instantiation.1AgdaClassify remaining patterns after splitting is complete into pattern variables, as patterns, dot patterns, and absurd patterns. Precondition: there are no more constructor patterns.1AgdaBuild a renaming for the internal patterns using variable names from the user patterns. If there are multiple user names for the same internal variable, the unused ones are returned as as-bindings.1AgdaAfter splitting is complete, we transfer the origins We also transfer the locations of absurd patterns, since these haven't been introduced yet in the internal pattern.1AgdaIf a user-written variable occurs more than once, it should be bound to the same internal variable (or term) in all positions. Returns the list of patterns with the duplicate user patterns removed.1AgdaeConstruct the context for a left hand side, making up hidden (dotted) names for unnamed variables.+AgdaBind as patterns1AgdaSince with-abstraction can change the type of a variable, we have to recheck the stripped with patterns when checking a with function.+AgdaCheck 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.1AgdaDDetermine in which order the splits should be tried by reordering insertingdropping the problem equations.1AgdaUThe loop (tail-recursive): split at a variable in the problem until problem is solved1Agda>Ensures that we are not performing pattern matching on codata.1AgdaWhen working with a monad m implementing MonadTCM and MonadError TCErr, suspendErrors f performs the TCM action f8 but catches any errors and throws them in the monad m instead.1Agda5A more direct implementation of the specification 2softTypeError err == suspendErrors (typeError err)1AgdaA convenient alias for liftTCM . typeErrord. Throws the error directly in the TCM even if there is a surrounding monad also implementing MonadError TCErr.1AgdaCheck if the type is a data or record type and return its name, definition, parameters, and indices. Fails softly if the type could become a data'record type by instantiating a variable(metavariable, or fail hard otherwise.1AgdayGet the constructor of the given record type together with its type. Throws an error if the type is not a record type.1AgdaDisambiguate a projection based on the record type it is supposed to be projecting from. Returns the unambiguous projection name and its type. Throws an error if the type is not a record type.1AgdaDisambiguate a constructor based on the data type it is supposed to be constructing. Returns the unambiguous constructor name and its type. Precondition: type should be a data/record type.1Agda#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.1Agda[Check that given parameters match the parameters of the inferred constructor/projection.+AgdaLists of flexible patterns are &.1Agda Trace, e.g., CheckPatternShadowing clause+Agda Trace, e.g. CheckPatternShadowing clauseAgda+The name of the definition we are checking.Agda The patterns.AgdaThe expected type  a =  ! b.Agda4Module parameter substitution from with-abstraction.AgdaiPatterns that have been stripped away by with-desugaring. ^ These should not contain any proper matches.Agda Continuation.1Agda+The name of the definition we are checking.AgdaThe current state.1AgdaName d of the record typeAgda Parameters pars of the record typeAgdaThe record type  Def d pars (for error reporting)1Agda3Hiding info of the projection's principal argument.Agda+Name of the projection to be disambiguated.Agda#Record type we are projecting from.1Agda0The name of the constructor to be disambiguated.AgdaName of the datatype.AgdaParameters of the datatype1Agda The record(data type name of the chosen constructor projection.Agda<The record/data type name as supplied by the type signature.AgdaThe parameters.++++++++++++++++++++++++++++++None"#$+-03457;<=>?ACNQVZ]^_'fAgda DOCUMENT ME!gAgda=Checking a lambda whose domain type has already been checked.hAgdaInfer the type of an expression. Implemented by checking against a meta variable. Except for neutrals, for them a polymorphic type is inferred.iAgdaType check an expression.jAgda<Check that an expression is a type without knowing the sort.+%Agda(Flag to control resurrection on domains.+&AgdaWe are checking a module telescope. We pass into the type world to check the domain type. This resurrects the whole context.+'AgdaWe 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.+(Agda#Check that an expression is a type.+)Agda?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 .+*AgdaBCheck that an expression is a type which is equal to a given type.+,AgdaQType check a (module) telescope. Binds the variables defined by the telescope.+-AgdaType check the telescope of a dependent function type. Binds the resurrected variables defined by the telescope. The returned telescope is unmodified (not resurrected).+.AgdaEType check a telescope. Binds the variables defined by the telescope.+/AgdaCheck 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.+1AgdaType check a lambda expression.+2AgdaCheck 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.+4AgdamInsert hidden lambda until the hiding info of the domain type matches the expected hiding info. Throws +5AgdacheckAbsurdLambda i h e t# checks absurd lambda against type t. Precondition: e = AbsurdLam i h+6Agda%checkExtendedLambda i di qname cs e t/ check pattern matching lambda. Precondition: e = ExtendedLam i di qname cs+7AgdaRun a computation.If successful, return Nothing.If IlltypedPattern p a, NotADatatype a or CannotEliminateWithPattern p a is thrown and type a is blocked on some meta x1, reset any changes to the state and 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.bIf --sharing is enabled, we will never catch errors since it's not safe to roll back the state.+9AgdacheckRecordExpression fs e t) checks record construction against type t. Precondition  e = Rec _ fs.+:Agda#checkRecordUpdate ei recexpr fs e t Precondition e = RecUpdate ei recexpr fs.+<AgdaVRemove top layers of scope info of expression and set the scope accordingly in the  I.+=Agda DOCUMENT ME!+>Agda DOCUMENT ME!+?Agda*Unquote a TCM computation in a given hole.+@Agda-Check an interaction point without arguments.+AAgda&Check an underscore without arguments.+BAgdaType check a meta variable.+CAgda\Infer the type of a meta variable. If it is a new one, we create a new meta for its type.+DAgdaType 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.+EAgdatTurn a domain-free binding (e.g. lambda) into a domain-full one, by inserting an underscore for the missing type.+FAgda,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.+GAgda.Check an argument whose value we already know.+HAgdaCheck a single argument.+KAgdaUsed to check aliases f = e. Switches off w+ for the checking of top-level application.+LAgda?Check whether a de Bruijn index is bound by a module telescope.+MAgda=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.+4AgdaExpected hiding.AgdaExpected to be a function type.AgdaContinuation on blocked type.AgdaQContinuation when expected hiding found. The continuation may assume that the Type is of the form (El _ (Pi _ _)).Agda!Term with hidden lambda inserted.+FAgda5User-supplied arguments (hidden ones may be missing).Agda+Inferred arguments (including hidden ones).Agda7Type of the head (must be Pi-type with enough domains).Agda-Remaining inferred arguments, remaining type.+GAgdaUser-supplied argument.Agda+Inferred arguments (including hidden ones).Agda7Type of the head (must be Pi-type with enough domains).Agda-Remaining inferred arguments, remaining type.0fghij+%+'+&+(+)+*+++,+-+.+/+0+1+2+3+4+5+6+7+8+9+:+;+<+=+>+?+@+A+B+C+D+E+F+G+H+I+J+K+L+M+N+O0+(j+)+*+++,+-+%+'+&+.+/+0+1+2+3g+4+5+6+7+8+9+:+;+<i+=+>+?f+@+A+B+C+D+E+F+G+Hh+I+J+K+L+M+N+O None"#$+-03457;<=>?ACNQVZ]^o91AgdaChecks 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.+RAgdabindPostulatedName builtin q m checks that q. is a postulated name, and binds the builtin builtin to the term m q def , where def is the current d of q.1AgdaLCheck that we're not trying to bind true and false to the same constructor.1AgdasOnly use for datatypes with distinct arities of constructors. Binds the constructors together with the datatype.1Agda'Bind BUILTIN EQUALITY and BUILTIN REFL.+SAgda&Bind a builtin thing to an expression.+VAgda#Bind a builtin thing to a new name.Since their type is closed, it does not matter whether we are in a parameterized module when we declare them. We simply ignore the parameters.+R+S+T+U+V+S+V+R+T+UNone"#$+-03457;<=>?ACNQV]^t$wAgda3Binds the FLAT builtin, and changes its definition.$xAgdaLBinds the SHARP builtin, and changes the definitions of INFINITY and SHARP.$yAgdaGBinds the INFINITY builtin, but does not change the type's definition.+WAgda The type of ".+XAgda The type of &o_.+YAgda The type of &m.$w$x$y+W+X+Y+W+X+Y$y$x$w None"#$+-03457;<=>?ACNQVZ]^m1Agda5What could go wrong if we try to split on the result?1Agda-We do not know the target type of the clause.1Agda8Type living in the given telescope is not a record type.1AgdaHRecord has irrelevant fields, but we do not have irrelevant projections.1Agda!Allow partial covering for split?1Agda)Introduce trailing pattern variables via +i?+ZAgdaA Covering is the result of splitting a +^.+\Agda@De Bruijn level (counting dot patterns) of argument we split on.+]AgdaECovering clauses, indexed by constructor/literal these clauses share.+`AgdaType of variables in scPats.+aAgdaMThe patterns leading to the currently considered branch of the split tree.+bAgdaSubstitution from +`Q to old context. Only needed directly after split on variable: * To update +dT * 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 +lI, which does not split on a variable, should reset it to the identity e, lest it be applied to +d again, leading to Issue 1294.+cAgdaWe need to keep track of the module parameter checkpoints for the clause for the purpose of inferring missing instance clauses.+dAgda'The type of the rhs, living in context +`.. This invariant is broken before calls to +i ; there, +d lives in the old context. +i moves +d0 to the new context by applying substitution +b.+eAgda,Project the split clauses out of a covering.+fAgdaJCreate a split clause from a clause in internal syntax. Used by make-case.+gAgda1Top-level function for checking pattern coverage.Effects:3Marks unreachable clauses as such in the signature.0Adds missing instances clauses to the signature.+hAgdaXTop-level function for eliminating redundant clauses in the interactive case splitter1Agda=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.1Agda6Append a instance clause to the clauses of a function.1Agda_Check that a type is a non-irrelevant datatype or a record with named constructor. Unless the U argument is W" the data type must be inductive.+iAgdaUpdate the target type, add more patterns to split clause if target becomes a function type. Returns the domains of the function type (if any).1Agda <computeNeighbourhood delta1 delta2 d pars ixs hix tel ps 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 cps Current module parameter checkpoints con Constructor to fit into hole dtype == d pars ixs+jAgdaEntry point from Interaction.MakeCase.+kAgdaEntry point from TypeChecking.Empty and Interaction.BasicOps. splitLast CoInductive is used in the refine tactics.1Agda$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).1AgdaConvert 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!).1Agda%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.+lAgda 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.+mAgdaFor debugging only.1AgdaFunction name.Agda"Clause to add. Clause hiding (in  ) must be P.1 AgdaTelescope before split point.Agda(Name of pattern variable at split point.AgdaTelescope after split point.AgdaName of datatype to split at.AgdaData type parameters.AgdaData type indices.AgdaIndex of split variable.AgdaTelescope for the patterns.Agda Patterns before doing the split. AgdaCurrent checkpoints AgdaConstructor to fit into hole. AgdaNew split clause if successful.1Agda:Coinductive constructors are allowed if this argument is W.AgdaDon't fail if computed +Z! does not cover all constructors.1Agda:Coinductive constructors are allowed if this argument is W.AgdaDon't fail if computed +Z! does not cover all constructors.AgdaIf 12, introduce new trailing variable patterns via +i.'++Z+[+\+]+^+_+`+a+b+c+d+e+f+g+h+i+j+k+l+^+_+`+a+b+c+d+f+i+Z+[+\+]+e+g+h+j+k+l'+None"#$+-03457;<=>?ACNQV]^Ϝ%AgdaVCheck whether a type is empty. This check may be postponed as emptiness constraint.1AgdaGeneric failure1AgdaFailure with informative error1AgdaEmptyness check blocked%AgdaRange of the absurd pattern.AgdaHType that should be empty (empty data type or iterated product of such).%%None"#$+-03457;<=>?ACNQV]^ !Agda%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.+uAgdaStripped-down version of  used in clause compiler.+wAgda8Pattern variables are considered in left-to-right order.+}AgdaSStrip down a clause. Don't forget to apply the substitution to the dot patterns!+AgdaGet the index of the next argument we need to split on. This the number of the first pattern that does a (non-lazy) match in the first clause. Or the first lazy match where all clauses agree on the constructor, if there are no non-lazy matches.+AgdaDIs is not a variable pattern? And if yes, is it a record pattern?+AgdaIs this a variable pattern?Maintain invariant: isVar = isNothing . properSplit!+AgdasplitOn single n cs* will force expansion of catch-alls if single.+Agda4Expand 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 +Agda<Make sure (by eta-expansion) that clause has arity at least n where n) is also the length of the provided list.!Agda=Translate record patterns and coverage check with given type?!+t+u+v+x+w+y+{+z+|+}+~++++++++++y+{+z+|!+u+v+x+w+t+}+~+++++++++ None"#$+-03457;<=>?ACNQV]^+Agda '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.+Agda(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+AgdaPosition and other info.AgdaRecord type identifier.Agda$Optional: (co)inductive declaration.Agda#Optional: user specified eta/no-etaAgdaOptional: constructor name.AgdaRecord parameters.Agda!Approximate type of constructor (fields0 -> Set). Does not include record parameters.AgdaField signatures.++++ None"#$+-03457;<=>?ACNQV]^++++++++++ None"#$+-03457;<=>?ACNQV]^ +Agda subst u . absTerm u == id+AgdaisPrefixOf u v = Just es if v == u ] es.+AgdaabstractType a v b[v] = b where a : v.+Agda )piAbstractTerm v a b[v] = (w : a) -> b[w]+Agda (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']+Agda This swaps var 0 and var 1. ++++++++++ ++++++++++None"#$+-03457;<=>?ACNQVZ]^O+Agda6Split pattern variables according to with-expressions.+AgdaAbstract with-expressions vs+ to generate type for with-helper function.Each  EqualityType, coming from a rewrite , will turn into 2 abstractions.+AgdaFrom a list of with and rewrite; expressions and their types, compute the list of final with" expressions (after expanding the rewrites).+AgdaFCompute the clauses for the with-function given the original patterns.+Agda >stripWithClausePatterns cxtNames parent f t  qs np  ps = ps'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).+AgdaConstruct 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 +Agda, context of types and with-arguments.Agda " t type of rhs.Agda " as types of with arguments.Agda " vs with arguments. Output:Agda( , ,,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 .+Agda 7 context for types of with types.Agda , " vs : raise  as with and rewrite-expressions.Agda " as8 types of with and rewrite-expressions.Agda "  = context extension to type with-expressions.Agda  , " b type of rhs.Agda ! 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.+ Agda6Names of the module parameters of the parent function.AgdaName of the parent function.AgdaName of the with-function.AgdaTypes of the parent function.AgdaContext of parent patterns.AgdaParent patterns.Agda.Number of module parameters in parent patternsAgda1Substitution from parent lhs to with function lhsAgdaFinal permutation. AgdaNumber of needed vars. AgdaNumber of with expressions. Agda With-clauses. Agda,With-clauses flattened wrt. parent patterns.+ AgdacxtNames6 names of the module parameters of the parent functionAgdaparent name of the parent function.Agdaf name of with-function.Agdat+ top-level type of the original function.Agda* context of patterns of parent function.Agdaqs* internal patterns for original function.Agdanpars number of module parameters in qs.Agda permutation taking vars(qs) to  support().Agdaps, patterns in with clause (eliminating type t). Agdaps'0 patterns for with function (presumably of type ).+AgdaThe name of parent function.AgdaThe name of the with -function.Agda  The arguments of the with function before the with expressions.Agda  The arguments of the with function after the with expressions.Agdan The number of with expressions.Agdaqs The parent patterns.Agdaperm7 Permutation to split into needed and unneeded vars.AgdalhsPerm9 Permutation reordering the variables in parent patterns.++++++++++++++++None"#$+-03457;<=>?ACNQVZ]^e$sAgdaSet  " according to termination info in  J4, which comes from a possible termination pragma.$tAgda)Enter a new section during type-checking.$uAgda,Type check a definition by pattern matching.+AgdaParameters for creating a with -function.+AgdaParent function name.+AgdaWith function name.+AgdaType of the parent function.+AgdaContext of the parent patterns.+AgdaRTypes of arguments to the with function before the with expressions (needed vars).+AgdaSTypes of arguments to the with function after the with expressions (unneeded vars).+AgdaWith and rewrite expressions.+Agda*Types of the with and rewrite expressions.+AgdaType of the right hand side.+AgdaParent patterns.+Agda.Number of module parameters in parent patterns+AgdaQPermutation resulting from splitting the telescope into needed and unneeded vars.+Agda;Permutation reordering the variables in the parent pattern.+Agda@Final permutation (including permutation for the parent clause).+Agda'The given clauses for the with function+AgdaIA single clause without arguments and without type signature is an alias.+Agda'Check a trivial definition of the form f = e+Agda,Type check a definition by pattern matching.+AgdaQInsert some with-patterns into the with-clauses LHS of the given RHS. (Used for rewrite.)+AgdaeInsert with-patterns before the trailing with patterns. If there are none, append the with-patterns.+AgdaType check a function clause.+AgdaType check the with and rewrite lhss and/or the rhs.+AgdaInvoked in empty context.+AgdaType check a where clause.+AgdaSet the current clause number.$uAgda'the type we expect the function to haveAgdais it irrelevant (for instance)Agda2are the clauses delayed (not unfolded willy-nilly)Agdapdoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)AgdaEis it a with function (if so, what's the name of the parent function)Agda range infoAgdathe name of the functionAgdathe clauses to check+ Agda'the type we expect the function to haveAgdais it irrelevant (for instance)Agda2are the clauses delayed (not unfolded willy-nilly)Agdapdoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)AgdaEis it a with function (if so, what's the name of the parent function)Agda range infoAgdathe name of the functionAgdaRsubstitution (from with abstraction) that needs to be applied to module parametersAgdathe clauses to check+Agda(Type of function defined by this clause.Agda<Module parameter substitution arising from with-abstraction.AgdaClause.AgdaType-checked clause.+Agda Range of lhs.AgdaName of function.AgdaPatterns in lhs.AgdaTop-level type of function.Agda Result of type-checking patternsAgda Rhs to check.+AgdaName of function.AgdaName of the with-function.AgdaType of function.Agda Result of type-checking patternsAgdaWith-expressions.AgdaTypes of with-expressions.AgdaWith-clauses to check.+AgdaWhere-declarations to check.Agda Continuation."$s$t$u$v++++++++++++++++++++++++++++++"$v+++$u+$s+++++++++++++++++++++++++$t+None"#$+-03457;<=>?ACNQVZ]^nAgdaPrecondition: Application hd args = appView e.oAgdacheckApplication hd args e t) checks an application. Precondition: Application hs args = appView echeckApplication1 disambiguates constructors (and continues to 1#) and resolves pattern synonyms.pAgdaCheck that a list of arguments fits a telescope. Inserts hidden arguments as necessary. Returns the type-checked arguments and the remaining telescope.qAgda!checkArguments exph r args t0 t k tries checkArgumentsE 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.1AgdaInfer 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.1Agda2The second argument is the relevance of the first.1Agda 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.1AgdaFIf we've already checked the target type we don't have to call coerce.1AgdaCheck 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.1AgdaCheck 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.1Agda0Returns an unblocking action in case of failure.1AgdaCInferring the type of an overloaded projection application. See 1.1AgdaBChecking the type of an overloaded projection application. See 1.1Agda;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.pAgda)Eagerly insert trailing hidden arguments?AgdaRange of application.AgdaArguments to check.Agda%Telescope to check arguments against.Agda8Checked arguments and remaining telescope if successful.1Agda7The whole expression which constitutes the application.AgdaEThe origin of the projection involved in this projection application.Agda,The projection name (potentially ambiguous).Agda The arguments to the projection.Agda(The expected type of the expression (if / , infer it).Agda9The type-checked expression and its type (if successful).nopqqponNone"#$+-03457;<=>?ACKNQV]^0/+Agda6The call information is stored as free monoid over G_. 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 0X; nodes and singleton leafs. Since we define no order on G! (expensive), we cannot use a SetU or nub list. Performance-wise, I could not see a difference between Set and list.+Agda2True if thing not eligible for structural descent.+AgdaThing.+AgdaExtract 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).+AgdaTermination monad.+Agda Termination monad service class.+AgdaThe termination environment.+AgdaAAre we mining dot patterns to find evindence of structal descent?+AgdaLDo we assume that record and data type constructors preserve guardedness?+AgdaDDo we inline with functions to enhance termination checking of with?+Agda#The name of size successor, if any.+Agda2The name of the delay constructor (sharp), if any.+Agda/Depth at which to cut off the structural order.+Agda3The name of the function we are currently checking.+AgdaThe names of the functions in the mutual block we are checking. This includes the internally generated functions (with, extendedlambda, coinduction).+AgdarThe list of name actually appearing in the file (abstract syntax). Excludes the internally generated functions.+AgdaSDoes the actual clause result from with-inlining? (If yes, it may be ill-typed.)+Agda_Target type of the function we are currently termination checking. Only the constructors of + are considered guarding.+Agda%Are we checking a delayed definition?+AgdaOnly consider the ,, /< arguments for establishing termination. See issue #1023.+AgdaOnly consider guardedness if / (not masked).+Agda How many SIZELTy relations do we have in the context (= clause telescope). Used to approximate termination for metas in call args.+Agda+The patterns of the clause we are checking.+AgdaNumber 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.+Agda~The current guardedness status. Changes as we go deeper into the term. Updated during call graph extraction, hence strict.+AgdaWhen 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).+AgdaJPattern variables that can be compared to argument variables using SIZELT.+AgdaThe current guardedness level.+Agda+The target of the function we are checking.+Agda!The mutual block we are checking.RThe functions are numbered according to their order of appearance in this list.+Agda!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.+Agda)Generic run method for termination monad.+AgdaCRun TerM computation in default environment (created from options).,AgdaAShould the codomain part of a function type preserve guardedness?,Agda Lens for +.,Agda Lens for +.,!Agda Lens for +.,$Agda9Compute usable vars from patterns and run subcomputation.,%AgdaSet + when going under constructor c.,&AgdaSet +$ for arguments following projection qx. We disregard j<i after a non-coinductive projection. However, the projection need not be recursive (Issue 1470).,'AgdaFor 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.,(AgdaCheck whether a projection belongs to a coinductive record and is actually recursive. E.g. @ isCoinductiveProjection (Stream.head) = return False8isCoinductiveProjection (Stream.tail) = return True @,)Agda3How long is the path to the deepest atomic pattern?,*AgdaUA dummy pattern used to mask a pattern that cannot be used for structural descent.,-Agda#A very crude way of estimating the SIZELT chains  i > j > k: in context. Returns 3 in this case. Overapproximates.,.Agda*Print masked things in double parentheses.,=Agda*Only show intermediate nodes. (Drop last G).[+++++++++++++++++++++++++++++++++++++++++++++,,,,,,,,,, , , , , ,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),*,+,,,-[+++++++++++++++++++++++++++++++++++,,,,,,,,,, , , , , ,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),*+++++++,+,,+++,-None"#$+-03457;<=>?ACNQV]^,NAgdaReturns /5 if no inlining happened, otherwise, the new clauses.1AgdaSReturns the original clause if no inlining happened, otherwise, the new clauses.1AgdawithExprClauses 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 0<ped back there (under all the Bind abstractions).Precondition: we are #,.1AgdainlinedClauses 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 #,.1AgdaThe 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).,N,O,P,N,O,PNone"#$&'+-03457;<=>?ACKNQVZ]^[\(1AgdalRemove all non-coinductive projections from an algebraic term (not going under binders). Also, remove s.1Agda)Extract recursive calls from expressions.1Agda]Convert a term (from a dot pattern) to a pattern for the purposes of the termination checker.SIZESUC is treated as a constructor.,QAgda:The result of termination checking a module. Must be a 0H and have \.1Agda-Call graph with call info for composed calls.,RAgda4Entry point: Termination check a single declaration.Precondition:  must be set correctly.1AgdaHTermination check a single declaration (without necessarily ignoring abstract).,SAgda8Entry point: Termination check the current mutual block.1Agda 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).1AgdaSmart constructor for C . Removes E that are not mentioned in F.1Agda reportCalls for debug printing.0Replays the call graph completion for debugging.1AgdatermFunction name checks name for termination.1AgdaTo process the target type.1Agda3Termination 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.1AgdaMask arguments and result for termination checking according to type of function. Only arguments of types ending in data/record or Size are counted in.1Agda0Is the current target type among the given ones?1Agda:Convert a term (from a dot pattern) to a DeBruijn pattern.MThe term is first normalized and stripped of all non-coinductive projections.1AgdaKMasks all non-data/record type patterns if --without-K. See issue #1023.1Agda(Extract recursive calls from one clause.1Agda7Extract recursive calls from a constructor application.1Agda/Handle guardedness preserving type constructor.1Agda-Extract calls from with function application.1AgdaHandles function applications g es.1Agda Rewrite type tel -> Size< u to  tel -> Size.1Agda 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.1AgdaTraverse patterns from left to right. When we come to a projection pattern, switch usage of SIZELT constraints: on, if coinductive, off, if inductive.UNUSED1Agda compareElim e dbpat1AgdaIn 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.1Agda1 turns the result of 1 into a proper call matrix1Agda16 adds guardedness flag in the upper left corner (0,0).1Agda=Compose something with the upper-left corner of a call matrix1AgdaStripping 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.1Agda$Compute the proper subpatterns of a .1Agda compareTerm' t dbpat1AgdasubTerm# computes a size difference (Order)1AgdaCompare two variables.@The first variable comes from a term, the second from a pattern.,ZAgda$Extract recursive calls from a term.,[Agda$Extract recursive calls from a type.,\Agda*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.,gAgda/Extract recursive calls from level expressions.,SAgdaUThe function names defined in this block on top-level. (For error-reporting only.)1AgdaConstructor name.Agda>Should the constructor be treated as inductive or coinductive?Agda@All the arguments, and for every argument a boolean which is /@ iff the argument should be viewed as preserving guardedness.,Q,R,S,R,S,QNone"#$+-03457;<=>?ACNQVZ]^kAgda@Check an application of a section (top-level function, includes ").lAgda Type check a single declaration.mAgda&Type check a sequence of declarations.,kAgdaCached checkDecl,mAgdaICheck 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).,pAgdaNRun a reflected TCM computatation expected to define a given list of names.,qAgdaInstantiate all metas in d associated to  G_. Makes sense after freezing metas. Some checks, like free variable analysis, are not in  E, so they will be more precise (see issue 1099) after meta instantiation. Precondition: name has been added to signature already.,rAgdaHighlight a declaration.,sAgda Termination check a declaration.,tAgda+Check a set of mutual names for positivity.,uAgdaCheck that all coinductive records are actually recursive. (Otherwise, one can implement invalid recursion schemes just like for the old coinduction.),vAgda7Check a set of mutual names for constructor-headedness.,wAgda4Check 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.,xAgda>Freeze metas created by given computation if in abstract mode.,yAgdaType check an axiom.,zAgda,Type check a primitive function declaration.,|AgdaCheck a pragma.,}Agda=Type check a bunch of mutual inductive recursive definitions.XAll definitions which have so far been assigned to the given mutual block are returned.,~AgdaFType check the type signature of an inductive or recursive definition.,AgdaType check a module.,Agda Helper for k.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.,Agda"Check an application of a section.,AgdarType check an import declaration. Actually doesn't do anything, since all the work is done when scope checking.kAgdaName m1' of module defined by the module macro.AgdaThe module macro  tel ! m2 args.AgdaImported names and modules,AgdaName of applied module.AgdaThe module parameters.Agda(The arguments this module is applied to.Agda>The remaining module parameters (has free de Bruijn indices!).,AgdaName m1' of module defined by the module macro.AgdaThe module macro  tel ! m2 args.AgdaImported names and modulesklm,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z,{,|,},~,,,,,,kml,l,m,j,n,o,p,q,r,s,t,u,v,w,x,y,z,{,|,},~,,k,,,h,i,\None"#$+-03457;<=>?ACNQV]^hilm,kml,khiNone"#$+-03457;<=>?ACNQV]^e,Agda'Takes the name of the data/record type.1AgdaDoesn'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.1AgdazStrip unreachable clauses (replace by tUnreachable for the default). Fourth argument is the set of ints covered so far.,,,,None"#$+-03457;<=>?ACNQV]^S2Agda*Environment for naming of local variables.2Agda;Maps case tree de-bruijn indices to TTerm de-bruijn indices2AgdayTTerm de-bruijn index of the current catch all If an inner case has no catch-all clause, we use the one from its parent.2Agda5Recompile clauses with forcing translation turned on.,Agda-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.2Agda1Does not require the name to refer to a function.2Agda.Initial environment for expression generation.2Agda%Term variables are de Bruijn indices.2Agda$Case variables are de Bruijn levels.2Agda<Compile a case tree into nested case and record expressions.2 AgdaShrinks or grows the context to the given size. Does not update the catchAll expression, the catchAll expression MUST NOT be used inside cont.2 AgdaAdds lambdas until the context has at least the given size. Updates the catchAll expression to take the additional lambdas into account.2 AgdaReplace de Bruijn Level x by n new variables.2 AgdaPrecondition: Map not empty.2 AgdaeTranslate 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.2AgdaCase tree de bruijn index.AgdaTTerm de bruijn index.2Agdacase tree de bruijn levelAgdaTTerm de bruijn index,,,,None"#$+-03457;<=>?ACNQV]^2Agda4Alpha-Equivalence of patterns, ignoring dot patterns2Agda+currently we only support variable patterns2AgdaA sequence of decisions b leading to a head a.2Agdathe list of choices2Agda?This is a n^2 grouping algorithm which uses only alpha-equality2AgdaExpects a sorted list.2Agda Similar to 2.,Agda Gs are not renamed.,,None"#$&'+-03457;<=>?ACNQV]^ݞ2Agda$Name sets for classifying a pattern.2Agdaname of defined symbol2Agdavalid constructor names2Agdavalid field names2AgdaData 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.2AgdaBills the operator parser.2AgdaCompute all defined names in scope and their fixities/notations. Note that overloaded names (constructors) can have several fixities/notations. Then we  . (See issue 1194.)2AgdaYCompute all names (first component) and operators/notations (second component) in scope.2Agda`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.2AgdaView 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).2Agda$Returns the list of possible parses.2 Agda(The returned list contains all operators notations1sections that were used to generate the grammar.2!Agda(Returns zero or one classified patterns.,AgdaJParses a left-hand side, and makes sure that it defined the expected name.,AgdaParses a pattern.2"AgdaHelper function for , and ,.2#AgdaHelper function for , and ,.2$Agda,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].,Agda0Parse a list of expressions into an application.,AgdaZParse an expression into a module application (an identifier plus a list of arguments).,,,,,,,,,,None"#$+-03457;<=>?ACNQV]^޴,,None"#$+-03457;<=>?ACNQV]^ߪ,,None"#$+-03457;<=>?ACNQV]^7'2%Agda,The with clauses haven't been translated yet2&Agda rewrite e (many)2'Agdawith e (many)2(Agdapthe subclauses spawned by a with (monadic because we need to reset the local vars before checking these clauses)2)Agda4Make sure definition is in same module as signature.,Agdaas seen from inside the module,Agda*Temporary data type to scope check a file.,Agda/The file path from which we loaded this module.,AgdagThe expected module name (coming from the import statement that triggered scope checking this file).,AgdaThe file content.2*Agda$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.2+AgdaWIf a set is given, then the first name must correspond to one of the names in the set.2,AgdaWrapper to resolve a name to a ( (rather than an x).2-AgdaWIf a set is given, then the first name must correspond to one of the names in the set.,AgdaPThings that can be translated to abstract syntax are instances of this class.2.AgdaFMake sure that there are no dot patterns (called on pattern synonyms).2/AgdaCCompute the type of the record constructor (with bogus target type)20Agda BcheckModuleMacro mkApply range access concreteName modapp open dirPreserves local variables.21AgdaThe public) keyword must only be used together with open.22AgdaJComputes the range of all the "to" keywords used in a renaming directive.23AgdaScope check a I.24Agda(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.,AgdaaThis operation does not affect the scope, i.e. the original scope is restored upon completion.25AgdaLike ,F but returns the scope after the completion of the second argument.26Agda Peel off  and represent it as an .27Agda Peel off  and represent it as an  , throwing away any name.28AgdaBy default, arguments are Relevant.29AgdaAParse a possibly dotted C.Expr as A.Expr. Bool = True if dotted.2:AgdamTranslate concrete expression under at least one binder into nested lambda abstraction in abstract syntax.2;Agda'Scope check extended lambda expression.2<Agda*Scope check a module (top level function).2=AgdaACheck whether a telescope has open declarations or module macros.2>Agda,Returns the scope inside the checked module.,AgdaThe top-level module name.2?Agda@runs Syntax.Concrete.Definitions.niceDeclarations on main module2@Agda 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.2AAgdaxTurn an operator application into abstract syntax. Make sure to record the right precedences for the various arguments.,AgdaContent of interaction hole.,Agda%Top-level declarations are always  (import|open)* -- a bunch of possibly opened imports module ThisModule ... -- the top-level module of this file 23Agda Arguments of IAgda Arguments of b2>Agda The concrete name of the module.Agda The abstract name of the module.AgdaThe module telescope.Agda*The code for checking the module contents.,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,None"#$+-03457;<=>?ACNQV]^; -Agda A subset of - .-AgdaYModifier for interactive commands, specifying whether safety checks should be ignored.-Agda8Ignore additional checks, like termination/positivity...- AgdaDon't ignore any checks.-!AgdakModifier for the interactive computation command, specifying the mode of computation and result display.-%Agda[Modifier for interactive commands, specifying the amount of normalization in the output.-+AgdaParses an expression.-.AgdaOAfter a give, redo termination etc. checks for function which was complemented.-/AgdaTry to fill hole by expression.LReturns the given expression unchanged (for convenient generalization to -0).-0Agda!Try to refine hole by expression e.)This amounts to successively try to give e, e ?, e ? ?3, ... Returns the successfully given expression.-1Agda9Evaluate the given expression in the current environment -;AgdagetSolvedInteractionPoints 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.-CAgdaReturns 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.-HAgda\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.-IAgda Parse a name.-JAgda8Check whether an expression is a (qualified) identifier.-KAgda3Returns the contents of the given module or record.-LAgda4Returns the contents of the given record identifier.-MAgda)Returns the contents of the given module.-/AgdaSkip safety checks?AgdaHole.AgdaThe expression to give.Agda9If successful, the very expression is returned unchanged.-0AgdaSkip safety checks when giving?AgdaHole.Agda'The expression to refine the hole with.Agda"The successfully given expression.-KAgda"How should the types be presented?AgdaThe range of the next argument.AgdaThe module name.Agda7Module names, names paired up with corresponding types.-LAgda!Amount of normalization in types.Agda%Expression presumably of record type.Agda7Module names, names paired up with corresponding types.-MAgda!Amount of normalization in types.Agda Module name.Agda7Module names, names paired up with corresponding types.I--- -- ------------- - - ------ --!-$-#-"-%-*-)-(-'-&-+-,---.-/-0-1-2-3-4-5-6-7-8-9-:-;-<-=->-?-@-A-B-C-D-E-F-G-H-I-J-K-L-M-NI-+-,---.-/-0-1-2-%-*-)-(-'-&-3-!-$-#-"-4-5-6-- ---- ------------- - - ----- --7-8-9-:-;-<-=->-?-@-A-B-C-D-E-F-G-H-I-J-K-L-M-NNone"#$+-03457;<=>?ACNQV]^>A-a-aNone"#$+-03457;<=>?ACNQV]^A-iAgdaThe interaction loop.-kAgdaSet  to  optInputFile.-{Agda>The logo that prints when Agda is started in interactive mode.-|AgdaThe help message-b-c-f-e-d-g-h-i-j-k-l-m-n-o-p-q-r-s-t-u-v-w-x-y-z-{-|-c-f-e-d-b-g-h-i-j-k-l-m-n-o-p-q-r-s-t-u-v-w-x-y-z-{-|None"#$+-03457;<=>?ACNQV]^O-~AgdaSParse variables (visible or hidden), returning their de Bruijn indices. Used in -.-AgdaLookup the clause for an interaction point in the signature. Returns the CaseContext, the clause itself, and a list of previous clauses-Agda&Entry point for case splitting tactic.-AgdaGMake the given pattern variables visible by marking their origin as . and pattern origin as  in the +^.-Agda2Make clause with no rhs (because of absurd match).-Agda*Make a clause with a question mark as rhs.-~AgdaThe function name.Agda-The telescope of the clause we are splitting.Agda,The hole of this function we are working on.AgdaThe range of this hole.Agda9The words the user entered in this hole (variable names).Agda<The computed de Bruijn indices of the variables to split on.-}-~------}-~-----None"#$+-03457;<=>?ACNQV]^Q--------------------------------------------------------------------------------------------None"#$+-03457;<=>?ACNQV]^_-Agda6Result 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.-Agda#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.2BAgda[Names for the equality reasoning combinators Empty if any of these names is not defined.2CAgdaTemplates for error messages --------- ---------None"#$+-03457;<=>?ACNQV]^!AgdapScope checks the given module. A proper version of the module name (with correct definition sites) is returned.-AgdaJAre we loading the interface for the user-loaded file or for an import?-AgdaFor the main file.+In this case state changes inflicted by - are preserved.-AgdaFor an imported file.+In this case state changes inflicted by - are not preserved.-AgdaJIs the aim to type-check the top-level module, or only to scope-check it?-Agda"Should state changes inflicted by - be preserved?-Agda0Merge an interface into the current proof state.-AgdaIf 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 - -).-AgdaType 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 (5n). Note, however, that if the file has already been type-checked, then a complete interface is returned.-AgdaTries 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.-AgdaSee -.-AgdaA more precise variant of -[. If warnings are encountered then they are returned instead of being turned into errors.-AgdaxCheck whether interface file exists and is in cache in the correct version (as testified by the interface file hash).-Agda6Try to get the interface from interface file or cache.-Agda7Run 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.-AgdaFormats and outputs the Checking, Finished and "Loading " messages.-AgdaDPrint the highlighting information contained in the given interface.-Agda-Writes the given interface to the given file.-AgdaTries 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.-AgdaCollect 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)-AgdaReconstruct the   (not serialized) from the   (serialized).-AgdafBuilds an interface for the current module, which should already have been successfully type checked.-Agda Returns (iSourceHash, iFullHash)-AgdauTrue if the first file is newer than the second file. If a file doesn't exist it is considered to be infinitely old.-AgdaModule name of file we process.AgdaFile we process.-AgdaModule name of file we process.AgdaFile we process.AgdaBool' is: do we have to merge the interface?-AgdaModule name of file we process.AgdaFile we process.AgdaBool' is: do we have to merge the interface?-AgdaThe prefix, like Checking, Finished, Loading .AgdaThe module name.AgdaOptionally: the file name.-AgdaThe corresponding file.-AgdaThe file to type check.AgdaThe expected module name.-Agda, for the current module.AgdaOptions set in OPTIONS pragmas.)!----------------------------------------)---------!-------------------------------None"#$+-03457;<=>?ACNQV]^A-AgdaMRecords already processed modules and maps them to an internal identifier.-AgdaSupply of internal identifiers.-AgdaEdges of dependency graph.-AgdaAInternal module identifiers for construction of dependency graph.-Agda 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.-Agda%Add an arc from importer to imported..Agda4Recursively build import graph, starting from given . Modifies the state in - and returns the - of the ..AgdaEGenerate 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]^+.Agda4Copy pasted from MAlonzo.... Move somewhere else!.Agda$Sets up the compilation environment......... . . . . ............ . . . . ....!None"#$+-03457;<=>?ACNQV]^ .Agda Classify FOREIGN Haskell code..Agda3A pragma that must appear before the module header..Agda@An import statement. Must appear right after the module header..Agda1The rest. To appear after the import statements..Agda GHC backend translation pragmas..Agda'@COMPILE GHC X = data D (c | ... | c ).Agda COMPILE GHC x as f.$AgdaGet content of  FOREIGN GHC pragmas, sorted by .2: file header pragmas, import statements, rest..%Agda Classify a  FOREIGN GHC declaration..&AgdaIClassify a Haskell pragma into whether it is a file header pragma or not..'AgdaPartition a list by . attribute............ .!.".#.$.%.&.'....... .!.".#.$.....%.&.'"None"#$+-03457;<=>?ACNQV]^.5Agda0Name for definition stripped of unused arguments.[Agda:Can the character be used in a Haskell module name part (conidJ)? This function is more restrictive than what the Haskell report allows.1.+.,.-.../.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.[1.+.,.-.../.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.[#None"#$+-03457;<=>?ACNQV]^.\AgdayHaskell module names have to satisfy the Haskell (including the hierarchical module namespace extension) lexical syntax: 4modid -> [modid.] large {small | large | digit | ' }.\C 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 .A.3Precondition: The input must not start or end with ., and no two .s may be adjacent..\.\$None"#$+-03457;<=>?ACNQV]^ .].^._.`.a.b.].^._.`.a.b%None"#$+-03457;<=>?ACNQV]^˰.zAgda7Check that the main function has type IO a, for some a..|Agda,Haskell modules to be imported for BUILT-INs.~Agda)Definition bodies for primitive functions .x.y.z.{.|.}.~... .x.y.z.{.|.}.~...&None"#$+-03457;<=>?ACNQV]^........'None"#$%+-03457;<=>?ACNQV]^ /2DAgda%The number of the current code block.2EAgdaThe current column number.2FAgdaQAll alignment columns found on the current line (so far), in reverse order.2GAgdajAll alignment columns found in previous lines (in any code block), with larger columns coming first.2HAgda(The next indentation column identifier.2IAgda5Indentation columns that have actually been used.2JAgda!Count extended grapheme clusters?2KAgda"Alignment and indentation columns.2LAgdaThe column's code block.2MAgdaThe column number.2NAgdaThe column kind. / for alignment columns and / i for indentation columns, where i$ is the column's unique identifier.2OAgda+Unique identifiers for indentation columns.2PAgda Column kinds.2QAgdanUsed only for indentation (the placement of the first token on a line, relative to tokens on previous lines).2RAgda,Used both for indentation and for alignment.2SAgda Output items.2TAgdaA piece of text.2UAgdaA 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 (2V).2WAgdaThe 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.2XAgda+Says what debug information should printed.2YAgdaRun function for the LaTeX monad.2ZAgdaGives 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.2[Agda-Does the string consist solely of whitespace?2\Agda6Is the character a whitespace character distinct from '\n'?2]AgdaOReplaces all forms of whitespace, except for new-line characters, with spaces.2^AgdaIf the 2_g consists of spaces, the internal column counter is advanced by the length of the token. Otherwise, 2^ is a no-op.2`AgdaMerges 2F into 2G , resets 2E and 2F2aAgda=Registers a column of the given kind. The column is returned.2bAgdaERegisters the given column as used (if it is an indentation column).2cAgda0Alignment column zero in the current code block.2dAgda-Registers column zero as an alignment column.2eAgdaFChanges to the state that are performed at the start of a code block.2fAgdaDChanges to the state that are performed at the end of a code block.2VAgdaVA command that is used when two tokens are put next to each other in the same column.2gAgdaThe column's name.QIndentation columns have unique names, distinct from all alignment column names.2hAgda#Opens a column with the given name.2iAgdaOpens the given column.2jAgdaDOpens a special column that is only used at the beginning of lines.2kAgdaiOpens the given column, and inserts an indentation instruction with the given argument at the end of it.2lAgda,Deals with markup, which is output verbatim.2mAgda2Deals with literate text, which is output verbatim2nAgdaZDeals with code blocks. Every token, except spaces, is pretty printed as a LaTeX command.2oAgdaEscapes special characters.2pAgdaEvery 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.2qAgdaSplit multi-lines string literals into multiple string literals Isolating leading spaces for the alignment machinery to work properly.Agda/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.2rAgda&Transforms the source code into LaTeX.2sAgda!Count extended grapheme clusters?2kAgda!Indentation instruction argument.2rAgda!Count extended grapheme clusters?2tAgda!Count extended grapheme clusters?..(None"#$+-03457;<=>?ACNQV]^ .Agda!The name of the default CSS file..AgdadGenerates 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..Agda-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.2uAgda;Converts module names to the corresponding HTML file names..AgdaAGenerates a highlighted, hyperlinked version of the given module.2vAgdaAttach multiple Attributes.Agda+Constructs the web page, including headers..Agda'Constructs token stream ready to print..Agda(Constructs the HTML displaying the code..AgdaPage generator.Agda Page rendererAgda#Directory in which to create files.AgdaModule to be highlighted..AgdaURL to the CSS file.AgdaModule to be highlighted..AgdaThe contents of the module.AgdaHighlighting information.Agda(position, contents, info)..............None"#$&'+,-03457;<=>?ACFNQSTV]^/& .Agda0Optional version information to be printed with  --version..AgdaDefault options.Agda_Backend-specific command-line flags. Should at minimum contain a flag to enable the backend..Agda%Unless the backend has been enabled, runAgda- will fall back to vanilla Agda behaviour..AgdaDCalled after type checking completes, but before compilation starts..Agda3Called after module compilation has completed. The IsMain argument is NotMain if the  --no-main flag is present..AgdaBCalled 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..Agda;Called after all definitions of a module has been compiled..AgdaCompile a single definition..AgdaTrue if the backend works if --only-scope-checking is used.2wAgdaPBackends that are not included in the state, but still available to the user.^. D E F G H Inopq J K 8 9 : ; < = > ? @ A B C D E F G H J I K L M P N O Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j         8      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRjSTUVWXYZ[\]^_`abcdefghiklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_a`bcdenfghijklmopqrstuvwxyz{|}~      !"#$%&'(,+)*-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmrstuvwxyz{|}~      !"#$%&'()*+,-./0123 !!! ! ! ! ! !!!!!#!$!%!&!'!(!)!*!+!,!-!.!/!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!!!!!!!!!!!!!!"""""""""" " " " " """"""""""""""""w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""""""""""""""""""""#%#&#'#(#)#*#+#,#-#.#/#0#1#2#3#4#5#6#7#8#9#:#;#<#=#>#?#@#A#B#C#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,...None"#$+-03457;<=>?ACNQV]^%N!AgdaPrint open metas nicely..AgdaAvailable backends..AgdaThe . monad. 2x! state holds the remaining input..Agda<Used to indicate whether something should be removed or not..Agdacmd_load m argv loads the module in file m , using argv as the command-line options..Agdacmd_compile b m argv compiles the module in file m using the backend b, using argv as the command-line options..AgdaaShow unsolved metas. If there are no unsolved metas but unsolved constraints show those instead..AgdaeShows all the top-level names in the given module, along with their types. Uses the top-level scope..Agda^Shows all the top-level names in scope which mention all the given identifiers in their type..AgdaVSolve (all goals / the goal at point) whose values are determined by the constraints..AgdanParse the given expression (as if it were defined at the top-level of the current module) and infer its type..Agda{Parse and type check the given expression (as if it were defined at the top-level of the current module) and normalise it..Agda!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..AgdaITells Agda to compute token-based highlighting information for the file.KThis command works even if the file's module name does not match its location in the file system, or if the file is not scope-correct. Furthermore no file names are put in the generated output. Thus it is fine to put source code into a temporary file before calling this command. However, the file extension should be correct.If the second argument is .J, then the (presumably temporary) file is removed after it has been read..AgdalTells Agda to compute highlighting information for the expression just spliced into an interaction point..Agda5Tells Agda whether or not to show implicit arguments..Agda%Toggle display of implicit arguments..Agda Goal commandsIf the range is B, then the string comes from the minibuffer rather than the goal..Agda&Displays the current goal and context..Agda&Displays the current goal and context and# infers the type of an expression..AgdaPGrabs the current goal's type and checks the expression in the hole against it..AgdamShows all the top-level names in the given module, along with their types. Uses the scope of the given goal..Agda$Displays version of the running Agda.AgdaAbort the current computation..Does nothing if no computation is in progress..AgdaAn interactive computation..AgdaCommand queues..Agda Commands..AgdaAn . command..AgdaStop processing commands..Agda8An error message for a command that could not be parsed..Agda4Monad for computing answers to interactive commands.. is  E extended with state ...Agda.Auxiliary state of an interactive computation..AgdaThe 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..AgdaThe 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..Agda*Reset the options on each reload to these..AgdaWe 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..AgdaCommand 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.).Agda#Initial auxiliary interaction state.Agda Restore both  I and ...AgdaRestore  I, do not touch ...AgdaBuild an opposite action to 2y for state monads..Agda Opposite of 2z for .1. Use only if main errors are already catched..Agda?Lift a TCM action transformer to a CommandM action transformer..AgdaDitto, but restore state..Agda1Put a response by the callback function given by 7..Agda A Lens for ...Agda A Lens for ...Agda*Do setup and error handling for a command..AgdaRun 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)..AgdaThe next command..AgdaRuns 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..AgdafCreates a command queue, and forks a thread that writes commands to the queue. The queue is returned..AgdaConverter from the type of 2{ to .O The first paramter is part of the error message in case the parse fails./AgdaDemand an exact string./AgdaTCan the command run even if the relevant file has not been loaded into the state?/AgdaShould & be issued after the command has run?/AgdaInterpret an interaction/Agda Show warnings/AgdamSolved goals already instantiated internally The second argument potentially limits it to one specific goal./Agda"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 -./ AgdaSet  to . , if any./ Agda)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)./ Agda/Sorts interaction points based on their ranges./ Agda,Pretty-prints the type of the meta-variable./Agda5Pretty-prints the context of the given meta-variable./AgdaLCreate type of application of new helper function that would solve the goal./AgdaJDisplays the current goal, the given document, and the current context.Should not modify the state./AgdaKShows all the top-level names in the given module, along with their types./Agda^Shows all the top-level names in scope which mention all the given identifiers in their type./Agda"Explain why something is in scope./AgdaASets the command line options and updates the status information./Agda!Computes some status information.Does not change the state./Agda'Displays or updates status information.Does not change the state./Agda display_info does what  display_info' FalseA does, but additionally displays some status information (see / and /)./AgdaParses 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./AgdaLTell to highlight the code using the given highlighting info (unless it is Nothing)./Agda@Tells the Emacs mode to go to the first error position (if any)./!AgdatNote that the grammar implemented by this instance does not necessarily match the current representation of ranges..AgdarunAgdaliftAgda(reverse lift in double negative position.AgdaReturns the next command./AgdaAllow unsolved meta-variables?Agda.Full type-checking, or only scope-checking?/ Agda Should safety checks be skipped?/Agda Normalise?Agda$Print the elements in reverse order?/AgdaThe command to perform.Agda5The name to use for the buffer displaying the output.AgdaThe expression to parse.u!......................................................................................////////// / / / / ////////////////u!......................................................................................////////// / / / / ////////////////)None"#$+-03457;<=>?ACNQV]^I/5Agda/5P is a fake ghci interpreter for the Emacs frontend and for interaction tests./5c reads the Emacs frontend commands from stdin, interprets them and print the result into stdout.2|AgdakGiven strings of goals, warnings and errors, return a pair of the body and the title for the info buffer2}AgdaFConvert Response to an elisp value for the interactive emacs frontend.2~Agda Adds a "last" tag to a response.2Agda;Show an iteraction point identifier as an elisp expression./5/5None"#$+-03457;<=>?ACNQV]^P/9Agda9Environment for naming of local variables. Invariant: reverse ccCxt ++ ccNameSupply/;AgdaSupply of fresh names/<AgdaNames currently in scope/=Agda0This environment is no longer used for anything./QAgda.Initial environment for expression generation./RAgda%Term variables are de Bruijn indices./TAgda'Introduce n variables into the context./XAgdaNExtract Agda term to Haskell expression. Erased arguments are extracted as (). Types are extracted as ()./eAgda%Is the type inductive or coinductive?8&C/6/7/8/9/:/</;/=/>/?/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/[/\/]/^/_/`/a/b/c/d/e/f/g/h/i/j/k/l8/C/D/>/?/B/A/@/E/F/G/H/=/I/J/K/L/M/N/9/:/</;/8/7/O/P/Q/R/6/S/T/U/V&C/W/X/Y/Z/[/\/]/^/_/`/a/b/c/d/e/f/g/h/i/j/k/l*None"#$+-03457;<=>?ACNQV]^/Agda3Ensure that there is at most one pragma for a name./Agda*Primitives implemented in the JS Agda RTS.,/m/n/o/p/q/r/s/t/u/v/w/x/y/z/{/|/}/~//////////////////////////,/q/r/n/o/p/s/t/u/v/m/w/x/y/z/{/|/}/~//////////////////////////+None"#$+-03457;<=>?ACNQV]^/AgdaThe main function/AgdaJRun Agda with parsed command line options and with a custom HTML generator/AgdaPrint usage information./AgdaPrint version information./AgdaWhat to do for bad options./Agda6Run a TCM action in IO; catch and pretty print errors./AgdaMain/Agda8Backends only for printing usage and version informationAgdaHTML generating actionAgdaBackend interactionAgda program nameAgdaparsed command line options /////////// ///////////2]^_]`a]`b]`c]`d]`e]`f]gh]ij]kl]km]kn]^o]^p]^q]^r]^stuvtuwtujtuxtuytuztu{tu|tu}tu~tututu                                      ~{vj      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLM5NOPQRSTUVWXYHZ[\\]^_0.``abcdefghijklmnopqrstuvwxyz{|}~9~{|vj      & !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQR S z  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"w"x"y"z"{"|"}"~"###############################################################$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&'''''''''3'''''''((((((((((((((( ( ( ( ( ((((((())))********* *!"#$%&'()*+,-./012345+6+++?+7+8+9+:+;+<+=+>+?+@+A+B+C+D+E+F+G+H+IJKLJK2JKMJKNJKOJKPJKQJKR,S,T,:,;,<,=,,,,,,,3,,,,,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-{-|-}-~-------................................................////0000000000000000,1111^1111111111111111111111111222222222222222222 2 2 2 2 2 222222222222222222222 2!2"2#2$2%2&2'2(2)2*2+2,2-2.2/202122232425262728292:2;2<2=2>2?2@2A2B2C2D2E2F2G2H2I2J2K2L2M2N2O2P2Q2R2S2T2U2V2W2X2Y2Z2[2\2]2^2_2`2a2b2c2d2e3f3g3h3i3j3k3l3m3n3o3p4q4~4r4s4t4u4v4w4x4y4z5{5{5|5}5~5555555555556666q6666666667777777777888~88{8888}88j88888888888888999999999999999999999::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<< < < = = = ============>>>>>?? ?v??!?"?#?$?%?&?'?(?)?*?+,-./0123456789:;<=>?@ABCDUE@F@F@G@H@I@J@K@L@M@N@O@P@Q@RASATAUAVAWBXBYBZB[B\BBB]B]B^B_B`BaBbBaBcBdBeBfBgBhBiBjBkBlBmBnBoBpBqBrBsBtBuCvCwCxCyCzC{C|C}C}C~CCC~CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC C C C C CDDDDDDDDDDDDDDDDDDD D!D"D#D$D%D&D'D(D)D*D+D,D-D.D/D0D1D2D3D4D5D6D7D8D9D:D;D<E=E>E?E@EAEBECECEDEEEFEGEHEIEJEKELEMENEOEPEPEQERESETEUEVEWEXEYEZE[E\E]E^E_E`EEaEbEcE^EdEeEfEgEhEiEjEkElEmEnEoEpEqErEsEtEuEvEwExEyEzE{E|E}E~EEEEEEEEFFFFFFFFFFFFFFFFFFFFFFFFFFGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH H H H H H HHHHHHHHHHHHHHHHHHH H!H"H#H$H$H%H&H'H(H)H*H+H+H,H-H.H/H0H1H2H3H4H5H6H7H8H9H:H;H;H<H=H>H?H@HAHBHCHDHEHFHGHHHIHJHKHLHMHNHOHPHQHRHSHTHUHVHWHXHYHZH[H\H]H^H_H`HaHbHcHdHeHfHgHhHiHjHkHlHmHnHoHpHqHrHsHtHuHvHwHxHyHzH{H|H}H~HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH 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 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 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 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 II I I I I I I I^IIIIIII I I I J J J J J J J J JHJZJHJ J J JWJWJ 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 JJ 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 JJ J J K K K K K K K K L L L L LLL L L L !L !L "L #L $L $L %L %L &L &LaL 'L (L )L *L.L0L +L ,LgL -L .L /LiL 0L 1LL 2L 3L 4L 5L 6L 7L 8L 9L :L ;L <L =L >L ?L @L AL BL CL DL EL FL GMM HM IM JMM KM LM MM NMM OM PM QM RM SM{M TM UN VN WN,NN XN YN ZN [N \N ]N N ^N _N `N aN bN cN dN eN fN gOO hO iO jO kO lO mO nO oO pO qO rO sO tO uO vO wO wO xO yO yO zO {O |O }O ~O O O O O O O O O O O O O O O O O O O O OaOfO O O O O O O O O O O OzO ObOO OqO O O O O O O O O O O O O O O O O O O O O OO O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O PP 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 /P 0P 1P 2P 3P 4P 5P 6P 7P 8P 9P :P ;P <P =P >P ?P @P AP BP CP DP EP FP GP HP IP JP KQ LQ MQ NQ OQ PQ QQ LQ 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 wR xR yR zR {R |R }R ~R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R R 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 T T T T T T T T T\T T T T T T THTHT T TWTWT 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 TT T T T T T T T T T T T T T T T T TT T T T T T T T T T TTT T T T T T T !T "T #T $U]U %U &U 'U (U )U *U +U ,U -U .U /U 0U 1U 2U 3UU 4U 5U 6VV 7V 8V 9V :V ;V <V =V >V ?V @V AV BV CV 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 NV hV iV jV kV lV mV nV oV pV qV rV 8V sV tV 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 W W W W W W W W W W W W W W W W W W W W W WzWWbWcW WW W W W WdW W W W W W W .W sW W W W W W W W X X X X X X X X X X X X XYX X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X !X "X #X $X %X &X 'X (X )X *X +X ,X -X .X /X 0X 1X 2X 3X 4X 5X 6X 7X 8X 9X :X ;X <X =X >X ?X @X AX BX$X%G CG DG EG FG GG HG IG JG KG LG MG NG OG PG QG RG RG SG TG UG VG WG XG YG ZG [G \G ]G ]G ^G _G `G aG bG bG cG dG eG fG gG hG hGG 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 Y Y Y~Y~Y Y YY Y YY Y Y Y Y Y Y Y Y Y Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z ZXZZ Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z ZZ~ZZ ZZ Z{ZZ|Z Z Z Z Z Z Z Z Z ZZ Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z 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\{\|\}\~\\ \\\\\\\\\\\\\\\\\\\\\\\\\]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]/]]]]R]]]Q]]]] ] ]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]D]D]]]]]]] m]]]]]]]]]]]]]]]]]] ]]]]] ] ] ] ] ] ]] ] ]]]]]X]d]]]]f]]]]] ]]]] ] ]]]]]h]] ]!]"]#]$]%]&]'](])]*]+],]-].]/]0]1]1]2]3]4]5]6]5]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]{]|]}]~]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ d^^^^^^^^^^^ ^^^^_f_]_______________ ______\__ _____ _ _ _ __ ___ ___________`````` `!`"`#`$`%`&`'`(`)`*`+`,`-`.`/`0`1`2`3`4`5`6`7`8`9`:`;`<`=`>`?`@`A`B`C`D`EaFaGaHaIaJaKaLaLaMaNaOaPaQaRaSaTaUaVaWaXaYaZa[a\a]a^a^a_a`aaabacaadaeafagahbibjbkblbmbnbobpbqbrbsbtbubvbwbxbybzb{b|b}b~bbbbbbbbccccccccccccccccccccccccc&cccccccccccc c c cccc c ccccccac c.ccYccWcc~ccccccccccccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeejee e e ee{eve e eeeeeffffff}ffffGgggggggggg g!g"g#g$g%g&g'g(g)g*g+g,g-g.g/g0g1g2g3g4g5g6g7g8g9g:g;g<g=g>g?g@gAgBgBgCgDgEgFgFgGgHgIgJgKgLgMgNgOgOgPgQgRgSgTgUgVgWgXgYgZg[g\g]g^g^g_g`gagbgcgdgegfggghgigjgkglgmgngogpgqgrgsgtgugvgwgxgygzg{g|g}g~ggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghhhiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii i i i i iiiiiiiiiiiiiiiiiii i!i"i#i$i%i&i'i(i)i*i+i,i-i.i/i0i1i2i3i4i5i6i7i8i9i:i;i<i=i>i?i@iAiBiCiDiEiFiGiHiIiJiKiLiMiNiOiPiQiRiSiTiUj jVj jWjWjjXjYjYjZj[j\j\j]j^j_jj`jajbjcjdjejfjgjjhjijjjjkjljmjnjojpjqjrjsjtjujvjwjxjyjzj{j|j}j~kkkkk kkkkkkkkkkkkkkkkkkkkkkkkkklllllllllllllllll{ljlllllllllllllllllllllllllmmmmmmmmm mjmvm{mm mmmmmmmmmnnnnoooooooooooooooooooopppp!ppppppppppqqrrrrrrrrrrrrrrrrrsss t t t t tuuuuuuuuuuuuuvvvvv v!v"v#v$v%r&r's(s)w*w+w,w-w.w/w0w1w2w3w4w5w6w7w8w9w:w;w<w=w>w?w@wAwBwCwDwEwFwGw zwHwIwJwJwKwLwMwNwOwOwPwQw wRw w w w w wSwTwUwVwWwXwYwZw[w\w]w w w^w_w`wawbwcwdwewfwwwgwhwiwjwgwkwlwmwnwowpwqwrwswtwuwvw@wwww wzwwxwywzw{w|ww}w~wwwwwzwwwww w wwwww w w w .wwwwbw wdw wcw w www,wwwwwwwwwww swwwwwwwwwwwwwwwwwwwwwwww wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww w w w w www wwwwwwwwwwwwwwww ww w!w"w#w$w%w w&w'w(w)w*w+w,w-w.w/w0w1w2w3w4w5w6w7w8w9w:w;w<w w=w>w?w@wAwBwCwDwEwFwGwHwIwJwKwLwMwNwOwPwQwRwSwTwUwVwWwXwYwZw[w\x]x^x_x`xaxbxcxdyeyfygyhyiyjykylymynyoypyqyrysytyuz zvzwzxzyzzzzz{z|z}z~zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{m{{{{{{{ i{{{{{{{{{{{ {{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{|||Q|| .| N|||||||||||||||A|||||||||||||||| | | } } }M}}}}}}}}}}}}}}}}}}} }!}"}#~$~%~j~&~'~j~(~)~*~+~,~-~.~/~/~~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~VWXYZ[\\]^_`abcdefghijklmnopqrs tR   u    vwDDxyzz{|}~  d m    .   b cd$f   h%&'()+*, sgdjist{789:;       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRCSTUVWXYZ[\]^_`abcdefghijklmnopqrislkjttuvCwxyz{|}~mqn~vzw !EJKI()*+ .it         !"#  $%&'()*+,-./0123456789:;<=>?@ABC< DEFGHIJKLMNOPQRSSTU^dV !WXYZ[\] m i ^_`abbcdef  ghij k lm^nopqrsWtuvwxyz{|&}~&PhjgPQ/klKKKKKK K K K K K KKKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKdKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK@KKKKKKKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K KKKKKKKKKKKKKKKKKKKKK K!K"KK#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?KyK@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKNKOKPKQKRKSKTKUKVKWKXKYKZK[K\K]K^K_K`KaKbKcKdKdKeKfKgKhKiKjKjKkK KlKK KK K KmKnKoKpKqKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK KKKKK KkKKKKKKKKKKKKKKKKKKKKKKKKKKKKKrKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K K K K K KKKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:KkK;K;K<K=K>K?K@KAKAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKPKQKRKKKSKTKUKVKWKXKXKYKYKZK[K\K]K^K_KK`KaKbKcKcKdKeKfKgKhKiKjKkKlKmKnKoKoKpKqKrKrKsKtKuKvKwKxKyKzK{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKbKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK K KK K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKYKZK\K]K^K_K`KaKbKcKdKeKfKgKhKiKjKkKlKmKnKoKpKKqKrKsKtKuKvKwKxKyKzK:K{K|K}K~KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKbKKKK K K K K KKKKKKKKKKKKKKKKKKK K!K"K#K$K%K&K'K(K)K*K+K,K-K.K/K0K1K2K3K4K5K6K7K8K K9K:K;K<K=K>K?K@KAKBKCKDKEKFKGKHKIKJKKKLKMKNKOKPKQKRKSKTKUKVKWKXKKYKZK[K\K]K^K_K`KaKbKcKdKeKfKgKhKijkllmnopqrstuvwxyz{|}~     JJ  !"#$%&'()*+,-./0123456789:;<=>?@ABCCDEFGHIJKLMMNNOPQRSTUVWXYZ[\]^_`abccdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Y      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiY\jklmnopqrstuvwxyz{|}~}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 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!!6]!"v"w"x"y"z"{"|"}"~"""""""""""""""""""""""""""""""""""""""f""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""""########## # # # # ################### #!#"###$#%#&#'#(#)#*#+#,#-#.#/#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#g#h#i#j#k#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$K$L$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 t%2%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%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%{%|%}%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%J%%%%%%%%%%%%Z%%%%%%%%%%%%  %%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&]& & & $& & &kl &&&&&&&&&&&&&&&&&&& &!&"&#&$&%&&&'&(&)&*&+&,&-&.&/&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&{&|&}&~&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&""P&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''' ' ' ' ' ' ''''''''''''''''''' '!'"'#'$'%'&'''(')'*'+','-'.'/'0'1'2'3'4'5'6'7'8'9':';';'<'='>'?""'@'A'B'C'D'E'F'F'G'H'I'J'K'L'M'N'O'P'Q'R'S'T'U'V'W 'Xi'Y'Z'['\']'^'_'`'a'b&'c'd'e'f'g'h'i'j'k'l'm'n'o'p'q'r's't'u'u'v'w'x'y'z'{'|'}'~''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''' +'''''''''''''''''''''i(((((((((( ( ( ( ( ((((((((((((((((((( (!(!("(#($(%(&('$$((()(*(*(+(,(-(-(.(/(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(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)Z)[)\)\)])^)_)`)a)b)b)c)d)e)f)g)h)h)i)j)k)l)m)n)o)p)q)r)s)t)u)v)w)x)y)z){)|2)})~)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))####))))))))))))))))))))))))))))))))))))))))))********** * * * * ******************* *!*"*#*$*%*&*'*(*)***+*,*-*.*/*0*1*2*3*4*5*6*7*8*9*:*:*;*<*=*=*>*?*@*A*B*B*C*D*E*F*F*G*H$3$4*I*J*KA*L*M*N$J$I*O$>*P*Q*R*S$H*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*{*|*}*~*****************************************************************I**************************T**************)***********************"****+++ +++++++ + + + + +++++++++++++++++++ +!+"+#+$+$+%+&+'+(+)+*+++,+-+.+/+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 +e +f +g +h +i +j +k +l +m +n +o +p +q +r A +s +t +u +v!+w!+x!+y!+z!+{!+|!+}!+~!+!+!+!+!+!+!+!+!+!+!+!+!+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+"+#+$+$+$+$+$ $+$+$ $ $ $+$ e$ 4$+$+$+$+$+$+$+$+$+$+$+$+$+$ `%+%+%+%+%+%+%+%+%+%+&+&+&+&+&+'+''9'+'+'+'%'+'+(+(+(+(+(+(+(++ u+++++++++++++++++++,,,,,,,,,,, , , , , , ,,,,,,,,,,,,,,,,,,, ,!,",#,$,%,&,',(,),*,+,,,-,.**&&,/,0,1,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,[,\I,],^,_,`,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,{,|,}),~(/,,,,,,,,,,,,,,,,,,,,,,,,,,,~,,,,,,,,,,,,,,,,,,,,,,,,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,*,* **,*,*,*,*,*,+,+,+,+,+,+,+,+,+,+,+,,,,,,^,, +],,],,,,,],,],,]^Q]^R]^P],,]^,]47,,,,},,z,,,,,,,,,,,,,,,,,,,,,,,y,,,,,,,,,,,,,,,j,,,,,{,,|,,,,,,,,,,v,,,,,,,,,,,,,,,,,=,,,,,,,~,,,,,,,,,,],],,-]--]--]--]--]--]--]-- ]-- ]-- ]-- - - v#-$-]1:]-]1=]1O]12]1<]1;]1L]1N]1M----,,-,--]--]--1-1-,,-1-1-11-1- 1-!1-"1-#1-$1-%8-&]--']--(,--)]-*-+,--,]^--]-*-.,--/]--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-N-O-QF-RF-SF-TF-UF-VF-WF-X,--Y]-Z-[]^-\Z-]]i-^]i-_]i-`,--a]i-b]^]4-c]^-dc-e]^.]^-f]--g-h-i-g-h-j-g-h-k-g-h-lj-mj-nj-o]i-pj-qj-rk-sk-tk-uk-v]^-wm-xq-yq-zq-{q-|q-}q-~q-q-q-u-u-u-]--v-v-v-v v-v-v%uv-v-v-v-v-v-v-v-v-v-v-v-r-r-r-r-r-s-{-{-{&{&{{-{{{}{---------------------------------------%------------&&-{}-~PP-P-P-P-P-P-P-------------------------------------------.....!..... . . . . .............J...... .!.".#.$.%.&.'t.(v.).*.+.,.-.../.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.m.o.p;;.q.r.s.t.u.v.w.x.y.z.{.|.}.~..........)..].............................................%%.... . . . . . . . . . . . . % . . . . .'."................#..................#........'....,....,~..////////// / / / / ////////////C/////// *E/!*G/"/#/$/%/&/'/(/)/*/+/,/-/.///0/1/2/3/4/5/6/7'/8'/9'/:'/;'/<'/='/>'/?'/@'/A'/B'/C'.2'/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*Agda-2.5.3.20180526-CXXl0GD0KrSHeHdmOguFYEAgda.Utils.MonadAgda.Interaction.OptionsAgda.Utils.NonemptyListAgda.Utils.FunctorAgda.Utils.VarSetAgda.Utils.ExceptAgda.Utils.PrettyAgda.Compiler.BackendAgda.Interaction.Library.BaseAgda.Interaction.Options.IORefsAgda.Termination.CutOffAgda.Termination.SemiringAgda.Utils.AffineHoleAgda.Utils.BiMapAgda.Utils.CharAgda.Utils.ClusterAgda.Utils.EitherAgda.Utils.EnvironmentAgda.Utils.FloatAgda.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.IntSet.InfiniteAgda.Utils.LensAgda.Utils.IndexedList!Agda.Interaction.Options.WarningsAgda.Interaction.Options.HelpAgda.Auto.OptionsAgda.Utils.Lens.ExamplesAgda.Utils.MaybeAgda.Utils.ListTAgda.Utils.MemoAgda.Utils.MonoidAgda.Utils.NullAgda.Utils.Maybe.StrictAgda.Utils.Parser.ReadPAgda.Utils.PartialOrdAgda.Utils.POMonoidAgda.Utils.PointerAgda.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.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.BenchmarkingAgda.Syntax.Concrete.Pattern%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.DeBruijn!Agda.TypeChecking.Free.PrecomputeAgda.TypeChecking.Free.LazyAgda.TypeChecking.Free"Agda.TypeChecking.Substitute.ClassAgda.Syntax.Internal.Generic Agda.TypeChecking.CompiledClauseAgda.Syntax.Internal.DefsAgda.Syntax.AbstractAgda.Syntax.Internal.PatternAgda.Syntax.Abstract.Views$Agda.Syntax.Abstract.PatternSynonymsAgda.Syntax.Abstract.PatternAgda.Utils.TypeLevelAgda.Utils.Update Agda.Syntax.Concrete.DefinitionsAgda.Syntax.ParserAgda.TypeChecking.Free.OldAgda.Utils.WarshallAgda.Utils.Zipper Agda.VersionAgda.VersionCommitAgda.Interaction.LibraryAgda.Utils.IO.DirectoryAgda.TypeChecking.SubstituteAgda.TypeChecking.TelescopeAgda.Compiler.Treeless.SubstAgda.Compiler.Treeless.Pretty$Agda.Compiler.Treeless.GuardsToPrimsAgda.Compiler.Treeless.CompareAgda.Compiler.Treeless.Uncase!Agda.Compiler.Treeless.AsPatterns Agda.TypeChecking.Serialise.BaseAgda.TypeChecking.Rules.TermAgda.TypeChecking.Rules.Decl#Agda.TypeChecking.Rules.ApplicationAgda.TypeChecking.RewritingAgda.TypeChecking.Reduce.Fast Agda.TypeChecking.ProjectionLikeAgda.TypeChecking.PrettyAgda.TypeChecking.PolarityAgda.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.Monad.CachingAgda.TypeChecking.WarningsAgda.TypeChecking.Monad.StateAgda.TypeChecking.Monad.Mutual!Agda.TypeChecking.Monad.BenchmarkAgda.TypeChecking.DropArgsAgda.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.TypeChecking.InliningAgda.Interaction.Options.LensesAgda.TypeChecking.Monad.Trace,Agda.TypeChecking.Serialise.Instances.Common2Agda.TypeChecking.Serialise.Instances.Highlighting"Agda.TypeChecking.Monad.Statistics"Agda.TypeChecking.Monad.SizedTypes*Agda.Syntax.Translation.AbstractToConcreteAgda.Syntax.Scope.Monad!Agda.TypeChecking.Monad.SignatureAgda.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.Def+Agda.TypeChecking.Rules.Builtin.CoinductionAgda.TypeChecking.Reduce.MonadAgda.TypeChecking.Records Agda.TypeChecking.Patterns.Match#Agda.TypeChecking.Patterns.Abstract"Agda.TypeChecking.MetaVars.MentionAgda.TypeChecking.EtaContractAgda.TypeChecking.Reduce#Agda.TypeChecking.SyntacticEquality#Agda.TypeChecking.Patterns.InternalAgda.TypeChecking.LevelAgda.TypeChecking.EmptyAgda.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.MAlonzo.CoerceAgda.Compiler.CallCompilerAgda.TypeChecking.DeadCode+Agda.Syntax.Translation.ReflectedToAbstractAgda.TypeChecking.SizedTypes#Agda.TypeChecking.Rules.LHS.ProblemAgda.TypeChecking.Rules.Display'Agda.TypeChecking.Rewriting.NonLinMatchAgda.TypeChecking.QuoteAgda.TypeChecking.IrrelevanceAgda.TypeChecking.SortAgda.TypeChecking.Implicit$Agda.TypeChecking.Rules.LHS.Implicit'Agda.TypeChecking.Rules.LHS.ProblemRestAgda.TypeChecking.FunctionsAgda.TypeChecking.ForcingAgda.TypeChecking.PositivityAgda.TypeChecking.PrimitiveAgda.Compiler.Treeless.Simplify/Agda.Compiler.Treeless.EliminateLiteralPatterns(Agda.Compiler.Treeless.EliminateDefaults#Agda.TypeChecking.InstanceArguments!Agda.TypeChecking.MetaVars.Occurs$Agda.TypeChecking.Coverage.SplitTree Agda.TypeChecking.RecordPatterns Agda.TypeChecking.Coverage.MatchAgda.TypeChecking.InjectivityAgda.TypeChecking.Unquote"Agda.TypeChecking.SizedTypes.Solve!Agda.TypeChecking.Rules.LHS.UnifyAgda.TypeChecking.Rules.DataAgda.TypeChecking.Rules.LHSAgda.TypeChecking.Rules.BuiltinAgda.TypeChecking.CoverageAgda.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.IdiomBracketsAgda.Syntax.DoNotation*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.MainPretty Agda.UtilsStringDataChar Data.Maybe fromMaybe fromMaybeMData.TraversableforAgda.Utils.HashMap TraversableforM_Lazy listToMaybe maybeToList catMaybesmapMaybeforMifNullAgda.TypeChecking.SubstitutionliftSAgda.Syntax.Internal.Patterns numberPatVarsLHS APatternLikeData.MapmapKeysMonotonicQName whyInScopeforcingTranslationcompileClauses NonLinMatch'foldTermAgda.Syntax.TranslationAbstractToConcrete' Paths_AgdaAbstractSyntax AtTopLevelinteractionLoop localStateAgda.TypeChecking.MonadAgda.TypeChecking.Testsprop_splitTelescopesimplifyLevelConstraint getConTypeTreeAgda.TheTypeCheckerbaseGHC.Base<*>System.Console.GetOptOptionOptDescrOptArgReqArgNoArgArgDescr Control.Monadunless Data.FoldabletoList Data.Functor$><&><$>when<$mplusmzero MonadPluscontainers-0.5.11.0Data.IntSet.InternalfromList toDescList isSubsetOf intersection differenceunionunionsdelete singletonemptymembernull mtl-2.2.2Control.Monad.Error.Class catchError throwError MonadErrortransformers-0.5.5.0Control.Monad.Trans.ExceptExceptT runExceptT mapExceptTpretty-1.1.3.6Text.PrettyPrint.HughesPJ fullRender renderStylerenderfsepfcatcatsep<+><>$+$$$ punctuatehangnestvcathsephcatbracesbracketsparens doubleQuotesquotesrationaldoublefloatintegerintrbracelbracerbracklbrackrparenlparenequalsspacecoloncommasemiisEmpty zeroWidthText sizedTextptexttextcharDoc#Text.PrettyPrint.Annotated.HughesPJstylePStrChrribbonsPerLine lineLengthmodeStyle OneLineModeLeftMode ZigZagModePageModeModeBackend AgdaLibFileAgdaLiblibNamelibFile libIncludes libDependsLibNamelibNameForCurrentDir emptyLibFile$fShowAgdaLibFileUnicodeOrAscii UnicodeOk AsciiOnlyunicodeOrAsciiCutOff DontCutOff $fShowCutOff $fEqCutOff $fOrdCutOffSemiringaddmulzeroHasZero zeroElementintegerSemiring intSemiring boolSemiring $fHasZeroInt$fHasZeroInteger AffineHole ZeroHolesOneHole ManyHoles$fApplicativeAffineHole$fFunctorAffineHoleBiMap 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[]floatEqfloatLt iterWhile repeatWhile repeatWhileMtrampolineWhiletrampolineWhileM trampoline trampolineM iterateUntil iterateUntilMiterate' applyWhen applyUnless applyWhenM applyUnlessMDioidcompose unitComposeMeetSemiLatticemeetPlusplusToptopisTopdebug setDebuggingtracetraceM$fPlusIntIntInt Decoration traverseF distributeF<.>dmapdget$fDecoration(,)$fDecorationCompose$fDecorationIdentity TyVarBind UnkindedVarQOpQVarOpNameIdentSymbolQualUnQual ModuleNameLiteralIntFracAltExpVarConLitInfixAppAppLambdaLetIfCase ExpTypeSigNegAppFakeExpStmt Qualifier GeneratorPatPVarPLitPAsPat PWildCardPBangPatPApp PatTypeSigPIrrPatTypeTyForallTyFunTyConTyVarTyAppFakeTypeMatch GuardedRhsRhs UnGuardedRhs GuardedRhssBindsBDeclsDeriving StrictnessStrictConDecl DataOrNewDataTypeNewTypeDeclTypeDeclDataDeclTypeSigFunBindPatSynFakeDecl ImportSpecIVar ImportDecl importModuleimportQualified importSpecs ModulePragmaLanguagePragma OtherPragmaModuleunit_con $fEqDataOrNew$fEqStrictness $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 $fOrdCostIntSetbelowabovefull toFiniteList invariant$fMonoidIntSet$fSemigroupIntSet $fEqIntSet $fShowIntSetLensMapLensSetLensGetLens'lFstlSnd^.setoverfocususe.=%=%==%%= locallyStateviewlocallylocally'keyIndexZeroSucAllNilConsSomewithSomemakeAll forgetAll forgetIndex mapWithIndexlIndex lookupIndex allIndices WarningNameOverlappingTokensWarning_UnknownNamesInFixityDecl_UnknownFixityInMixfixDecl_UnknownNamesInPolarityPragmas_ PolarityPragmasButNotPostulates_UselessPrivate_UselessAbstract_UselessInstance_ EmptyMutual_EmptyAbstract_ EmptyPrivate_EmptyInstance_ EmptyMacro_EmptyPostulate_InvalidTerminationCheckPragma_InvalidNoPositivityCheckPragma_InvalidCatchallPragma_ OldBuiltin_EmptyRewritePragma_UselessPublic_UnreachableClauses_UselessInline_GenericWarning_DeprecationWarning_InversionDepthReached_TerminationIssue_CoverageIssue_CoverageNoExactSplit_NotStrictlyPositive_UnsolvedMetaVariables_UnsolvedInteractionMetas_UnsolvedConstraints_GenericNonFatalError_SafeFlagPostulate_SafeFlagPragma_SafeFlagNonTerminating_SafeFlagTerminating_SafeFlagPrimTrustMe_SafeFlagNoPositivityCheck_SafeFlagPolarity_ UserWarning_ WarningMode _warningSet _warn2Error warningSet warn2ErrordefaultWarningSetdefaultWarningModewarningModeUpdate warningSetsstring2WarningNamewarningName2String usageWarning$fEqWarningName$fOrdWarningName$fShowWarningName$fReadWarningName$fEnumWarningName$fBoundedWarningName$fEqWarningMode$fShowWarningModeHelp GeneralHelpHelpFor allHelpTopicshelpTopicUsagestring2HelpTopic $fEqHelpTopic$fShowHelpTopic$fEqHelp $fShowHelp AutoTokenMRDLTSH AutoOptions autoHints autoTimeOutautoPickautoMode autoHintModeTimeOut getTimeOutHints AutoHintModeAHMNone AHMModuleMNormal 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 $fEnumMaxNat NonemptyList:!headNetailNeunionNe zipWithNezipNe caseListNe listCaseNeelemNe$fShowNonemptyList$fMonadNonemptyList$fApplicativeNonemptyList$fSemigroupNonemptyList$fEqNonemptyList$fOrdNonemptyList$fFunctorNonemptyList$fFoldableNonemptyList$fTraversableNonemptyList$fDataNonemptyListNullifNullMwhenNull unlessNull whenNullM unlessNullM $fNullDoc $fNullMaybe $fNullSet $fNullSeq $fNullHashSet $fNullHashMap $fNullMap $fNullIntSet $fNullIntMap $fNullBag$fNull[]$fNullByteString $fNull(,)$fNull()#strict-0.3.2-GUMMwuTAWLDDoRWXG04D6ZData.Strict.MaybefromJustisJust isNothingmaybeMaybeJustNothingtoStricttoLazy $fBinaryMaybe $fNFDataMaybe$fTraversableMaybe$fFoldableMaybe $fMonoidMaybe$fSemigroupMaybe$fGenericMaybe $fDataMaybeReadPparsegetlookpfail+++<++gathersatisfystringmunchmunch1choice 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$fFunctorInclusionLeftClosedPOMonoidinverseComposePOMonoid POSemigroupPtrnewPtrderefPtr updatePtrsetPtr updatePtrM $fDataIORef $fNFDataPtr $fHashablePtr$fOrdPtr$fEqPtr$fTraversablePtr $fFoldablePtr $fFunctorPtr $fShowPtr $fDataPtrpretty prettyPrec prettyList prettyShowpwordsfwords prettyList_mparensalign multiLineTextpshow $fDataDoc$fPrettyNonemptyList $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 $fSemiRing()$fStarSemiRingMaybe$fStarSemiRing() 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 SubscriptsubscriptAllowedisSubscriptDigittoSubscriptDigitfromSubscriptDigit nextSuffix suffixView addSuffix nameVariantThreeOneTwo partition3 $fEqThree $fOrdThree $fShowThree$fBoundedThree $fEnumThreeTrie everyPrefix unionWith insertWithadjusttoListOrderedBy mapSubTries lookupPath lookupTriefiltervalueAt $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'zipWithKeepRestnubOnuniqOn commonSuffix commonPrefixeditDistanceSpec editDistanceStrunStrquotehaskellStringLiteral 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$fEqLisp==<<whenMunlessMguardMifMifNotMand2MandMallMor2MorManyMaltM1 orEitherMmapM'forM' mapMaybeM forMaybeM dropWhileM partitionM fromMaybeMP catMaybesMPfinallytryMaybebracket_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(,)$fHasRangeNonemptyList $fHasRange[]$fHasRangeBool$fHasRangeRange'$fHasRangeInterval' $fSetRange[]$fSetRangeRange'$fKillRangeEither$fKillRangeMaybe$fKillRange(,,,)$fKillRange(,,)$fKillRange(,)$fKillRangeSet$fKillRangeMap $fKillRange[]$fKillRangeNonemptyList$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 parseFlagsparseWarningName 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$fShowParseResult 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 argInfoHidingargInfoModality argInfoOriginargInfoFreeVariablesLensFreeVariablesgetFreeVariablessetFreeVariablesmapFreeVariables FreeVariables UnknownFVsKnownFVs LensOrigin getOrigin setOrigin mapOrigin WithOriginwoOriginwoThingOrigin UserWrittenInserted Reflected CaseSplit LensRelevance getRelevance setRelevance mapRelevance RelevanceRelevant NonStrict Irrelevant LensQuantity getQuantity setQuantity mapQuantityQuantity Quantity0 Quantityω LensModality getModality setModality mapModalityModality modRelevance modQuantity LensHiding getHiding setHiding mapHiding WithHidingwhHidingwhThingHidingHiddenInstance NotHidden Overlappable YesOverlap NoOverlap Induction Inductive CoInductiveHasEtaNoEtaYesEtaDelayed NotDelayed mergeHidingvisible notVisiblehiddenhidehideOrKeepInstance makeInstance makeInstance'isOverlappable isInstance sameHidingdefaultModalitygetRelevanceModsetRelevanceModmapRelevanceModgetQuantityModsetQuantityModmapQuantityModdefaultQuantity allRelevancesdefaultRelevance isRelevant isIrrelevant isNonStrict moreRelevantunusableRelevancecomposeRelevanceinverseComposeRelevanceirrToNonStrictnonStrictToRelnonStrictToIrrunknownFreeVariablesnoFreeVariablesoneFreeVariablefreeVariablesFromListhasNoFreeVariablesdefaultArgInfogetHidingArgInfosetHidingArgInfomapHidingArgInfogetModalityArgInfosetModalityArgInfomapModalityArgInfogetOriginArgInfosetOriginArgInfomapOriginArgInfogetFreeVariablesArgInfosetFreeVariablesArgInfomapFreeVariablesArgInfo defaultArg withArgsFromwithNamedArgsFrom argFromDom domFromArg defaultDomunnamednamednamedArgdefaultNamedArgupdateNamedArg setNamedArgunrangedrawNameToStringstringToRawName bestConInfo noPlaceholderdefaultImportDirisDefaultImportDirsetImportedName$fKillRangeDelayed$fNFDataHasEta$fKillRangeHasEta$fHasRangeHasEta$fNFDataInduction$fKillRangeInduction$fHasRangeInduction$fShowInduction$fNFDataOverlappable$fMonoidOverlappable$fSemigroupOverlappable$fNFDataHiding$fKillRangeHiding$fMonoidHiding$fSemigroupHiding$fNFDataWithHiding$fKillRangeWithHiding$fSetRangeWithHiding$fHasRangeWithHiding$fApplicativeWithHiding$fDecorationWithHiding$fLensHidingWithHiding$fLensHidingHiding$fNFDataQuantity$fKillRangeQuantity$fPOMonoidQuantity$fPOSemigroupQuantity$fPartialOrdQuantity $fOrdQuantity$fMonoidQuantity$fSemigroupQuantity$fLensQuantityQuantity$fLeftClosedPOMonoidRelevance$fPOMonoidRelevance$fPOSemigroupRelevance$fMonoidRelevance$fSemigroupRelevance$fPartialOrdRelevance$fOrdRelevance$fNFDataRelevance$fKillRangeRelevance$fLensQuantityModality$fNFDataModality$fKillRangeModality$fPOMonoidModality$fPOSemigroupModality$fPartialOrdModality$fMonoidModality$fSemigroupModality$fLensModalityModality$fLensRelevanceRelevance$fLensRelevanceModality$fNFDataOrigin$fKillRangeOrigin$fNFDataWithOrigin$fKillRangeWithOrigin$fSetRangeWithOrigin$fHasRangeWithOrigin$fDecorationWithOrigin$fLensOriginWithOrigin$fLensOriginOrigin$fNFDataFreeVariables$fMonoidFreeVariables$fSemigroupFreeVariables $fLensFreeVariablesFreeVariables$fLensQuantityArgInfo$fLensRelevanceArgInfo$fLensFreeVariablesArgInfo$fLensOriginArgInfo$fLensModalityArgInfo$fLensHidingArgInfo$fNFDataArgInfo$fKillRangeArgInfo$fLensArgInfoArgInfo$fLensQuantityArg$fLensRelevanceArg$fLensFreeVariablesArg$fLensOriginArg$fLensModalityArg$fLensHidingArg$fLensArgInfoArg $fNFDataArg $fShowArg$fEqArg$fKillRangeArg $fSetRangeArg $fHasRangeArg$fDecorationArg$fUnderscoreDoc$fUnderscoreByteString$fUnderscore[]$fLensQuantityDom$fLensRelevanceDom$fLensFreeVariablesDom$fLensOriginDom$fLensModalityDom$fLensHidingDom$fLensArgInfoDom $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 $fDataHasEta $fShowHasEta $fEqHasEta $fOrdHasEta$fDataInduction $fEqInduction$fOrdInduction$fDataOverlappable$fShowOverlappable$fEqOverlappable$fOrdOverlappable $fDataHiding $fShowHiding $fEqHiding $fOrdHiding$fDataWithHiding$fEqWithHiding$fOrdWithHiding$fShowWithHiding$fFunctorWithHiding$fFoldableWithHiding$fTraversableWithHiding$fDataQuantity$fShowQuantity$fGenericQuantity $fEqQuantity$fEnumQuantity$fBoundedQuantity$fDataRelevance$fShowRelevance $fEqRelevance$fEnumRelevance$fBoundedRelevance$fGenericRelevance$fDataModality $fEqModality $fOrdModality$fShowModality$fGenericModality $fDataOrigin $fShowOrigin $fEqOrigin $fOrdOrigin$fDataWithOrigin$fEqWithOrigin$fOrdWithOrigin$fShowWithOrigin$fFunctorWithOrigin$fFoldableWithOrigin$fTraversableWithOrigin$fDataFreeVariables$fEqFreeVariables$fOrdFreeVariables$fShowFreeVariables $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 isOpenMixfix 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 nameFixity unambiguousheadAmbQ isAmbiguousgetUnambiguousisAnonymousModuleName 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 $fIsProjPVoid$fIsProjPNamed $fIsProjPArg $fMkName[]$fDataModuleName$fFunctorQNamed$fFoldableQNamed$fTraversableQNamed$fEqAmbiguousQName$fOrdAmbiguousQName$fDataAmbiguousQName$fShowAmbiguousQName $fShowQNamedLitNat LitWord64LitFloat LitStringLitCharLitQNameLitMeta showString' showChar' compareFloat$fNFDataLiteral$fKillRangeLiteral$fSetRangeLiteral$fHasRangeLiteral $fOrdLiteral$fPrettyLiteral $fShowLiteral $fDataLiteral isUnreachableTError TUnreachableTAltTAConTAGuardTALitaConaArityaBodyaGuardaLitCaseInfocaseLazycaseTypeCaseTypeCTDataCTNatCTIntCTCharCTStringCTFloatCTQNameTPrimPAddPAdd64PSubPSub64PMulPMul64PQuotPQuot64PRemPRem64PGeqPLtPLt64PEqIPEq64PEqFPEqSPEqCPEqQPIfPSeqPITo64P64ToITTermTVarTDefTAppTLamTLitTConTLetTCaseTUnitTSortTErasedTCoerceArgsCompiled cTreeless cArgUsageTPFnTPOpisPrimEqmkTApptAppViewtLetViewtLamViewmkTLammkLettIntintView word64ViewtPlusK tNegPlusK plusKView negPlusKViewtOp tUnreachable tIfThenElse$fKillRangeCompiled$fUnreachableTTerm$fUnreachableTAlt $fDataTPrim $fShowTPrim $fEqTPrim $fOrdTPrim$fDataCaseType$fShowCaseType $fEqCaseType $fOrdCaseType$fDataCaseInfo$fShowCaseInfo $fEqCaseInfo $fOrdCaseInfo $fDataTError $fShowTError $fEqTError $fOrdTError $fDataTTerm $fShowTTerm $fEqTTerm $fOrdTTerm $fDataTAlt $fShowTAlt$fEqTAlt $fOrdTAlt$fDataCompiled$fShowCompiled $fEqCompiled $fOrdCompiled 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 SymEndCommentKeywordKwLetKwInKwWhereKwDataKwCoDataKwDo 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 KwINJECTIVEKwINLINE KwNOINLINEKwETAKwNO_TERMINATION_CHECK KwTERMINATINGKwNON_TERMINATINGKwWARNING_ON_USAGE KwMEASURE KwDISPLAY KwREWRITE KwQuoteGoalKwQuoteContextKwQuote KwQuoteTerm KwUnquote KwUnquoteDecl KwUnquoteDefKwSyntax KwPatternSynKwTactic KwCATCHALLKwNO_POSITIVITY_CHECK KwPOLARITYlayoutKeywords$fHasRangeToken $fEqKeyword $fShowKeyword $fEqSymbol $fShowSymbolPrecedenceStack PrecedenceTopCtxFunctionSpaceDomainCtxLeftOperandCtxRightOperandCtx FunctionCtx ArgumentCtxInsideOperandCtx WithFunCtx WithArgCtx DotPatternCtxParenPreference PreferParenPreferParenlessFixity fixityRange fixityLevel fixityAssoc AssociativityNonAssoc LeftAssoc RightAssocPrecedenceLevel UnrelatedRelatedNotationSection sectNotationsectKind sectLevel sectIsSection NewNotationnotaName notaNames notaFixitynotationnotaIsOperatorThingWithFixity theFixity theNotation theNameRangenamesToNotationuseDefaultFixity notationNamessyntaxOfmergeNotations noSectionnoFixity defaultFixity preferParenpreferParenlesspushPrecedenceheadPrecedence argumentCtx_ opBrackets opBrackets' lamBrackets appBrackets appBrackets'withAppBrackets piBracketsroundFixBrackets _notaFixity _fixityAssoc _fixityLevel$fNFDataFixity$fKillRangeFixity$fHasRangeFixity $fOrdFixity $fEqFixity$fNFDataFixity'$fKillRangeFixity' $fEqFixity'$fKillRangeThingWithFixity$fPrettyPrecedence$fEqPrecedenceLevel$fOrdPrecedenceLevel$fShowPrecedenceLevel$fDataPrecedenceLevel$fEqAssociativity$fOrdAssociativity$fShowAssociativity$fDataAssociativity $fDataFixity $fShowFixity$fShowNewNotation$fShowNotationSection $fDataFixity' $fShowFixity'$fFunctorThingWithFixity$fFoldableThingWithFixity$fTraversableThingWithFixity$fDataThingWithFixity$fShowThingWithFixity$fEqParenPreference$fOrdParenPreference$fShowParenPreference$fDataParenPreference$fShowPrecedence$fDataPrecedence$fEqPrecedenceRangesfromtorangesInvariant overlappingrangeToPositionsrangesToPositionsrToRrangeToEndPointsminus $fEqRange $fOrdRange $fShowRange $fEqRanges $fShowRangesDAGdagGraphdagComponentMap dagNodeMapNodessrcNodestgtNodesallNodesEdgesourcetargetlabelGraphgraphedges neighbours neighboursMap edgesFromedgesTodiagonalnodes sourceNodes targetNodes computeNodes isolatedNodesdiscreteacyclic fromNodes fromNodeSet fromEdges fromEdgesWith insertEdgeinsertEdgeWith unionsWith mapWithEdge transposeEdge transposeclean removeNodes removeNode removeEdge filterEdges composeWithsccs'sccs dagInvariant oppositeDAG reachablesccDAG'sccDAG reachableFromreachableFromSetwalkSatisfyingcomplete completeIter1gaussJordanFloydWarshallMcNaughtonYamadaReference(gaussJordanFloydWarshallMcNaughtonYamada $fShowGraph $fPrettyGraph$fFunctorGraph $fPrettyEdge $fEqGraph$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$fBoundedOccurrenceAppView HoleContent HoleContent'HoleContentExprHoleContentRewritePragma OptionsPragma BuiltinPragma RewritePragmaCompiledDataPragmaCompiledTypePragmaCompiledPragmaCompiledExportPragmaCompiledJSPragmaCompiledUHCPragmaCompiledDataUHCPragmaHaskellCodePragma ForeignPragma CompilePragma StaticPragmaInjectivePragma InlinePragma ImportPragmaImportUHCPragmaImpossiblePragma EtaPragmaTerminationCheckPragmaWarningOnUsageCatchallPragma DisplayPragmaNoPositivityCheckPragmaPolarityPragma OpenShortHandDoOpenDontOpenModuleApplication SectionAppRecordModuleIFS DeclarationField FunClauseDataSig RecordSigInfix PatternSynMutualPrivate InstanceBMacroOpenImport ModuleMacro UnquoteDecl UnquoteDefTypeSignatureOrInstanceBlock TypeSignatureAsNameasNameasRange ExprWhere LamClauselamLHSlamRHSlamWhere lamCatchAll WhereClause'NoWhereAnyWhere SomeWhere WhereClauseRHS' AbsurdRHSRHSLHSCoreLHSHeadLHSProjLHSWith lhsDefNamelhsPats lhsDestructor lhsPatsLeftlhsFocuslhsHeadlhsWithPatternsWithExpr RewriteEqnlhsOriginalPattern lhsRewriteEqn lhsWithExpr Telescope TypedBinding'TBind TypedBinding BoundNameBName boundName boundLabel bnameFixityTypedBindings' TypedBindings LamBinding' DomainFree DomainFull LamBindingDoStmtDoBindDoThenDoLetIdentPQuotePAppPRawAppPOpAppPHiddenP InstancePParenPWildPAsPRecP EllipsisPWithPExpr QuestionMarkRawAppOpAppWithApp HiddenArg InstanceArg AbsurdLam ExtendedLamFunSetNRec RecUpdateParen IdiomBracketsDoBlockAbsurdAsDotETel QuoteGoal QuoteContextQuote QuoteTermTacticUnquoteDontCareEqualEllipsisRecordAssignmentsRecordAssignmentModuleAssignment _qnameModA _exprModA_importDirModAFieldAssignmentFieldAssignment' _nameFieldA _exprFieldASyntaxBindingLambdaOrdinary fromOrdinary nameFieldA exprFieldA mkBoundName_ mkBoundName countTelVarstopLevelModuleNamespanAllowedBeforeModuleappView$fNFDataFieldAssignment'$fKillRangeFieldAssignment'$fHasRangeFieldAssignment'$fNFDataTypedBindings'$fNFDataBoundName$fKillRangeBoundName$fHasRangeBoundName$fNFDataLamBinding' $fNFDataRHS'$fNFDataWhereClause'$fNullWhereClause'$fNFDataAsName$fKillRangeAsName$fHasRangeAsName$fNFDataDoStmt$fNFDataLamClause$fNFDataModuleAssignment $fNFDataLHS $fNFDataOpApp$fNFDataModuleApplication$fNFDataTypedBinding'$fNFDataPragma$fNFDataDeclaration$fNFDataPattern $fNFDataExpr$fKillRangeWhereClause'$fKillRangeTypedBindings'$fKillRangeTypedBinding'$fKillRangeRHS'$fKillRangePragma$fKillRangePattern$fKillRangeOpApp$fKillRangeModuleApplication$fKillRangeDoStmt$fKillRangeLamClause$fKillRangeLHS$fKillRangeLamBinding'$fKillRangeExpr$fKillRangeDeclaration$fKillRangeModuleAssignment$fSetRangePattern$fSetRangeTypedBindings'$fHasRangePattern$fHasRangePragma$fHasRangeDoStmt$fHasRangeLamClause$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$fDataLamClause $fDataDoStmt$fDataModuleAssignment $fDataOpApp$fFunctorOpApp$fFoldableOpApp$fTraversableOpApp$fFunctorHoleContent'$fFoldableHoleContent'$fTraversableHoleContent'TelSpecialCharacters_dbraces_lambda_arrow_forallQspecialCharactersbraces'dbracesforallQbracesAndSemicolonsarrowlambda prettyHidingprettyRelevancesmashTel prettyOpApp$fPrettyImportedName'$fPrettyUsing'$fPrettyImportDirective'$fPrettyPattern $fPrettyNamed $fPrettyArg$fPrettyFixity'$fPrettyGenPart$fPrettyFixity$fPrettyPragma$fPrettyOpenShortHand$fPrettyDeclaration$fPrettyDoStmt$fPrettyModuleApplication$fPrettyLHSCore $fPrettyLHS$fPrettyWhereClause' $fPrettyRHS'$fPrettyTypedBinding'$fPrettyTypedBindings'$fPrettyLamBinding'$fPrettyBoundName$fPrettyLamClause$fPrettyModuleAssignment$fPrettyFieldAssignment'$fPrettyEither$fPrettyMaybePlaceholder $fPrettyOpApp$fPrettyInduction$fPrettyRelevance$fPrettyWithHiding$fPrettyThingWithFixity$fShowModuleApplication$fShowWhereClause' $fShowLHSCore $fShowLHS $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 $fShowPhase CPatternLike foldrCPatterntraverseCPatternAtraverseCPatternMLHSPatternViewLHSAppPLHSWithPIsWithPisWithP HasEllipsis hasEllipsis IsEllipsis isEllipsislhsPatternView lhsCoreApp lhsCoreWithlhsCoreAddSpinemapLhsOriginalPatternmapLhsOriginalPatternM hasCopatterns foldCPatternpreTraverseCPatternMpostTraverseCPatternM mapCPattern patternQNames patternNameshasWithPatterns isWithPatternnumberOfWithPatterns hasEllipsis'$fIsEllipsisPattern$fHasEllipsisLHS$fHasEllipsisPattern$fIsWithPNamed $fIsWithPArg$fIsWithPPattern$fCPatternLikeFieldAssignment'$fCPatternLikeMaybe$fCPatternLike[]$fCPatternLikeNamed$fCPatternLikeArg$fCPatternLike(,)$fCPatternLikePatternNKInPrePostNon OperatorType ParseSectionsDoNotParseSectionsIsExprexprView unExprViewExprViewLocalVWildVOtherVAppVOpAppV HiddenArgV InstanceArgVLamVParenV placeholdermaybePlaceholdersatNoPlaceholderpartPatLeastTwoPartswildOrUnqualifiedNameopPargsPappP$fIsExprPattern $fIsExprExpr$fHasRangeExprView$fEqParseSections$fShowParseSectionsExprLikemapExpr traverseExprfoldExpr$fExprLikeDeclaration$fExprLikeModuleApplication$fExprLikeDoStmt$fExprLikeLamClause $fExprLikeLHS$fExprLikeTypedBindings'$fExprLikeLamBinding'$fExprLikeOpApp$fExprLikeModuleAssignment$fExprLikeFieldAssignment'$fExprLikeExpr$fExprLike(,,,)$fExprLike(,,) $fExprLike(,)$fExprLikeWhereClause'$fExprLikeRHS'$fExprLikeTypedBinding'$fExprLikeEither$fExprLikeMaybePlaceholder$fExprLikeMaybe $fExprLike[] $fExprLikeArg$fExprLikeNamed$fExprLikeBool$fExprLikeQName$fExprLikeNameCompressedFilerangesHighlightingInfoFilemapping TokenBasedNotOnlyTokenBasedDefinitionSite defSiteModule defSitePos defSiteHere defSiteAnchorAspectsaspect otherAspectsnotedefinitionSite tokenBased OtherAspect DottedPattern UnsolvedMetaUnsolvedConstraintTerminationProblemPositivityProblemReachabilityProblemCoverageProblemIncompletePatternCatchallClause TypeChecksNameKindFunctionArgumentAspectNumber PrimitiveType parserBasedseveralmerge smallestPostoMapcompressedFileInvariantcompress decompressnoHighlightingInRange singletonCseveralCmergeCsplitAtCselectC smallestPosC$fEqDefinitionSite$fMonoidTokenBased$fSemigroupTokenBased$fMonoidAspects$fSemigroupAspects $fEqAspects $fMonoidFile$fSemigroupFile$fMonoidCompressedFile$fSemigroupCompressedFile $fEqNameKind$fShowNameKind $fEqAspect $fShowAspect$fEqOtherAspect$fShowOtherAspect$fEnumOtherAspect$fBoundedOtherAspect$fShowDefinitionSite$fEqTokenBased$fShowTokenBased $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_VersionMakeCaseVariantExtendedLambdaRemoveTokenBasedHighlightingRemoveHighlightingKeepHighlightingResponseResp_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 UsingOrHiding ResolvedNameVarName DefinedName FieldNameConstructorNamePatternSynResName UnknownName resolvedVarresolvedBinderAbstractModule AbsModuleamodName amodLineage AbstractNameAbsName anameName anameKind anameLineage WhyInScopeDefinedOpenedApplied KindOfNameConNameFldNameDefNamePatternSynName MacroName QuotableNameInScope inScopeTag InScopeTagNameTag ModuleTag InScopeSetModulesInScope NamesInScope ThingsInScope NameSpacensNames nsModules nsInScopeLocalVarlocalVar localBinderlocalShadowedByBinder LambdaBound PatternBoundLetBound LocalVars ScopeInfo scopeCurrent scopeModulesscopeVarsToBind scopeLocalsscopePrecedencescopeInverseNamescopeInverseModule scopeInScopeScopeNameSpaces NameSpaceId PrivateNSPublicNS ImportedNSOnlyQualifiedNSScope scopeName scopeParentsscopeNameSpaces scopeImportsscopeDatatypeModulelocalNameSpacenameSpaceAccessscopeNameSpaceupdateScopeNameSpacesupdateScopeNameSpacesM shadowLocalnotShadowedLocalnotShadowedLocalsupdateVarsToBind setVarsToBindupdateScopeLocalssetScopeLocals 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$fPrettyResolvedName$fDataNameSpaceId$fEqNameSpaceId$fBoundedNameSpaceId$fEnumNameSpaceId$fShowNameSpaceId $fDataBinder $fShowBinder $fEqBinder$fEqKindOfName$fShowKindOfName$fDataKindOfName$fEnumKindOfName$fBoundedKindOfName$fDataWhyInScope$fShowWhyInScope$fDataAbstractName$fShowAbstractName$fDataLocalVar$fShowLocalVar$fDataAbstractModule$fShowAbstractModule$fDataNameSpace $fEqNameSpace$fShowNameSpace $fDataScope $fEqScope $fShowScope$fDataScopeInfo$fShowScopeInfo$fDataResolvedName$fShowResolvedName$fEqResolvedName$fEqAllowAmbiguousNamesdontDescendIntoinstanceUniverseBiT'instanceTransformBiMT' ConPatInfo patOriginpatInfopatLazyPatInfoPatRangeLHSInfoLHSRange MutualInfomutualTermCheckmutualPositivityCheck mutualRangeDeclInfodeclName declRangeDefInfo defFixity defAccess defAbstract defInstancedefMacrodefInfoLetInfoLetRange ModuleInfo minfoRange minfoAsTo minfoAsNameminfoOpenShortminfoDirectiveAppInfoappRange appOrigin appParensExprInfo ExprRangeMetaInfo metaRange metaScope metaNumbermetaNameSuggestion emptyMetaInfo exprNoRangedefaultAppInfodefaultAppInfo_ mkDefInfomkDefInfoInstance patNoRange$fKillRangeMetaInfo$fHasRangeMetaInfo$fKillRangeExprInfo$fHasRangeExprInfo$fLensOriginAppInfo$fKillRangeAppInfo$fHasRangeAppInfo$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 $fDataAppInfo $fShowAppInfo $fEqAppInfo $fOrdAppInfo$fDataModuleInfo$fEqModuleInfo $fDataLetInfo $fShowLetInfo $fEqLetInfo $fNullLetInfo$fDataDeclInfo$fShowDeclInfo $fEqDeclInfo $fDataDefInfo $fShowDefInfo $fEqDefInfo$fDataMutualInfo$fShowMutualInfo$fEqMutualInfo $fDataLHSInfo $fShowLHSInfo $fEqLHSInfo $fNullLHSInfo $fDataPatInfo $fEqPatInfo $fNullPatInfo $fShowPatInfo$fSetRangePatInfo$fHasRangePatInfo$fKillRangePatInfo$fDataConPatInfo$fEqConPatInfo$fShowModuleInfoDiagonalMatrixunMMIxrowcolSizerowscolssquaresupSize 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 moduleParsermoduleNameParserholeContentParser splitOnDots$fEqRecordDirective$fShowRecordDirective$fShowRHSOrTypeSigs withInterval_end openBrace closeBraceTermSizetermSizetsize IsProjElim isProjElimSuggestsuggestSgTelsgTel TelToArgs telToArgsListTelListTel' EqualityView EqualityType OtherTypeeqtSorteqtName eqtParamseqtTypeeqtLhseqtRhsPatternSubstitution Substitution Substitution'IdSEmptyS:# StrengthenWk PatternVars patternVarsConPatternInfo conPRecordconPTypeconPLazyDeBruijnPatternDBPatVar dbPatVarName dbPatVarIndexPattern' PatOrigin PatOSystem PatOSplitPatOVarPatODotPatOWildPatOConPatORecPatOLit PatOAbsurd PatVarNameclauseLHSRangeclauseFullRange clauseTelnamedClausePats clauseBody clauseTypeclauseCatchallclauseUnreachableBlocked_ NotBlockedtheBlockingMetaignoreBlockingblockingStatusStuckOn Underapplied AbsurdMatchMissingClausesReallyNotBlocked LevelAtom MetaLevel BlockedLevel NeutralLevelUnreducedLevel PlusLevel ClosedLevelMaxInfSizeUnivPiSortUnivSortMetaSTeleEmptyTel ExtendTelLensSortlensSortgetSortType'El_getSortunElNoAbsabsNameunAbsArgNameProjConInfoMetaV LensConName getConName setConName mapConNameConHeadconName conInductive conFields NamedArgsargNameToStringstringToArgNameappendArgNames nameToArgNamestuckOn clausePatspatVarNameToStringnameToPatVarNamevarPdotP namedVarP namedDBVarPnoConPatternInfotoConPatternInfofromConPatternInfo patternOriginproperlyMatchingisEqualityType absurdBody isAbsurdBodyabsurdPatternNameisAbsurdPatternNamevar typeDontCaretopSortsortvarSortlevelSucmkTypeisSortimpossibleTermhackReifyToMetaisHackReifyToMeta mapAbsNamesM mapAbsNamesreplaceEmptyName telFromList' telFromList telToList blockingMetablocked notBlocked stripDontCarearitynotInScopeNameunNotInScopeNameunSpineunSpine'hasElims argFromElim isApplyElim 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$fKillRangePatOrigin$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$fDataPatOrigin$fShowPatOrigin $fEqPatOrigin$fDataDBPatVar$fShowDBPatVar $fEqDBPatVar$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$fDeBruijnTermPrecomputeFreeVarsprecomputeFreeVarsprecomputeFreeVars_precomputedFreeVars$fPrecomputeFreeVars(,)$fPrecomputeFreeVarsMaybe$fPrecomputeFreeVars[]$fPrecomputeFreeVarsElim'$fPrecomputeFreeVarsType'$fPrecomputeFreeVarsLevelAtom$fPrecomputeFreeVarsPlusLevel$fPrecomputeFreeVarsLevel$fPrecomputeFreeVarsSort$fPrecomputeFreeVarsTerm$fPrecomputeFreeVarsAbs$fPrecomputeFreeVarsDom$fPrecomputeFreeVarsArg freeVars'FreeM SingleVarVariableFreeEnv feIgnoreSorts feFlexRig feRelevance feSingleton IgnoreSorts IgnoreNotIgnoreInAnnotations IgnoreAllVarMap theVarMap TheVarMapIsVarSet withVarOccVarOcc varFlexRig varRelevanceFlexRigFlexible WeaklyRigid Unguarded StronglyRigidMetaSetcomposeFlexRig maxVarOcc topVarOcc botVarOcc composeVarOcc mapVarMap initFreeEnvrunFreeMvariablesubVarbindbind'gogoRelunderConstructor$fLensRelevanceVarOcc$fIsVarSetVarMap$fMonoidVarMap$fSemigroupVarMap$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 $fShowVarMap$fSingletonVarMap VarCounts varCounts NoOccurrence IrrelevantlyFVstronglyRigidVars unguardedVarsweaklyRigidVars flexibleVarsirrelevantVars rigidVars relevantVarsallVars occurrencerunFreefreeInfreeInIgnoringSortsrelevantInIgnoringSortAnn relevantIn isBinderUsedclosed allFreeVarsallFreeVarsWithOccallRelevantVarsIgnoringallRelevantVars $fIsVarSetAll $fIsVarSetAny $fIsVarSet[]$fIsVarSetIntSet$fIsVarSetFreeVars$fSingletonIntFreeVars$fMonoidFreeVars$fSemigroupFreeVars$fNullFreeVars$fSingletonIntVarCounts$fIsVarSetVarCounts$fMonoidVarCounts$fSemigroupVarCounts$fIsVarSetRelevantIn $fEqFreeVars$fShowFreeVars$fSemigroupRelevantIn$fMonoidRelevantInSubst applySubstabstractapplyEapplysapply1raise raiseFrom strengthen substUnderidSwkSraiseSconsS singletonSinplaceSdropScomposeSsplitS++#prependS parallelScompactS strengthenSlookupSabsApp lazyAbsAppnoabsAppabsBodymkAbsreAbsunderAbs underLambdas$fSubstTermQNameTermLike traverseTermMcopyTerm$fTermLikeEqualityView$fTermLikeType'$fTermLikeLevelAtom$fTermLikePlusLevel$fTermLikeLevel$fTermLikeTerm$fTermLike(,,,)$fTermLike(,,) $fTermLike(,)$fTermLikeBlocked $fTermLikeAbs$fTermLikeMaybe $fTermLike[] $fTermLikeDom $fTermLikeArg$fTermLikeElim'$fTermLikeQName$fTermLikeChar$fTermLikeInteger $fTermLikeInt$fTermLikeBoolCompiledClausesCompiledClauses'DoneFailBranches projPatterns conBranches etaBranch litBranchescatchAllBranch lazyMatch WithAritycontentlitCaseconCaseetaCaseprojCasecatchAllcheckLazyMatch hasCatchAllhasProjectionPatterns 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$fMonadGetDefsReaderTMaybePostfixProjPmaybePostfixProjPPatternsNAPsDefP PatternSynPLHSCore'lhsInfolhsCoreSpineLHS spLhsInfo spLhsDefName spLhsPatsWithRHS RewriteRHSrhsExpr rhsConcrete rewriteExprsrewriteStrippedPats rewriteRHSrewriteWhereDecls SpineClauseWhereDeclarations WhereDecls whereModule whereDeclsClause' clauseLHSclauseStrippedPats clauseRHSclauseWhereDecls ProblemEq problemInPat problemInst problemType LetBindingLetBind LetPatBindLetApplyLetOpenLetDeclaredVariableBuiltinNoDefPragma GetDefInfo getDefInfoSectionRecSigRecDef PatternSynDef ScopedDecl ScopeCopyInfo renModulesrenNamesRenFunSigNoFunSig RecordAssigns RecordAssignAssignsAssign ScopedExprBindNameunBind initCopyInfo noWhereDecls $fOrdBindName $fEqBindName$fKillRangeScopeCopyInfo$fPrettyScopeCopyInfo$fSetRangePattern'$fHasRangePattern'$fKillRangeLHSCore'$fHasRangeLHSCore'$fKillRangeLetBinding$fKillRangeWhereDeclarations$fKillRangeRHS$fKillRangeProblemEq$fKillRangeClause'$fKillRangeTypedBinding$fKillRangeTypedBindings$fKillRangeLamBinding$fHasRangeLetBinding$fHasRangeWhereDeclarations $fHasRangeRHS$fHasRangeClause'$fHasRangeTypedBinding$fHasRangeTypedBindings$fHasRangeLamBinding$fLensHidingLamBinding$fLensHidingTypedBindings$fUnderscoreExpr$fEqDeclaration$fEqExpr $fIsProjPExpr$fEqLHS$fEqRHS $fEqProblemEq$fGetDefInfoDeclaration$fKillRangeSpineLHS$fHasRangeSpineLHS$fMaybePostfixProjPNamed$fMaybePostfixProjPArg$fMaybePostfixProjPPattern'$fShowBindName$fDataBindName$fHasRangeBindName$fSetRangeBindName$fKillRangeBindName $fDataAxiom $fEqAxiom $fOrdAxiom $fShowAxiom$fEqScopeCopyInfo$fShowScopeCopyInfo$fDataScopeCopyInfo $fEqPattern'$fDataLHSCore'$fShowLHSCore'$fFunctorLHSCore'$fFoldableLHSCore'$fTraversableLHSCore' $fEqLHSCore' $fDataClause' $fShowClause'$fFunctorClause'$fFoldableClause'$fTraversableClause' $fEqClause' $fDataRHS $fShowRHS$fDataWhereDeclarations$fShowWhereDeclarations$fEqWhereDeclarations$fDataTypedBindings$fShowTypedBindings$fEqTypedBindings$fDataTypedBinding$fShowTypedBinding$fEqTypedBinding$fDataLetBinding$fShowLetBinding$fEqLetBinding$fEqModuleApplication$fDataLamBinding$fShowLamBinding$fEqLamBinding $fEqPragma$fDataProblemEq$fShowProblemEq$fDataSpineLHS$fShowSpineLHS $fEqSpineLHS$fUniverseBiDeclarationQName%$fUniverseBiDeclarationAmbiguousQName$fUniverseBiDeclarationExpr!$fUniverseBiDeclarationLetBinding!$fUniverseBiDeclarationLamBinding#$fUniverseBiDeclarationTypedBinding$fUniverseBiDeclarationPattern' $fUniverseBiDeclarationPattern'0"$fUniverseBiDeclarationDeclaration!$fUniverseBiDeclarationModuleName!$fUniverseBiDeclarationModuleInfo SubstExpr substExprPatternSynDefnsPatternSynDefn NameToExprnameExpr AnyAbstract anyAbstractAllNamesallNames axiomNameapp patternToExprlambdaLiftExprinsertImplicitPatSynArgs$fUniverseBiDeclarationRanged$fAllNamesModuleApplication$fAllNamesLetBinding$fAllNamesTypedBinding$fAllNamesTypedBindings$fAllNamesLamBinding$fAllNamesExpr$fAllNamesWhereDeclarations $fAllNamesRHS$fAllNamesClause'$fAllNamesDeclaration$fAllNamesQName $fAllNames(,)$fAllNamesNamed $fAllNamesArg$fAllNamesMaybe $fAllNames[]$fAnyAbstractDeclaration$fAnyAbstract[]$fNameToExprResolvedName$fNameToExprAbstractName$fSubstExprTypedBinding$fSubstExprTypedBindings$fSubstExprLetBinding$fSubstExprExpr$fSubstExprFieldAssignment'$fSubstExprModuleName$fSubstExprName$fSubstExprEither$fSubstExpr(,)$fSubstExprNamed$fSubstExprArg $fSubstExpr[]PatternVarModalitiespatternVarModalitiesCountPatternVarscountPatternVars PatternLike foldrPatterntraversePatternMMapNamedArgPatternmapNamedArgPattern LabelPatVars labelPatVarsunlabelPatVarsFunArityfunArity clauseArgs clauseElimsunnumberPatVars dbPatPerm dbPatPerm' clausePerm patternToElimpatternsToElims patternToTerm foldPatternpreTraversePatternMpostTraversePatternM $fFunArity[]$fFunArityClause $fFunArity[]0!$fLabelPatVarsPattern'Pattern'Int$fLabelPatVars[][]i$fLabelPatVarsNamedNamedi$fLabelPatVarsArgArgi$fMapNamedArgPatterna[]$fMapNamedArgPatternaArg$fPatternLikeaNamed$fPatternLikeaArg$fPatternLikea[]$fPatternLikeaPattern'$fCountPatternVarsPattern'$fCountPatternVarsNamed$fCountPatternVarsArg$fCountPatternVars[]$fPatternVarModalitiesPattern'x$fPatternVarModalitiesElim'x$fPatternVarModalitiesArgx$fPatternVarModalitiesNamedx$fPatternVarModalities[]x recurseExprLamViewAppView' ApplicationappView'maybeProjTurnPostfix unAppViewlamViewasViewisSetunScope deepUnscopedeepUnscopeDeclsdeepUnscopeDecl$fExprLikeSpineLHS$fExprLikeLHSCore'$fExprLikePragma$fExprLikeWhereDeclarations $fExprLikeRHS$fExprLikeClause'$fExprLikePattern'$fExprLikeLetBinding$fExprLikeTypedBinding$fExprLikeTypedBindings$fExprLikeLamBinding$fExprLikeModuleName$fExprLikeVoid$fFunctorAppView'mergePatternSynDefsmatchPatternSynmatchPatternSynP LHSToSpine lhsToSpine spineToLhsLHSProjP foldrAPatterntraverseAPatternMNAP foldAPatternpreTraverseAPatternMpostTraverseAPatternM mapAPatterncontainsAPatterncontainsAbsurdPatterncontainsAsPatterncheckPatternLinearity substPattern substPattern'splitOffTrailingWithPatternstrailingWithPatternslhsCoreToSpinespineToLhsCorelhsCoreAddChunklhsCoreAllPatternslhsCoreToPattern mapLHSHead$fIsWithPPattern'$fMapNamedArgPattern(,)$fMapNamedArgPatternMaybe$$fMapNamedArgPatternFieldAssignment'$fMapNamedArgPattern[]$fMapNamedArgPatternArg$fAPatternLikea(,)$fAPatternLikeaFieldAssignment'$fAPatternLikeaMaybe$fAPatternLikea[]$fAPatternLikeaNamed$fAPatternLikeaArg$fAPatternLikeaPattern'$fLHSToSpineLHSSpineLHS$fLHSToSpine[][]$fLHSToSpineClause'Clause'$fShowLHSPatternView 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 $fMonadChangeNiceDeclarationWarningUnknownNamesInFixityDeclUnknownFixityInMixfixDeclUnknownNamesInPolarityPragmasPolarityPragmasButNotPostulatesUselessPrivateUselessAbstractUselessInstance EmptyMutual EmptyAbstract EmptyPrivate EmptyInstance EmptyMacroEmptyPostulateInvalidTerminationCheckPragmaInvalidNoPositivityCheckPragmaInvalidCatchallPragmaDeclarationExceptionMultipleFixityDeclsMultiplePolarityPragmasMultipleEllipses InvalidNameDuplicateDefinitionMissingDefinitionMissingWithClausesWrongDefinitionWrongParametersNotAllowedInMutualCodataDeclarationPanicWrongContentBlockAmbiguousFunClausesInvalidMeasureMutualPragmaNoTerminationCheckUnquoteDefRequiresSignature BadMacroDefNiceTypeSignatureNiceConstructorMeasureNiceDeclaration NiceFieldPrimitiveFunction NiceMutual NiceModuleNiceModuleMacroNiceOpen NiceImport NicePragma NiceRecSig NiceDataSig NiceFunClauseNicePatternSynNiceUnquoteDeclNiceUnquoteDefdeclarationWarningNamerunNiceniceDeclarationsnotSoNiceDeclarationsniceHasAbstract$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$fShowSizeExpr ComposeZipper ComposeZip ListZipperListZipZipperCarrierElement firstHoleplugHolenextHole$fZipperListZipper$fZipperComposeZipper$fEqListZipper$fOrdListZipper$fShowListZipper$fFunctorListZipper$fFoldableListZipper$fTraversableListZipperversionversionWithCommitInfo commitInfoLibM VersionViewvvBase vvNumbersgetDefaultLibrariesgetInstalledLibrarieslibraryIncludePathsfindLib' versionView unVersionView$fShowLibrariesFile$fEqVersionView$fShowVersionView$fShowLibErrorcopyDirContentFlagOptM PragmaOptionsoptShowImplicitoptShowIrrelevant optUseUnicode optVerboseoptProofIrrelevanceoptAllowUnsolvedoptDisablePositivityoptTerminationCheckoptTerminationDepthoptCompletenessCheckoptUniverseCheck optSizedTypesoptInjectiveTypeConstructorsoptGuardingTypeConstructorsoptUniversePolymorphismoptIrrelevantProjectionsoptExperimentalIrrelevance optWithoutK optCopatternsoptPatternMatching optExactSplitoptEta optRewritingoptPostfixProjectionsoptInstanceSearchDepthoptInversionMaxDepthoptSafeoptWarningModeoptCompileNoMain optCachingoptCountClusters optAutoInlineoptPrintPatternSynonymsCommandLineOptionsOptionsoptProgramName optInputFileoptIncludePathsoptAbsoluteIncludePaths optLibrariesoptOverrideLibrariesFileoptDefaultLibs optUseLibsoptShowVersion optShowHelpoptInteractiveoptGHCiInteractionoptOptimSmashing optCompileDiroptGenerateVimFileoptGenerateLaTeXoptGenerateHTMLoptDependencyGraph optLaTeXDir optHTMLDir optCSSFileoptIgnoreInterfaces optForcingoptPragmaOptionsoptOnlyScopeChecking IgnoreFlags RespectFlags Verbosity isLiteratemapFlagdefaultVerbositydefaultInteractionOptionsdefaultOptionsdefaultPragmaOptions defaultCutOffrunOptM checkOptsunsafePragmaOptions inputFlagstandardOptionsstandardOptions_ getOptSimpleparseStandardOptionsparseStandardOptions'parsePragmaOptionsparsePluginOptionsusage defaultLibDir$fEqIgnoreFlags$fShowPragmaOptions$fEqPragmaOptions$fShowCommandLineOptionsIMMonadTCMliftTCMReduceM unReduceM ReduceEnvredEnvredSt HasOptions pragmaOptionscommandLineOptionsTCErr TypeError Exception IOException PatternErr tcErrState tcErrClosErr LHSOrPatSynIsLHSIsPatSyn InternalErrorNotImplemented NotSupportedCompilationErrorTerminationCheckFailedPropMustBeSingletonDataMustEndInSort#ShouldEndInApplicationOfTheDatatype&ShouldBeAppliedToTheDatatypeParametersShouldBeApplicationOf!ConstructorPatternInWrongDatatype6CantResolveOverloadedConstructorsTargetingSameDatatypeDoesNotConstructAnElementOfDifferentAritiesWrongHidingInLHSWrongHidingInLambdaWrongHidingInApplicationWrongNamedArgumentWrongIrrelevanceInLambdaWrongInstanceDeclarationHidingMismatchRelevanceMismatchUninstantiatedDotPattern ForcedConstructorNotInstantiatedIlltypedPatternIllformedProjectionPatternCannotEliminateWithPattern!WrongNumberOfConstructorArguments ShouldBeEmpty ShouldBeASort ShouldBePiShouldBeRecordTypeShouldBeRecordPatternNotAProjectionPatternNotAProperTermSetOmegaNotValidTypeInvalidTypeSort InvalidTypeFunctionTypeInSizeUnivSplitOnIrrelevantSplitOnNonVariableDefinitionIsIrrelevantVariableIsIrrelevant UnequalTerms UnequalTypesUnequalRelevance UnequalHiding UnequalSorts UnequalBecauseOfUniverseConflict NotLeqSortMetaCannotDependOnMetaOccursInItselfMetaIrrelevantSolution GenericErrorGenericDocErrorBuiltinMustBeConstructorNoSuchBuiltinNameDuplicateBuiltinBindingNoBindingForBuiltinNoSuchPrimitiveFunctionShadowedModuleBuiltinInParameterisedModuleIllegalLetInTelescopeNoRHSRequiresAbsurdPatternAbsurdPatternRequiresNoRHS TooFewFields TooManyFieldsDuplicateFieldsDuplicateConstructorsWithOnFreeVariableUnexpectedWithPatternsWithClausePatternMismatchFieldOutsideRecordModuleArityMismatch SplitErrorImpossibleConstructorTooManyPolaritiesLocalVsImportedModuleClashSolvedButOpenHolesCyclicModuleDependency FileNotFoundOverlappingProjectsAmbiguousTopLevelModuleNameModuleNameUnexpectedModuleNameDoesntMatchFileNameClashingFileNamesForModuleDefinedInOtherFileBothWithAndRHSAbstractConstructorNotInScope NotInScope NoSuchModule AmbiguousNameAmbiguousModuleUninstantiatedModuleClashingDefinitionClashingModuleClashingImportClashingModuleImportPatternShadowsConstructorModuleDoesntExportDuplicateImportsInvalidPatternRepeatedVariablesInPatternNotAModuleExprNotAnExpressionNotAValidLetBindingNotValidBeforeFieldNothingAppliedToHiddenArgNothingAppliedToInstanceArgBadArgumentsToPatternSynonymTooFewArgumentsToPatternSynonym$CannotResolveAmbiguousPatternSynonymUnusedVariableInPatternSynonymNoParseForApplicationAmbiguousParseForApplication NoParseForLHSAmbiguousParseForLHSOperatorInformationIFSNoCandidateInScope UnquoteFailedDeBruijnIndexOutOfScopeNeedOptionCopatternsNeedOptionRewritingNonFatalErrorsInstanceSearchDepthExhausted UnquoteError BadVisibilityConInsteadOfDefDefInsteadOfCon NonCanonical BlockedOnMeta UnquotePanicUnificationFailureUnifyIndicesNotVarsUnifyRecursiveEqUnifyReflexiveEqNegativeUnification UnifyConflict UnifyCycle NotADatatypeIrrelevantDatatypeCoinductiveDatatypeUnificationStuckGenericSplitErrorcantSplitConName cantSplitTelcantSplitConIdxcantSplitGivenIdxcantSplitFailuresTerminationErrortermErrFunctions termErrCallsCallInfocallInfoTarget callInfoRange callInfoCall TCWarningtcWarningRange tcWarningtcWarningPrintedWarningtcWarningCachedWarning NicifierIssueTerminationIssueUnreachableClauses CoverageIssueCoverageNoExactSplitNotStrictlyPositiveUnsolvedMetaVariablesUnsolvedInteractionMetasUnsolvedConstraints OldBuiltinEmptyRewritePragma UselessPublic UselessInlineInversionDepthReachedGenericWarningGenericNonFatalErrorSafeFlagPostulateSafeFlagPragmaSafeFlagNonTerminatingSafeFlagTerminatingSafeFlagPrimTrustMeSafeFlagNoPositivityCheckSafeFlagPolarityDeprecationWarning UserWarning Candidate candidateTerm candidateType candidateEticandidateOverlappableExplicitToInstanceExplicitStayExplicit ExpandHidden ExpandLastDontExpandLast AbstractMode ConcreteModeIgnoreAbstractMode LetBindings ContextEntryContext UnquoteFlags_unquoteNormalise envContextenvLetBindingsenvCurrentModuleenvCurrentPathenvAnonymousModules envImportPathenvMutualBlockenvTerminationCheckenvSolvingConstraintsenvCheckingWhereenvWorkingOnTypesenvAssignMetasenvActiveProblemsenvAbstractMode envRelevanceenvDisplayFormsEnabledenvRangeenvHighlightingRange envClauseenvCallenvHighlightingLevelenvHighlightingMethodenvModuleNestingLevelenvAllowDestructiveUpdate envExpandLast envAppDefenvSimplificationenvAllowedReductionsenvInjectivityDepthenvCompareBlockedenvPrintDomainFreePienvPrintMetasBareenvInsideDotPatternenvUnquoteFlagsenvInstanceDepthenvIsDebugPrintingenvPrintingPatternLambdas envCallByNeedenvCurrentCheckpointenvCheckpointsDirectIndirectHighlightingLevelNoneNonInteractive InteractiveBuiltinPrim BuiltinThings BuiltinInfo builtinName builtinDescBuiltinDescriptor BuiltinDataBuiltinDataCons BuiltinPrimBuiltinPostulateBuiltinUnknownTempInstanceTable InstanceTable CheckClause CheckPatternCheckLetBinding InferExpr CheckExprCallCheckDotPatternCheckPatternShadowingCheckProjection IsTypeCallIsType_InferVarInferDefCheckArgumentsCheckTargetType CheckDataDef CheckRecDefCheckConstructorCheckFunDefCall CheckPragmaCheckPrimitive CheckIsEmptyCheckWithFunctionTypeCheckSectionApplicationCheckNamedWhereScopeCheckExprScopeCheckDeclaration ScopeCheckLHSNoHighlightingModuleContents StatisticsMutualIdMutIdTermHeadSortHeadPiHeadConsHeadVarHead UnknownHeadFunctionInverse' NotInjectiveInverse InversionMapFunctionInversePrimFun primFunName primFunArityprimFunImplementationAllowedReductionsAllowedReductionProjectionReductionsInlineReductionsCopatternReductionsFunctionReductionsRecursiveReductionsLevelReductionsUnconfirmedReductionsNonTerminatingReductionsMaybeReducedElimsMaybeReducedArgs MaybeReducedMaybeRed isReduced ignoreReduced IsReduced NotReducedReduced NoReduction YesReductionSimplificationYesSimplificationNoSimplificationFieldsDefn AbstractDefn funClauses funCompiled funTreelessfunInv funMutualfunAbstr funDelayed funProjectionfunFlags funTerminates funExtLamfunWithfunCopatternLHSdataParsdataIxs dataInduction dataClausedataConsdataSort dataMutual dataAbstrrecPars recClause recConHead recNamedCon recFieldsrecTel recMutualrecEtaEquality' recInductionrecAbstrconParsconArity conSrcConconDataconAbstrconInd conForced conErased primAbstrprimName primClausesprimInv primCompiled FunctionFlag FunStatic FunInlineFunMacro EtaEquality SpecifiedInferredtheEtaEqualityProjLams getProjLams Projection projProperprojOrig projFromType projIndexprojLams ExtLamInfo extLamModuleCompiledRepresentation BackendNameCompilerPragmaIsForcedForced NotForced 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 UnquoteTactic CheckedTargetNotCheckedTargetMetaInstantiationInstVOpenIFS BlockedConstPostponedTypeCheckingProblemFrozen InstantiableListener EtaExpandCheckConstraint MetaVariableMetaVarmvInfo mvPriority mvPermutation mvJudgementmvInstantiation mvListenersmvFrozen JudgementHasTypeIsSortjMetaId jMetaType OpenThingopenThingCheckpoint openThingCompareDirectionDirEqDirLeqDirGeq ComparisonCmpEqCmpLeqValueCmpElimCmpTypeCmpTelCmpSortCmpLevelCmp HasBiggerSort HasPTSRuleUnBlockGuardedIsEmptyCheckSizeLtSat FindInScope CheckFunDefProblemConstraintPConstrconstraintProblems theConstraintClosure clSignatureclEnvclScopeclModuleCheckpointsclValue Interface iSourceHashiImportedModules iModuleNameiScope iInsideScope iSignature iDisplayForms iUserWarningsiBuiltin iForeignCode iHighlightingiPragmaOptions iPatternSyns iWarnings ForeignCodeDecodedModulesVisitedModules miInterface miWarningsSourceToModule FreshName freshName_ CheckpointId ProblemIdHasFresh freshLens nextFresh'TypeCheckAction EnterSection LeaveSectionPragmasCurrentTypeCheckLogCachedTypeCheckLogLoadedFileCache lfcCached lfcCurrentPersistentTCStatePersistentTCStstDecodedModulesstPersistentOptionsstInteractionOutputCallback stBenchmarkstAccumStatisticsstLoadedFileCachestPersistBackends MutualBlock mutualInfo mutualNamesPostScopeStatestPostSyntaxInfostPostDisambiguatedNamesstPostMetaStorestPostInteractionPointsstPostAwakeConstraintsstPostSleepingConstraints stPostDirtystPostOccursCheckDefsstPostSignaturestPostModuleCheckpointsstPostImportsDisplayFormsstPostCurrentModulestPostInstanceDefsstPostStatisticsstPostTCWarningsstPostMutualBlocksstPostLocalBuiltinsstPostFreshMetaIdstPostFreshMutualIdstPostFreshProblemIdstPostFreshCheckpointIdstPostFreshIntstPostFreshNameIdstPostAreWeCachingDisambiguatedNames PreScopeState stPreTokens stPreImportsstPreImportedModulesstPreModuleToSourcestPreVisitedModules stPreScopestPrePatternSynsstPrePatternSynImportsstPrePragmaOptionsstPreImportedBuiltinsstPreImportedDisplayFormsstPreImportedInstanceDefsstPreForeignCodestPreFreshInteractionIdstPreUserWarnings ReadTCState getTCStateTCStstPreScopeStatestPostScopeStatestPersistentStateinitPersistentStateinitPreScopeStateinitPostScopeStatestTokens stImportsstImportedModulesstModuleToSourcestVisitedModulesstScope stPatternSynsstPatternSynImportsstPragmaOptionsstImportedBuiltins stForeignCodestFreshInteractionIdstUserWarnings stBackends stFreshNameId stSyntaxInfostDisambiguatedNames stMetaStorestInteractionPointsstAwakeConstraintsstSleepingConstraintsstDirtystOccursCheckDefs stSignaturestModuleCheckpointsstImportsDisplayFormsstImportedDisplayFormsstCurrentModulestImportedInstanceDefsstInstanceDefs stStatistics stTCWarningsstMutualBlocksstLocalBuiltins stFreshMetaIdstFreshMutualIdstFreshProblemIdstFreshCheckpointId stFreshIntstAreWeCachingstBuiltinThings nextFreshfresh freshName freshNoName freshNoName_sourceToModulelookupModuleFromSource iFullHash buildClosurefromCmpflipCmpdirToCmpnormalMetaPrioritylowMetaPriorityhighMetaPriority getMetaInfo getMetaScope getMetaEnv getMetaSiggetMetaRelevance sigSectionssigDefinitionssigRewriteRules secTelescopeemptySignaturedefaultDisplayForm defRelevance theDefLens defaultDefn jsBackendNameghcBackendNameuhcBackendName noCompiledRep projDropPars projArgInfosetEtaEquality recRecursiverecEtaEquality emptyFunctionfunFlag funStatic funInlinefunMacroisMacroisEmptyFunctionisCopatternLHSrecCon defIsRecorddefIsDataOrRecorddefConstructors notReducedreduced allReductions defClauses defCompiled defParameters defInversedefCompilerPragmas defDelayeddefNonterminatingdefTerminationUnconfirmed defForced"ifTopLevelAndHighlightingLevelIsOr ifTopLevelAndHighlightingLevelIsinitEnvdisableDestructiveUpdatedefaultUnquoteFlagsunquoteNormaliseeUnquoteNormaliseeContext eLetBindingseCurrentModule eCurrentPatheAnonymousModules eImportPath eMutualBlockeTerminationCheckeSolvingConstraintseCheckingWhereeWorkingOnTypes eAssignMetaseActiveProblems eAbstractMode eRelevanceeDisplayFormsEnabledeRangeeHighlightingRangeeCalleHighlightingLeveleHighlightingMethodeModuleNestingLeveleAllowDestructiveUpdate eExpandLasteAppDefeSimplificationeAllowedReductionseInjectivityDeptheCompareBlockedePrintDomainFreePieInsideDotPattern eUnquoteFlagseInstanceDeptheIsDebugPrintingePrintingPatternLambdas eCallByNeedeCurrentCheckpoint eCheckpoints aDefToMode aModeToDef warningNametcWarningOriginequalHeadConstructorsgetPartialDefs mapRedEnvmapRedSt mapRedEnvSt reduceEnvreduceSt onReduceEnv fmapReduceapReduce bindReduce runReduceM runReduceFrunIM catchError_finally_mapTCMTpureTCM returnTCMTbindTCMTthenTCMTfmapTCMTapTCMTpatternViolation internalError genericErrorgenericDocError typeError typeError_runTCM runTCMTop runTCMTop' runSafeTCMforkTCMextendedLambdaNameabsurdLambdaNameisAbsurdLambdaName$fNullMutualBlock$fPrettyProblemId$fShowProblemId$fPrettyCheckpointId$fShowCheckpointId$fPrettyComparison$fPrettyCompareDirection$fKillRangeOpen$fDecorationOpen$fShowJudgement$fPrettyNamedMeta $fEqIPClause$fEqInteractionPoint$fKillRangeSection$fPrettySection$fKillRangeDisplayTerm$fPrettyDisplayTerm$fFreeDisplayTerm$fKillRangeDisplayForm$fFreeDisplayForm$fKillRangeNLPType$fKillRangeNLPat$fKillRangeRewriteRule$fKillRangeHashMap$fKillRangePolarity$fKillRangeIsForced$fHasRangeCompilerPragma$fKillRangeMap0$fKillRangeExtLamInfo$fKillRangeProjLams$fKillRangeProjection$fKillRangeEtaEquality$fKillRangeFunctionFlag$fMonoidSimplification$fSemigroupSimplification$fNullSimplification$fIsProjElimMaybeReduced$fKillRangeTermHead$fPrettyTermHead$fKillRangeFunctionInverse'$fKillRangeDefn $fPrettyDefn$fKillRangeMutualId$fKillRangeDefinition$fPrettyDefinition$fKillRangeHashMap0$fKillRangeSignature$fHasRangeCall $fPrettyCall$fHasRangeClosure $fShowClosure$fSetRangeMetaInfo$fFreeCandidate$fTermLikeConstraint$fFreeConstraint$fHasRangeConstraint$fHasRangeProblemConstraint $fOrdListener $fEqListener$fAllNamesCallInfo$fPrettyCallInfo $fEqTCWarning$fHasRangeTCWarning$fPrettyInterface$fHasOptionsWriterT$fHasOptionsStateT$fHasOptionsReaderT$fHasOptionsMaybeT$fHasOptionsListT$fHasOptionsExceptT $fMonoidTCMT$fSemigroupTCMT $fNullTCMT$fMonadBenchPhaseTCMT$fApplicativeTCMT $fFunctorTCMT $fMonadTCMT$fMonadTransTCMT$fMonadStateTCStateTCMT$fMonadReaderTCEnvTCMT$fMonadReaderTCEnvReduceM$fMonadReduceM$fApplicativeReduceM$fFunctorReduceM$fHasOptionsTCMT$fSetRangeMetaVariable$fHasRangeMetaVariable$fShowMetaInstantiation $fShowTCState $fMonadIOTCMT$fMonadErrorTCErrTCMT$fExceptionTCErr$fHasRangeTCErr $fShowTCErr $fErrorTCErr $fFreshName()$fFreshNameRange' $fFreshName[]$fFreshName(,)$fHasFreshCheckpointId$fHasFreshProblemId $fHasFreshInt$fHasFreshNameId$fHasFreshInteractionId$fHasFreshMutualId$fHasFreshMetaId$fReadTCStateTCMT$fReadTCStateReduceM$fMonadTCMWriterT$fMonadTCMExceptT$fMonadTCMListT$fMonadTCMMaybeT$fMonadTCMTCMT$fMonadErrorTCErrTCMT0$fShowMutualBlock$fEqMutualBlock$fDataProblemId $fEqProblemId$fOrdProblemId$fEnumProblemId$fRealProblemId$fIntegralProblemId$fNumProblemId$fDataCheckpointId$fEqCheckpointId$fOrdCheckpointId$fEnumCheckpointId$fRealCheckpointId$fIntegralCheckpointId$fNumCheckpointId$fShowForeignCode$fEqComparison$fDataComparison$fShowComparison$fEqCompareDirection$fShowCompareDirection $fDataOpen $fShowOpen $fFunctorOpen$fFoldableOpen$fTraversableOpen $fEqFrozen $fShowFrozen$fEqMetaPriority$fOrdMetaPriority$fShowMetaPriority$fEqRunMetaOccursCheck$fOrdRunMetaOccursCheck$fShowRunMetaOccursCheck$fDataIPClause $fDataSection $fShowSection$fDataDisplayTerm$fShowDisplayTerm$fDataDisplayForm$fShowDisplayForm $fDataNLPType $fShowNLPType $fDataNLPat $fShowNLPat$fDataRewriteRule$fShowRewriteRule$fDataPolarity$fShowPolarity$fDataIsForced$fShowIsForced $fEqIsForced$fDataCompilerPragma$fShowCompilerPragma$fEqCompilerPragma$fDataExtLamInfo$fEqExtLamInfo$fOrdExtLamInfo$fShowExtLamInfo$fDataProjLams$fShowProjLams$fNullProjLams$fDataProjection$fShowProjection$fDataEtaEquality$fShowEtaEquality$fEqEtaEquality$fDataFunctionFlag$fEqFunctionFlag$fOrdFunctionFlag$fEnumFunctionFlag$fShowFunctionFlag $fNullFields$fDataSimplification$fEqSimplification$fShowSimplification$fFunctorReduced$fFunctorMaybeReduced$fShowAllowedReduction$fEqAllowedReduction$fOrdAllowedReduction$fEnumAllowedReduction$fBoundedAllowedReduction$fDataAllowedReduction$fDataTermHead $fEqTermHead $fOrdTermHead$fShowTermHead$fDataFunctionInverse'$fShowFunctionInverse'$fFunctorFunctionInverse' $fDataDefn $fShowDefn$fDataMutualId $fEqMutualId $fOrdMutualId$fShowMutualId $fNumMutualId$fEnumMutualId$fDataDefinition$fDataSignature$fShowSignature $fDataCall $fShowBuiltin$fFunctorBuiltin$fFoldableBuiltin$fTraversableBuiltin$fEqHighlightingLevel$fOrdHighlightingLevel$fShowHighlightingLevel$fReadHighlightingLevel$fDataHighlightingLevel$fEqHighlightingMethod$fShowHighlightingMethod$fReadHighlightingMethod$fDataHighlightingMethod$fDataUnquoteFlags$fDataAbstractMode$fShowAbstractMode$fEqAbstractMode$fEqExpandHidden$fDataExpandHidden $fDataTCEnv $fDataClosure$fFunctorClosure$fFoldableClosure$fEqExplicitToInstance$fShowExplicitToInstance$fDataExplicitToInstance$fShowCandidate$fDataCandidate$fDataConstraint$fDataProblemConstraint$fShowProblemConstraint$fDataCallInfo$fShowCallInfo$fDataTerminationError$fShowTerminationError $fShowWarning $fDataWarning$fShowTCWarning$fShowInterface$fShowNegativeUnification$fShowUnificationFailure$fShowSplitError$fEqLHSOrPatSyn$fShowLHSOrPatSyn$fShowUnquoteError$fShowTypeError TeleNoAbs teleNoAbsTelVtheTeltheCoreTelView canProjectconAppdefApp argToDontCarepiApplytelVars namedTelVars abstractArgsrenaming renamingRrenamePapplyNLPatSubstfromPatternSubstitution applyPatSubst usePatOriginprojDropParsApplytelView' telView'UpTo bindsToTel' bindsToTelbindsWithHidingToTel'bindsWithHidingToTelmkPimkLamtelePi'telePitelePi_teleLamtypeArgsWithTelcompiledClauseBody univSort'univSortfunSort'funSortpiSort'piSortlevelMaxlevelTm unLevelAtom levelSucView $fOrdElim' $fEqElim'$fOrdAbs$fEqAbs $fOrdTerm$fEqTerm $fOrdType' $fEqType'$fOrdLevelAtom $fEqLevelAtom$fOrdPlusLevel$fSubstTermRange'$fSubstPattern'Pattern'$fDeBruijnPattern'$fSubstTermEqualityView$fSubstTermCandidate $fSubstt(,,,) $fSubstt(,,) $fSubstt(,) $fSubstTerm() $fSubsttMap $fSubstt[] $fSubsttMaybe $fSubsttDom $fSubsttNamed $fSubsttArg $fSubsttAbs $fSubsttElim'$fSubstTermConstraint $fSubsttTele$fSubstTermDisplayTerm$fSubstTermDisplayForm$fSubsttBlocked$fSubstNLPatRewriteRule$fSubstNLPatNLPType$fSubstNLPatNLPat$fDeBruijnNLPat$fSubstTermProblemEq$fSubstTermPattern'$fSubstTermConPatternInfo $fSubstTerm[]$fSubstTermName$fSubstTermLevelAtom$fSubstTermPlusLevel$fSubstTermLevel$fSubstTermSort$fSubstTermType'$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 $fApplySort $fApplyTerm$fTeleNoAbsTele $fTeleNoAbs[] $fShowTelV $fFunctorTelV $fEqSection$fEqConstraint $fOrdTele$fEqTele $fEqCandidate $fEqBlocked$fEqNotBlocked $fEqPlusLevel $fOrdLevel $fEqLevel $fOrdSort$fEqSort$fOrdSubstitution'$fEqSubstitution' $fOrdTelV$fEqTelVtelViewpiApplyMInSeqHasFreeOccursSeqArg UnderLambdaonceinSeq underLambdaoccursIn tryStrengthen$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 $fPrettyTTerm convertGuards equalTerms caseToSeqrecoverAsPatterns $fShowAsPatVALUvaluN' valueArgsICODE icodeArgsEmbPrjicodeicod_valueStnodeEstringEbstringEintegerEdoubleEnodeMemomodFileincludesMemoUDictnodeDstringDbstringDintegerDdoubleDtermDnameDqnameDnodeCstringCbstringCintegerCdoubleCtermCnameCqnameCstats collectStatsabsPathDQNameId FreshAndReusefarFreshfarReuse HashTablefarEmpty lensFresh lensReuseqnameId emptyDict malformed tickICode runGetStateicodeX icodeInteger icodeDouble icodeString icodeNode icodeMemovcaseicodeNicodeN'valuNvalueN$fICODE(->)False $fICODEtTrue$fVALU(->)False $fVALUtTrue unquoteTacticcheckPostponedLambda inferExpr checkExprisType_checkSectionApplication checkDecl checkDeclsinferApplicationcheckApplicationcheckArguments_checkArgumentsrewriteverifyBuiltinRewrite fastNormalise fastReduceeligibleForProjectionLikemakeProjection PrettyTCM prettyTCM composePolcomputePolarity VerboseKey enableCachingverboseS hasVerbositygetIncludeDirs addImportaddImportCycleCheck getImports isImported getImportPath visitModulesetVisitedModulesgetVisitedModules isVisitedgetVisitedModulegetDecodedModulessetDecodedModulesgetDecodedModulestoreDecodedModuledropDecodedModulewithImportPathcheckForImportCycle currentModulewithCurrentModulegetAnonymousVariableswithAnonymousModulewithEnvgetEnvwithIncreasedModuleNestingLevelwithHighlightingLevel doExpandLastdontExpandLastperformedSimplificationperformedSimplification'getSimplificationupdateAllowedReductionsmodifyAllowedReductionsputAllowedReductionsonlyReduceProjectionsallowAllReductionsallowNonTerminatingReductionsinsideDotPatternisInsideDotPattern callByName MonadDebugdisplayDebugMessagetraceDebugMessageformatDebugMessage reportSDoc reportSLnreportScheckpointSubstitutionmakeOpengetOpen tryGetOpenisClosedCoinductionKit nameOfInf nameOfSharp nameOfFlat HasBuiltinsgetBuiltinThinglitTypesetBuiltinThingsbindBuiltinName bindPrimitive getBuiltin getBuiltin' getPrimitive' getPrimitiveconstructorFormconstructorForm' primIntegerprimIntegerPosprimIntegerNegSuc primFloatprimChar primStringprimBoolprimUnit primUnitUnitprimTrue primFalseprimListprimNilprimConsprimIOprimNatprimSucprimZero primNatPlus primNatMinus primNatTimesprimNatDivSucAuxprimNatModSucAuxprimNatEquality primNatLess primWord64 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 primAgdaTermprimAgdaTermVarprimAgdaTermLamprimAgdaTermExtLamprimAgdaTermDefprimAgdaTermConprimAgdaTermPiprimAgdaTermSortprimAgdaTermLitprimAgdaTermUnsupportedprimAgdaTermMetaprimAgdaErrorPartprimAgdaErrorPartStringprimAgdaErrorPartTermprimAgdaErrorPartNameprimAgdaLiteralprimAgdaLitNatprimAgdaLitWord64primAgdaLitFloatprimAgdaLitCharprimAgdaLitStringprimAgdaLitQNameprimAgdaLitMetaprimAgdaPatternprimAgdaPatConprimAgdaPatVarprimAgdaPatDotprimAgdaPatLitprimAgdaPatProjprimAgdaPatAbsurdprimAgdaClauseprimAgdaClauseClauseprimAgdaClauseAbsurdprimAgdaDefinitionFunDefprimAgdaDefinitionDataDefprimAgdaDefinitionRecordDef!primAgdaDefinitionDataConstructorprimAgdaDefinitionPostulateprimAgdaDefinitionPrimitiveprimAgdaDefinition primAgdaMeta primAgdaTCMprimAgdaTCMReturnprimAgdaTCMBindprimAgdaTCMUnifyprimAgdaTCMTypeErrorprimAgdaTCMInferTypeprimAgdaTCMCheckTypeprimAgdaTCMNormaliseprimAgdaTCMReduceprimAgdaTCMCatchErrorprimAgdaTCMGetContextprimAgdaTCMExtendContextprimAgdaTCMInContextprimAgdaTCMFreshNameprimAgdaTCMDeclareDefprimAgdaTCMDeclarePostulateprimAgdaTCMDefineFunprimAgdaTCMGetTypeprimAgdaTCMGetDefinitionprimAgdaTCMQuoteTermprimAgdaTCMUnquoteTermprimAgdaTCMBlockOnMetaprimAgdaTCMCommitprimAgdaTCMIsMacroprimAgdaTCMWithNormalisationprimAgdaTCMDebugPrint builtinNat builtinSuc builtinZerobuiltinNatPlusbuiltinNatMinusbuiltinNatTimesbuiltinNatDivSucAuxbuiltinNatModSucAuxbuiltinNatEqualsbuiltinNatLess builtinWord64builtinIntegerbuiltinIntegerPosbuiltinIntegerNegSuc 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 builtinAbsAbsbuiltinAgdaTermbuiltinAgdaTermVarbuiltinAgdaTermLambuiltinAgdaTermExtLambuiltinAgdaTermDefbuiltinAgdaTermConbuiltinAgdaTermPibuiltinAgdaTermSortbuiltinAgdaTermLitbuiltinAgdaTermUnsupportedbuiltinAgdaTermMetabuiltinAgdaErrorPartbuiltinAgdaErrorPartStringbuiltinAgdaErrorPartTermbuiltinAgdaErrorPartNamebuiltinAgdaLiteralbuiltinAgdaLitNatbuiltinAgdaLitWord64builtinAgdaLitFloatbuiltinAgdaLitCharbuiltinAgdaLitStringbuiltinAgdaLitQNamebuiltinAgdaLitMetabuiltinAgdaClausebuiltinAgdaClauseClausebuiltinAgdaClauseAbsurdbuiltinAgdaPatternbuiltinAgdaPatVarbuiltinAgdaPatConbuiltinAgdaPatDotbuiltinAgdaPatLitbuiltinAgdaPatProjbuiltinAgdaPatAbsurdbuiltinAgdaDefinitionFunDefbuiltinAgdaDefinitionDataDefbuiltinAgdaDefinitionRecordDef$builtinAgdaDefinitionDataConstructorbuiltinAgdaDefinitionPostulatebuiltinAgdaDefinitionPrimitivebuiltinAgdaDefinitionbuiltinAgdaMetabuiltinAgdaTCMbuiltinAgdaTCMReturnbuiltinAgdaTCMBindbuiltinAgdaTCMUnifybuiltinAgdaTCMTypeErrorbuiltinAgdaTCMInferTypebuiltinAgdaTCMCheckTypebuiltinAgdaTCMNormalisebuiltinAgdaTCMReducebuiltinAgdaTCMCatchErrorbuiltinAgdaTCMGetContextbuiltinAgdaTCMExtendContextbuiltinAgdaTCMInContextbuiltinAgdaTCMFreshNamebuiltinAgdaTCMDeclareDefbuiltinAgdaTCMDeclarePostulatebuiltinAgdaTCMDefineFunbuiltinAgdaTCMGetTypebuiltinAgdaTCMGetDefinitionbuiltinAgdaTCMBlockOnMetabuiltinAgdaTCMCommitbuiltinAgdaTCMQuoteTermbuiltinAgdaTCMUnquoteTermbuiltinAgdaTCMIsMacrobuiltinAgdaTCMWithNormalisationbuiltinAgdaTCMDebugPrint builtinsNoDefcoinductionKit'coinductionKitprimEqualityName equalityViewequalityUnview$fHasBuiltinsTCMT$fHasBuiltinsMaybeT Condition newSortMeta newTelMetanewNamedValueMeta'newNamedValueMeta newValueMeta newIFSMetaassignassignVetaExpandMetaSafe assignTerm newArgsMeta newArgsMeta' $fShowLeq$fEqLeqsayWhen prettyWarning prettyErrorunlessDebugPrintingtraceSLn traceSDocverboseBracket$fMonadDebugWriterT$fMonadDebugStateT$fMonadDebugReaderT$fMonadDebugMaybeT$fMonadDebugListT$fMonadDebugExceptT$fMonadDebugTCMT cachingStarts areWeCachingwriteToCurrentLogrestorePostScopeStatenoCacheForImportedModulereadFromCachedLogcleanCachedLogactivateLoadedFileCachecacheCurrentLog WhichWarnings ErrorWarnings AllWarningsgenericWarninggenericNonFatalErrorwarning_applyWarningModewarningswarningisUnsolvedWarningclassifyWarningonlyOnceonlyShowIfUnsolvedclassifyWarningsrunPM$fEqWhichWarnings$fOrdWhichWarnings resetState resetAllState localTCStatelocalTCStateSavingfreshTCMlensPersistentStateupdatePersistentStatemodifyPersistentStatelensAccumStatisticsPlensAccumStatisticsgetScopesetScope modifyScope_ modifyScope withScope withScope_ localScope notInScope printScopemodifySignaturemodifyImportedSignature getSignaturemodifyGlobalDefinition setSignature withSignatureaddRewriteRulesForlookupDefinitionupdateDefinitionsupdateDefinition updateTheDef updateDefTypeupdateDefArgOccurrencesupdateDefPolarityupdateDefCompiledRepaddCompilerPragmaupdateFunClausesupdateCompiledClausesupdateFunCopatternLHSsetTopLevelModulewithTopLevelModuleaddForeignCodeaddDeprecatedForeignCodeaddHaskellImportaddHaskellImportUHCaddInlineHaskellgetInteractionOutputCallbackappInteractionOutputCallbacksetInteractionOutputCallbackgetPatternSynssetPatternSynsmodifyPatternSynsgetPatternSynImportsgetAllPatternSynslookupPatternSynlookupSinglePatternSyn theBenchmarkupdateBenchmarkaddImportedInstancesupdateInstanceDefsmodifyInstanceDefsgetAllInstanceDefsgetAnonInstanceDefsclearAnonInstanceDefsaddUnknownInstanceaddNamedInstance noMutualBlock inMutualBlocksetMutualBlockInfoinsertMutualBlockInfosetMutualBlockcurrentOrFreshMutualBlocklookupMutualBlock mutualBlockOfupdateBenchmarkingStatusprintDropArgsdropArgs$fDropArgsCompiledClauses'$fDropArgsTerm$fDropArgsFunctionInverse'$fDropArgsClause$fDropArgsPermutation$fDropArgsTele$fDropArgsMaybedebugConstraintsguardConstraintifNoConstraints_ noConstraintssolveAwakeConstraints'solveConstraintcatchConstraintmatchCompiledE matchCompiledActioninfercheckInternal' checkInternal checkTypeeraseUnusedAction defaultActionPSynNamesInnamesIn$fNamesInAmbiguousQName$fNamesInPattern'$fNamesInDisplayTerm$fNamesInDisplayForm $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$fNamesInNonemptyList $fNamesIn[]$fNamesInMaybe $fNamesInPSyn showOpenMetasscopeCheckImporthighlightAsTypeCheckedcheckModuleName moduleName' moduleName autoInlineLensPersistentVerbositygetPersistentVerbositysetPersistentVerbositymapPersistentVerbosityPersistentVerbosityLensIncludePathsgetIncludePathssetIncludePathsmapIncludePathsgetAbsoluteIncludePathssetAbsoluteIncludePathsmapAbsoluteIncludePaths 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' hasInputFileproofIrrelevancehasUniversePolymorphismshowImplicitArgumentsshowIrrelevantArgumentswithShowAllArgumentswithShowAllArguments'withPragmaOptionsignoreInterfacespositivityCheckEnabled typeInType etaEnabledmaxInstanceSearchDepthmaxInversionDepthparseVerboseKeyhasExactVerbositywhenExactVerbosity verbosityinterestingCall traceCallM traceCallgetCurrentRangesetCurrentRange FindErrorNotFound AmbiguoustoIFilereplaceModuleExtensionfindErrorToTypeErrorfindFile findFile' findFile''findInterfaceFilerootNameModuleSerialisedRangeunderlyingRange $fEmbPrjEmpty$fEmbPrjImpossible$fEmbPrjDelayed$fEmbPrjIsAbstract$fEmbPrjLiteral$fEmbPrjProjOrigin$fEmbPrjConOrigin$fEmbPrjFreeVariables$fEmbPrjOrigin$fEmbPrjRelevance$fEmbPrjModality$fEmbPrjQuantity$fEmbPrjHiding$fEmbPrjInduction$fEmbPrjHasEta $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$fEmbPrjIntSet $fEmbPrjSet $fEmbPrjMap $fEmbPrjBiMap$fEmbPrjNonemptyList $fEmbPrj[]$fEmbPrjTopLevelModuleName$fEmbPrjPosition'$fEmbPrjAbsolutePath$fEmbPrjDataOrRecord $fEmbPrjBool $fEmbPrjMaybe$fEmbPrjMaybe0$fEmbPrjEither $fEmbPrj(,,) $fEmbPrj(,) $fEmbPrj() $fEmbPrjVoid$fEmbPrjDouble $fEmbPrjChar $fEmbPrjInt $fEmbPrjInt32$fEmbPrjWord64$fEmbPrjInteger$fEmbPrjByteString $fEmbPrj[]0 $fEmbPrjName0$fEmbPrjSerialisedRange$fEmbPrjTokenBased$fEmbPrjCompressedFile$fEmbPrjDefinitionSite$fEmbPrjAspects$fEmbPrjOtherAspect$fEmbPrjAspect$fEmbPrjNameKind $fEmbPrjRange getStatisticsmodifyStatisticsticktickNtickMaxprintStatistics SizeMaxViewSizeViewComparable NotComparableYesAboveYesBelow DeepSizeViewDSizeInfDSizeVar DSizeMeta DOtherSizeSizeViewSizeInfSizeSuc OtherSize IsSizeType isSizeType BoundedSize BoundedLt BoundedNoisSizeTypeTestgetBuiltinDefNamegetBuiltinSizeisSizeNameTestisSizeNameTestRawhaveSizedTypes haveSizeLtbuiltinSizeHooksizeSortsizeUniv sizeType_sizeType sizeSucNamesizeSucsizeSuc_sizeMaxsizeViewsizeViewComparable sizeViewSuc_ sizeViewPredsizeViewOffset removeSucs unSizeViewunDeepSizeView maxViewMax maxViewConssizeViewComparableWithMax maxViewSuc_ unMaxView$fIsSizeTypeTerm$fIsSizeTypeType'$fIsSizeType(,)$fIsSizeTypeDom$fEqBoundedSize$fShowBoundedSize$fShowDeepSizeView$fFunctorSizeViewComparableRangeAndPragma DontTouchMe ToConcrete toConcretebindToConcreteAbsToConEnvpreserveInteractionIds noTakenNames runAbsToConabstractToConcreteScopeabstractToConcreteCtxabstractToConcrete_abstractToConcreteHiding toConcreteCtx$fToConcreteNamedMetaExpr$fToConcreteInteractionIdExpr$fToConcreteLHSCore'Pattern$fToConcreteLHSLHS$fToConcreteSpineLHSLHS.$fToConcreteModuleApplicationModuleApplication$fToConcreteClause'[]$fToConcreteConstrDeclaration$fToConcreteMaybeMaybe$fToConcreteRHS(,,,))$fToConcreteWhereDeclarationsWhereClause'$fToConcreteLetBinding[]%$fToConcreteTypedBindingTypedBinding'$fToConcreteTypedBindings[]$fToConcreteLamBinding[],$fToConcreteFieldAssignment'FieldAssignment'$fToConcreteExprExpr$fToConcreteResolvedNameQName$fToConcreteAbstractNameQName$fToConcreteModuleNameQName$fToConcreteQNameQName$fToConcreteBindNameName$fToConcreteNameName$fToConcreteNamedNamed $fToConcreteWithHidingWithHiding$fToConcreteArgArg$fToConcrete(,,)(,,)$fToConcrete(,)(,)$fToConcreteEitherEither$fToConcrete[][]$fToConcreteDontTouchMea $fToConcreteRangeAndPragmaPragma$fToConcreteDeclaration[]$fToConcreteUserPatternArg$fToConcreteUserPatternPattern'$fToConcretePattern'Pattern$fToConcreteSplitPatternArg $fToConcreteSplitPatternPattern'"$fToConcreteBindingPatternPattern'$fToConcreteFreshNameName ScopeMemo memoNames memoModulesWSMScopeMisDatatypeModule printLocalsgetCurrentModulesetCurrentModulewithCurrentModule' getNamedScopegetCurrentScope createModule modifyScopesmodifyNamedScope setNamedScopemodifyNamedScopeMmodifyCurrentScopemodifyCurrentScopeMmodifyCurrentNameSpacepushContextPrecedencesetContextPrecedencewithContextPrecedence getLocalVarsmodifyLocalVars setLocalVars withLocalVars getVarsToBind addVarToBindbindVarsToBindfreshAbstractNamefreshAbstractName_freshAbstractQName resolveName resolveName' resolveModule getNotation bindVariableunbindVariablebindName rebindName bindModule bindQModule stripNoNamesmemoToScopeInfo copyScopeapplyImportDirectiveMlookupImportedName mapImportDirmapUsing mapRenaming openModule_ KeepNames AddContext addContext contextSize modifyContextsafeInTopContext inTopContext escapeContext checkpoint updateContextgetModuleParameterSubaddCtxunshadowedName unshadowNamedummyDomunderAbstractionunderAbstraction'underAbstraction_ addLetBinding getContextgetContextSizegetContextArgsgetContextTermsgetContextTelescopegetContextNameslookupBV typeOfBV'typeOfBVnameOfBV getVarInfo$fAddContextTele$fAddContext[]$fAddContextName$fAddContextDom$fAddContext(,)$fAddContext(,)0$fAddContext(,)1$fAddContextDom0$fAddContextDom1$fAddContext(,)2$fAddContext[]0$fAddContextKeepNames$fAddContext(,)3 HasConstInfo getConstInfo getConstInfo'getRewriteRulesForSigError SigUnknown SigAbstractCoreCodeJSCode HaskellType HaskellCode addConstant setTerminatesmodifyFunClauses addClausesmkPragma addPragmaaddDeprecatedPragma dataFormataddHaskellCodeaddHaskellExportaddHaskellTypeaddHaskellData addJSCode addCoreCode addCoreTypegetUniqueCompilerPragmasetFunctionFlag markStatic markInline markInjectiveunionSignatures addSectionsetModuleCheckpoint getSection lookupSectionaddDisplayForms applySection applySection'addDisplayFormisLocalgetDisplayFormschaseDisplayFormshasLoopingDisplayForm canonicalNamesameDef whatInductionsingleConstructorTypesigErrordefaultGetRewriteRulesForgetOriginalProjectiondefaultGetConstInfo getConInfo getPolarity' setPolarity getForcedArgsgetArgOccurrencesetArgOccurrencesmodifyArgOccurrences setTreelesssetCompiledArgUse getCompiledgetErasedConArgssetErasedConArgs getTreelessgetCompiledArgUse getMutual getMutual_ setMutualmutuallyRecursivedefinitelyNonRecursive_getCurrentModuleFreeVars getDefModulegetDefFreeVarsfreeVarsToApplygetModuleFreeVarsmoduleParamsToApplyinFreshModuleIfFreeParamsinstantiateDefinstantiateRewriteRuleinstantiateRewriteRules makeAbstractinAbstractModeinConcreteModeignoreAbstractModeinConcreteOrAbstractModetreatAbstractlytreatAbstractly' typeOfConst relOfConst droppedPars isProjection isProjection_ isStaticFun isInlineFunisProperProjectionprojectionArgsusesCopatternsapplyDef$fHasConstInfoWriterT$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'$fEmbPrjPatOrigin$fEmbPrjDBPatVar$fEmbPrjConPatternInfo$fEmbPrjClause$fEmbPrjTermHead$fEmbPrjFunctionInverse'$fEmbPrjCompiledClauses' $fEmbPrjCase$fEmbPrjWithArity$fEmbPrjFunctionFlag $fEmbPrjDefn$fEmbPrjEtaEquality$fEmbPrjOccurrence$fEmbPrjIsForced$fEmbPrjPolarity$fEmbPrjExtLamInfo$fEmbPrjProjLams$fEmbPrjProjection$fEmbPrjRewriteRule$fEmbPrjNLPType $fEmbPrjNLPat$fEmbPrjDefinition$fEmbPrjMutualId$fEmbPrjDisplayTerm$fEmbPrjCheckpointId $fEmbPrjOpen$fEmbPrjDisplayForm $fEmbPrjSort$fEmbPrjLevelAtom$fEmbPrjPlusLevel $fEmbPrjLevel $fEmbPrjTerm $fEmbPrjAbs $fEmbPrjType'$fEmbPrjConHead $fEmbPrjElim' $fEmbPrjDrop$fEmbPrjPermutation $fEmbPrjTele$fEmbPrjSection$fEmbPrjSignature$fEmbPrjScopeInfo$fEmbPrjPrecedence$fEmbPrjParenPreference$fEmbPrjConPatInfo$fEmbPrjLocalVar$fEmbPrjBinder$fEmbPrjKindOfName$fEmbPrjAbstractModule$fEmbPrjAbstractName$fEmbPrjWhyInScope$fEmbPrjNameSpace$fEmbPrjAccess$fEmbPrjNameSpaceId $fEmbPrjScope$fEmbPrjBindName $fEmbPrjDoc$fEmbPrjDeclarationWarning$fEmbPrjWarning$fEmbPrjTCWarning$fEmbPrjInterfaceencodedecodeencodeInterface encodeFiledecodeInterface decodeHashes decodeFile useTerPragma newSection checkFunDef' checkFunDefbindBuiltinFlatbindBuiltinSharpbindBuiltinInfaskRapplyWhenVerboseS$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$fMentionsMetaTerm BinAppViewNoApp binAppView etaContractetaOnceetaConetaLamInstantiateFullinstantiateFull' Normalise normalise'Simplify simplify'reduce'reduceB' Instantiate instantiate' instantiateinstantiateFullreducereduceB normalisesimplifyisFullyInstantiatedMeta ifBlocked isBlocked ifBlockedType isBlockedTypeshouldTryFastReducemaybeFastReduceTermslowReduceTermunfoldCorecursionEunfoldCorecursionunfoldDefinitionunfoldDefinitionEunfoldDefinition'unfoldDefinitionStep reduceDefCopy reduceHead reduceHead' unfoldInlinedunfoldInlined'appDef_appDefE_appDefappDefEappDef'appDefE'simplifyBlocked'slowNormaliseArgs$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$fInstantiateFullConHead$fInstantiateFullQName$fInstantiateFullBuiltin$fInstantiateFullInterface$fInstantiateFullClause!$fInstantiateFullCompiledClauses'$fInstantiateFullCase$fInstantiateFullWithArity!$fInstantiateFullFunctionInverse'$fInstantiateFullDefn$fInstantiateFullDisplayTerm$fInstantiateFullDisplayForm$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 teleArgNamesteleArgswithNamedArgsFromTel teleNamedArgstele2NamedArgssplitTelescopeAt permuteTelvarDependenciessplitTelescopesplitTelescopeExactinstantiateTelescopeexpandTelescopeVar telViewUpTo telViewUpTo'mustBePiifPiifPiTypeifNotPi ifNotPiTypepiApply1 typeAritygetOutputTypeNameaddTypedInstanceresolveUnknownInstanceDefsgetInstanceDefsSynEqcheckSyntacticEquality$fSynEqArgInfo $fSynEqDom $fSynEqArg $fSynEqAbs $fSynEqElim' $fSynEq[] $fSynEqType' $fSynEqSort$fSynEqLevelAtom$fSynEqPlusLevel $fSynEqLevel $fSynEqTerm TermToPattern termToPatterndotPatternsToPatterns$fTermToPatternTermPattern'$fTermToPatternNamedNamed$fTermToPatternArgArg$fTermToPattern[][]LevelKitlvlTypelvlSuclvlMaxlvlZerotypeNamesucNamemaxNamezeroName levelTypelevelSucFunctionbuiltinLevelKit requireLevels haveLevelsunLevelreallyUnLevelViewunlevelWithKitunPlusV maybePrimCon maybePrimDef levelView levelView'levelLubsubLevel isEmptyTypeSubstWithOriginsubstWithOrigin dtermToTermdisplayFormArities displayFormmatchDisplayForm $fMatchLevel $fMatchSort $fMatchTerm $fMatchElim' $fMatchArg $fMatch[]$fSubstWithOriginArg$fSubstWithOriginDisplayTerm$fSubstWithOriginTerm$fSubstWithOriginArg0$fSubstWithOriginElim'$fSubstWithOrigin[]leqLevelleqType equalLevel 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$fBlankVarsProblemEq$fBlankVarsEither$fBlankVars(,)$fBlankVarsFieldAssignment'$fBlankVarsPattern' $fBlankVars[]$fBlankVarsNamed$fBlankVarsArg $fBinder(,) $fBinder[] $fBinderNamed $fBinderArg$fBinderFieldAssignment'$fBinderWithHiding$fBinderWithHiding0$fBinderLetBinding$fBinderTypedBinding$fBinderTypedBindings$fBinderLamBinding$fBinderPattern'$fBinderLHSCore' $fBinderLHS$fBlankVarsExpr$fBlankVarsClause'readlinevimFileescape wordBoundedmatchestoVimgenerateVimFilelispifyTokenBasedlispifyHighlightingInfo usedArgumentsstripUnusedArgumentsnormalizeNamesdetectIdentityFunctions$fSemigroupIdentityIntranslateBuiltins closedTerm addCoercions 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 PrettyContext prettyTCMCtxprettyTCMPatternsprettyTCMPatternList$fPrettyTCMOccurrence$fPrettyTCMRewriteRule$fPrettyTCMType'$fPrettyTCMElim'$fPrettyTCMNLPType$fPrettyTCMNLPat$fPrettyTCMElim'0$fPrettyTCMPattern'$fPrettyTCMDBPatVar$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$fPrettyTCMSubstitution'$fPrettyTCMTerm$fPrettyTCMIsForced$fPrettyTCMPolarity$fPrettyTCMPermutation$fPrettyTCMLevel$fPrettyTCMQNamed$fPrettyTCMNamedClause$fPrettyTCMDisplayTerm$fPrettyTCMSort$fPrettyTCMType'0$fPrettyTCMTerm0$fPrettyTCM(,,)$fPrettyTCM(,)$fPrettyTCM[]0$fPrettyTCMClosure$fPrettyTCMCheckpointId$fPrettyTCMRange'$fPrettyTCMProblemId$fPrettyTCMInt$fPrettyTCMLiteral$fPrettyTCMComparison$fPrettyTCMQName0$fPrettyTCMName0$fPrettyTCMBool$fPrettyTCMPrettyContext$fPrettyTCMGraph$fPrettyTCMWithNodeOldSizeConstraintLeq OldSizeExprSizeMetacheckSizeLtSatcheckSizeNeverZerocheckSizeVarNeverZero isBoundedboundedSizeMetaHook trySizeUniv deepSizeView sizeMaxView compareSizescompareMaxViewscompareBelowMaxcompareSizeViewstrivial isSizeProblemisSizeConstrainttakeSizeConstraintsgetSizeConstraints getSizeMetasoldComputeSizeConstraintsoldComputeSizeConstraint oldSizeExprflexibleVariablesoldCanonicalizeSizeConstraintoldSolveSizeConstraints oldSolver$fShowOldSizeExpr$fShowOldSizeConstraint$fEqOldSizeExprLHSState_lhsTel _lhsOutPat _lhsProblem _lhsTarget AbsurdPattern DotPattern AsBindingAsBProblem _problemEqs_problemRestPats _problemCont ChooseFlex chooseFlex FlexChoice ChooseLeft ChooseRight ChooseEither ExpandBoth FlexibleVar flexHiding flexOriginflexKindflexPosflexVarFlexibleVarKind RecordFlex ImplicitFlexDotFlex OtherFlex FlexibleVars allFlexVars problemEqsproblemRestPats problemCont problemInPatslhsTel lhsOutPat lhsProblem lhsTarget$fPrettyTCMProblemEq$fLensOriginFlexibleVar$fLensHidingFlexibleVar$fMonoidFlexChoice$fSemigroupFlexChoice$fChooseFlexFlexibleVar$fChooseFlexInt$fChooseFlexOrigin$fChooseFlexHiding$fChooseFlexMaybe$fChooseFlex[]$fChooseFlexFlexibleVarKind$fInstantiateFullAsBinding$fPrettyAsBinding$fPrettyTCMAsBinding$fSubstTermAsBinding$fPrettyTCMDotPattern$fSubstTermDotPattern$fPrettyTCMAbsurdPattern$fSubstTermAbsurdPattern$fSubstTermProblem$fEqFlexibleVarKind$fShowFlexibleVarKind$fEqFlexibleVar$fShowFlexibleVar$fFunctorFlexibleVar$fFoldableFlexibleVar$fTraversableFlexibleVar$fEqFlexChoice$fShowFlexChoice $fShowProblemcheckDisplayPragmaNormaliseProjPnormaliseProjPElimTypeArgTProjTprojTRec projTFieldmkCon orderFieldsinsertMissingFields recordModule getRecordDefgetRecordOfFieldrecordFieldNamesfindPossibleRecordsgetRecordFieldTypesgetRecordTypeFieldsgetRecordConstructor isRecordType tryRecordTypeorigProjection getDefType projectTyped typeElimsisEtaConisInductiveRecordisEtaRecordTypeunguardedRecordrecursiveRecordnonRecursiveRecordisRecursiveRecordetaExpandBoundVarexpandRecordVarexpandRecordVarsRecursivelycurryAtetaExpandRecordforceEtaExpandRecordetaExpandRecord'etaExpandRecord_etaExpandRecord'_etaExpandAtRecordTypeisSingletonRecord isSingletonRecordModuloRelevanceisSingletonRecord'isSingletonTypeisSingletonTypeModuloRelevanceisSingletonType'isEtaVaremap$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[][] 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$fHasPolarityArgUsableRelevance usableRelhideAndRelParamsinverseApplyRelevanceapplyRelevance workOnTypes workOnTypes'applyRelevanceToContextwakeIrrelevantVars$fUsableRelevanceAbs$fUsableRelevanceDom$fUsableRelevanceArg$fUsableRelevanceElim'$fUsableRelevance(,)$fUsableRelevance[]$fUsableRelevanceLevelAtom$fUsableRelevancePlusLevel$fUsableRelevanceLevel$fUsableRelevanceSort$fUsableRelevanceType'$fUsableRelevanceTerm inferUnivSort sortFitsIn hasBiggerSort inferPiSort inferFunSortptsRuleptsRule' hasPTSRulecheckTelePiSortImplicitInsertion ImpInsert BadImplicits NoSuchNameNoInsertNeeded implicitArgsimplicitNamedArgs newMetaArgnewInteractionMetaArg impInsertinsertImplicit$fShowImplicitInsertion implicitPinsertImplicitPatternsinsertImplicitSizeLtPatternsinsertImplicitPatternsTuseNamesFromPattern useOriginFrom noProblemRest initLHSStateupdateProblemRestetaExpandClausegetDefForcedVariablesforcedVariablescomputeForcingAnnotationsisForced nextIsForcedforceTranslateTelescoperebindForcedPatterndotForcedPatterns$fForcedVariablesTerm$fForcedVariablesArg$fForcedVariablesElim'$fForcedVariables[]ConstructorInfoDataCon RecordCon getConFormgetOrigConHeadgetFullyAppliedConTypegetConstructorInfo isDatatypeisDataOrRecordTypeisDataOrRecordgetNumberOfParametersgetConstructorsgetConstructors'getConstructors_ getConHeads getConHeads' getConHeads_DefNodeArgNodeComputeOccurrences 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 sSizeUniv tSizeUnivargNdomNargHdomHprimitiveFunctionslookupPrimitiveFunctionlookupPrimitiveFunctionQgetBuiltinName isBuiltin $fShowNat $fTermLikeNat $fIntegralNat $fShowLvl $fPrimTermIO $fPrimTerm[]$fPrimTermFixity'$fPrimTermType'$fPrimTermMetaId$fPrimTermQName $fPrimTermLvl $fPrimTermNat $fPrimTermStr$fPrimTermDouble$fPrimTermChar$fPrimTermBool$fPrimTermWord64$fPrimTermInteger $fPrimTypea$fPrimTerm(->) $fToTerm[]$fToTermPrecedenceLevel$fToTermAssociativity$fToTermFixity$fToTermFixity'$fToTermArgInfo $fToTermType' $fToTermTerm $fToTermBool$fToTermInteger$fToTermMetaId $fToTermQName $fToTermStr $fToTermChar$fToTermDouble $fToTermLvl$fToTermWord64 $fToTermNat $fFromTerm[]$fFromTermBool$fFromTermMetaId$fFromTermQName $fFromTermStr$fFromTermChar$fFromTermDouble $fFromTermLvl$fFromTermWord64 $fFromTermNat$fFromTermInteger$fEqNat$fOrdNat$fNumNat $fEnumNat $fRealNat$fEqLvl$fOrdLvl simplifyTTerm $fShowAtom$fEqAtom $fOrdAtom BuiltinKitnateliminateLiteralPatterns transformeliminateCaseDefaults YesNoMaybeHellNoinitialIFSCandidates findInScope findInScope'insidePirigidlyConstrainedMetasisRigidareThereNonRigidMetaArgumentsfilterResetingStatedropSameCandidatesisNocheckCandidatesisIFSConstraintapplyDroppingParameters$fShowYesNoMaybe matchedArgs foldMatchmatchCopattern matchPatternyesSimplification $fNullMatch$fFunctorMatch PruneResultNothingToPrune PrunedNothingPrunedSomethingPrunedEverything FoldRigid foldRigidoccurs metaOccursVarsUnfoldStrategy YesUnfoldNoUnfold OccursCtxIrrelmodifyOccursCheckDefsinitOccursCheckdefNeedsCheckingtallyDefdefArgsunfoldweaklystronglypatternViolation'abort goIrrelevant goNonStrict allowedVar takeRelevanttakeAll 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$fShowPruneResultSplitTreeLabellblConstructorName lblSplitArg lblBindingsSplitTagSplitConSplitLit SplitCatchall SplitTrees' SplitTree' SplittingDoneSplitAt splitBindingssplitArg splitTrees SplitTrees SplitTreetoTreetoTrees$fPrettySplitTree'$fPrettyTCMSplitTag$fPrettySplitTag$fPrettySplitTreeLabel$fShowSplitTag $fEqSplitTag $fOrdSplitTagrecordPatternToProjectionstranslateCompiledClausestranslateSplitTreetranslateRecordPatterns $fDropFrom[] $fDropFrom(,)$fDropFromSplitTree'$fPrettyTCM(->) $fPretty(->)$fPrettyTCMEither$fFunctorRecPatM$fApplicativeRecPatM$fMonadRecPatM$fMonadIORecPatM$fMonadTCMRecPatM$fHasOptionsRecPatM$fMonadDebugRecPatM$fMonadReaderRecPatM$fMonadStateRecPatM$fEqKind BlockingVars BlockingVar blockingVarNoblockingVarConsblockingVarLitsblockingVarOverlapBlockblockedOnResult blockedOnVars MatchResultSplitPSubstitution SplitPattern SplitPatVarsplitPatVarNamesplitPatVarIndexsplitExcludedLits toSplitVar fromSplitVartoSplitPatternsfromSplitPatterns toSplitPSubstfromSplitPSubstapplySplitPSubstisTrivialPatternblockedOnConstructorblockedOnLiteralblockedOnProjectionmapBlockingVarConsmapBlockingVarLitssetBlockingVarOverlapzipBlockingVars matchClause matchPatsmatchPat$fPrettyTCMSplitPatVar$fPrettySplitPatVar$fPrettyBlockingVar $fMonoidMatch$fSemigroupMatch$fShowSplitPatVar$fShowBlockingVar newProblem newProblem_ifNoConstraintswhenConstraintswakeupConstraintswakeupConstraints_solveAwakeConstraintssolveConstraint_checkTypeCheckingProblem InvertExcept CantInvert NeutralArg ProjectedVarRes SubstCandFVsReduceAndEtaContractreduceAndEtaContract ProjVarExcNoProjectedVarnoProjectedVarMetaKindRecordsSingletonRecordsLevelsfindIdx isBlockedTermisEtaExpandable assignTerm'newSortMetaBelowInf newSortMeta'newSortMetaCtxnewSortMetaCtx' newTypeMeta newTypeMeta_ newIFSMetaCtxnewValueMetaCtx newValueMeta'newValueMetaCtx' trueConditionnewArgsMetaCtxnewArgsMetaCtx' newRecordMetanewRecordMetaCtxnewQuestionMarknewQuestionMark' blockTermblockTermOnProblemblockTypeOnProblemunblockedTesterpostponeTypeCheckingProblem_postponeTypeCheckingProblemetaExpandListenerswakeupListener allMetaKinds etaExpandMetaetaExpandBlocked assignWrapper assignMeta assignMeta'subtypingForSizeLtexpandProjectedVarsetaExpandProjectedVarcheckLinearity inverseSubstopenMetasToPostulates$fNoProjectedVar[]$fNoProjectedVarArg$fNoProjectedVarTerm$fReduceAndEtaContractTerm$fReduceAndEtaContractArg$fReduceAndEtaContract[] $fEqMetaKind$fEnumMetaKind$fBoundedMetaKind$fShowMetaKindFullPartialprintHighlightingInfogenerateAndPrintSyntaxInfogenerateTokenInfogenerateTokenInfoFromStringprintSyntaxInfoprintErrorInfoerrorHighlightingwarningHighlightingprintUnsolvedInfocomputeUnsolvedMetaWarningscomputeUnsolvedConstraintsstoreDisambiguatedName MaybeAbortAbort KeepGoingInvViewInvNoInv headSymbol headSymbol' topLevelArg joinHeadMaps updateHeadscheckInjectivitycheckOverapplicationinstantiateVarHeadsfunctionInverseuseInjectivityinvertFunctionforcePiUsingInjectivity tryConversiontryConversion'sameVars intersectVars equalAtom convError unifyPointersassignEcompareTermDir compareTerm' etaInequalcompareAtomDircomputeElimHeadType compareDomcompareRelevance antiUnify antiUnifyTypeantiUnifyElimscompareIrrelevantcompareWithPol polFromCmpcoerce coerceSizeleqSort 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$fUnquoteWord64$fUnquoteInteger $fUnquoteBool$fUnquoteElim' $fUnquoteArg$fUnquoteArgInfo$fUnquoteModality$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$fShowUnifyStep checkDataDef forceSortcheckConstructorbindParametersbindParameters'fitsIn constructs isCoinductive GetMatchables getMatchables NLPatVarsnlPatVarsUnder nlPatVarsRelView relViewTel relViewDelta relViewType relViewType' relViewCorerequireOptionRewritingrelViewaddRewriteRuleaddRewriteRules rewriteWithrewArity $fFreeNLPType $fFreeNLPat$fNLPatVarsNLPat$fNLPatVarsNLPType $fNLPatVarsf$fGetMatchablesRewriteRule$fGetMatchablesNLPat$fGetMatchablesfStackFrame$fPrettyNameId$fPrettyFastCase$fPrettyFastCompiledClauses $fPrettyThunk$fPrettyClosure$fPrettyPointer$fPrettyCatchAllFrame$fPrettyMatchStack$fZipperElimZipper$fPrettyControlFrame $fPrettyAM$fEqNormalisation$fFunctorThunk$fEqElimZipper$fOrdElimZipper$fShowElimZipper$fFunctorElimZipper$fFoldableElimZipper$fTraversableElimZipper preAction postActionrelevanceAction inferSort LHSResult lhsParameters lhsVarTele lhsPatterns lhsHasAbsurd lhsBodyType lhsPatSubst lhsAsBindingsIsFlexiblePatternmaybeFlexiblePatternisFlexiblePatternbindAsPatternscheckLeftHandSidecheckSortOfSplitVar$fIsFlexiblePatternNamed$fIsFlexiblePatternArg$fIsFlexiblePattern[]$fIsFlexiblePatternPattern'$fIsFlexiblePatternPattern'0$fMonoidLeftoverPatterns$fSemigroupLeftoverPatterns$fInstantiateFullLHSResultLamOrPiLamNotPiPiNotLamisTypenoFunctionsIntoSize isTypeEqualToleqType_checkTelescopecheckPiTelescopecheckTelescope'checkTypedBindingscheckTypedBinding checkLambdalambdaIrrelevanceChecklambdaAddContextinsertHiddenLambdascheckAbsurdLambdacheckExtendedLambda!catchIlltypedPatternBlockedOnMetaexpandModuleAssignscheckRecordExpressioncheckRecordUpdate checkLiteral scopedExpr quoteGoal quoteContextunquoteMcheckQuestionMarkcheckUnderscore checkMeta inferMetacheckOrInferMeta domainFreecheckKnownArgumentscheckKnownArgument checkNamedArg inferExpr'defOrVarcheckDontExpandLastisModuleFreeVarinferExprForWithcheckLetBindingscheckLetBinding $fEqLamOrPi $fShowLamOrPibindPostulatedName bindBuiltinisUntypedBuiltinbindUntypedBuiltinbindBuiltinNoDef typeOfInf typeOfSharp typeOfFlatCovering covSplitArgcovSplitClauses SplitClauseSClausescTelscPatsscSubst scCheckpointsscTarget splitClausesclauseToSplitClause coverageCheck isCovered fixTargetsplitClauseWithAbsurd splitLast splitResult$fPrettyTCMSplitClause$fPrettyTCMCosplitError$fShowFixTarget$fEqAllowPartialCover$fShowAllowPartialCover$fMonoidErrorNonEmpty$fSemigroupErrorNonEmptyClsClclPatsclBodyRunRecordPatternTranslationDontRunRecordPatternTranslationcompileClauses'unBruijncompileWithSplitTreecompile nextSplit properSplitisVarsplitOnsplitCexpandCatchAllsensureNPatterns substBody$$fPrecomputeFreeVarsCompiledClauses' $fPrettyCl$fEqRunRecordPatternTranslation$fShowCl checkRecDefcheckRecordProjectionsreconstructParametersInTypereconstructParametersInTelreconstructParametersInEqViewreconstructParametersdropParametersAbsTermabsTerm IsPrefixOf isPrefixOftypeOf abstractTypepiAbstractTerm piAbstract abstractTermswap01$fIsPrefixOfTerm$fIsPrefixOf[]$fIsPrefixOf[]0 $fAbsTerm(,) $fAbsTermAbs$fAbsTermMaybe $fAbsTerm[] $fAbsTermDom $fAbsTermArg$fAbsTermElim'$fAbsTermLevelAtom$fAbsTermPlusLevel$fAbsTermLevel $fAbsTermSort$fAbsTermType' $fAbsTermTermsplitTelForWithwithFunctionType countWithArgs withArgumentsbuildWithFunctionstripWithClausePatternswithDisplayForm patsToElimsWithFunctionProblemNoWithFunction WithFunction wfParentNamewfName wfParentType wfParentTel wfBeforeTel wfAfterTelwfExprs wfExprTypes wfRHSType wfParentPatswfParentParams wfPermSplit wfPermParent wfPermFinal wfClausescheckMacroTypeisAlias checkAlias checkFunDefSinsertPatternsinsertPatternsLHSCore 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$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$fRenameWhereDeclarations $fRenameRHS$fRenameClause'$fRenameProblemEq$fRenameTypedBinding$fRenameTypedBindings$fRenameLamBinding$fRenameLetBinding$fRenameFieldAssignment'$fRenameModuleName $fRenameExpr$fRenameBindName $fRenameName $fRenameQName $fAlpha[] $fAlphaNamed $fAlphaArg $fAlphaLHS$fAlphaLHSCore'$fAlphaPattern' $fAlphaName $fFunctorPath $fEqProjEntry$fOrdProjEntryparseLHS parsePatternparsePatternSynparseApplicationparseModuleApplication $fEqExprKind$fShowExprKindparseIdiomBracketsdesugarDoNotation LeftHandSide AbstractRHS RightHandSideLetDefLetDefs TopLevelInfo topLevelDecls topLevelScopeTopLevel topLevelPathtopLevelExpectedNametopLevelTheThing OldModuleNameNewModuleQName NewModuleNameAPatNamePatNameOldNameOldQNameNewNameconcreteToAbstract_concreteToAbstractlocalToAbstract$$fToAbstractHoleContent'HoleContent'$fToAbstractPattern'Pattern'$fToAbstractLHSCore'LHSCore' $fToAbstractWithHidingWithHiding'$fToAbstractTypedBindings'TypedBindings,$fToAbstractFieldAssignment'FieldAssignment'$fToAbstractMaybeMaybe$fToAbstractEitherEither$fToAbstract(,,)(,,)$fToAbstract(,)(,)!$fToAbstractLamBinding'LamBinding$fToAbstractNewNameName$fToAbstractNewNameName0$fToAbstractPatternPattern'$fToAbstractOldQNameExpr$fToAbstractLHSCoreLHSCore'$$fToAbstractResolveQNameResolvedName$fToAbstractPatNameAPatName$fToAbstractOldNameQName$fToQNameQName $fToQNameName#$fToAbstractNewModuleNameModuleName$$fToAbstractNewModuleQNameModuleName$fToAbstractModuleAssignment(,)#$fToAbstractOldModuleNameModuleName$fEnsureNoLetStms[]$fEnsureNoLetStmsTypedBindings'$fEnsureNoLetStmsLamBinding'$fEnsureNoLetStmsTypedBinding' $fToAbstractTopLevelTopLevelInfo%$fToAbstractTypedBinding'TypedBinding$fToAbstractExprExpr$fToAbstractLetDef[]$fToAbstractLetDefs[]$fToAbstractBlindBlind$fLivesInCurrentModuleQName"$fLivesInCurrentModuleAbstractName!$fToAbstractConstrDeclDeclaration&$fToAbstractNiceDeclarationDeclaration$fToAbstractRHS'AbstractRHS$$fToAbstractRightHandSideAbstractRHS$fToAbstractAbstractRHSRHS$fToAbstractLeftHandSideLHS$fToAbstractClauseClause'$fToAbstractPragma[]OutputConstraint'OfType'ofNameofExprOutputConstraintOfType CmpInTypeCmpElimJustTypeCmpTypes CmpLevelsCmpTelesJustSortCmpSortsGuard TypedAssignPostponedCheckArgs IsEmptyType SizeLtSat FindInScopeOF PTSInstance 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 readInterfacewriteInterfaceremovePrivatescreateInterfacegetUniqueMetasRangesgetUnsolvedMetasgetAllUnsolvedgetAllWarnings'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 mazErasedNamemazAnyTypeName mazCoercemazIncompleteMatchrtmIncompleteMatchmazUnreachableErrorrtmUnreachableError mazAnyTypemazRTErtmQualrtmVarrtmErrorunsafeCoerceModfakeDfakeDSfakeDQfakeTypefakeExpfakeDecl emptyBinds isModCharencodeModuleName prettyPrint prettyWhere prettyRhsprettyGuardedRhs prettyQName $fPrettyQOp $fPrettyAlt $fPrettyStmt $fPrettyType$fPrettyTyVarBind$fPrettyDataOrNew $fPrettyBinds $fPrettyPat $fPrettyMatch$fPrettyStrictness$fPrettyConDecl $fPrettyDecl$fPrettyImportSpec$fPrettyImportDecl$fPrettyModulePragmaisMainFunctionhasMainFunctioncheckTypeOfMaintreelessPrimNameimportsForPrimxForPrimprimBody noCheckCoverpconNamebltQual' haskellTypecheckConstructorCounthsTelApproximationhsTelApproximation'$fEqPolyApprox generateLaTeX $fShowKind$fShowAlignmentColumn $fShowOutput $fEqDebug $fShowDebugdefaultCSSFile generateHTMLgenerateHTMLWithPageGen generatePagepage tokenStream RecompileBackend' backendNamebackendVersionoptionscommandLineFlags isEnabled preCompile postCompile preModule postModule compileDefscopeCheckingSuffices callBackendparseBackendOptionsbackendInteraction GiveRefineGiveRefineIntroCompilerBackendLaTeX QuickLaTeX OtherBackendParseRemoveKeepIOTCM'IOTCM Interaction'Cmd_load Cmd_compileCmd_constraints Cmd_metas!Cmd_show_module_contents_toplevelCmd_search_about_toplevel Cmd_solveAll Cmd_solveOneCmd_infer_toplevelCmd_compute_toplevelCmd_load_highlighting_infoCmd_tokenHighlighting 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' independentupdateInteractionPointsAfter interpretinterpretWarningssolveInstantiatedGoals cmd_load'give_gen highlightExprsortInteractionPointsprettyTypeOfMeta prettyContextcmd_helper_functioncmd_goal_type_context_andshowModuleContents searchAboutsetCommandLineOptsstatus displayStatus display_info refreshStr nameModifiersparseAndDoAtToplevel maybeTimedtellToUpdateHighlightingtellEmacsToJumpToError$fReadPosition'$fReadAbsolutePath$fReadInterval' $fReadRange'$fReadInteractionId$fReadCompilerBackend$fShowCompilerBackend $fShowRemove $fReadRemove$fEqCompilerBackend$fShowInteraction'$fReadInteraction'$fFunctorInteraction'$fFoldableInteraction'$fTraversableInteraction' $fShowIOTCM' $fReadIOTCM'$fFunctorIOTCM'$fFoldableIOTCM'$fTraversableIOTCM' $fShowCommand$fEqGiveRefine$fShowGiveRefine mimicGHCi CCContext NameSupplyCCEnv _ccNameSupply _ccContext GHCModuleEnv GHCOptions optGhcCompile optGhcCallGhc optGhcFlags ghcBackend ghcBackend'defaultGHCOptionsghcCommandLineFlags ghcPreCompileghcPostCompile ghcPreModule ghcPostModule ghcCompileDefimports definitionconstructorCoverageCode ccNameSupply ccContext initCCEnv freshNamesintroscheckConstructorType checkCovermkIftermhsCoerce compilePrimalthslitlitqname litqnamepat erasedAritycondeclcompiledcondeclcompiledTypeSynonymtvaldeclinfodeclcopyRTEModules 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.EithereitherEitherTrueRightLeftGHC.Num+Functor3unordered-containers-0.2.9.0-HQtYJEH7265DslRAJ09vVDData.HashMap.Base filterWithKeyfoldl' foldlWithKey'foldr foldrWithKey lookupDefaulttraverseWithKeyData.HashMap.StrictalterdifferenceWith fromListWithintersectionWithintersectionWithKeymapMaybeWithKey unionWithKeyHashMapGHC.IO.ExceptionGHC.IOcatchconvertLineEndings GHC.IORefIORef Data.IORefatomicWriteIORefatomicModifyIORef'atomicModifyIORef modifyIORef' modifyIORef mkWeakIORef writeIORef readIORefnewIORefBelowAbovewarningNameDescription HelpTopicGHC.List readP_to_S readS_to_POrdering GHC.ClassesOrdGHC.ShowShowshowDocsPGFalseValueContPospgparserdocsstarDocs prettyKey memoiseDocssingletonOrEveryPrefixinitlastEq Data.OldListgroupBy==.sortBycomparezipWith System.IOputStrLn GenericLineHeaderContentfName fOptionalfParsefSetgeHeader geContent GenericFileP agdaLibFieldsFilePathparseLib fromGeneric fromGeneric' checkFields findField parseGeneric parseLine groupLines GenericEntry stripCommentsdisplayInBufferrunningInfoBufferName dropWhilerootNamedirectory-1.3.1.5System.DirectorycanonicalizePath doesFileExistmkLayersbleachisBlankbreak1getLine emptyLiteraterex<=GHC.EnummaxBoundfmapreachableFromInternalfoldr1orall&&anymapMmempty mergeAspectsMonoid-geniplate-mirror-0.7.6-BOyiF6L7w2F4l39KglniJWData.Generics.GeniplateinstanceUniverseBiT universeBiinstanceTransformBiMT transformBiM TransposetoBoundsinfSizelengthblowUpSparseVecunionAssocWithcollapseokMmaxOminOmappendcombineNewOldCallGraphlitError stringToken lexString lexStringGaplexChar lexEscapereadNum readNumAccsillyEscapeCharspragmafpragmaalexScanGHC.Err undefined happyErrortakeOptionsPragmasfigureOutTopLevelModulemkQName pragmaQNameisNameforallPitLetaddType buildDoStmtverifyImportDirectivevalidHaskellModuleName exprToLHS exprToPattern exprToNameHappyStk returnEOFskipTonewInputfoolAlex qualified getOffside occurrenceFVflexible irrelevantlyfreeIn'ChangeT evalUpdater MakePrivate MakeAbstractNiceEnv _loneSigs_termChk_posChk _catchallniceWarn DataRecOrFunDataNameRecNameFunNameInMutual NotInMutual KindOfBlockPostulateBlockPrimitiveBlock InstanceBlock FieldBlock DataBlockParamscombineTermChecksmatchParameters initNiceEnvloneSigs addLoneSig removeLoneSiggetSig noLoneSigs checkLoneSigsterminationCheckPragmapositivityCheckPragmacatchallPragmapopCatchallPragma niceWarning getFixity parameters plusFixitiesfixitiesAndPolaritiesFixities NiceWarnings parseFileExts withCommentswithoutCommentsFreeT fcIgnoreSorts fcContext subtractFV getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName LibErrorIOLibError LibNotFound AmbiguousLib OtherErrorlfPathlfExistsmkLibM getAgdaAppDirdefaultLibraryFiles defaultsFilefindAgdaLibFilesreadDefaultsFilegetLibrariesFile parseLibFilesstripCommentLinesformatLibErrorfindLibhasMatch CopyDirActionMkDirCopyFile performActioncopyDirContentDryRun copyIfChangeddefaultLaTeXDirdefaultHTMLDir withNames' splitAlts)hashtables-1.2.3.0-JLBm25hIoA33r7x6q6NMmgData.HashTable.IOCuckooHashTableBasicHashTableLinearHashTablematchLeq inequalities benchmarking modifyCounterbuiltins preserveIIds addBinding isBuiltinFununsafeQNameToName bindName'bracket'bracket bracketP_isLambda withInfixDeclwithAbstractPrivatebindToConcreteCtx toConcreteTopbindToConcreteToptoConcreteHidingbindToConcreteHidingtryToRecoverPatternSyntryToRecoverPatternSynPrecoverPatternSyn recoverOpApp icodeFileModSynEqMinequalifEqualcyclicrecDef BlankVarsnappsappsnelimsisSelfelimsreifyDisplayFormreifyDisplayFormPnameFirstIfHiddenstripImplicitstryRecPFromConPtoAtoms showAspectsData.Sequence.Internal IndefinitedropTopLevelModule'topLevelModuleDropper prettyInEqual RecordTreeLeafRecConVarPatDotPatKindRecPatMDropFromRecordSplitTreeRecordSplitNodesplitTag splitAritysplitRecordPattern conjColumns insertColumn cutSublistrecordExpressionsToCopatternsreplaceByProjections isRecordCaserecordSplitTree runRecPatMnextVar projections removeTreetranslatePattern recordTree translateTel NameKindstokenHighlighting nameKindsgenerateConstructorInfoterminationErrorHighlightingpositivityErrorHighlightinggenerate nameToFile nameToFileA getVarType getEqualitygetEqualityUnraisedaddEqssolveVarsolveEq simplifyEqisHom ControlFrameCaseKArgK NormaliseKForceKTrustMeKNatSucKPrimOpK UpdateThunkApplyK SpineContextCatchAll MatchStack ControlStackAMEval GHC.STRefSTRefIsValueThunkPointerPure BlackHoleSpineFastCompiledClausesFCaseFEtaFDoneFFail fprojPatterns fconBranches flitBranchesfcatchAllBranchCForceCTrustMeCTyConCAxiomCPrimOpCOther compactDef CompactDefclApplyclApply_ derefPointer_unsafeDerefPointer createThunk pureThunk lookupEnv_topMetaIsNotBlocked decodeSpineGHC.STunsafeInterleaveST decodeEnv decodeClosure elimsToSpinetrimEnvironmentbuildEnvreduceTm BuiltinEnv:>>: checkType' fullyApplyCon checkArgInfocheckRelevanceinferDef inferDef' inferSpine inferSpine'shouldBeProjectible shouldBeSort checkSort checkLevelmetaTypesubtype eliminate checkSpine checkArgsflexiblePatternsupdateProblemEqsisSolvedProblemproblemAllVariablesnoShadowingOfConstructorscheckDotPatterngetLeftoverPatternsgetUserVariableNamestransferOriginscomputeLHSContextrecheckStrippedWithPattern splitStrategycheckLHSnoPatternMatchingOnCodata suspendErrors softTypeError hardTypeErrordisambiguateProjectiondisambiguateConstructorcheckConstructorParameterscheckParametersinductiveCheckcheckBuiltinBoolbindBuiltinDatabindBuiltinEquality CosplitErrorCosplitNoTargetCosplitNoRecordTypeCosplitIrrelevantProjectionsAllowPartialCover FixTargetcoverinferMissingClausecomputeNeighbourhoodsplitlookupPatternVarsplit' YesFixTarget FailBecausecheckConstructorApplication inferHeadcheckHeadApplicationcoerce'checkArgumentsE inferProjAppinferOrCheckProjApp checkProjAppinlineWithClauses'withExprClausesinlinedClausesinlineStripAllProjections ExtractCallsCalls termDecl' termMutual'terminationError reportCalls termFunction typeEndsInDeftermDefsetMasks targetElem termToDBPmaskNonDataArgs termClause constructorguardPresTyCon withFunctionfunction maskSizeLtannotatePatsWithUseSizeLt compareElim compareProjmakeCMaddGuardednesscomposeGuardednessoffsetFromConstructor subPatternssubTerm compareVarVarpruneUnreachable pruneIntCaseccCxt ccCatchAllgetCompiledClauses cacheTreeless lookupLevel casetreeTopwithContextSize lambdasUpTo replaceVarmkRecord substTermAlphapatsPEPaththePath groupClauses pathToRecord groupPathesPatternCheckConfigtopNameconNamesfldNamesParsers billToParsergetDefinedNames localNames buildParserspatternAppViewparsePat parseLHS'classifyPatternvalidConPatternqualifierModulesWithRHS' rhsRewriteEqn rhsWithExpr rhsSubclausesLivesInCurrentModuleEnsureNoLetStms ResolveQName noDotPatternrecordConstructorTypecheckModuleMacronotPublicWithoutOpen renamingRange checkOpen toAbstractCtxlocalToAbstract' mkNamedArgmkArg'mkArg toAbstractDot toAbstractLamscopeCheckExtendedLamscopeCheckNiceModuletelHasOpenStmsOrModuleMacrosscopeCheckModule niceDeclstoAbstractOpArgtoAbstractOpAppgetEqCombinatorsgenericNotEnough codeBlockcolumncolumns columnsPrevnextId usedColumns countClustersAlignmentColumncolumnCodeBlock columnColumn columnKindIndentationColumnId Indentation AlignmentOutputText MaybeColumn agdaSpacedebugsrunLaTeXisSpacesisSpaceNotNewline replaceSpacesmoveColumnForToken resetColumnregisterColumn useColumn columnZeroregisterColumnZero enterCode leaveCode columnNameptOpen'ptOpenptOpenBeginningOfLine ptOpenIndent processMarkupprocessComment processCodespaces stringLiteraltoLaTeX emptyState processTokens modToFile!! otherBackendsControl.Monad.Trans.State.LazyStateTControl.Monad.Trans.ClassControl.Monad.IO.ClassliftIO Text.ReadreadsformatWarningsAndErrorslispifyResponselastTag showNumIId