h$ ] {|                ! " # $ % & ' ( ) * +,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcd e f g hijklmnopqrstuvwxyz{|}~                       !!!!!!!!!!!!!!!!!!!!!!!!!!!!"###############################################################################################################################$$$$$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&''''''''''''''((((((((((((((((((((((((((((((((((((())))))**+++++++++++++++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,-------------------------------------------------------------------------------------------------------..........////0000000000111111111111111111111111111222222222222222222222222222333333333333333333333333333333333333333333333333444445555555555555555666666666667777777777777788899999999999999999      : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ; ; ; ; ; ; ; ; ; ; ; ; ; ; < < < < < < = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =                            > > > > > > > > > > > > ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B C C C C C C C C C C C C C C C D D D D D D D D D D D D D D E E E E E                                                   F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F 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 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 H H H H H H H H H H H H H H HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKKKKKKKKKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[\]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^___`aaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeee e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#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#g#g#g#g#g#g#g#h#h#h#h#h#h#h#h#h#h#h#h#h#h#h#h#h#h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$i$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$j$k$k$k$k$k$k$k$k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%m%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%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&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'''''''''''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'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(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(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)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*u*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*w*w*w*w*w*w*w*w*w*w*w*w*w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+x+y+y+y+y+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+{+{+{+{+{+{+{+{+{+{+{+{+{+{+{+|+|+}+}+}+}+}+}+}+}+}+}+}+}+}+}+}+}+}+}+}+~+~+~++++++++++++,,,,,,,,,,,,,,,,,,,},},~,~,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------------------------------------------------------------------------------------------------------------------................................................................................................................................////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333344444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555555556666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666677777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777888888888888888888888888888888888888888888888888888888888888888888 8 888888888888888888888888888888888888888888888888888888888888899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999::::::::::::::::::::::::::::::::::::::::::::::::::::::::M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@MAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMCMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMDMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEMEEEEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJpJpJpJpJpJpJpJpJpJpJpJpJpJpJpJpJpJpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKpKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^________________________________________________________________________________________________________________________________````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffgggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkllllllllllllllllllllllllllllllllllllllllllllll_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_l_lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnn`n`n`n`n`n`n`n`n`n` None #$%-0235679>?-dAgdaIn f and  we want to know whether we are allowed to insert unicode characters or not.defgdefgNone #$%-0235679>?/MAgdaBuiltins 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 C Set which is not valid Agda.hijklmnopqrstuvwxyz{|}~hijklmnopqsturvwxyz{|}~None #$%-0235679>?2AgdaCut off structural order comparison at some depth in termination checker?Agdac >= 0( means: record decrease up to including c+1.None #$%-0235679>?5;Agda Semirings.Agda Addition.AgdaMultiplication.AgdaZero. The one is never used in matrix multiplication , one :: a -- ^ One.AgdaHasZero 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 ns.AgdaThe standard semiring on ns.AgdaThe standard semiring on ns.  None #$%-0235679>?6,AgdaA constant term.Agda,A term with one hole and the (old) contents.Agda%A term with many holes (error value).None #$%-0235679>?7AgdaGuard: return the action f only if the boolean is TrueAgdaGuard: return the value a only if the boolean is TrueNone #$%-0235679>?9y 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.Does not check for actual bijectivity of constructed finite map. O(n log n)AgdaTurn into list, sorted ascendingly by first value. O(Map.toList)  None #$%-0235679>?9 None #$%-0235679>?;uAgdaError class for backward compatibility (from Control.Monad.Trans.Error in transformers 0.3.0.0).AgdaWe 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 #$%-0235679>?;None #$%-0235679>?E}AgdaRepeat a state transition f :: a -> (b, a) with output b while condition cond 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.usualTrampoline f = trampolineWhile $ a -> maybe (False,a) (True,) (f a).trampolineWhile is very similar to  repeatWhile, 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 .AgdaMore 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 #$%-0235679>?F}AgdaSemiring with idempotent n == dioidAgdaE.g. +Agdaneutral element of compose , e.g. zero None #$%-0235679>?K Agda?A decoration is a functor that is traversable into any functor.The n 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.  is a misnomer, it should be forA.AgdaInfix version of .Agda#Any decoration is traversable with traverse = traverseF. Just like any n6 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 1None #$%-0235679>?KAgda7Unstructured pragma (Andreas, 2017-08-23, issue #2712).None #$%-0235679>?MAgdaCatch ns.Agda+Upon exception, the written output is lost.Agda Alias of n for the IO monad.None #$%-0235679>?NAgdaReturns a close function for the file together with the contents.None #$%-0235679>?P%AgdacopyDirContent src dest recursively copies directory src onto dest.First, a to-do list of copy actions is created. Then, the to-do list is carried out.This avoids copying files we have just created again, which can happen if src and dest( are not disjoint. (See issue #2705.)None #$%-0235679>?QAgdaReads a UTF8-encoded text file and converts many character sequences which may be interpreted as line or paragraph separators into 'n'.AgdaWrites a UTF8-encoded text file. The native convention for line endings is used.AgdaWrites a UTF8-encoded text file. The native convention for line endings is used.None #$%-0235679>?RaAgdaCreates a temporary file, writes some stuff, and returns the filepathNone #$%-0235679>?RAgdaRead n+, modify it strictly, and return old value. nnnnnnnnnnNone #$%-0235679>?XAgdaMonads in which we can catch an "impossible" error, if possible.Agda Catch any  exception.Agda Catch only # exceptions selected by the filter.Agda Version of , with argument order suiting short handlers.Agda Version of , with argument order suiting short handlers.Agda"Impossible" errors, annotated with a file name and a line number corresponding to the source code location of the error.Agda7We reached a program point which should be unreachable.Agda 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.AgdaWe reached a program point without all the required primitives or BUILTIN to proceed forward. (ImpMissingDefinitions neededDefs forThisAgdaAbort by throwing an "impossible" error. You should not use this function directly. Instead use  IMPOSSIBLEAgda8Create something with a callstack's file and line numberAgda:Create something with the call site's file and line numberAgda Throw an  Impossible* error reporting the *caller's* call site.Agda Throw an  Unreachable error reporting the *caller's* call site. Note that this call to "withFileAndLine" will be filtered out due its filter on the srcLocModule. None #$%-0235679>?ZyAgdatoImpossible 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.!None #$%-0235679>?^WAgdaA set with duplicates. Faithfully stores elements which are equal with regard to (==).Agda%The list contains all occurrences of a (not just the duplicates!). Hence, the invariant: the list is never empty.AgdaIs 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).AgdaReturn 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."None #$%-0235679>?^#None #$%-0235679>?bAgdaAgsy's meta variables.a the type of the metavariable (what it can be instantiated with). blk= the search control information (e.g. the scope of the meta).AgdaMaybe an instantiation (refinement). It is usually shallow, i.e., just one construct(or) with arguments again being metas.AgdaDoes 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.AgdaForking proof on something that is not part of the term language. E.g. whether a term will reduce or not.Agda Obsolete.$None #$%-0235679>?gJ AgdaRepresents a set of integers. Invariants: - All cannot be the argument to n or n - 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.Agda No integers.Agda All integers.Agda'If finite, return the list of elements.Agda Invariant.  %None #$%-0235679>?j AgdaVan 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.Agda#Modify a part of the state locally.Agda Ask for part of read-only state.Agda/Modify a part of the state in a subcomputation.84444&None# #$%'(-./0235679>?nF Agda An index into a type-level list.Agda4Lists indexed by a type-level list. A value of type All p [xA..xA]% is a sequence of values of types p xA, .., p xA.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.AgdaMapping over an indexed list.Agda>If you have an index you can get a lens for the given element.Agda)Looking up an element in an indexed list.Agda!All indices into an indexed list.'None #$%-0235679>?pAgda Content of a  .agda-lib file.Agda!The symbolic name of the library.Agda Path to this  .agda-lib file (not content of the file).Agda3Roots where to look for the modules of the library.Agda Dependencies.AgdaA symbolic library name.AgdaThe special name "." is used to indicated that the current directory should count as a project root.AgdaLenses for AgdaLibFile  (None #$%-0235679>?qoAgdaTokenising the input (makes  cleaner)Agda*Options for Auto, default value and lenses$$)None #$%-0235679>?rAgda(View source:) This is how you implement a lens for a record field.*None #$%-0235679>?smAgdaFilter a map based on the keys.Agda>O(n log n). Rebuilds the map from scratch. Not worse than n.+None #$%-0235679>?xAgdaRetain object when tag is n.Agda unionWith for collections of size <= 1.Agda unionsWith for collections of size <= 1.Agda Unzipping a list of length <= 1.AgdaFiltering a singleton list. filterMaybe p a = n (n p [a])Agda Version of n" with different argument ordering.Agda Version of n with different argument ordering. Often, we want to case on a n%, do something interesting in the n( case, but only a default action in the n* case. Then, the argument ordering of  caseMaybe is preferable. $caseMaybe m d f = flip (maybe d) m fAgda with flipped branches.AgdaMonadic version of n.AgdaMonadic version of n.AgdaMonadic version of . That is, $ with a different argument ordering.Agda with flipped branches.AgdaA more telling name for  for the n collection type. Or:  without the n case.Agda without the n case.Agda without the n case.Agda without the n case.AgdaLazy version of allJust  . sequence. (allJust = mapM for the Maybe/ monad.) Only executes monadic effect while isJust.nnnnnnnnnnnn,None #$%-0235679>?|Agda.Lazy monadic computation of a list of results.AgdaBoilerplate function to lift n through the  transformer.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.Agda8Force all values in the lazy list, effects left-to-rightAgdaThe 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 #$%-0235679>?AgdaThe  WarningName data enumeration is meant to have a one-to-one correspondance to existing warnings in the codebase.AgdaA  WarningMode has two components: a set of warnings to be displayed and a flag stating whether warnings should be turned into fatal errors.AgdaThe defaultWarningMode is a curated set of warnings covering non-fatal errors and disabling style-related onesAgdawarningModeUpdate str computes the action of str over the current  WarningMode: it may reset the set of warnings, add or remove a specific flag or demand that any warning be turned into an errorAgdaCommon sets of warningsAgdaThe flag corresponding to a warning is precisely the name of the constructor minus the trailing underscore.Agda warningUsage generated using warningNameDescription.None #$%-0235679>?2AgdaInterface to the help functionAgdaGeneral usage informationAgda)Specialised usage information about TOPICAgdaUsage information generationAgdaConversion functions to strings/None #$%-0235679>?Agda"Simple, non-reentrant memoisation.AgdaRecursive memoisation, second argument is the value you get on recursive calls.0None #$%-0235679>?Agda/Maximum of on-negative (small) natural numbers.1None #$%-0235679>?tAgda Satisfying null empty == True.AgdaA n is ' when it corresponds to the empty list.  2None #$%-02356789>?Agda Analogous to  in  Data.Maybe.Agda Analogous to  in  Data.Maybe.Agda Analogous to  in  Data.Maybe.Agda Analogous to  in  Data.Maybe.Agda unionWith for collections of size <= 1.Agda Unzipping a list of length <= 1.AgdaFiltering a singleton list. filterMaybe p a =  (n p [a])Agda Version of " with different argument ordering.Agda Version of  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 fAgdaMonadic version of .AgdaMonadic version of .AgdaMonadic version of . That is, $ with a different argument ordering.Agda with flipped branches.AgdaA more telling name for  for the  collection type. Or:  without the  case.Agda without the  case.AgdaNote that strict Maybe is an n only modulo strictness. The laws only hold in the strict semantics. Eg. pure f  * pure _|_ = _|_#, but according to the laws for n it should be  pure (f _|_)3. We ignore this issue here, it applies also to n and n.3None #$%-0235679>?AgdaInclusion comparison wrapper.AgdaPointwise comparison wrapper.AgdaDecidable partial orderings.Agda6The result of comparing two things (of the same type).Agda Less than.AgdaLess or equal than.AgdaEqualAgdaGreater or equal.Agda Greater than.AgdaNo information (incomparable).Agda8Comparing the information content of two elements of '. More precise information is smaller.Includes equality: x  x == True.Agda Opposites.related a po b iff related b (oppPO po) a.AgdaCombining 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 n.Agda%Represent a non-empty disjunction of ns as .AgdaA ! information is a disjunction of n informations.AgdaAny n is a .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.Agdan and n _ are unrelated.Partial ordering for Maybe a is the same as for  Either () a.Agda4The pointwise ordering for lists of the same length.There 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.4None #$%-0235679>?2Agda?Completing POMonoids with inverses to form a Galois connection.Law: 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.  related x POLE x' && related y POLE y' ==> related (x <> y) POLE (x' <> y') AgdaPartially ordered semigroup."Law: composition must be monotone.  related x POLE x' && related y POLE y' ==> related (x <> y) POLE (x' <> y') AgdahasLeftAdjoint x checks whether  x^-1 := x  mempty is such that x  y == x^-1 <> y for any y.5None #$%-0235679>?_AgdaIf 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).6None #$%-0235679>?\AgdaStar semirings ( 5https://en.wikipedia.org/wiki/Semiring#Star_semirings).Agda Semirings ( &https://en.wikipedia.org/wiki/Semiring).7None #$%-0235679>?8None #$%-0235679>?BAgdaCharacteristic identifiers.AgdaGiven a function f :: a -> NonEmpty C6 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.9None #$%-0235679>?AgdaThing decorated with its size. The thing should fit into main memory, thus, the size is an Int.Agda,The size of a collection (i.e., its length).AgdaCache the size of an object.AgdaReturn the cached size.None #$%-0235679>?v AgdaWhile n- is for rendering data in Haskell syntax,  is for displaying data to the world, i.e., the user and the environment.Atomic data has no inner document structure, so just implement  as pretty a = text $ ... a ....AgdaUse instead of n when printing to world.Agda+Comma separated list, without the brackets.AgdaApply = to V if boolean is true.Agdaalign max rows lays out the elements of rows 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 . prettyAgdaUsed for with-like  telescopes+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWYX^]Z\[c_`ba+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWYX^]Z\[c_`ba6:None #$%-0235679>? Agda(Documents paired with precedence levels. AgdaAn extended parser type, with some support for printing parsers. AgdaRuns the parser. Agda&Tries to print the parser, or returns n, depending on the implementation. This function might not terminate. AgdaParses a token satisfying the given predicate. The computed value is returned. AgdaUses 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 unique key. (Parametrised parsers must use distinct keys for distinct inputs.) AgdaMemoises the given parser, but only if printing, not if parsing./Every memoised parser must be annotated with a unique 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.rThe type of memoised values. (Yes, all memoised values have to have the same type.)tokThe token type.aThe result type. AgdaUses 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 E and +. AgdaPrecedence of atoms.  ;None #$%-0235679>? Agda%Paths which are known to be absolute.Note that the n and n instances do not check if different paths point to the same files or directories. Agda Extract the   to be used as n. Agda Constructs  s.2Precondition: The path must be absolute and valid. AgdaMakes the path absolute.This function may raise an __IMPOSSIBLE__ error if n" does not return an absolute path. AgdaTries to establish if the two file paths point to the same file (or directory). AgdaCase-sensitive n 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.)   4<None #$%-0235679>?r AgdaHashes a piece of n. Agda-Hashing a module name for unique identifiers.  =None #$%-0235679>?A Agda4The 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-negative AgdaExecuting a substitution. AgdaPartial 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= 0. AgdaDefault polarity is  . Agda?Returns an error message if we have a contradictory constraint. Agda  acts as n,   as n. Agda Interpret   as relation on  . AgdaAdd offset to size expression. AgdaComparison operator is ordered   <  .5 5 None #$%-0235679>? Agda Time O(n)! Agda Time O(1). Agdanot . member a . Time O(1). Agda Time O(n). AgdaThe empty set. Time O(n). AgdaThe full set. Time O(n). AgdaA singleton set. Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n). Agda Time O(n).   >None #$%-0235679>?@ Agda&Classification of identifier variants. AgdaIdentifier 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 'A'-'A'? Agda Converts '0'-'9' to 'A'-'A'-Precondition: The digit needs to be in range. Agda Converts 'A'-'A' to '0'-'9'.-Precondition: The digit needs to be in range. Agda?Increase the suffix by one. If no suffix yet, put a subscript 13 unless users do not want us to use any unicode. Agda Parse suffix. Agda Print suffix. ?None #$%-0235679>? AgdaDisjoint sum of three. AgdaEnum type with 3 elements. AgdaPartition a list into 3 groups.)Preserves the relative order or elements. AgdaPartition a list into 3 groups.)Preserves the relative order or elements. @None #$%-0235679>? AgdaFinite map from [k] to v.With the strict n type,   is also strict in v. 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. AgdaConvert to list where nodes at the same level are ordered according to the given ordering. AgdaCreate 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.   None #$%-0235679>?À AgdaBifunctoriality for pairs. Agda mapFst f = f -*- id Agda mapSnd g = id -*- g AgdaLifted pairing. AgdaMonadic version of  . AgdaMonadic  . AgdaMonadic  .    2 3ANone #$%-0235679>?ݵ; Agda$Internal state for stripping suffix. AgdaError. Agda8"Negative string" to remove from end. List may be empty. Agda+"Positive string" (result). Non-empty list. AgdaAppend a single element at the end. Time: O(length); use only on small lists. Agda5Case distinction for lists, with list first. O(1).Cf. 1. Agda5Case distinction for lists, with list first. O(1).Cf. 1. Agda4Case distinction for lists, with list last. O(1). AgdaHead function (safe). Returns a default value on empty lists. O(1). >headWithDefault 42 [] = 42 headWithDefault 42 [1,2,3] = 1 AgdaTail function (safe). O(1). AgdaTail function (safe). Returns a default list on empty lists. O(1). AgdaLast element (safe). O(n). Agda"Last two elements (safe). O(n). AgdaOpposite of cons (:), safe. O(1). AgdaMaybe cons. O(1). "mcons ma as = maybeToList ma ++ as Agdan and n in one go, safe. O(n). Agdainit, safe. O(n). Agda4Lookup function (partially safe). O(min n index). AgdaLookup function with default value for index out of range. O(min n index).The name is chosen akin to . AgdaFind an element satisfying a predicate and return it with its index. O(n) in the worst case, e.g. findWithIndex f xs = Nothing.%TODO: more efficient implementation!? AgdaA generalised variant of  elemIndex. O(n). AgdadownFrom n = [n-1,..1,0] . O(n). Agda:Update the first element of a list, if it exists. O(1). Agda9Update the last element of a list, if it exists. O(n). Agda/Update nth element of a list, if it exists. O(min index n). Precondition: the index is >= 0. Agda#splitExactlyAt n xs = Just (ys, zs) iff  xs = ys ++ zs and genericLength ys = n. Agda*Drop from the end of a list. O(length). &dropEnd n = reverse . drop n . reverseForces the whole list even for n==0. AgdaSplit off the largest suffix whose elements satisfy a predicate. O(n).spanEnd p xs = (ys, zs) where  xs = ys ++ zs and all p zs and #maybe True (not . p) (lastMaybe yz). AgdaA generalized version of  takeWhile . (Cf. mapMaybe vs. filter#). @O(length . takeWhileJust f)."takeWhileJust f = fst . spanJust f. AgdaA generalized version of span. O(length . fst . spanJust f). AgdaPartition a list into ns and n s. O(n). partitionMaybe f = partitionEithers . map ( a -> maybe (Left a) Right (f a))Note: n f = snd . partitionMaybe f. AgdaLike n, but additionally return the last partition of the list where the predicate is False everywhere. O(n). AgdaLike n, but additionally return the last partition of the list where the function always returns Nothing . O(n). AgdaSublist relation. Agda7All ways of removing one element from a list. O(n). Agda6Compute the common prefix of two lists. O(min n m). AgdaDrops from both lists simultaneously until one list is empty. O(min n m). AgdaCheck if a list has a given prefix. If so, return the list minus the prefix. O(length prefix). Agda4Compute the common suffix of two lists. O(n + m). AgdastripSuffix suf xs = Just pre iff xs = pre ++ suf. O(n). Agda&stripReversedSuffix rsuf xs = Just pre iff xs = pre ++ reverse suf . O(n). Agda  f = groupBy ((n ) `on` f) n n (n `on` f). O(n log n). Agda A variant of n: which applies the predicate to consecutive pairs. O(n). AgdaSplit a list into sublists. Generalisation of the prelude function words . O(n). words xs == wordsBy isSpace xs Agda2Chop up a list in chunks of a given length. O(n). AgdaChop a list at the positions when the predicate holds. Contrary to  , consecutive separator elements will result in an empty segment in the result. O(n). *intercalate [x] (chopWhen (== x) xs) == xs AgdaCheck membership for the same list often. Use partially applied to create membership predicate hasElem xs :: a -> Bool. First time:  O(n log n) in the worst case.Subsequently: O(log n).Specification: hasElem xs == (n xs). Agda&Check whether a list is sorted. O(n).Assumes that the n% instance implements a partial order. AgdaCheck whether all elements in a list are distinct from each other. Assumes that the n- instance stands for an equivalence relation.O(n) in the worst case distinct xs == True. AgdaAn optimised version of  . O(n log n)./Precondition: The list's length must fit in an n. AgdaReturns an (arbitrary) representative for each list element that occurs more than once. O(n log n). AgdaRemove the first representative for each list element. Thus, returns all duplicate copies. O(n log n).&allDuplicates xs == sort $ xs \ nub xs. AgdaEfficient variant of nubBy for lists, using a set to store already seen elements. O(n log n)Specification: )nubOn f xs == 'nubBy' ((==) `'on'` f) xs. AgdaEfficient variant of nubBy for finite lists. O(n log n).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 uniqOn id == Set.toAscList . Set.fromList AgdaChecks if all the elements in the list are equal. Assumes that the n6 instance stands for an equivalence relation. O(n). Agda5Requires both lists to have the same length. O(n). Otherwise, Nothing is returned. AgdaLike n but keep the rest of the second list as-is (in case the second list is longer). O(n).  zipWithKeepRest f as bs == zipWith f as bs ++ drop (length as) bs AgdaImplemented using tree recursion, don't run me at home! O(3^(min n m)). Agda*Implemented using dynamic programming and  Data.Array . O(n*m). AgdaThe list after the split point. Agda The list before the split point.? ? BNone #$%-0235679>?^ Agda  adds double quotes around the string, replaces newline characters with n, and escapes double quotes and backslashes within the string. This is different from the behaviour of n: > n $ n "\x2200" "\8704" > n $   "\x2200" "D" (The code examples above have been tested using version 4.2.0.0 of the base library.) AgdaTurns 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 A-A 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. CNone #$%-0235679>? Agda"CPU time in pico (10^-12) seconds. Agda Timestamps. AgdaThe current time. AgdaMeasure the time of a computation. Of course, does not work with exceptions. Agda(Print CPU time in milli (10^-3) seconds.  DNone #$%-0235679>? 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. AgdaClear the running info buffer. AgdaClear the warning buffer AgdaDisplay running information about what the type-checker is up to. ENone #$%-0235679>?| AgdaRemove suffix .0$ from printed floating point number.  None #$%-0235679>?/ Agda Loop while we have an exception. AgdaMonadic version of n$ with a different argument ordering. Agda'Either _ b' is a functor. Agda'Either a' is a functor. Agdan is bitraversable. Note: From base >= 4.10.0.0 already present in . Agda Analogue of . Agda Analogue of . Agda Analogue of +. Agda Analogue of +. AgdaSafe projection from n. 8maybeLeft (Left a) = Just a maybeLeft Right{} = Nothing AgdaSafe projection from n.  x) xs) else Nothing Agda)Groups a list into alternating chunks of n and n values AgdaConvert n to n ().    None #$%-0235679>? Agda Binary bind. AgdaMonadic guard. AgdaMonadic if-then-else. Agda ifNotM mc = ifM (not  $ mc) AgdaLazy monadic conjunction. AgdaLazy monadic disjunction. AgdaLazy monadic disjunction with Either> truth values. Returns the last error message if all fail. AgdaLazy monadic disjunction with accumulation of errors in a monoid. Errors are discarded if we succeed. AgdaGeneralized version of 8traverse_ :: Applicative m => (a -> m ()) -> [a] -> m () 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 3for_ :: Applicative m => [a] -> (a -> m ()) -> m () AgdaA monadic version of n :: (a -> Maybe b) -> [a] -> [b]. Agda A version of  ' with a computation for the input list. AgdaThe for version of  . AgdaThe for version of  . AgdaA monadic version of n :: (a -> Bool) -> [a] -> [a]. AgdaA monadic version of  dropWhileEnd :: (a -> Bool) -> [a] -> m [a]:. Effects happen starting at the end of the list until p becomes false. AgdaA `monadic' version of @ partition# :: (a -> Bool) -> [a] -> ([a],[a]) Agda Translates n to . AgdaGeneralises the n& function from lists to an arbitrary . AgdaFinally for the  class. Errors in the finally part take precedence over prior errors. AgdaTry a computation, return n if an  occurs. Agda1Run a command, catch the exception and return it. Agda;Bracket without failure. Typically used to preserve state. Agda Restore state after computation. AgdaAcquires resource. Run first.AgdaReleases resource. Run last.Agda Computes result. Run in-between.+  +  FNone #$%-0235679>? Agda'Monad with access to benchmarking data. AgdaWe need to be able to terminate benchmarking in case of an exception. AgdaBenchmark structure is a trie, mapping accounts (phases and subphases) to CPU time spent on their performance. AgdaAre we benchmarking at all? Agda!What are we billing to currently? Agda/The accounts and their accumulated timing bill. Agda3Record when we started billing the current account. Agda(Account we can bill computation time to. AgdaSemantic editor combinator. AgdaSemantic editor combinator. AgdaSemantic editor combinator. Agda"Add to specified CPU time account. AgdaTurn benchmarking on/off. AgdaBill current account with time up to now. Switch to new account. Return old account (if any). Agda.Resets the account and the timing information. AgdaBill a computation to a specific account. Works even if the computation is aborted by an exception. Agda;Bill a CPS function to an account. Can't handle exceptions. Agda.Bill a pure computation to a specific account. Agda2Print benchmark as three-column table with totals. Agda$Initial benchmark structure (empty). AgdaMaybe new account.AgdaMaybe old account.  GNone #$%-02356789>?p7 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   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. AgdaThe 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:  . AgdaAre 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 positions Agda?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' movePos Agda%Backup the position by one character.(Precondition: The character must not be 'n'. 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. AgdaConverts 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'.Precondition: The ranges must point to the same file (or be empty). AgdaPrecondition: The ranges must point to the same file (or be empty). Agda beginningOf r 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 r 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 elementsIt 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. AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the tuple elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the list elements must point to the same file (or be empty). AgdaPrecondition: The ranges of the list elements must point to the same file (or be empty). AgdaOverlaps with  KillRange [a]. HNone #$%-0235679>? 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]:  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  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 nAgdaIdentity 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 ?, but Permutations operate on de Bruijn LEVELS, not indices.Agda 2permute (compose p1 p2) == permute p1 . permute p2Agda invertP err p is the inverse of p) where defined, otherwise defaults to err. composeP p (invertP err p) == pAgdaTurn a possible non-surjective permutation into a surjective permutation.Agda ?permute (reverseP p) xs == reverse $ permute p $ reverse xs Example:  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 reverseP, you can convert a permutation on de Bruijn indices to one on de Bruijn levels, and vice versa.Agda8permPicks (flipP p) = permute p (downFrom (permRange p)) or permute (flipP (Perm n xs)) [0..n-1] = permute (Perm n xs) (downFrom n)Can be use to turn a permutation from (de Bruijn) levels to levels to one from levels to indices.See .Agda expandP i n  in the domain of  replace the ith element by n elements.AgdaStable 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.    INone" #$%-02356789>?]AAgdaPart of a NotationAgdaArgument is the position of the hole (with binding) where the binding should occur. First range is the rhs range and second is the binder.Agda+Argument is where the expression should go.Agda"An underscore in binding position.AgdaNotation as provided by the syntax declaration.AgdaRewriteEqn' qn p e represents the rewrite and irrefutable with clauses of the LHS. qn stands for the QName of the auxiliary function generated to implement the feature p is the type of patterns e is the type of expressionsAgda  rewrite eAgda  with p <- eAgda!Coverage check? (Default is yes).Agda!Universe check? (Default is yes).Agda#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 .AgdaNew fixity of  (optional).AgdaThe range of the "to" keyword. Retained for highlighting purposes.Agda3An imported name can be a module or a defined name.AgdaImported module name of type m.AgdaImported name of type n.AgdaThe using clause of import directive.AgdaNo using clause given.Agdausing the specified names.AgdaThe 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.AgdaThe notation is handled as the fixity in the renamer. Hence, they are grouped together in this type.AgdaRange of the name in the fixity declaration (used for correct highlighting, see issue #2140).AgdaFixity of operators.Agda&Range of the whole fixity declaration.AgdaAssociativity.AgdaNo fixity declared.Agda$Fixity level declared as the number.Agda Precedence levels for operators.AgdaPlaceholders are used to represent the underscores in a section.AgdaThe 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.AgdaThe 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?Agda Range of the instance keyword.Agda"Is any element of a collection an .AgdaAbstract or concrete.AgdaAccess modifier.Agda Store the  of the private block that lead to this qualifier. This is needed for more faithful printing of declarations.AgdaFunctions can be defined in both infix and prefix style. See f.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.AgdaNames in binders and arguments.AgdaOnly  arguments can have names.AgdaAccessor/editor for the  component.AgdaStandard argument names.AgdaStandard naming.Agda&Something potentially carrying a name.Agda4A function argument can be hidden and/or irrelevant.AgdaA lens to access the : attribute in data structures. Minimal implementation: getFreeVariables and mapFreeVariables or  LensArgInfo.AgdaA lens to access the : attribute in data structures. Minimal implementation:  getOrigin and  mapOrigin or  LensArgInfo.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.AgdaNamed application produced to represent a substitution. E.g. "?0 (x = n)" instead of "?0 n"AgdaA lens to access the : attribute in data structures. Minimal implementation:  getCohesion and  mapCohesion or  LensModality.AgdaCohesion modalities see "Brouwer's fixed-point theorem in real-cohesive homotopy type theory" (arXiv:1509.07584) types are now given an additional topological layer which the modalities interact with.Agda=same points, discrete topology, idempotent comonad, box-like.Agdaidentity modality. | Sharp -- ^ same points, codiscrete topology, idempotent monad, diamond-like.Agdasingle point space, artificially added for Flat left-composition.AgdaA lens to access the : attribute in data structures. Minimal implementation:  getRelevance and  mapRelevance or  LensModality.Agda:A function argument can be relevant or irrelevant. See Agda.TypeChecking.Irrelevance.Agda4The argument is (possibly) relevant at compile-time.AgdaThe argument may never flow into evaluation position. Therefore, it is irrelevant at run-time. It is treated relevantly during equality checking.Agda3The argument is irrelevant at compile- and runtime.AgdaQuantity for linearity.A quantity is a set of natural numbers, indicating possible semantic uses of a variable. A singleton set {n}= requires that the corresponding variable is used exactly n times.Agda Zero uses {0}, erased at runtime.Agda Linear use {1} (could be updated destructively). Mostly TODO (needs postponable constraints between quantities to compute uses).AgdaUnrestricted use B.Agda Origin of .AgdaUser wrote nothing.AgdaUser wrote "@".AgdaUser wrote "@plenty".Agda Origin of .AgdaUser wrote nothing.AgdaUser wrote "@1".AgdaUser wrote "@linear".Agda Origin of .AgdaUser wrote nothing.AgdaUser wrote "@0".AgdaUser wrote "@erased".AgdaWe have a tuple of modalities, which might not be fully orthogonal. For instance, irrelevant stuff is also run-time irrelevant.Agda4Legacy irrelevance. See Pfenning, LiCS 2001; AbelVezzosiWinterhalter, ICFP 2017.AgdaCardinality / runtime erasure. See Conor McBride, I got plenty o' nutting, Wadlerfest 2016. See Bob Atkey, Syntax and Semantics of Quantitative Type Theory, LiCS 2018.AgdaCohesion/what was in Agda-flat. see "Brouwer's fixed-point theorem in real-cohesive homotopy type theory" (arXiv:1509.07584) Currently only the comonad is implemented.AgdaA lens to access the : attribute in data structures. Minimal implementation:  getHiding and  mapHiding or  LensArgInfo.AgdaDecorating something with  information.Agda4Used to specify whether something should be delayed.AgdaMonoidal composition of  information in some data.Agda arguments are visible.Agda and  arguments are  notVisible.Agda arguments are hidden.AgdaIgnores .Agdam  m' means that an m can be used where ever an m' is required.Agda(Multiplicative monoid (standard monoid).AgdaCompose with modality flag from the left. This function is e.g. used to update the modality information on pattern variables a- after a match against something of modality q.AgdainverseComposeModality r x returns the least modality y such that forall x, y we have .x `moreUsableModality` (r `composeModality` y) iff 5(r `inverseComposeModality` x) `moreUsableModality` y (Galois connection).AgdaLeft division by a 3. Used e.g. to modify context when going into a m argument.Agda# forms a pointwise additive monoid.Agda"Absorptive element under addition.AgdaEquality ignoring origin.AgdaEquality ignoring origin.Agda. forms an additive monoid with zero Quantity0.AgdaAbsorptive element is .Agdam moreUsableQuantity m' means that an m can be used where ever an m' is required.AgdaCompose with quantity flag from the left. This function is e.g. used to update the quantity information on pattern variables a- after a match against something of quantity q.AgdainverseComposeQuantity r x returns the least quantity y such that forall x, y we have (x `moreQuantity` (r `composeQuantity` y) iff /(r `inverseComposeQuantity` x) `moreQuantity` y (Galois connection).AgdaLeft division by a 3. Used e.g. to modify context when going into a q argument.Agda Check for .Agda Check for .Agda Check for .Agda*Did the user supply a quantity annotation?Agda9A thing of quantity 0 is unusable, all others are usable.AgdaInformation ordering. Relevant `moreRelevant` NonStrict `moreRelevant` IrrelevantAgdaEquality ignoring origin.AgdausableRelevance rel == False! iff we cannot use a variable of rel.Agda composition.  is dominant, + is neutral. Composition coincides with n.AgdaCompose with relevance flag from the left. This function is e.g. used to update the relevance information on pattern variables a! after a match against something rel.AgdainverseComposeRelevance 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).AgdaLeft division by a 3. Used e.g. to modify context when going into a rel argument.AgdaCombine inferred . The unit is .Agda4 forms a monoid under addition, and even a semiring.Agda"Absorptive element under addition.AgdaIrrelevant function arguments may appear non-strictly in the codomain type.AgdaApplied when working on types (unless --experimental-irrelevance).AgdaInformation ordering. Flat `moreCohesion` Continuous `moreCohesion` Sharp `moreCohesion` SquashAgdaEquality ignoring origin.AgdausableCohesion rel == False! iff we cannot use a variable of rel.Agda composition.  is dominant,  is neutral.AgdaCompose with cohesion flag from the left. This function is e.g. used to update the cohesion information on pattern variables a- after a match against something of cohesion rel.AgdainverseComposeCohesion r x returns the least y such that forall x, y we have (x `moreCohesion` (r `composeCohesion` y) iff /(r `inverseComposeCohesion` x) `moreCohesion` y1 (Galois connection). The above law fails for  r = Squash.AgdaLeft division by a 3. Used e.g. to modify context when going into a rel argument.AgdaCombine inferred . The unit is .Agda4 forms a monoid under addition, and even a semiring.Agda"Absorptive element under addition.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.Agda,Equality of argument names of things modulo   and .Agda,Equality of argument names of things modulo   and .AgdaDoes an argument arg fit the shape dom of the next expected argument?The hiding has to match, and if the argument has a name, it should match the name of the domain.n should be , so use as @ fromMaybe  IMPOSSIBLE $ fittingNamedArg arg dom @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).AgdaisDefaultImportDir implies null, but not the other way round.Agda Just for the 9 instance. Should never combine different overlapping.Agda, is an idempotent partial monoid, with unit .  and  are incompatible.AgdaRight-biased composition, because the left quantity acts as context, and the right one as occurrence.AgdaRight-biased composition, because the left quantity acts as context, and the right one as occurrence.AgdaRight-biased composition, because the left quantity acts as context, and the right one as occurrence.AgdaNote that the order is  D 0,1, more options is smaller.AgdaIn the absense of finite quantities besides 0,  is the unit. Otherwise, 1 is the unit.Agda+Composition of quantities (multiplication). is dominant.  is neutral.Right-biased for origin.Agda is the unit.Agda% forms a semigroup under composition.AgdaMore relevant is smaller.AgdaMore relevant is smaller.Agda Continous is the unit.Agda% forms a semigroup under composition.AgdaFlatter is smaller.Agda2Order is given by implication: flatter is smaller.AgdaDominance ordering.AgdaPointwise unit.AgdaPointwise composition.AgdaRanges are not forced.Agda Default is .Agda+Semigroup computes if any of several is an .Agda(Show non-record version of this newtype.AgdaRanges are not forced.AgdaRanges are not forced.Agdanull for import directives holds when everything is imported unchanged (no names are hidden or renamed).JNone #$%&-0235679>?g Agda/Type of a literate preprocessor: Invariants:  f : Processor f pos s /= []f pos s >>= layerContent == sAgdaA list of contiguous layers.Agda9A sequence of characters in a file playing the same role.Agda Role of a character in the file.AgdaList of valid extensions for literate Agda files, and their corresponding preprocessors.If you add new extensions, remember to update test/Utils.hs so that test cases ending in the new extensions are found.AgdaReturns True& if the role corresponds to Agda code.AgdaReturns True! if the layer contains Agda code.AgdaBlanks 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.AgdaShort list of extensions for literate Agda files. For display purposes.AgdaPreprocessor for literate TeX.AgdaPreprocessor for Markdown.Agda"Preprocessor for reStructuredText.Agda$Preprocessor for Org mode documents.KNone #$%-02356789>?l AgdaThe parser monad.AgdaMemoisation keys.AgdaRuns the parser.AgdaParses a token satisfying the given predicate. The computed value is returned.Agda.Parses a token satisfying the given predicate.AgdaUses 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 unique key. (Parametrised parsers must use distinct keys for distinct inputs.)AgdaMemoises the given parser, but only if printing, not if parsing./Every memoised parser must be annotated with a unique key. (Parametrised parsers must use distinct keys for distinct inputs.)Agda&Tries to print the parser, or returns n, depending on the implementation. This function might not terminate.LNone  #$%-02356789>?xAgda+Check whether a name is the empty name "_".AgdaNumber of holes in a $ (i.e., arity of a mixfix-operator).AgdaTop-level module names. Used in connection with the file system.&Invariant: The list must not be empty.AgdaQName 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?zAgdaArbitrary JS code.%%ONone #$%-0235679>?zPNone #$%-0235679>?|%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.  QNone #$%-0235679>?'Agda"Entry of an explicit substitution.&An explicit substitution is a list of CAction"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.Different 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.AgdaNat - 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.AgdaSubstituting for a variable.AgdaFreeVars class and instancesAgda Renaming Typeclass and instancesRNone #$%-0235679>?Agda!Moves A move is composed of a Cost: together with an action computing the refined problem.Agda univar sub v figures out what the name of v" "outside" of the substitution sub ought to be, if anything.Agda6List of the variables instantiated by the substitutionAgdaNew 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.Agda5New spine of arguments potentially using placeholdersAgdaNew App?lication node using a new spine of arguments respecting the Hiding annotationAgdaEquality reasoning steps The begin token is accompanied by two steps because it does not make sense to have a derivation any shorter than that.AgdaPick the first unused UId amongst the ones you have seen (GA: ??) Defaults to the head of the seen ones.SNone #$%-0235679>?YAgda)Typechecker drives the solution of metas.--TNone #$%-0235679>?AgdaSpeculation: Type class computing the size (?) of a pattern and collecting the vars it introducesAgdaTake a list of patterns and returns (is, size, vars) where (speculation):22UNone #$%-0235679>?c Agda.Zero or more consecutive and separated ranges.AgdaCharacter ranges. The first character in the file has position 1. Note that the 4 position is considered to be outside of the range. Invariant:  n .AgdaThe  invariant.AgdaThe  invariant.Agdan iff the ranges overlap.)The ranges are assumed to be well-formed.Agdan iff the range is empty.Agda(Converts a range to a list of positions.Agda/Converts several ranges to a list of positions.Agda Converts a   to a .Agda 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.VNone #$%-0235679>?,Agda The result of parsing something.AgdaWarnings for parsing.Agda,Parse errors that concern a range in a file.Agda)The range of the bigger overlapping tokenAgda,Parse errors: what you get if parsing fails.Agda4Errors that arise at a specific position in the fileAgda,Parse errors that concern a range in a file.Agda'Parse errors that concern a whole file.Agda%The file in which the error occurred.AgdaWhere the error occurred.AgdaThe remaining input.AgdaThe previous token.Agda*Hopefully an explanation of what happened.Agda)The range of the bigger overlapping tokenAgda"The file which the error concerns.Agda Parser flags.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 layoutAgdalayout at specified columnAgda:For context sensitive lexing alex provides what is called  start codes in the Alex documentation. It is really an integer representing the state of the lexer, so we call it LexState instead.AgdaThe parser state. Contains everything the parser and the lexer could ever need.Agda"position at current input locationAgdaposition of last tokenAgdathe current inputAgdathe character before the inputAgdathe previous tokenAgdathe stack of layout contextsAgdathe state of the lexer (states can be nested so we need a stack)Agdaparametrization of the parserAgdaThe parse monad.Agda,Throw a parse error at the current position.AgdaConstructs 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.AgdaThe default flags.Agda.The most general way of parsing a string. The Agda.Syntax.Parser; will define more specialised functions that supply the  and the .Agda.The even more general way of parsing a string.AgdaParses a string as if it were the contents of the given file Useful for integrating preprocessors.AgdaThe parse interval is between the last position and the current position.AgdaFake 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.Agda3Report a parse error at the beginning of the given  .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.>>WNone #$%-0235679>?"AgdaMake a  from some kind of string.AgdaThe   sets the definition site of the name, not the use site.Agda*Check whether we are a projection pattern.Agda>XNone #$%-0235679>? Agda-Sections, as well as non-sectioned operators.Agda>For non-sectioned operators this should match the notation's .AgdaEffective precedence level. n for closed notations.Agdan for non-sectioned operators.Agda/All the notation information related to a name.Agda-The names the syntax and/or fixity belong to.Invariant: The set is non-empty. Every name in the list matches .Agda3Associativity and precedence (fixity) of the names.Agda!Syntax associated with the names.AgdaTrue if the notation comes from an operator (rather than a syntax declaration).AgdaClassification of notations.AgdaEx:  _bla_blub_.AgdaEx:  _bla_blub.AgdaEx:  bla_blub_.AgdaEx: bla_blub.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.AgdaTarget argument position of a part (Nothing if it is not a hole).AgdaIs 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? 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 C x or not? See .AgdaDecorating something with Fixity'.Agda#Argument context preferring parens.AgdaDo we need to bracket an operator application of the given fixity in a context with the given precedence.AgdaDo 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: mA >>= ( x C x) >>= mA (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?ZNone #$%-0235679>?ƹAgdaRanges are not forced.  [None #$%-0235679>? Agda5Checks if the given expression is unreachable or not.AgdaCode 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 variablesAgdaCompiler-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 | StringAgdaintroduces 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 backendAgda,A runtime error, something bad has happened.AgdaThe treeless compiler can behave differently depending on the target language evaluation strategy. For instance, more aggressive erasure for lazy targets.Agda=Strip leading coercions and indicate whether there were some.AgdaExpose the format  coerce f args.We fuse coercions, even if interleaving with applications. We assume that coercion is powerful enough to satisfy / coerce (coerce f a) b = coerce f a b AgdaIntroduces a new binding\None #$%-0235679>?]None #$%-0235679>?ѝAgdaWe lose track of @-patterns in the internal syntax. This pass puts them back.^None #$%-0235679>?AgdaA misplaced end-comment "-}".aNone #$%-0235679>?fAgdaLibrary Warnings.AgdaParse  .agda-lib file.Sets  name and turn mentioned include directories into absolute pathes (provided the given n is absolute).Agda+Remove leading whitespace and line comment.Agda4Break a comma-separated string. Result strings are trimmed.bNone #$%-0235679>?<Agda SCC DAGs.0The maps map SCC indices to and from SCCs/nodes.AgdaVarious kinds of nodes.AgdaNodes with outgoing edges.AgdaNodes with incoming edges.Agda!All nodes, with or without edges.AgdaEdges.AgdaOutgoing node.AgdaIncoming node.AgdaEdge label (weight).Agda Graph n e, is a type of directed graphs with nodes in n and edges in e.At 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)). However, computing the incoming edges may be more expensive.Note that neither the number of nodes nor the number of edges may exceed n :: n.AgdaForward edges.AgdaInternal invariant.AgdaIf there is an edge from s to t, then  lookup s t g is n e, where e is the edge's label. O(log n).AgdaThe graph's edges. O(n + e).Agdaneighbours 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|).AgdaneighboursMap 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).AgdaedgesFrom g ns is a list containing all edges originating in the given nodes (i.e., all outgoing edges for the given nodes). If ns does not contain duplicates, then the resulting list does not contain duplicates. O(|ns| log |n| + |edgesFrom g ns|).Agda edgesTo g ns is a list containing all edges ending in the given nodes (i.e., all incoming edges for the given nodes). If ns does not contain duplicates, then the resulting list does not contain duplicates. O(|ns | n log n).AgdaAll self-loops.  O(n log n).Agda All nodes. O(n).AgdaNodes with outgoing edges. O(n).AgdaNodes with incoming edges. O(n + e log n).Agda Constructs a  structure. O(n + e log n).Agda*Nodes without incoming or outgoing edges. O(n + e log n).AgdaChecks whether the graph is discrete (containing no edges other than  edges). O(n + e).AgdaReturns True iff the graph is acyclic.AgdaConstructs a completely disconnected graph containing the given nodes.  O(n log n).AgdaConstructs a completely disconnected graph containing the given nodes. O(n).Agda fromEdges es$ is a graph containing the edges in es=, with the caveat that later edges overwrite earlier edges. O(|es| log n).AgdafromEdgesWith f es$ is a graph containing the edges in es. Later edges are combined with earlier edges using the supplied function. O(|es| log n).Agda"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(nA log (nAnA + 1) + eA log eA, where nA/ is the number of nodes in the graph with the smallest number of nodes and nA0 is the number of nodes in the other graph, and eA is the number of edges in the graph with the smallest number of edges and eA+ 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).AgdaUnion. 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 n< 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.AgdaThe graph's strongly connected components, in reverse topological order.AgdaThe graph's strongly connected components, in reverse topological order.Agda invariant.AgdaThe opposite DAG.Agda'The nodes reachable from the given SCC.AgdaConstructs a DAG containing the graph's strongly connected components.AgdaConstructs 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 n :: n.Amortised time complexity (assuming that comparisons take constant time):  O(e log n), 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 n :: n.Amortised time complexity (assuming that comparisons take constant time): O((|ns | + e) log n).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 some. 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 n :: n.Amortised 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.The last element in the list is the transitive closure, paired with the empty graph. (complete g = snd $ last $ completeIter gAgda-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.This 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 , and with some shortcuts:Zero edge differences are not added to the graph, thus avoiding some zero edges.Strongly connected components are used to avoid computing some zero edges.The graph's strongly connected components (in reverse topological order) are returned along with the transitive closure.AgdaThe transitive closure. Using . NOTE: DO NOT USE () AS EDGE LABEL SINCE THIS MEANS EVERY EDGE IS CONSIDERED A ZERO EDGE AND NO NEW EDGES WILL BE ADDED! Use 'Maybe ()' instead.Agda*The graph's strongly connected components.cNone #$%&-0235679>?)Agdatopoligical sort with smallest-numbered available vertex first | input: nodes, edges | output is Nothing if the graph is not a DAG Note: should be stable to preserve order of generalizable variables. Algorithm due to Richard Eisenberg, and works by walking over the list left-to-right and moving each node the minimum distance left to guarantee topological ordering.dNone #$%-0235679>?7%AgdaThese metas are < D.Agda,Lower or upper bound for a flexible variableAgdaA 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".AgdaAdd 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 g 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.Application: 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.AgdaCompute the relative minima in a set of nodes (those that do not have a predecessor in the set).AgdaCompute 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.AgdaCompute the sup of two different rigids or a rigid and a constant.AgdaCompute the inf of two different rigids or a rigid and a constant.Agda$Compute the least upper bound (sup).AgdaCompute the greatest lower bound (inf) of size expressions relative to a hypotheses graph.AgdaSolve a forest of constraint graphs relative to a hypotheses graph. Concatenate individual solutions.AgdaCheck that after substitution of the solution, constraints are implied by hypotheses.Agda1Iterate solver until no more metas can be solved.This 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  if it contains a negative loop (diagonal edge). Makes sense on transitive graphs.Agda;Meta variable polarities (prefer lower or upper solution?).AgdaHypotheses (assumed to have no metas, so, fixed during iteration).AgdaConstraints to solve.Agda7Previous substitution (already applied to constraints).AgdaAccumulated substition.eNone #$%-0235679>?AgdaSubterm 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. AgdaGuarded strictly positive occurrence (i.e., under D). 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 D 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 function Agda"is an index of an inductive family Agdain the definition of a constant AgdaDescription of an occurrence. AgdaThe elements of the sequences, read from left to right, explain how to get to the occurrence. The second sequence includes the main information, and if the first sequence is non-empty, then it includes information about the context of the second sequence. Agda&The map contains bindings of the form  bound |-> ess?, satisfying the following property: for every non-empty list w, n  w n bound iff n [ n every w n n some w | (every, some) <- ess ]. Agda+productOfEdgesInBoundedWalk occ g u v bound returns a value distinct from n iff there is a walk c (a list of edges) in g, from u to v, for which the product n  (n occ c) n bound&. In this case the returned value is n (n  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  is meet (glb) and 0 is composition. Both operations are idempotent.For ,   is neutral (zero) and  is dominant. For ,   is neutral (one) and   is dominant.    fNone #$%-0235679>?<Ԍ AgdaThe ! is not an application. Agda(Extended content of an interaction hole. Agda e Agda  (rewrite | invert) e0 | ... | en Agda=Modules: Top-level pragmas plus other top-level declarations. Agda$Second Range is for REWRITE keyword. Agdafirst string is backend name Agdafirst string is backend name AgdaINLINE or NOINLINE Agda.Throws an internal error in the scope checker. Agda:For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop). AgdaApplies to the named function AgdaApplies to the current module AgdaMark a definition as injective for the pattern matching unifier. Agda*Display lhs as rhs (modifies the printer). Agda)Applies to the following function clause. AgdaApplies to the following function (and all that are mutually recursive with it) or to the functions in the following mutual block. AgdaApplies to the following function (and all that are mutually recursive with it) or to the functions in the following mutual block. Agda:Applies to the following data/record type or mutual block. Agda*Applies to the following data/record type. Agda  tel. M args Agda  M {{...}} AgdaThe representation type of a declaration. The comments indicate which type in the intended family the constructor targets. AgdaAxioms and functions can be irrelevant. (Hiding should be NotHidden) Agda=Variables to be generalized, can be hidden and/or irrelevant. Agda#lone data signature in mutual block Agda%lone record signature in mutual block Agda7The optional name is a name for the record constructor. Agdanotation declaration for a name AgdaIn  Agda.Syntax.Concrete.Definitions we generate private blocks temporarily, which should be treated different that user-declared private blocks. Thus the . AgdaThe  9 here (exceptionally) only refers to the range of the instance( keyword. The range of the whole block InstanceB r ds is fuseRange r ds. Agda(Just type signatures or instance blocks. AgdaJust type signatures. Agda.From the parser, we get an expression for the as-#, which we have to parse into a . AgdaThe content of the as -clause of the import statement. AgdaThe "as" name. AgdaThe range of the "as" keyword. Retained for highlighting purposes. Agda3An imported name can be a module or a defined name. AgdaThe things you are allowed to say when you shuffle names between name spaces (i.e. in import,  namespace, or open declarations). AgdaAn 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  (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 f!Agda ps!AgdaRecord 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 D g) x = f (g x)We use fixity information to see which name is actually defined.!AgdaOriginal pattern (including with-patterns), rewrite equations and with-expressions.!Agdae.g.  f ps | wps!Agda(rewrite e | with p <- e) (many)!Agdawith e1 | {e2} | ... (many)!AgdaDid we expand an ellipsis?!AgdaA telescope is a sequence of typed bindings. Bound variables are in scope in later types.!AgdaBinding (x1@p1 ... xn@pn : A).!Agda Let binding (let Ds) or  (open M args).!AgdaA typed binding.!Agda. x or {x} or .x or .{x} or {.x} or x@p or (p)!Agda. (xs : e) or {xs : e}!Agda0A lambda binding is either domain free or typed.!Agda A Binder x@p, the pattern is optional!Agda p C e where cs!Agda9Concrete patterns. No literals in patterns at the moment.!Agdac or x!Agda quote!Agdap p' or  p {x = p'}!Agdap1..pn before parsing operators!Agdaeg: p => p' for operator _=>_ The  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 unused!Agda .e!Agda0, 1, etc.!Agda record {x = p; y = q}!Agdai = i1$ i.e. cubical face lattice generator!Agda..., only as left-most pattern.!Agda| p, for with-patterns.!AgdaConcrete expressions. Should represent exactly what the user wrote.!Agdaex: x!Agdaex: 1 or "foo"!Agdaex: ? or  {! ... !}!Agdaex: _ or _A_5!Agdabefore parsing operators!Agdaex: e e, e {e}, or  e {x = e}!Agdaex: e + e The  is possibly ambiguous, but it must correspond to one of the names in the set.!Agdaex: e | e1 | .. | en!Agdaex: {e} or {x=e}!Agdaex: {{e}} or {{x=e}}!Agdaex:  \x {y} -> e or \(x:A){y:B} -> e!Agdaex: \ ()!Agdaex: .\ { p11 .. p1a -> e1 ; .. ; pn1 .. pnz -> en }!Agdaex: e -> e or .e -> e (NYI: {e} -> e)!Agdaex:  (xs:e) -> e or  {xs:e} -> e!Agdaex: Set!Agdaex: Prop!Agdaex: Set0, Set1, ..!Agdaex: Prop0, Prop1, ..!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 let!Agdaex: (e)!Agdaex: (| e1 | e2 | .. | en |) or (|)!Agdaex: do x <- m1; m2!Agdaex: () or {}, only in patterns!Agdaex: x@p, only in patterns!Agdaex: .p, only in patterns!Agdaex: ..A, used for parsing ..A -> B!Agda!only used for printing telescopes!Agdaex: quote, should be applied to a name!Agdaex:  quoteTerm, should be applied to a term!Agdaex:  @(tactic t)", used to declare tactic arguments!Agdaex: unquote&, should be applied to a term of type Term!Agdato print irrelevant things!Agdaex: a = b, used internally in the parser!Agda...$, used internally to parse patterns.!AgdaAn abstraction inside a special syntax declaration (see Issue 358 why we introduce this)."AgdaWe can try to get a  Telescope from a  [LamBinding]. If we have a type annotation already, we're happy. Otherwise we manufacture a binder with an underscore for the type."AgdaSmart constructor for Pi: check whether the  Telescope is empty"Agda#Computes the top-level module name.Precondition: The   has to be well-formed. This means that there are only allowed declarations before the first module declaration, typically import declarations. See "."AgdaSplits off allowed (= import) declarations before the first non-allowed declaration. After successful parsing, the first non-allowed declaration should be a module declaration."Agda*Observe the hiding status of an expression"AgdaTurn an expression into a pattern. Fails if the expression is not a valid pattern."AgdaA ! is  when the where keyword is absent. An empty list of declarations does not count as  here."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced."AgdaRanges are not forced. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"""""""""""!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!" """""!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"" !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!" !!!!! !!!!  ""gNone #$%-0235679>?Bi#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.########################################################################hNone #$%-0235679>?Fd #Agdan for root of split tree#AgdaTag 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).#AgdaSplit 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.#AgdaAbstract case tree shape.#AgdaNo more splits coming. We are at a single, all-variable clause.#AgdaA split is necessary.#Agda+The number of variables bound in the clause$AgdaArg. no to split at.$AgdaSub split trees.$AgdaConvert a split tree into a  (for printing).#################$$$#$$$$$$###$$$###############$$iNone #$%-0235679>?N1($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 $: compacting interfaces.$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 LHS$Agda Subphase for $: checking the RHS$Agda Subphase for $: checking a type signature$Agda Subphase for $: generalizing over variables$Agda Subphase for $: solving instance goals$Agda Subphase for $: unification of the indices$AgdaPretty 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./$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$/$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$jNone #$%-0235679>?X$AgdaGeneric pattern traversal.See .$Agda Fold pattern.$AgdaCombine 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.!$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$!$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$kNone" #$%'(-/0235679>?^ $AgdaA singleton type for  (except for the constructor ).$Agda"Used to define the return type of %.$AgdaShould sections be parsed?%AgdaThe  is possibly ambiguous, but it must correspond to one of the names in the set.%AgdaRuns a parser. If sections should be parsed, then identifiers with at least two name parts are split up into multiple tokens, using  to record the tokens' original positions within their respective identifiers.%Agda)Parse a specific identifier as a NamePart%AgdaParses 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.%Agda,Parses a potentially pattern-matching binder%Agda0Parse the "operator part" of the given notation.Normal holes (but not binders) at the beginning and end are ignored.If the notation does not contain any binders, then a section notation is allowed."$$$$$$$%$%%%%%%%%%%%%%%%%%%%%%%%%%"%%%%%%%%%%%%%%%%%$%$%%%%$$$$$$%%%%lNone #$%-0235679>?_%Agda,Generic traversals for concrete expressions. Note: does not go into patterns!%AgdaThis corresponds to n.%AgdaThis corresponds to n.%AgdaThis is a reduce.%%%%%%%%mNone #$%-0235679>?a%AgdaGet 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. %%%%%%%%%%%%% %%%%%%%%%%%%%nNone #$%-0235679>?dX%Agda(Conjunctive constraint.)%AgdaAn attribute is a modifier for .%AgdaModifiers for .%AgdaModifiers for .%Agda#Concrete syntax for all attributes.%Agda#Parsing a string into an attribute.%Agda(Parsing an expression into an attribute.%Agda!Setting an attribute (in e.g. an ). Overwrites previous value.%AgdaSetting some attributes in left-to-right order. Blindly overwrites previous settings.%AgdaSetting  if unset.%AgdaSetting  if unset.%AgdaSetting  if unset.%Agda'Setting an unset attribute (to e.g. an ).%Agda#Setting a list of unset attributes.%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%oNone #$%-0235679>?u@3%Agda A compressed %0, in which consecutive positions with the same % are stored together.%Agda Syntax highlighting information.%AgdaA %6 is a mapping from file positions to meta information.,The first position in the file has number 1.%AgdaIs the highlighting "token-based", i.e. based only on information from the lexer?%AgdaThe defining module.%AgdaThe file position in that module. File positions are counted from 1.%Agda Has this DefinitionSite/ been created at the defining site of the name?%Agda#A pretty name for the HTML linking.%AgdaMeta 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).&AgdaThe definition site of the annotated thing, if applicable and known.&AgdaIs this entry token-based?&AgdaOther aspects, generated by type checking. (These can overlap with each other and with &s.)&AgdaUnsolved constraint not connected to meta-variable. This could for instance be an emptyness constraint.&AgdaUsed for highlighting unreachable clauses, unreachable RHS (because of an absurd pattern), etc.&Agda8Used for shadowed repeated variable names in telescopes.&AgdaWhen 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.&AgdaFunction declaration without matching definition NB: We put CatchallClause last so that it is overwritten by other, more important, aspects in the emacs mode.&AgdaNameKind(s are figured out during scope checking.&AgdaBound variable.&AgdaGeneralizable variable. (This includes generalizable variables that have been generalized).&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.&Agda6Syntactic aspects of the code. (These cannot overlap.)&Agda Symbols like forall, =, ->, etc.&AgdaThings like Set and Prop.&AgdaIs the name an operator part?&AgdaText occurring in pragmas that does not have a more specific aspect.&Agda"Non-code contents in literate Agda&AgdaDelimiters used to separate the Agda code blocks from the other contents in literate Agda&Agda A variant of n with & set to %.&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  instead of only one.&Agda Merges files.&Agda.Returns the smallest position, if any, in the %.&Agda Convert the % 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.&AgdaCompresses 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  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 %.%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%&&&&&&%%%%%%%%%%%%%&&&&&&%%%&&&&&&&&&&qNone #$%-0235679>?}r &Agda;Result of comparing a candidate with the current favorites.&AgdaGreat, 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.We 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 n under  and 'union.&AgdaEquality checking is a bit expensive, since we need to sort! Maybe use a Set! of favorites in the first place?&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&None #$%-0235679>?D 'Agda,A finite map, represented as a set of pairs.%Invariant: at most one value per key.'AgdaLookup keys in the same association list often. Use partially applied to create partial function apply m :: k -> Maybe v. First time:  O(n log n) in the worst case.Subsequently: O(log n).Specification:  apply m == ( m).'Agda9O(n). Get the domain (list of keys) of the finite map.'AgdaO(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.'AgdaO(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?'AgdaSet the  in an abstract name.'AgdaUsed 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.'Agda%When we get here we cannot have both using and hiding.'Agda9Local variable bound by , , module telescope, pattern, let.'Agda&Function, data/record type, postulate.'AgdaRecord field name. Needs to be distinguished to parse copatterns.'Agda Data or record constructor name.'AgdaName of pattern synonym.'Agda Unbound name.'AgdaWhat kind of binder?'Agda-A decoration of abstract syntax module names.'AgdaThe resolved module name.'Agda&Explanation where this name came from.'AgdaA decoration of W.'AgdaThe resolved qualified name.'Agda6The kind (definition, constructor, record field etc.).'Agda&Explanation where this name came from.'AgdaAdditional information needed during scope checking. Currently used for generalized data/record params.'AgdaWhere does a name come from?=This information is solely for reporting to the user, see .'AgdaDefined in this module.'AgdaImported from another module.'Agda!Imported by a module application.'Agda A set of ', for the sake of (.'AgdaOnly these kinds.'AgdaAll but these Kinds.'AgdaFor the sake of parsing left-hand sides, we distinguish constructor and record field names from defined names.'AgdaConstructor name.'AgdaRecord field name.'AgdaName of a pattern synonym.'AgdaName to be generalized'Agda&Generalizable variable from a let open'AgdaName of a macro'Agda3A name that can only be quoted. Previous category DefName: (Refined in a flat manner as Enum and Bounded are not hereditary.)'Agda Name of a data.'Agda Name of a record.'AgdaName of a defined function.'Agda Name of a  postulate.'Agda Name of a  primitive.'AgdaA DefName7, but either other kind or don't know which kind. End DefName0. Keep these together in sequence, for sake of  isDefName!'Agda%Non-dependent tag for name or module.'Agda-Type class for some dependent-types trickery.'Agda#Set of types consisting of exactly ' and '..A GADT just for some dependent-types trickery.'AgdaA  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.'Agda0Maps concrete names to a list of abstract names.'Agda>Maps concrete module names to a list of abstract module names.'AgdaAll abstract names targeted by a concrete name in scope. Computed by (.'AgdaA local variable can be shadowed by an import. In case of reference to a shadowed variable, we want to report a scope error.'AgdaUnique ID of local variable.'Agda/Kind of binder used to introduce the variable (, let, ...).'AgdaIf this list is not empty, the local variable is shadowed by one or more imports.'AgdaFor each bound variable, we want to know whether it was bound by a , , module telescope, pattern, or let.'Agda (currently also used for  and module parameters)'Agda 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.'Agda&Maps concrete names C.Name to fixities'Agda(Maps concrete names C.Name to polarities'AgdaSee .'Agda#Things not exported by this module.'Agda+Things defined and exported by this module.'Agda1Things from open public, exported by this module.'AgdaA scope is a named collection of names partitioned into public and private names.'AgdaGet a ' from '.'Agda A lens for ''Agda`Monadic' lens (Functor sufficient).'Agda3Shadow a local name by a non-empty list of imports.'Agda1Treat patternBound variable as a module parameter(Agda*Project name of unshadowed local variable.(Agda%Get all locals that are not shadowed  by imports.(AgdaLenses for ScopeInfo components(Agda Lens for (.(Agda Lens for (.(Agda inNameSpace> selects either the name map or the module name map from a '. What is selected is determined by result type (using the dependent-type trickery).(AgdaVan Laarhoven lens on '.(AgdaVan Laarhoven lens on '.(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 Maybe C.Name for defined names and module names. However, the penalty of doing it in two passes should not be too high. (Doubling the run time.)(Agda Version of ( that also returns sets of name and module name clashes introduced by renaming0 to identifiers that are already imported by using or lack of hiding.(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.(Agda3Disallow using generalized variables from the scope(Agda.Add an explanation to why things are in scope.(Agda5Get the public parts of the public modules of a scope(AgdaCompute 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 scope(AgdaFind the concrete names that map (uniquely) to a given abstract name. Sort by length, shortest first.(AgdaFind the concrete names that map (uniquely) to a given abstract qualified name. Sort by length, shortest first.(AgdaFind 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.(AgdaWe show shadowed variables as prefixed by a ".", as not in scope.(Agda/Sets the binding site of all names in the path.(Agda4Merged scope, clashing names, clashing module names.''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((''''''''''''''''''''''''''''''''''''''''''''(((((((((((((((((''''''''''''''('''''''''''''''''(''''(((('''''''''''''''''(('''''''''((((((((((((((((((((((((((((((('''((((((((((((((((''''(((((((''((sNone #$%-0235679>?)Agda.Types which Geniplate should not descend into.)AgdaA localised instance of n. The generated n. functions neither descend into the types in )*, nor into the types in the list argument.)AgdaA localised instance of n. The generated n. functions neither descend into the types in )*, nor into the types in the list argument.))))))tNone #$%-0235679>?x)Agda:Has the constructor pattern a dotted (forced) constructor?)AgdaDotted constructor.)AgdaOrdinary constructor.)AgdaConstructor pattern info.)AgdaDoes this pattern come form the eta-expansion of an implicit pattern?)Agda;For a general pattern we remember the source code position.)AgdaThe range of the "as" and "to" keywords, if any. Retained for highlighting purposes.)AgdaThe "as" module name, if any. Retained for highlighting purposes.)Agda Retained for abstractToConcrete of  .)AgdaInformation about application)Agda6Do 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 ).>))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))>))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))uNone #$%-0235679>?*Agda* m extracts the diagonal of m.For non-square matrices, the length of the diagonal is the minimum of the dimensions of the matrix.*Agda6Type of matrices, parameterised on the type of values.Sparse matrices are implemented as an ordered association list, mapping coordinates to values.*AgdaDimensions of the matrix.*Agda!Association of indices to values.*Agda%Type of matrix indices (row, column).*Agda Row index, 1 <= row <= rows.*Agda Column index 1 <= col <= cols.*AgdaSize of a matrix.*AgdaNumber of rows, >= 0.*AgdaNumber of columns, >= 0.*Agdan iff the matrix is square.*AgdaReturns n iff the matrix is empty.*Agda5Compute the matrix size of the union 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 rs constructs a matrix from a list of lists of values (a list of rows). O(size) where size = rows  cols.Precondition: n rs n * sz and n ((* sz n) . n) 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.*Agda-Converts a matrix to a list of row lists. O(size) where size = rows  cols.*Agda (i,)  $ f a), and same for gs and g.*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). interAssocWith f l l' = { (i, f a b) | (i,a) D l and (i,b) D l' }Used 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) 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 m, after the rows already existing in the matrix. All elements in the new row get set to x.*AgdaPointwise 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.*Agda$Element only present in left matrix.Agda%Element only present in right matrix.Agda!Element present in both matrices.AgdaResult counts as zero?**************************************************************vNone #$%-0235679>?*AgdaA 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 * n Le n Lt.This is generalized to * n '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.*AgdaNo 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 n k n ?cutoff + 1.*AgdaSmart 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?*AgdaMatrix-shaped order is decreasing if any diagonal element is decreasing.*AgdaMultiplication of *.s. (Corresponds to sequential composition.)*Agda+The supremum of a (possibly empty) list of *;s. More information (i.e., more decrease) is bigger. *# is no information, thus, smallest.*Agda%The infimum of a (non empty) list of *$s. Gets the worst information. *& is the least element, thus, dominant.*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: * 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'. If we are still decreasing, it can get worse: less decreasing.**********************************************wNone #$%-0235679>?**AgdaSets of incomparable call matrices augmented with path information. Use overloaded , , , n.*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.In 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 source 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 n 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.*************++++++**********+***+++xNone #$%-0235679>?-+AgdaA call graph is a set of calls. Every call also has some associated meta information, which should be nal 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 n 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.+AgdaReturns all the nodes with incoming edges. Somewhat expensive. O(e).+AgdaConverts a call graph to a list of calls with associated meta information.+AgdaConverts 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.+Agda"Call graph comparison. A graph cs' is `worse' than cs 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 cs. 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.*++++++++++++++++++++*++++++++++yNone #$%-0235679>?+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.n perms: is returned if the functions are size-change terminating.,If termination can not be established, then n problems is returned instead. Here problems contains an indication of why termination cannot be established. See lexOrder for further details.Note 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 ( == ) 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.++++++++zNone #$%-0235679>?+AgdaSometimes 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.+AgdaIn 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 +. Alex needs this to be defined to handle "patterns with a left-context".+Agda,Returns the next character, and updates the + value.This function is not suitable for use by Alex 2, because it can return non-ASCII characters.+Agda'Returns the next byte, and updates the + value.A trick is used to handle the fact that there are more than 256 Unicode code points. The function translates characters to bytes in the following way:Whitespace characters other than '\t' and '\n' are translated to ' '.8Non-ASCII alphabetical characters are translated to 'z'.;Other non-ASCII printable characters are translated to '+'.&Everything else is translated to '\1'.Note that it is important that there are no keywords containing 'z', '+', ' ' or '\1'.*This function is used by Alex (version 3).+AgdaConjunction of +s.+AgdaDisjunction of +s.+Agda Negation of +s.++++++++++++++++++++++++++++++++++++++++{None #$%-0235679>?C +AgdaThe LookAhead monad is basically a state monad keeping with an extra +, wrapped around the  monad.+Agda8Throw an error message according to the supplied method.+Agda$Get the current look-ahead position.+AgdaSet the look-ahead position.+AgdaLift a computation in the  monad to the + monad.+AgdaLook at the next character. Fails if there are no more characters.+AgdaConsume all the characters up to the current look-ahead position.+Agda-Undo look-ahead. Restores the input from the .+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. ++++++++++++ ++++++++++++|None #$%-0235679>?+AgdaLex a string literal. Assumes that a double quote has been lexed.+AgdaLex 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.++++None #$%-0235679>?+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 +" is called to lex a real token.+Agda Lex a hole ( {! ... !}#). Holes can be nested. Returns  .+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.++++++++++None #$%-0235679>?z+AgdaThis is the initial state for parsing a regular, non-literate file.+Agda8The layout state. Entered when we see a layout keyword (+3) and exited either when seeing an open brace ( openBrace) or at the next token (+)./Update: we don't use braces for layout anymore.,AgdaWe 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 data 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 + is executed, generating the closing brace. The open brace is generated when entering by +.,AgdaThis 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 +.,AgdaThis 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.,AgdaReturn the next token. This is the function used by Happy in the parser.  lexer k = + >>= k,Agda3This is the main lexing function generated by Alex. +++++++,,,,,, ,+,+,,,+++++,None #$%-0235679>?E,Agda1Parse the token stream. Used by the TeX compiler.,Agda3Parse an expression. Could be used in interactions.,AgdaParse an expression followed by a where clause. Could be used in interactions.,AgdaParse a module.,AgdaBreaks up a string into substrings. Returns every maximal subsequence of zero or more characters distinct from n. splitOnDots "" == [""] splitOnDots "foo.bar" == ["foo", "bar"] splitOnDots ".foo.bar" == ["", "foo", "bar"] splitOnDots "foo.bar." == ["foo", "bar", ""] splitOnDots "foo..bar" == ["foo", "", "bar"],,,,,,,,,,,,,,n9 n9 }None #$%-0235679>? +Agda??+Agda&This action is only executed from the ,/ state. It will exit this state, enter the , state, and return a virtual close brace (closing the empty layout block started by +).+AgdaStart a new layout context. This is one of two ways to get out of the + state (the other is ,#). There are two possibilities:The current token is to the right of the current layout context (or we're in a no layout context).The 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 , 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 ,). Checks the position of the token relative to the current layout context. If the token is to the left : Exit the current context and a return virtual close brace (stay in the , state). same column : Exit the ,/ state and return a virtual semi colon. to the right : Exit the , state and continue lexing.If the current block doesn't use layout (i.e. it was started by ,%) all positions are considered to be  to the right.,Agda$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.++++,,,,++++None #$%-0235679>? ,AgdaWrapped Parser type.,Agda"A monad for handling parse results,Agda'Returns the contents of the given file.,AgdaExtensions supported by ,.,AgdaParses a module.,AgdaParses a module name.,AgdaParses an expression.,Agda0Parses an expression followed by a where clause.,AgdaParses an expression or some other content of an interaction hole.,Agda3Gives the parsed token stream (including comments).,AgdaThe path to the file.Agda)The file contents. Note that the file is not read from disk.!,,,,,,,,,,,,,,,,!,,,,,,,,,,,,,,,,None #$%-0235679>?R,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.,Agda2Suggest a name if available (i.e. name is not "_"),Agda#Constructing a singleton telescope.,Agda Drop the types from a telescope.,AgdaTelescope as list.,AgdaView type as path type.,Agdareduced,AgdaSort of this type.,Agda Builtin PATH.,AgdaHidden,AgdaHidden,Agda NotHidden,Agda NotHidden,AgdaView type as equality type.,Agdareduced,AgdaSort of this type.,AgdaBuiltin EQUALITY.,AgdaHidden. Empty or Level.,AgdaHidden,Agda NotHidden,Agda NotHidden,AgdaSubstitutions.,AgdaIdentity substitution.   E IdS : ,AgdaEmpty substitution, lifts from the empty context. First argument is  IMPOSSIBLE. Apply this to closed terms you want to use in a non-empty context.  E EmptyS : (),AgdaSubstitution extension, `cons'.   E u : A  E  :  ----------------------  E u :#  : , A ,Agda/Strengthening substitution. First argument is  IMPOSSIBLE. Apply this to a term which does not contain variable 0 to lower all de Bruijn indices by one.   E  :  ---------------------------  E Strengthen  : , A ,Agda9Weakening substitution, lifts to an extended context.   E  :  ------------------- ,  E Wk ||  :  ,Agda9Lifting substitution. Use this to go under a binder. Lift 1  == var 0 :# Wk 1 .   E  :  ------------------------- ,  E 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 (True) or data type (False). In the former case, the  PatOrigin of the conPInfo 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 (-).,Agda)Information on the origin of the pattern.,AgdaFalse if data constructor. True if record constructor.,AgdaShould the match block on non-canonical terms or can it proceed to the catch-all clause?,AgdaThe 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.,AgdaLazy patterns are generated by the forcing translation in the unifier () and are dropped by the clause compiler (TODO: not yet) () 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 x,Agda .t,Agdac ps= The subpatterns do not contain any projection copatterns.,AgdaE.g. 5, "hello".,Agda1Projection copattern. Can only appear by itself.,AgdaPath elimination pattern, like VarP but keeps track of endpoints.,Agda:Used for HITs, the QName should be the one from primHComp.,AgdaOrigin of the pattern: what did the user write in this position?,AgdaPattern inserted by the system,AgdaPattern generated by case split,AgdaUser wrote a variable pattern,AgdaUser wrote a dot pattern,AgdaUser wrote a wildcard pattern,Agda User wrote a constructor pattern,AgdaUser wrote a record pattern,AgdaUser wrote a literal pattern,AgdaUser wrote an absurd pattern-AgdaPattern 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. A level is a maximum expression of a closed level and 0..n -4 expressions each of which is an atom plus a number.-AgdaSorts.-AgdaSet B.-AgdaProp B.-AgdaSet.-AgdaSizeUniv, a sort inhabited by type Size.-AgdaSort of the pi type.-Agda(Sort of a (non-dependent) function type.-AgdaSort of another sort.-AgdaA postulated sort.-AgdaA (part of a) term or type which is only used for internal purposes. Replaces the abuse of Prop for a dummy sort. The String typically describes the location where we create this dummy, but can contain other information as well.-AgdaSequence 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.-AgdaBinder.-2: The bound variable might appear in the body. - 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 properly-Agda5Eliminations, subsuming applications and projections.-Agda Application.-Agda Projection.  is name of a record projection.-Agda'IApply x y r, x and y are the endpoints-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 neutral-Agda+Terms are beta normal. Relevance is ignored-Agdaf es, possibly a delta/iota-redex-Agdac es or record { fs = es } es allows only Apply and IApply eliminations, and IApply only for data constructors.-Agda)dependent or non-dependent function space-AgdaIrrelevant stuff in relevant position, but created in an irrelevant context. Basically, an internal version of the irrelevance axiom .irrAx : .A -> A.-AgdaA (part of a) term or type which is only used for internal purposes. Replaces the  Sort Prop hack. The String typically describes the location where we create this dummy, but can contain other information as well. The second field accumulates eliminations in case we apply a dummy term to more of them.-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.-AgdaThe name of the record fields. Empty list for data constructors.  is stored since the info in the constructor args might not be accurate because of subtyping (issue #2170).-AgdaType of argument lists.-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 - of internal syntax, in Context and -.  is used for actual arguments (-, -, - etc.) and in Abstract syntax and other situations.  cubical When domFinite = True for the domain of a - type, the elements should be compared by tabulating the domain type. Only supported in case the domain type is primIsOne, to obtain the correct equality for partial elements.-Agdae.g. x in {x = y : A} -> B.-Agda "@tactic e".-AgdaConstant level n-AgdaWhen trying to reduce f es(, on match failed on one elimination e D es that came with info r :: NotBlocked.  stuckOn e r produces the new  NotBlocked info.- must be propagated, as this is blockage that can be lifted in the future (as more clauses are added).- e0 is also propagated, since it provides more precise information as  StuckOn e (as e0 is the original reason why reduction got stuck and usually a subterm of e). An information like %StuckOn (Apply (Arg info (Var i []))) (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 es 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 e is of function type, but we cannot match against something of function type.).Agda6Make an absurd pattern with the given de Bruijn index..AgdaBuild partial , from -.AgdaBuild - from ,..Agda'Retrieve the PatternInfo from a pattern.Agda Retrieve the origin of a pattern.Agda1Does the pattern perform a match that could fail?.AgdaAbsurd lambdas are internally represented as identity with variable name "()"..AgdaAn unapplied variable..AgdaAdd - is it is not already a DontCare..Agda,Aux: A dummy term to constitute a dummy termlevel sort/type..Agda.Aux: A dummy level to constitute a level/sort..Agda5A dummy term created at location. Note: use macro  DUMMY_TERM !.Agda6A dummy level created at location. Note: use macro  DUMMY_LEVEL !.Agda5A dummy sort created at location. Note: use macro  DUMMY_SORT !.Agda5A dummy type created at location. Note: use macro  DUMMY_TYPE !.AgdaContext entries without a type have this dummy type. Note: use macro  DUMMY_DOM !.AgdaTop sort (Setomega)..AgdaGiven a constant m and level l , compute m + l.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..AgdaLens to edit a - as a list..AgdaRemoving a topmost - constructor..AgdaDoesn't do any reduction..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. (Safe).AgdaDrop - constructors. (Safe).AgdaSplit at first non--.Agda Discards Proj f entries..AgdaDrop - constructors. (Safe).AgdaIgnores  and  and tactic..AgdaThis instance cheats on -, use with care. -s are always assumed to be , since they have no . Same for IApply.Agda2The size of a telescope is its length (as a list)..Agda- is the unit. - is dominant. -{}1 should be propagated, if tied, we take the left..AgdaBlocking by a meta is dominant./AgdaA  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..Agda-Should absurd patterns count as proper match?Agda1Should projection patterns count as proper match?Agda The pattern.,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------------------------------------------------------------------------------------------------------------------....................................................................,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------------------------------------------------------------------------------------------------------------------....................................................................,4None #$%-0235679>?X/AgdaThings 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.////////None #$%-0235679>?Y////////None  #$%-0235679>?o.0Agda&Gather free variables in a collection.0AgdaThe current context.0AgdaAdditional context, e.g., whether to ignore free variables in sorts.0AgdaAre we flexible or rigid?0Agda+What is the current relevance and quantity?0Agda#Method to return a single variable.0Agda5Where should we skip sorts in free variable analysis?0Agda Do not skip.0AgdaSkip when annotation to a type.0AgdaSkip unconditionally.0AgdaKeep track of 07 for every variable, but forget the involved meta vars.0AgdaRepresentation of a variable set as map from de Bruijn indices to 0.0AgdaAny representation c 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`.)In algebraic terminology, a variable set a; needs to be (almost) a left semimodule to the semiring 0.0AgdaLaws * Respects monoid operations: ``` withVarOcc o mempty == mempty withVarOcc o (x <> y) == withVarOcc o x <> withVarOcc o y ``` * Respects VarOcc composition: ``` withVarOcc oneVarOcc = id withVarOcc (composeVarOcc o1 o2) = withVarOcc o1 . withVarOcc o2 ``` * Respects VarOcc aggregation: ``` withVarOcc (o1 <> o2) x = withVarOcc o1 x <> withVarOcc o2 x ``` Since the corresponding unit law may fail, ``` withVarOcc mempty x = mempty ``` it is not quite a semimodule.0AgdaOccurrence of free variables is classified by several dimensions. Currently, we have 0 and .0AgdaDepending on the surrounding context of a variable, it's occurrence can be classified as flexible or rigid, with finer distinctions.The constructors are listed in increasing order (wrt. information content).0Agda7In arguments of metas. The set of metas is used by ' to generate the right blocking information. The semantics is that the status of a variable occurrence may change if one of the metas in the set gets solved. We may say the occurrence is tainted by the meta variables in the set.0Agda*In arguments to variables and definitions.0AgdaIn top position, or only under inductive record constructors (unit).0Agda3Under at least one and only inductive constructors.0Agda5A set of meta variables. Forms a monoid under union.0Agda0 aggregation (additive operation of the semiring). For combining occurrences of the same variable in subterms. This is a refinement of the n operation for 0 which would work if 0 did not have the 0* as an argument. Now, to aggregate two 0$ occurrences, we union the involved 0s.0Agda Unit for 0.0AgdaAbsorptive for 0.0Agda0 composition (multiplicative operation of the semiring). For accumulating the context of a variable.0 is dominant. Once we are under a meta, we are flexible regardless what else comes. We taint all variable occurrences under a meta by this meta.00 is next in strength. Destroys strong rigidity.0 is still dominant over 0.00 is the unit. It is the top (identity) context.0Agda Unit for 0.0AgdaThe absorptive element of variable occurrence under aggregation: strongly rigid, relevant.0AgdaFirst argument is the outer occurrence (context) and second is the inner. This multiplicative operation is to modify an occurrence under a context.0AgdaIgnore free variables in sorts.0AgdaThe initial context.0AgdaRun function for FreeM.0AgdaBase case: a variable.0Agda3Subtract, but return Nothing if result is negative.0AgdaGoing under a binder.0Agda Going under n binders.0Agda Changing the .0Agda Changing the .0Agda Changing the 0 context.0Agda?x1AgdaCollect all free variables together with information about their occurrence.Doesn't go inside solved metas, but collects the variables from a metavariable application X ts as  flexibleVars.1AgdaCompute free variables.1Agda7Get the full occurrence information of a free variable.1Agda7Get the full occurrence information of a free variable.1Agda7Is the variable bound by the abstraction actually used?1Agda0Is the term entirely closed (no free variables)?1AgdaCollect all free variables.1Agda=Collect all relevant free variables, possibly ignoring sorts.1AgdaCollect all relevant free variables, excluding the "unused" ones.1Agda?Variables under only and at least one inductive constructor(s).1AgdaVariables 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.1AgdaRigid variables: either strongly rigid, unguarded, or weakly rigid.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. flexibleVars :: VarMap -> IntMap MetaSet flexibleVars (VarMap m) = (n= m) $ case VarOcc (Flexible ms) _ -> Just ms _ -> Nothing1Agda"Hereditary Semigroup instance for n. (The default instance for n may not be the hereditary one.)1Agda"Hereditary Semigroup instance for n. (The default instance for n may not be the hereditary one.)200000000000000000000000000001111111111111111111111211100000001011111111111111100000000000000000111000None #$%-0235679>?1AgdaApply a substitution.1Agda(abstract args v) 1 args --> v[args].1AgdaApply something to a bunch of arguments. Preserves blocking tags (application can never resolve blocking).1Agda Apply to some default arguments.1Agda#Apply to a single default argument.1Agda%Raise de Bruijn index, i.e. weakening1AgdaReplace de Bruijn index i by a - in something.1AgdaReplace what is now de Bruijn index 0, but go under n binders. %substUnder n u == subst n (raise n u).1AgdaTo replace index n by term u, do applySubst (singletonS n u).  ,  E u : A --------------------------------- ,  E singletonS || u : , A,  1AgdaSingle substitution without disturbing any deBruijn indices.  , A,  E u : A --------------------------------- , A,  E inplace || u : , A,  1Agda$Lift a substitution under k binders.1Agda   E  : ,  -------------------  E dropS ||  :  1Agda applySubst ( 1& ) v == applySubst  (applySubst  v)1Agda   E  :   E reverse vs :  ----------------------------- (treating Nothing as having any type)  E prependS vs  : ,  1Agda E (strengthenS E ||) : ,1AgdalookupS (listS [(x0,t0)..(xn,tn)]) xi = ti, assuming x0 < .. < xn.1Agda/Instantiate an abstraction. Strict in the term.1AgdaInstantiate an abstraction. Lazy in the term, which allow it to be  IMPOSSIBLE in the case where the variable shouldn't be used but we cannot use 1. Used in Apply.1Agda9Instantiate an abstraction that doesn't use its argument.1AgdaunderAbs k a b applies k to a# and the content of abstraction b# and puts the abstraction back. a 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.1AgdaunderLambdas 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.'111111111111111111111111111111111111111'11111111111111111111111111111111111111114None #$%-0235679>?)11111111111111111111111111111111111111111)11111111111111111111111111111111111111111None  #$%-0235679>?2AgdaGeneric term traversal.Note: ignores sorts in terms! (Does not traverse into or collect from them.)2Agda?Generic traversal with post-traversal action. Ignores sorts.2AgdaGeneric fold, ignoring sorts.2Agda5Put it in a monad to make it possible to do strictly.22222222None #$%-0235679>?2AgdaCase tree with bodies.2Agda 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 2 with arity 0.2Agda 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.2Agda Absurd case.2AgdaBranches in a case tree.2Agda3We are constructing a record here (copatterns). 2 lists projections.2AgdaMap from constructor (or projection) names to their arity and the case subtree. (Projections have arity 0.)2AgdaEta-expand with the given (eta record) constructor. If this is present, there should not be any conBranches or litBranches.2Agda!Map from literal to case subtree.2Agda'(Possibly additional) catch-all clause.2Agda?(if True) In case of non-canonical argument use catchAllBranch.2AgdaLazy pattern match. Requires single (non-copattern) branch with no lit branches and no catch-all.2AgdaCheck that the requirements on lazy matching (single inductive case) are met, and set lazy to False otherwise.2Agda1Check whether a case tree has a catch-all clause.2Agda5Check whether a case tree has any projection patterns222222222222222222222222222222222222222222222222222222None #$%-0235679>?2AgdaReturns every meta-variable occurrence in the given type, except for those in -s.2AgdaReturns 2 in a list. allMetasList = allMetas (:[]).Note: this resulting list is computed via difference lists. Thus, use this function if you actually need the whole list of metas. Otherwise, use 2 with a suitable monoid.2Agdan if thing contains no metas. noMetas = null . allMetasList.2Agda8Returns the first meta it find in the thing, if any. 'firstMeta == listToMaybe . allMetasList.22222222None #$%-0235679>?2AgdaGetting the used definitions.Note: in contrast to  getDefs also collects from sorts in terms. Thus, this is not an instance of foldTerm.2Agda*What it takes to get the used definitions.2AgdaInputs to and outputs of getDefs' are organized as a monad.2AgdagetDefs' lookup emb a 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 emb can also choose to discard a used definition by mapping to the unit of the monoid. 22222222222 22222222222None #$%-0235679>?J2Agda,Parameterised over the type of dot patterns.2AgdaDestructor pattern d.3Agda%Defined pattern: function definition f ps. It is also abused to convert destructor patterns into concrete syntax thus, we put AmbiguousQName here as well.3AgdaUnderscore pattern entered by user. Or generated at type checking for implicit arguments.3Agda Dot pattern .e3Agda| p, for with-patterns.3AgdaThe lhs in projection-application and with-pattern view. Parameterised over the type e of dot patterns.3Agda&The head applied to ordinary patterns.3Agda Projection.3AgdaWith patterns.3AgdaHead f.3AgdaApplied to patterns ps.3AgdaRecord projection identifier.3AgdaMain argument of projection.3Agda E.g. the 3.3AgdaApplied to with patterns | p1 | ... | pn*. These patterns are not prefixed with WithP!3AgdaThe lhs of a clause in focused (projection-application) view (outside-in). Projection patters are represented as 3s.3AgdaRange.3Agda Copatterns.3AgdaThe lhs of a clause in spine view (inside-out). Projection patterns are contained in  spLhsPats, represented as ProjP d.3AgdaRange.3Agda!Name of function we are defining.3Agda3Elimination by pattern, projections, with-patterns.3AgdaThe " is the name of the with function.3AgdaWe store the original concrete expression in case we have to reproduce it during interactive case splitting. n for internally generated rhss.3AgdaThe s are the names of the generated with functions, one for each 4.3AgdaThe patterns stripped by with-desugaring. These are only present if this rewrite follows a with.3AgdaThe RHS should not be another  RewriteRHS.3Agda&The where clauses are attached to the  RewriteRHS by3AgdaWe 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.3AgdaOnly 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.3AgdaA 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.3AgdaWe don't yet know the position of generalized parameters from the data sig, so we keep these in a set on the side.3AgdaMaps generalize variables to the corresponding bound variable (to be introduced by the generalisation).3AgdaA 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) before type-checking. However, this would be slightly problematic: $We would have to typecheck the type A several times.If A contains a meta variable or hole, it would be duplicated by such a translation.While 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.3AgdaAs in telescope  (x y z : A) or type (x y z : A) -> B.3AgdaE.g.  (let x = e) or  (let open M).3Agda0A lambda binding is either domain free or typed.3Agda. x or {x} or .x or {x = y} or x@p or (p)3Agda. (xs:e) or {xs:e} or (let Ds)3AgdaOnly 4s.3AgdaBindings that are valid in a let.3Agda LetBind info rel name type defn3AgdaIrrefutable pattern binding.3Agda*LetApply mi newM (oldM args) renamings dir. The ImportDirective is for highlighting purposes.3Agda,only for highlighting and abstractToConcrete3Agda?Only used for highlighting. Refers to the first occurrence of x in let x : A; x = e(. | LetGeneralize DefInfo ArgInfo Expr3Agda' is not ':. Name can be ambiguous e.g. for built-in constructors.3AgdaBuiltins that do not come with a definition, but declare a name for an Agda concept.3Agda"Range is range of REWRITE keyword.3Agda:For coinductive records, use pragma instead of regular  eta-equality, definition (as it is might make Agda loop).3Agda tel. M args : applies M to args and abstracts tel.3Agda  M {{...}}3Agda3Type signature (can be irrelevant, but not hidden).The fourth argument contains an optional assignment of polarities to arguments.3AgdaFirst argument is set of generalizable variables used in the type.3Agda record field3Agdaprimitive function3Agda)a bunch of mutually recursive definitions3AgdaThe ImportDirective is for highlighting purposes.3AgdaThe ImportDirective is for highlighting purposes.3Agda'only retained for highlighting purposes3Agdasequence of function clauses3Agdalone data signature3Agdathe 3s are 3) and bind the parameters of the datatype.3Agdalone record signature3AgdaThe 3s are 31 and bind the parameters of the datatype. The 4' gives the constructor type telescope, (x1 : A1)..(xn : An) -> Prop5, and the optional name is the constructor's name.3AgdaOnly for highlighting purposes3Agdascope annotation4AgdaRenaming (generic).4AgdaIs a type signature a  postulate or a function signature?4AgdaA function signature.4AgdaNot a function signature, i.e., a postulate (in user input) or another (e.g. data/record) type signature (internally).4AgdaRecord field assignment f = e.4AgdaExpressions after scope checking (operators parsed, names resolved).4AgdaBound variable.4Agda/Constant: axiom, function, data or record type.4AgdaProjection (overloaded).4AgdaConstructor (overloaded).4AgdaPattern synonym.4AgdaMacro.4AgdaLiteral.4Agda&Meta variable for interaction. The " is usually identical with the ) of ). However, if you want to print an interaction meta as just ? instead of ?n, you should set the ) to n while keeping the .4Agda=Meta variable for hidden argument (must be inferred locally).4Agda.e, for postfix projection.4AgdaOrdinary (binary) application.4AgdaWith application.4Agda bs C e.4Agda() or {}.4AgdaDependent function space  C A.4Agda(Like a Pi, but the ordering is not known4AgdaNon-dependent function space.4AgdaSet, Set1, Set2, ...4AgdaProp, Prop1, Prop2, ...4Agda let bs in e.4Agda#Only used when printing telescopes.4AgdaRecord construction.4AgdaRecord update.4AgdaScope annotation.4AgdaQuote an identifier .4Agda Quote a term.4Agda#The splicing construct: unquote ...4Agda tactic e x1 .. xn4Agda For printing DontCare from Syntax.Internal.4AgdaA name in a binding position: we also compare the nameConcrete when comparing the binders for equality.With  --caching on we compare abstract syntax to determine if we can reuse previous typechecking results: during that comparison two names can have the same nameId but be semantically different, e.g. in  {_ : A} -> .. vs.  {r : A} -> ...4Agda!Smart constructor for Generalized4AgdaDoes not compare ' fields.4AgdaDoes not compare ' fields. Does not distinguish between prefix and postfix projections.4AgdaIgnore   when comparing 3s.4AgdaIgnore 3 when comparing 3s.5AgdaTurn a name into an expression.5AgdaAre we in an abstract block?)In that case some definition is abstract.5Agda/Extracts all the names which are declared in a 3. This does not include open public or let expressions, but it does include local modules, where clauses and the names of extended lambdas.5Agda$The name defined by the given axiom.3Precondition: The declaration has to be a (scoped) 4.5AgdaTurn a ' into an expression.Assumes name is not '.5AgdaTurn an ' into an expression.2222233233333332323333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333444444444444444444444444444444444444444444444444444444444555555555555555522222332333333323233333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333334444444444444444444444444444444444444444444444444444444445555555555555555None  #$%-0235679>?65Agda State [i] (f (Pattern' (i,x)))5Agda+Arity of a function, computed from clauses.5AgdaTranslate the clause patterns to terms with free variables bound by the clause telescope.%Precondition: no projection patterns.5AgdaTranslate the clause patterns to an elimination spine with free variables bound by the clause telescope.6Agda5Augment pattern variables with their de Bruijn index.6AgdaComputes the permutation from the clause telescope to the pattern variables.Use as  fromMaybe  IMPOSSIBLE . dbPatPerm to crash in a controlled way if a de Bruijn index is out of scope here.The first argument controls whether dot patterns counts as variables or not.6AgdaComputes the permutation from the clause telescope to the pattern variables.Use as  fromMaybe  IMPOSSIBLE . clausePerm to crash in a controlled way if a de Bruijn index is out of scope here.6AgdaTurn a pattern into a term. Projection patterns are turned into projection eliminations, other patterns into apply elimination.6AgdaCompute from each subpattern a value and collect them all in a monoid.6AgdaTraverse pattern(s) with a modification before the recursive descent.6AgdaTraverse pattern(s) with a modification after the recursive descent.6Agda!Get the number of common initial - patterns in a list of clauses.6AgdaGet the number of initial - patterns in a clause.6AgdaGet the number of initial - patterns.6AgdaModify 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.5Agda>Combine a pattern and the value computed from its subpatterns.5Agdapre : Modification before recursion.Agdapost: Modification after recursion.6Agdapre : Modification before recursion.6Agdapost: Modification after recursion.555555555555555566666666666555555566666666555556665555None #$%'(-0235679>?Ȫ6AgdaApply an expression rewriting to every subexpression, inside-out. See Agda.Syntax.Internal.Generic.6AgdaThe first expression is pre-traversal, the second one post-traversal.6AgdaCollects plain lambdas.6Agda-Gather applications to expose head and spine.Note: everything is an application, possibly of itself to 0 arguments6AgdaGather top-level 3%atterns to expose underlying pattern.6Agda-Check whether we are dealing with a universe.6Agda Remove top 4 wrappers.6AgdaRemove 4 wrappers everywhere.!NB: Unless the implementation of 6 for clauses has been finished, this does not work for clauses yet.666666666666666666666666666666666666666666None #$%-0235679>?c6AgdaMerge 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).6Agda.Match an expression against a pattern synonym.6Agda*Match a pattern against a pattern synonym.666666None  #$%-0235679>?Կ6Agda-Convert a focused lhs to spine view and back.6AgdaThe next patterns are ...(This view discards ).)6Agda&Application patterns (non-empty list).6Agda6A projection pattern. Is also stored unmodified here.6AgdaWith patterns (non-empty list). These patterns are not prefixed with 3.6AgdaGeneric pattern traversal.6Agda Fold pattern.6AgdaTraverse pattern.6AgdaCompute from each subpattern a value and collect them all in a monoid.6AgdaTraverse pattern(s) with a modification before the recursive descent.6AgdaTraverse pattern(s) with a modification after the recursive descent.6Agda?Map pattern(s) with a modification after the recursive descent.6Agda9Collect pattern variables in left-to-right textual order.6Agda4Check if a pattern contains a specific (sub)pattern.6AgdaCheck if a pattern contains an absurd pattern. For instance, suc () , does so.+Precondition: contains no pattern synonyms.6Agda)Check if a pattern contains an @-pattern.+Precondition: contains no pattern synonyms.6AgdaCheck if any user-written pattern variables occur more than once, and throw the given error if they do.6AgdaPattern substitution.For the embedded expression, the given pattern substitution is turned into an expression substitution.6AgdaPattern substitution, parametrized by substitution function for embedded expressions.6Agda7Split patterns into (patterns, trailing with-patterns).6Agda1Get the tail of with-patterns of a pattern spine.6AgdaConstruct the 6" of the given list (if not empty).+Return the view and the remaining patterns.6AgdaAdd applicative patterns (non-projection / non-with patterns) to the right.6AgdaAdd with-patterns to the right.6AgdaCombine a pattern and the value computed from its subpatterns.6Agdapre : Modification before recursion.Agdapost: Modification after recursion.6Agdapre : Modification before recursion.6Agdapost: Modification after recursion.6Agda&Substitution function for expressions.Agda(Parallel) substitution.AgdaInput pattern.$666666666666666666666666666666666666$666666666666666666666666666666666666None% #$%'(-./0235679>?7Agda Currying as b# witnesses the isomorphism between  Arrows as b and Products as -> b. It is defined as a type class rather than by recursion on a singleton for as so all of that these conversions are inlined at compile time for concrete arguments.7AgdaUsing 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 exposed7AgdaIsBase t is 'True whenever t is *not* a function space.7AgdaArrows [a1,..,an] r corresponds to a1 -> .. -> an -> r | Products [a1,..,an] corresponds to (a1, (..,( an, ())..))7Agda Version of Foldr taking a defunctionalised argument so that we can use partially applied functions.7AgdaOn Lists7Agda On Booleans7AgdaAll p as ensures that the constraint p is satisfied by all the types in as. (Types is between scare-quotes here because the code is actually kind polymorphic)77777777777777777777777777777777777777777777None  #$%'(-/0235679>?97AgdaA known boolean is one we can obtain a singleton for. Concrete values are trivially known.7Agda"Singleton for type level booleans.77777777777777None #$%-0235679>?ޖ 7AgdaLike  Bifunctor, but preserving sharing.7AgdaLike n, but preserving sharing.7AgdaThe ChangeT monad transformer.7AgdaThe class of change monads.7AgdaRun a 70 computation, returning result plus change flag.7AgdaMap a 7( computation (monad transformer action).7AgdaBlindly run an updater.7AgdaRun a 70 computation, returning result plus change flag.7AgdaBlindly run an updater.7AgdaMark a computation as dirty.7AgdaReplace result of updating with original input if nothing has changed.7Agda8A mock change monad. Always assume change has happened.7Agda = sharing . updater17Agda-Mark computation as having changed something.7777777777777777777777777777777777777777777777None #$%'(-0235679>?)7AgdaNicifier monad. Preserve the state when throwing an exception.7Agda-Non-fatal errors encountered in the Nicifier.7AgdaEmpty abstract block.7AgdaEmpty field block.7AgdaEmpty variable block.7AgdaEmpty instance block7AgdaEmpty macro block.7AgdaEmpty mutual block.7AgdaEmpty  postulate block.7AgdaEmpty private block.7AgdaEmpty  primitive block.7AgdaA {-# CATCHALL #-} pragma that does not precede a function clause.7AgdaA {-# NON_COVERING #-} pragma that does not apply to any function.7AgdaA {-# NO_POSITIVITY_CHECK #-} pragma that does not apply to any data or record type.7AgdaA {-# NO_UNIVERSE_CHECK #-} pragma that does not apply to a data or record type.7AgdaA {-# TERMINATING #-} and {-# NON_TERMINATING #-} pragma that does not apply to any function.7Agda9Declarations (e.g. type signatures) without a definition.7Agdaprivate has no effect on  open public!. (But the user might think so.)7Agdaabstract has no effect on  open public!. (But the user might think so.)7AgdaPragma {-# NO_TERMINATION_CHECK #-} has been replaced by {-# TERMINATING #-} and {-# NON_TERMINATING #-}.7AgdaCOMPILE% pragmas are not allowed in safe mode7Agdaabstract6 block with nothing that can (newly) be made abstract.7Agdainstance8 block with nothing that can (newly) become an instance.7Agdaprivate5 block with nothing that can (newly) be made private.7AgdaThe exception type.7Agda7in a mutual block, a clause could belong to any of the [Name] type signatures7AgdaIn a mutual block, all or none need a MEASURE pragma. Range is of mutual block.7AgdaOne clause in a function definition. There is no guarantee that the ! actually declares the #. We will have to check that later.7AgdaOnly 7s.7AgdaOnly 7s.7Agda1Termination measure is, for now, a variable name.7AgdaThe 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 instance modifiers have been distributed to the individual declarations. Observe the order of components:Range Fixity' Access IsAbstract IsInstance TerminationCheck PositivityCheckfurther attributes(Q)Namecontent (Expr, Declaration ...)7Agda: argument: We record whether a declaration was made in an abstract block. argument: Axioms and functions can be declared irrelevant. ( should be .)8AgdaAn uncategorized function clause, could be a function clause without type signature or a pattern lhs (e.g. for irrefutable let). The   is the actual  .8AgdaBlock of function clauses (we have seen the type signature before). The  s are the original declarations that were processed into this 8 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.8Agda(Nicifier warnings turned into errors in --safe mode.8AgdaRun a Nicifier computation, return result and warnings (in chronological order).8AgdaMain. Fixities (or more precisely syntax declarations) are needed when grouping function clauses.8Agda(Approximately) convert a 7 back to a list of  s.8AgdaHas the 7 a field of type ?8AgdaContents of a where& clause are abstract if the parent is.7777777777777777777777777777777777777777777777778788888888888888888888888878788888888888888888877777777777777777777777777777777777777777777787888878 None #$%-0235679>? !"#$888#" !$8None #$%-0235679>?8Agda e.g. x + 58Agdaa number or infinity8AgdaA solution assigns to each flexible variable a size expression which is either a constant or a v + n for a rigid variable v.8Agda"A matrix with row descriptions in b and column descriptions in c.8Agda6The Graph Monad, for constructing a graph iteratively.8AgdaScope for each flexible var.8AgdaNode labels to node numbers.8AgdaNode numbers to node labels.8AgdaNumber of nodes n.8AgdaThe edges (restrict to [0..n[).8Agda%A constraint is an edge in the graph.8AgdaFor  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.8Agda3Which rigid variables a flex may be instatiated to.8AgdaNodes of the graph are either - flexible variables (with identifiers drawn from Int*), - rigid variables (also identified by Intn2 to be at most k(. Also adds nodes if not yet present.8Agda sizeRigid r n. returns the size expression corresponding to r + n588888888888888888888888888888888888888888888888888888588888888888888888888888888888888888888888888888888888None #$%-/0235679>?9999999999None #$%-0235679>?a 9999999999 9999999999None #$%-0235679>?nnnnnnnnNone #$%-0235679>?E9AgdaThe version of Agda.99None #$%-0235679>?9Agda?Information about current git commit, generated at compile time9999None #$%-0235679>?~9AgdaThrows V exceptions, still collects 9s.9AgdaName of  libraries file9AgdaLine number in  libraries file.9Agda Library file9AgdaLibrary names are structured into the base name and a suffix of version numbers, e.g.  mylib-1.2.3". The version suffix is optional.9AgdaActual library name.9AgdaMajor version, minor version, subminor version, etc., all non-negative. Note: a priori, there is no reason why the version numbers should be Ints.9AgdaGet project root9Agda:Get dependencies and include paths for given project root: Look for  .agda-lib files according to n?. If none are found, use default dependencies (according to defaults/ file) and current directory (project root).9Agda9Parse the descriptions of the libraries Agda knows about.Returns none if there is no  libraries file.9Agda6Get all include pathes for a list of libraries to use.9AgdaGeneralized version of n for testing. findLib' 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" ] == []9AgdaSplit a library name into basename and a list of version numbers. versionView "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.)9AgdaPrint a  VersionView , inverse of  versionView (modulo leading zeros).9Agda Project root.AgdaUse defaults if no  .agda-lib file exists for this project?Agda The returned LibNames are all non-empty strings.9AgdaOverride the default  libraries file?Agda-Content of library files. (Might have empty LibNames.)9Agda 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.9999999999999999999999999999999999999999None #$%-/0235679>?V(9Agdaf :: Flag opts is an action on the option record that results from parsing an option. f opts produces either an error message or an updated options record9AgdaThe 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.9Agda%Options which can be set in a pragma.9AgdaCut off structural order comparison at some depth in termination checker?9Agda+irrelevant levels, irrelevant data matching9Agda(Allow definitions by copattern matching?9Agda0Is pattern matching allowed in the current file?9Agda2Perform the forcing analysis on data constructors?9Agda6Perform the projection-likeness analysis on functions?9Agda$Can rewrite rules be added and used?9Agda$Should system generated projections  ProjSystem0 be printed postfix (True) or prefix (False).9AgdaShould case splitting replace variables with dot patterns (False) or keep them as variables (True).9Agda:Should conversion checker use syntactic equality shortcut?9Agda1Should conversion checker compare sorts of types?9AgdaCount extended grapheme clusters rather than code points when generating LaTeX.9AgdaAutomatic compile-time inlining for simple definitions (unless marked NOINLINE).9Agda+Use the Agda abstract machine (fastReduce)?9Agda"Check confluence of rewrite rules?9Agda)Can we split on a (x :{flat} A) argument?9Agda-Use this (if Just) instead of .agda/libraries9AgdaUse ~.agdadefaults9Agdalook for .agda-lib files:Agda2In the absence of a path the project root is used.:AgdaShould the top-level module only be scope-checked, and not type-checked?:Agda(Use the compiler at PATH instead of ghc  js  etc.: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.:Agda-Checks that the given options are consistent.:Agda?qAgda+Polarity for equality and subtype checking.AgdaMaps top-level module names to the corresponding source file names.AgdaType checking monad.Agda4The type checking monad transformer. Adds readonly  and mutable .Agda;How much highlighting should be sent to the user interface?Agda6How should highlighting be sent to the user interface?Agda8For printing, we couple a meta with its name suggestion.AgdaType-checking errors.AgdaA non-fatal error is an error which does not prevent us from checking the document further and interacting with the user.:AgdaEmbedding a TCM computation.:AgdaInteraction monad.:Agda MonadTCState made into its own dedicated service class. This allows us to use n for n extensions of TCM.:Agda MonadTCEnv made into its own dedicated service class. This allows us to use n for n extensions of TCM.: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.:Agda?The first argument is the state in which the error was raised.:AgdaThe 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.:AgdaExpected a type to be an application of a particular datatype.:Agdaconstructor, datatype:AgdaDatatype, constructors.:Agdaconstructor, type:AgdaThe 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.:AgdaA function is applied to a hidden argument where a non-hidden was expected.:AgdaA function is applied to a hidden named argument it does not have. The list contains names of possible hidden arguments at this point.:Agda0Wrong user-given relevance annotation in lambda.:Agda/Wrong user-given quantity annotation in lambda.:Agda/Wrong user-given cohesion annotation in lambda.:AgdaThe given quantity does not correspond to the expected quantity.:AgdaFailed to apply injectivity to constructor of indexed datatype;Agda=Can't solve equation because variable occurs in (type of) lhs;Agda=Can't solve reflexive equation because --without-K is enabled;Agda?Can't solve equation because solution modality is less "usable";AgdaError when splitting a pattern variable into possible constructor patterns.;AgdaNeither data type nor record.;Agda&Data type, but in irrelevant position.;Agda8Data type, but in erased position. If the boolean is n, then the reason for the error is that the K rule is turned off.;AgdaSplit on codata not allowed. UNUSED, but keep! -- | NoRecordConstructor Type -- ^ record type, but no constructor;AgdaCopattern split with a catchall;Agda-We do not know the target type of the clause.;Agda!Target type is not a record type.;Agda Constructor.;AgdaContext for indices.;Agda,Inferred indices (from type of constructor).;Agda)Expected indices (from checking pattern).;Agda$Reason(s) why unification got stuck.<AgdaInformation about a mutual block which did not pass the termination checker.<AgdaThe functions which failed to check. (May not include automatically generated functions.)<AgdaThe problematic call sites.<AgdaInformation about a call.<AgdaTarget function name.<AgdaRange of the target function.<Agda+To be formatted representation of the call.<Agda"Range where the warning was raised<AgdaThe warning itself<AgdaThe warning printed in the state and environment where it was raised<Agda*Should the warning be affected by caching.<Agda4`UnreachableClauses f rs` means that the clauses in f' whose ranges are rs are unreachable<Agda!`CoverageIssue f pss` means that pss are not covered in f<AgdaDo not use directly with warning<AgdaDo not use directly with warning<AgdaDo not use directly with warning<AgdaIn `OldBuiltin old new`, the BUILTIN old has been replaced by new<AgdaIf the user wrote just {-# REWRITE #-}.<AgdaIf the user wrote something other than an unqualified name in the as clause of an import statement. The n$ gives optionally extra explanation.<AgdaIf a renaming import directive introduces a name or module name clash in the exported names of a module. (See issue #4154.)<AgdaIf the user opens a module public before the module header. (See issue #2377.)<AgdaAn instance was declared with an implicit argument, which means it will never actually be considered by instance search.<AgdaThe type of an instance argument doesn't end in a named or variable type, so it will never be considered by instance search.<AgdaAs InstanceWithExplicitArg, but for local bindings rather than top-level instances.<AgdaThe --inversion-max-depth was reached. Generic warnings for one-off things<Agda'Harmless generic warning (not an error)<AgdaGeneric error which doesn't abort proceedings (not a warning) Safe flag errors<AgdaUnsafe OPTIONS.<AgdaETA pragma is unsafe.<Agda)`DeprecationWarning old new version`: old is deprecated, use new( instead. This will be an error in Agda version.<AgdaUser-defined warning (e.g. to mention that a name is deprecated)<AgdaFixity of modules cannot be changed via renaming (since modules have no fixity).<AgdaSome imported names are not actually exported by the source module<AgdaImporting a file using an infective option into one which doesn't<AgdaImporting a file not using a coinfective option from one which does<AgdaConfluence checker found critical pair and equality checking resulted in a type error<AgdaConfluence checker got stuck on computing overlap between two rewrite rules<Agda&COMPILE directive for an erased symbol<Agda&Out of scope error we can recover from<AgdaA 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.<AgdaAdd implicit arguments in the end until type is no longer hidden -.<Agda!Do not append implicit arguments.<AgdaMakes  doExpandLast have no effect. Used to avoid implicit insertion of arguments to metavariables.<Agda6Abstract 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. n9 if we do not have a file (like in interactive mode see  CommandLine).<Agda4anonymous modules and their number of free variables<Agdato detect import cycles<Agda!the current (if any) mutual block<Agda/are we inside the scope of a termination pragma<Agda,are we inside the scope of a coverage pragma<Agdaare we inside a make-case (if so, ignore forcing analysis in unifier)<Agda>Are we currently in the process of solving active constraints?<AgdaHave 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.<Agda7 component: Are we checking an irrelevant argument? (= Irrelevant) Then top-level irrelevant declarations are enabled. Other value: Relevant*, then only relevant decls. are available.; component: Are we checking a runtime-irrelevant thing? (=<) Then runtime-irrelevant things are usable. Other value:  Quantity1, runtime relevant.  Quantity/ is not allowed here, see Bob Atkey, LiCS 2018.<Agda+Sometimes we want to disable display forms.<Agda8Interactive highlighting uses this range rather than <.<AgdaWhat is the current clause we are type-checking? Will be recorded in interaction points in this clause.<Agdawhat we're doing at the moment<AgdaSet to =+ when imported modules are type-checked.<AgdaThis 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.<AgdaWhen type-checking an alias f=e, we do not want to insert hidden arguments in the end, because these will become unsolved metas.<AgdaWe are reducing an application of this function. (For debugging of incomplete matches only.)<AgdaDid we encounter a simplification (proper match) during the current reduction process?<AgdaInjectivity can cause non-termination for unsolvable contraints (431, 3067). Keep a limit on the nesting depth of injectivity uses.<AgdaWhen True, the conversion checker will consider all term constructors as injective, including blocked function applications and metas. Warning: this should only be used when not assigning any metas (e.g. when envAssignMetas is False or when running pureEqualTerms.) or else we get non-unique meta solutions.<AgdaWhen True, 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.<AgdaUntil 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.<AgdaCheckpoints track the evolution of the context as we go under binders or refine it by pattern matching.<AgdaKeeps the substitution from each previous checkpoint to the current context.<Agda"Should new metas generalized over.<Agda(Values for used generalizable variables.<AgdaDo we check that options in imported files are consistent with each other?=AgdaIs some backend active at the moment, and if yes, which? NB: we only store the  here, otherwise instance Data TCEnv is not derivable. The actual backend can be obtained from the name via A.=Agda Via stdout.=AgdaBoth via files and via stdout.=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 (Nothing). 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 x, 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 instances=Agda*Interaction command: show module contents.=Agdaused by setCurrentRange=Agda Primitives=Agda 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.=AgdaAllow  allReductions in types, even if not allowed at term level (used by confluence checker)=Agda9Functions whose termination has not (yet) been confirmed.=Agda0Functions that have failed termination checking.=AgdaThree cases: 1. not reduced, 2. reduced, but blocked, 3. reduced, not blocked.=AgdaDid 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=AgdaData or record type signature that doesn't yet have a definition=Agda&Generalizable variable (introduced in  generalize block)=Agda Returned by  getConstInfo if definition is abstract.=AgdaPrimitive or builtin functions.=Agdan* while function is still type-checked. Just cc after type and coverage checking and translation to case trees.=AgdaThe split tree constructed by the coverage checker. Needed to re-compile the clauses after forcing translation.=Agda2Intermediate representation for compiler backends.=AgdaCovering clauses computed by coverage checking. Erased by (IApply) confluence checking(?)=AgdaMutually recursive functions, datas and records. 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?=AgdaIs 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>AgdaIs this a generated with-function? If yes, then what's the name of the parent function.>AgdaNumber of parameters.>AgdaNumber of indices.>Agda(This might be in an instantiated module.>AgdaConstructor names , ordered according to the order of their definition.>AgdaMutually recursive functions, datas and records. Does include this data type. Empty if not recursive. Nothing- if not yet computed (by positivity checker).>Agda+Path constructor names (subset of dataCons)>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?>AgdaThe record field names.>AgdaThe record field telescope. (Includes record parameters.) Note: $TelV recTel _ == telView' recConType . Thus, recTel is redundant.>AgdaMutually recursive functions, datas and record>s. Does include this record. Empty if not recursive. Nothing- if not yet computed (by positivity checker).>Agda#Eta-expand at this record type? False for unguarded recursive records and coinductive records unless the user specifies otherwise.>Agda or *? Matters only for recursive records. n means that the user did not specify it, which is an error for recursive records.>AgdaNumber of parameters.>Agda+Number of arguments (excluding parameters).>AgdaName of (original) constructor and fields. (This might be in a module instance.)>Agda Name of datatype or record type.>AgdaInductive or coinductive?>AgdaCubical composition.>Agda Projections. n if not yet computed.>AgdaWhich arguments are forced (i.e. determined by the type of the constructor)? Either this list is empty (if the forcing analysis isn't run), or its length is conArity.>AgdaWhich arguments are erased at runtime (computed during compilation to treeless)? n means erased, n means retained. n if no erasure analysis has been performed yet. The length of the list is conArity.>Agda for primitive functions, not null for builtin functions.>AgdaBuiltin functions can have inverses. For instance, natural number addition.>Agdan for primitive functions, n something for builtin functions.>AgdaAgda9Should calls to this function be inlined by the compiler?>AgdaIs this function a macro?>Agda(Should a record type admit eta-equality?>Agda2User specifed 'eta-equality' or 'no-eta-equality'.>Agda0Positivity checker inferred whether eta is safe.>AgdaAbstractions to build projection function (dropping parameters).>Agda&Additional information for projection =s.>AgdaNothing 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.>AgdaThe original projection name (current name could be from module application).>Agda-Type projected from. Original record type if projProper = Just{}. Also stores ArgInfo of the principal argument. This field is unchanged by module application.>AgdaIndex 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.>AgdaTerm 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 >.) In case of a projection-like function, just the function symbol is returned as -: t = pars -> f.>Agda,Additional information for extended lambdas.>AgdaFor 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.>AgdaAn alternative representation of partial elements in a telescope:  E  . [A uA, ... , A uA] :  C PartialP (D_: :) T see cubicaltt paper (however we do not store the type T).>Agda4the telescope , binding vars for the clauses,  E >Agda?a system [A uA, ... , A uA] where ,  E : and , , : E u:>Agda;The backends are responsible for parsing their own pragmas.>AgdaInformation about whether an argument is forced by the type of a function.>Agdamonotone>Agdaantitone>Agdano information (mixed variance)>Agdaconstant>Agda5When lambda-lifting new args are generalizable if >, also when the number is zero.>AgdaHiding should not be used.>Agda-The canonical name, used e.g. in compilation.>AgdaType of the lifted definition.>AgdaVariance information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.>AgdaPositivity information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.>Agda)How many arguments should be generalised.>AgdaGives the name of the (bound variable) parameter for named generalized parameters. This is needed to bring it into scope when type checking the data/record definition corresponding to a type with generalized parameters.>AgdaJust q/ when this definition is an instance of class q>Agda:Has this function been created by a module instantiation?>AgdaThe set of symbols with rewrite rules that match against this symbol>Agda8should compilers skip this? Used for e.g. cubical's comp>AgdaShould the def be treated as injective by the pattern matching unifier?>Agda)Is this a function defined by copatterns?>AgdaWhat blocking tag to use when we cannot reduce this def? Used when checking a function definition is blocked on a meta in the type.>Agda?Rewrite rules can be added independently from function clauses.>AgdaName of rewrite rule q :  C f ps D rhs where D is the rewrite relation.>Agda.>Agdaf.>Agda  E f ps : t.>Agda  E rhs : t.>Agda E t.>Agda1Non-linear (non-constructor) first-order pattern.>AgdaMatches anything (modulo non-linearity) that only contains bound variables that occur in the given arguments.>AgdaMatches f es>AgdaMatches  x C t>AgdaMatches  (x : A) C B>Agda"Matches a sort of the given shape.>AgdaMatches x es# where x is a lambda-bound variable>Agda'Matches the term modulo  (ideally ).>AgdaA structured presentation of a - for reification into .?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 es (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 . 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 type of the function?AgdaModule parameter substitution?AgdaThe original AST clause.?Agda&Environment for rechecking the clause.?Agda The boundary imposed by the LHS.?AgdaDatatype representing a single boundary condition: x_0 = u_0, ... ,x_n = u_n E t = ?n es?Agda x_0 = u_0, ... ,x_n = u_n?Agda t?Agda ?n es?AgdaIs ?n overapplied in ?n es ??AgdaFlag to indicate whether the meta is overapplied in the constraint. A meta is overapplied if it has more arguments than the size of the telescope in its creation environment (as stored in MetaInfo).?Agda/Data structure managing the interaction points.We 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??AgdaThe clause of the interaction point (if any). Used for case splitting.?AgdaName 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.?AgdaShould this meta be generalized if unsolved? If so, at what ArgInfo??AgdaMeta 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 : tA) C e) : t This is not an instance of ? as the domain type has already been checked. For example, when checking '( (x y : Fin _) C e) : (x : Fin n) C ? we want to postpone ( (y : Fin n) C e) : ? where Fin n is a - rather than an 4.?Agda,Quote the given term and check type against -?Agda Solving a ? 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)?Agdaunsolved?Agda+open, to be instantiated by instance search?Agda(solution blocked by unsolved constraints?AgdaFrozen 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 instantiated?Agdaa metavariable doesn't have to depend on all variables in the context, this "permutation" will throw away the ones it does not depend on?Agdameta variables scheduled for eta-expansion but blocked by this one?Agdaare we past the point where we can instantiate this meta variable??AgdaJust m$ means this meta will be equated to m# when the latter is unblocked. See blockedTermOnProblem.?AgdaThe value of a generalizable variable. This is created to be a generalizable meta before checking the type to be generalized.?AgdaParametrized since it is used without MetaId when creating a new meta.?Agdaare we checking (CmpLeq) or inferring (CmpEq ) the type??Agda-A thing tagged with the context it came from.?AgdaWe can either compare two terms at a given type, or compare two types without knowing (or caring about) their sorts.?AgdaType should not be Size5. But currently, we do not rely on this invariant.?Agda Replaces AsTermsOf Size.?AgdaAn extension of  to >=.@Agda,the two types are for the error message only@Agda+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)@AgdaFirst argument is computation and the others are hole and goal type@AgdaHash of the source code.@AgdaThe source code. The source code is stored so that the HTML and LaTeX backends can generate their output without having to re-read the (possibly out of date) source code.@Agda4Source file type, determined from the file extension@Agda"Imported modules and their hashes.@AgdaModule name of this interface.@AgdaScope defined by this module.Andreas, 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  and .@Agda-Display forms added for imported identifiers.@Agda&User warnings for imported identifiers@Agda8Whether this module should raise a warning when imported@AgdaPragma options set in the file.@AgdaOptions/features used when checking the file (can be different from options set directly in the file).@Agdan if warnings were encountered when the module was type checked.@Agdan if the module is a primitive module, which should always be importable.@AgdaA monad that has read and write access to the stConcreteNames part of the TCState. Basically, this is a synonym for `MonadState ConcreteNames m` (which cannot be used directly because of the limitations of Haskell's typeclass system).@AgdaMaps 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.@@@*, for declarations and nested modules@, leaving the main module.@AgdaNever a Section or ScopeDecl@AgdaLike @, 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.@AgdaA part of the state which is not reverted when an error is thrown or the state is reset.@AgdaCallback function to call when there is a response to give to the interactive frontend. See the documentation of &.@AgdaStructure to track how much CPU time was spent on which Agda phase. Needs to be a strict field to avoid space leaks!@AgdaShould be strict field.@AgdaCached 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.@AgdaHighlighting info.@AgdaDisambiguation carried out by the type checker. Maps position of first name character to disambiguated  for each $ already passed by the type checker.@AgdaDirty when a constraint is added, used to prevent pointer update. Currently unused.@AgdaDefinitions 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.@AgdaDeclared identifiers of the current file. These will be serialized after successful type checking.@AgdaFor each module remember the checkpoint corresponding to the orignal context of the module parameters.@Agda-Display forms we add for imported identifiers@AgdaThe current module is available after it has been type checked.@AgdaMap keeping track of concrete names assigned to each abstract name (can be more than one name in case the first one is shadowed)@AgdaMap keeping track for each name root (= name w/o numeric suffixes) what names with the same root have been used during a TC computation. This information is used to build the ShadowingNames map.@AgdaMap keeping track for each (abstract) name the list of all (raw) names that it could maybe be shadowed by.@AgdaCounters to collect various statistics about meta variables etc. Only for current file.@AgdaShould we instantiate away blocking metas? This can produce ill-typed terms but they are often more readable. See issue #3606. Best set to True only for calls to pretty*/reify to limit unwanted reductions.AAgda/Local partial definitions, to be stored in the  InterfaceAAgdaHighlighting info for tokens (but not those tokens for which highlighting exists in A).AAgda?Imported declared identifiers. Those most not be serialized!AAgda2Pattern synonyms of the current file. Serialized.AAgda3Imported pattern synonyms. Must not be serialized!AAgdaCollected generalizable variables; used during scope checking of termsAAgda&Options applying to the current file. OPTIONS! pragmas only affect this field.AAgda;Display forms added by someone else to imported identifiersAAgda{-# FOREIGN #-} code that should be included in the compiled output. Does not include code for imported modules.AAgda Imported  UserWarnings, not to be stored in the  InterfaceAAgdaLocally defined  UserWarnings, to be stored in the  InterfaceAAgda=Whether the current module should raise a warning when openedAAgda6Imported partial definitions, not to be stored in the  InterfaceAAgda/The state which is frozen after scope checking.AAgda1The state which is modified after scope checking.AAgda'State which is forever, like a diamond.AAgdaEmpty persistent state.AAgdaEmpty state of type checker.AAgda Creates a @ map based on A. O(n log n).For a single reverse lookup in A, rather use lookupModuleFromSourse.AAgda Lookup an   in A.O(n).AAgdaCombines the source hash and the (full) hashes of the imported modules.AAgdaEmbed  into ?.AAgda!Flip the direction of comparison.AAgdaTurn a  function into a ? function. Property:  dirToCmp f (fromCmp cmp) = f cmpAAgda$By default, we have no display form.AAgda+Create a definition with sensible defaults.AAgda>Building the projection function (which drops the parameters).AAgda,The info of the principal (record) argument.BAgda3Make sure we do not overwrite a user specification.BAgdaIs the record type recursive?BAgdaA template for creating =% definitions, with sensible defaults.BAgdaChecking whether we are dealing with a function yet to be defined.BAgdaConceptually: 2redBind m f k = either (return . Left . f) k =<< mBAgda:Not quite all reductions (skip non-terminating reductions)BAgda+Are the clauses of this definition delayed?BAgda2Has the definition failed the termination checker?BAgdaHas the definition not termination checked or did the check fail?BAgda&ifTopLevelAndHighlightingLevelIs l b m runs m when we're type-checking the top-level module and either the highlighting level is at least l or b is n.BAgda$ifTopLevelAndHighlightingLevelIs l m runs m when we're type-checking the top-level module and the highlighting level is at least l.BAgdaGets the include directories.Precondition: 9 must be nonempty (i.e. setCommandLineOptions must have run).BAgda&Modify the lens-indicated part of the TCEnv in a subcomputation.BAgda A variant of :6 in which the computation is strict in the new state.BAgdaOverwrite the part of the  focused on by the lens.BAgdaModify the part of the  focused on by the lens.BAgda'Modify a part of the state monadically.BAgdaModify the part of the 0 focused on by the lens, and return some result.BAgda?Modify a part of the state monadically, and return some result.BAgda.Preserve the state of the failing computation.BAgdaExecute 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.CAgda4Running the type checking monad (most general form).CAgdaRunning the type checking monad on toplevel (with initial state).CAgdaC runs a safe  action (a 9 action which cannot fail) in the initial environment.CAgda6Runs the given computation in a separate thread, with a copy' of the current state and environment.Note 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.CAgda$Base name for patterns in telescopesCAgda&Base name for extended lambda patternsCAgda>>>??AAAA<=<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=====???<<<<<::::::<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=============================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=============>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@??@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@A@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA@@A@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA@@@A@@@@AAAA@@@AA@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@A@@@@@@@@@A@@@@@?@@@@@@@@@@@@@??@??????AAA?????????????????????????????????????????????????????????????????????AAAAAAAAAAA????????????????????????????????AAA???????AA??????>?????A>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>AA>>>>>>>>>AA>A>>>>>>>>>A>>>>>>>>>>AA>>>>B>>>>>>>>B==========>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=============BBBBBBBBBBBBBB========BB=========BB===========BB=======BBBBBBBBBBB=====================================================================BB<=<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<?'EAgdaicodeArgs proxy (a1, ..., an) maps icode over a1, ..., an* and returns the corresponding list of Int32.FAgdaMonad used by the decoder.TCM is not used because the associated overheads would make decoding slower.FAgdaMonad used by the encoder.FAgdaState of the decoder.FAgdaObtained from interface file.FAgdaObtained from interface file.FAgdaObtained from interface file.FAgdaObtained from interface file.FAgdaObtained from interface file.FAgdaCreated and modified by decoder. Used to introduce sharing while deserializing objects.FAgda?ؘFAgdaAssumes that the first module in the import path is the module we are worried about.FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNone #$%-0235679>?hFAgda+Get the name of the current module, if any.FAgda#Set the name of the current module.FAgda*Get the path of the currently checked fileFAgda7Get the number of variables bound by anonymous modules.FAgda+Add variables bound by an anonymous module.FAgda(Set the current environment to the givenFAgdaGet the current environmentFAgdaIncreases the module nesting level by one in the given computation.FAgdaSet highlighting levelFAgdaRestore setting for < to default.FAgdaIf the reduced did a proper match (constructor or literal pattern), then record this as simplification step.GAgda Lens for =.GAgdaReduce Def f vs only if f is a projection.GAgdaAllow all reductions except for non-terminating functions (default).GAgda9Allow all reductions including non-terminating functions.GAgda(Allow all reductions when reducing typesGAgda/Update allowed reductions when working on typesGAgda?fGAgda?Debug print some lines if the verbosity level for the given : is at least :.Note: In the presence of OverloadedStrings , just @( traceS key level "Literate string"  gives an Ambiguous type variable error in  GHC@. Use the legacy functions G and G instead then.GAgda?Debug print some lines if the verbosity level for the given : is at least :.Note: In the presence of OverloadedStrings , just @) reportS key level "Literate string"  gives an Ambiguous type variable error in  GHC@. Use the legacy functions G and G instead then.GAgda=Print brackets around debug messages issued by a computation.GAgda/During printing, catch internal errors of kind  and print them.GAgda#Conditionally println debug string.GAgdaConditionally render debug V and print it.GAgda(Debug print the result of a computation.GAgdaConditionally render debug V, print it, and then continue.GAgda5Check whether a certain verbosity level is activated.-Precondition: The level must be non-negative.GAgdaCheck whether a certain verbosity level is activated (exact match).GAgdaRun a computation if a certain verbosity level is activated (exact match).GAgda?GAgdaGet the statistics.GAgda)Modify the statistics via given function.GAgdaIncrease specified counter by 1.GAgdaIncrease specified counter by n.GAgdaSet the specified counter to the maximum of its current value and n.GAgdaPrint the given statistics if verbosity "profile.ticks" is given.GGGGGGGGGGGGGGGGNone #$%-0235679>?GAgda/To be called before any write or restore calls.GAgda Writes a @( to the current log, using the current @GAgdaRuns the action and restores the current cache at the end of it.GAgdaRuns the action without cache and restores the current cache at the end of it.GAgda>Reads the next entry in the cached type check log, if present.GAgdaEmpties the "to read" CachedState. To be used when it gets invalid.GAgdaMakes sure that the A is n(, with a clean current log. Crashes is A is already active with a dirty log. Should be called when we start typechecking the current file.GAgdaCaches the current type check log. Discardes the old cache. Does nothing if caching is inactive. GGGGGGGGGG GGGGGGGGGGNone #$%-0235679>?.GAgdaWhen verbosity is set or changes, we need to turn benchmarking on or off.GAgdaPrints the accumulated benchmark results. Does nothing if profiling is not activated at level 2.7 $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$GG G GNone #$%-0235679>?HHHHHHHHNone #$%-0235679>?HAgda8Assorted warnings and errors to be displayed to the userHAgdaClassifying warnings: some are benign, others are (non-fatal) errorsHAgda(warnings that will be turned into errorsHAgdaall warnings, including errors and benign ones Note: order of constructors is important for the derived Ord instanceHAgdaRender the warningHAgda;The only way to construct a empty WarningsAndNonFatalErrorsHAgdarunning the Parse monadHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHNone #$%-0235679>? HAgdaMark a definition to be inlined if it satisfies the inlining criterion.HHNone #$%-0235679>?jHAgda9Errors which can arise when trying to find a source file."Invariant: All paths are absolute.HAgdaThe file was not found. It should have had one of the given file names.HAgda"Several matching files were found.Invariant: The list of matching files has at least two elements.HAgdaType aliases for source files and interface files. We may only produce one of these if we know for sure that the file does exist. We can always output an  AbsolutePath if we are not sure.HAgdaMakes an interface file from an AbsolutePath candidate. If the file does not exist, then fail by returning Nothing.HAgdaConverts an Agda file name to the corresponding interface file name. Note that we do not guarantee that the file exists.HAgdaGiven the module name which the error applies to this function converts a H to a :.HAgdaFinds 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.HAgdaTries to find the source file corresponding to a given top-level module name. The returned paths are absolute.SIDE EFFECT: Updates A.HAgda A variant of H which does not require .HAgdaFinds the interface file corresponding to a given top-level module file. The returned paths are absolute.Raises n+ if the the interface file cannot be found.HAgdaFinds the interface file corresponding to a given top-level module file. The returned paths are absolute.Raises an error if the source file cannot be found, and returns n= if the source file can be found but not the interface file.HAgdaEnsures 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.HAgdaComputes the module name of the top-level module in the given file.If no top-level module name is given, then an attempt is made to use the file name as a module name.HAgda$Path to the candidate interface fileAgdaInterface file iff it existsHAgdaInclude paths.AgdaCached invocations of H. An updated copy is returned.HAgdaPath to the source fileAgda Maybe path to the interface fileHAgdaThe name of the module.Agda"The file from which it was loaded.Agda3The expected name, coming from an import statement.HAgdaThe path to the file.AgdaThe parsed module.HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHNone #$%-0235679>?lHAgda*Ranges that should be serialised properly.IAgda"Ranges are always deserialised as  .HHHHHHNone #$%-0235679>?None #$%-0235679>?IIIIIIIINone #$%-0235679>?j1IAgda A subset of I.IAgda8Ignore additional checks, like termination/positivity...IAgdaDon't ignore any checks.JAgdaAvailable backends.JAgdaThe J monad. n! state holds the remaining input.JAgda?&AgdaCallback 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 n representation and print it on standard output (suitable for inter-process communication).Put the response into a mutable variable stored in the closure of the &< function. (suitable for intra-process communication).&AgdaStatus information.&AgdaGive action result"Comment derived from agda2-mode.elIf &2 is 'Give_String s', then the goal is replaced by s, and otherwise the text inside the goal is retained (parenthesised if & is J).&AgdaShould token-based highlighting be removed in conjunction with the application of new highlighting (in order to reduce the risk of flicker)?&Agda4Info to display at the end of an interactive command&Agda,There are two kinds of "make case" commands.&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$Response is list of printed clauses.&Agda(Solution for one or more meta-variables.&Agda)The integer is the message's debug level.&Agda%Clear highlighting of the given kind.&AgdaA command sent when an abort command has completed successfully.&Agda>A command sent when an exit command is about to be completed.&Agda The default & function prints certain things to stdout (other things generate internal errors).JAgda!Are implicit arguments displayed?JAgda.Has the module been successfully type checked?JAgdaEntry in context.JAgdaThe original concrete name.JAgda&The name reified from abstract syntax.JAgda The type.JAgda)The value (if it is a let-bound variable)JAgda Whether the J is in scope.JAgda/Auxiliary information that comes with Goal TypeJAgda Errors that goes into Info_ErrorWhen an error message is displayed this constructor should be used, if appropriate.KAgdaGoals & WarningsKAgdaWhen an error message is displayed this constructor should be used, if appropriate.KAgdaK, denotes either an error or a success (when &< is present) TODO: split these into separate constructorsKAgda7Yes, remove all token-based highlighting from the file.KAgdaNo.&&JJJ&JJJ&KK&KKKKKKKKKKKKKKKK&KK&&&&&&&&&&&&&&&HJJJJJJJJJJJJKKKKKKKKKKK&&&&&&&&&&&&&&&KK&KK&KKKKKKKKKKKKKKKKKKKKKKKHJKKKKJJJJJJJJJJJ&JJJ&JJJ&&None #$%-0235679>?)t"KAgda:Resets the non-persistent part of the type checking state.KAgda&Resets all of the type checking state. Keep only $ and backend information.KAgdaRestore ! after performing subcomputation.In contrast to , the $* info from the subcomputation is saved.KAgdaSame as K but also returns the state in which we were just before reverting it.KAgdaSame as K but keep all warnings.KAgda:Allow rolling back the state changes of a TCM computation.KAgdaA fresh TCM instance.The 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.)KAgda Lens for @.KAgdaGet the current scope.KAgdaSet the current scope.KAgda;Modify the current scope without updating the inverse maps.KAgdaModify the current scope.KAgda Get a part of the current scope.KAgda&Run a computation in a modified scope.KAgda#Run a computation in a local scope.KAgdaSame as K-, but discard the scope from the computation.KAgda2Discard any changes to the scope by a computation.KAgda Scope error.KAgdaDebug print the scope.KAgdaUpdate 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.KAgdaRun some computation in a different signature, restore original signature.KAgdaSet the top-level module. This affects the global module id of freshly generated names.KAgdaUse a different top-level module for a computation. Used when generating names for imported modules.KAgda Lens for A.KAgda,Get both local and imported pattern synonymsKAgdaLens getter for $ from .KAgda Lens map for $.KAgdaLens getter for $ from .KAgdaLens modify for $.KAgda>Look through the signature and reconstruct the instance table.KAgda Lens for A.KAgda4Remove all instances whose type is still unresolved.KAgda/Add an instance whose type is still unresolved.KAgdaAdd instance to some `class'.KAgdaName of the instance.AgdaName of the class.KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKNone #$%-0235679>?/,KAgdaReset <' to previous value in the continuation.Caveat: if the last K did not set an K, for example, only set the   with  /, we will revert to the last interesting call.KAgda$Record a function call in the trace.KAgdaSets 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  ).KAgdahighlightAsTypeChecked rPre r m runs m 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.KAgda5Lispify and print the given highlighting information.KAgda rPreAgda r KKKKKKKKK KKKKKKKKKNone #$%-0235679>?1oKAgdaPass the current mutual block id or create a new mutual block if we are not already inside on.KAgdaSet the mutual block info for a block, possibly overwriting the existing one.KAgda6Set the mutual block info for a block if non-existing.KAgda&Set the mutual block for a definition.KAgdaGet the current mutual block, if any, otherwise a fresh mutual block is returned.KAgda0Reverse lookup of a mutual block id for a names.KKKKKKKKKKKKKKKKNone #$%-0235679>?1KKKKKKNone #$%-0235679>?5 KAgdaMonad service class containing methods for adding and solving constraintsKAgda#Unconditionally add the constraint.LAgda#Add constraint as awake constraint.LAgda`catchPatternErr handle m` runs m, handling pattern violations with handle (doesn't roll back the state)LAgdaSolve awake constraints matching the predicate. If the second argument is True solve constraints even if already L.LAgdaGet the awake constraintsLAgdaTakes out all constraints matching given filter. Danger! The taken constraints need to be solved or put back at some point.LAgdaSuspend 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.LAgdaAdd new a constraintLAgdaStart solving constraintsLAgda7Add constraint if the action raises a pattern violation&KLLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLL&LLLLLLLLLLLLLLLLLLLLKLLLLLLLLKLLLLLLLLNone #$%-0235679>?HA(LAgdaA finite map for  ImportedNames.LAgdaBool: 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.LAgdaTo simplify interaction between scope checking and type checking (in particular when chasing imports), we use the same monad.LAgda-Create a new module with an empty scope. (Just' if it is a datatype or record module.)LAgda"Apply a function to the scope map.LAgda$Apply a function to the given scope.LAgda*Apply a monadic function to the top scope.LAgda&Apply a function to the current scope.LAgda5Apply a function to the public or private name space.LAgda7Run a computation without changing the local variables.LAgdaRun a computation outside some number of local variables and add them back afterwards. This lets you bind variables in the middle of the context and is used when binding generalizable variables (#3735).LAgda6Check that the newly added variable have unique names.LAgdaAfter collecting some variable names in the scopeVarsToBind, bind them all simultaneously.LAgda2Create a fresh abstract name from a concrete name.This function is used when we translate a concrete name in a binder. The  ) of the concrete name is saved as the  of the abstract name.LAgda 0freshAbstractName_ = freshAbstractName noFixity'LAgda'Create a fresh abstract qualified name.LAgda0Create a concrete name that is not yet in scope.LAgda?Look up the abstract name referred to by a given concrete name.LAgdaLook 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.)LAgdaLook up a module in the scope.LAgda'Get the fixity of a not yet bound name.LAgda+Get the polarities of a not yet bound name.LAgdaCollect the fixity/syntax declarations and polarity pragmas from the list of declarations and store them in the scope.LAgda?Get the notation of a name. The name is assumed to be in scope.LAgdaBind a variable.LAgda;Temporarily unbind a variable. Used for non-recursive lets.LAgda.Bind a defined name. Must not shadow anything.LAgdaRebind a name. Use with care! Ulf, 2014-06-29: Currently used to rebind the name defined by an unquoteDecl, which is a ' in the body, but a ' later on.LAgdaBind a module name.LAgdaBind a qualified module name. Adds it to the imports field of the scope.LAgda Clear the scope of any no names.LAgdaCreate 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.LAgda*Warn about useless fixity declarations in renaming directives.LAgdaApply an import directive and check that all the names mentioned actually exist.LAgdaTranslation of ImportDirective.LAgda Create a L.LAgdaApply a L.LAgdaTranslation of Renaming.LAgdaOpen a module.LAgda>Open a module, possibly given an already resolved module name.LAgdaOld local scopeAgdaNew local scopeLAgda(Restrict search to these kinds of names.AgdaUnless n., restrict search to match any of these names.AgdaName to be resolvedAgda?JLAgdaParses a left-hand side, and makes sure that it defined the expected name.LAgdaParses a pattern.LAgda0Parse a list of expressions into an application.LAgdaParse an expression into a module application (an identifier plus a list of arguments).LLLLLLLLLLNone #$%-0235679>?KMAgdaThese builtins may use postulates, and are still considered --safeMAgdaThese builtins may not use postulates under --safe. They are not automatically unsafe, but will be if they use an unsafe feature.0LMLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM0MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMLMLLMMNone #$%-0235679>?S MAgdaSets the pragma options.MAgdaSets 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 n now, and were previously n something>), then the state is reset (completely, see setIncludeDirs) ./An empty list of relative include directories (n []) is interpreted as ["."].MAgdaDisable display forms.MAgdaDisable display forms.MAgda#Check if display forms are enabled.MAgdaMakes the given directories absolute and stores them as include directories.If the include directories change, then the state is reset (completely, except for the include directories and @). An empty list is interpreted as ["."].MAgdaShould only be run if M.MAgda Return the 9 as   , if any.MAgdaSwitch on printing of implicit and irrelevant arguments. E.g. for reification in with-function generation. Restores all 9> after completion. Thus, do not attempt to make persistent 9 changes in a M bracket.MAgdaChange 9* for a computation and restore afterwards.MAgda%The base directory of relative paths.MAgda%The base directory of relative paths.MAgda%The base directory of relative paths.MAgdaNew include directories.Agda%The base directory of relative paths.MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNone #$%-0235679>?b>MAgdaPerforms void (noAbs) abstraction over telescope.MAgdaApply Elims while using the given function to report ill-typed redexes. Recursive calls for applyE and  applySubst happen at type t/ to propagate the same strategy to subtrees.MAgdaIf $v$ is a record value, canProject f v returns its field f.MAgdaEliminate a constructed term.MAgdadefApp 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)Precondition: The type must contain the right number of pis without having to perform any reduction.piApply$ is potentially unsafe, the monadic piApplyM is preferable.MAgdaIf permute  : [a] -> [a], then ,applySubst (renaming _ ) : Term  -> Term MAgdaIf permute  : [a] -> [a], then +applySubst (renamingR ) : Term  -> Term MAgdaThe permutation should permute the corresponding context. (right-to-left list)MAgda  projDropParsApply proj o args = A proj o `1` argsThis function is an optimization, saving us from construction lambdas we immediately remove through application.MAgdaTakes off all exposed function domains from the given type. This means that it does not reduce to expose Pi-types.MAgdatelView'UpTo n t takes off the first n exposed function types of t#. Takes off all (exposed ones) if n < 0.MAgdaTurn a typed binding (x1 .. xn : A) into a telescope.MAgdaTurn a typed binding (x1 .. xn : A) into a telescope.MAgda )mkPi dom t = telePi (telFromList [dom]) tNAgda)Uses free variable analysis to introduce - bindings.NAgdaEverything will be an -.NAgdaOnly abstract the visible components of the telescope, and all that bind variables. Everything will be an -! Caution: quadratic time!NAgdaAbstract over a telescope in a term, producing lambdas. Dumb abstraction: Always produces -, never -.$The implementation is sound because - does not use -.NAgdaGiven arguments vs : tel= (vector typing), extract their individual types. Returns Nothing is tel is not long enough.NAgdaIn compiled clauses, the variables in the clause body are relative to the pattern variables (including dot patterns) instead of the clause telescope.NAgdaunivSort' univInf s gets the next higher sort of s), if it is known (i.e. it is not just  UnivSort s). univInf is returned as the sort of Inf.Precondition: s is reducedNAgdaCompute the sort of a function type from the sorts of its domain and codomain.NAgdaCompute the sort of a pi type from the sorts of its domain and codomain.NAgdaGiven two levels a and b , compute a E b" and return its canonical form.NAgdaEquality of binders relies on weakening which is a special case of renaming which is a special case of substitution.NAgda Syntactic - equality, ignores stuff below DontCare and sharing.NAgda Syntactic -$ equality, ignores sort annotations.NAgdatel E ( E lhs C rhs : t) becomes tel,  E lhs C rhs : t) we do not need to change lhs, rhs, and t since they live in . See 'Abstract Clause'.NAgda)Make sure we only drop variable patterns.,,,,,,,,////111111111111111111111111111111111111111MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNN>MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNN,,,,,,,,None #$%-0235679>?e.OAgda+Create an open term in the current context.OAgdaExtract the value from an open term. The checkpoint at which it was created must be in scope.OAgda-Extract the value from an open term. Returns n> if the checkpoint at which it was created is not in scope.OAgdaAn ?" is closed if it has checkpoint 0.OOOOOOOONone #$%-0235679>?qQGAgdaaddCtx x arg cont add a variable to the context.Chooses an unused .7Warning: Does not update module parameter substitution!GAgda'Add a let bound variable to the contextGAgdaUpdate the context. Requires a substitution that transports things living in the old context to the new.GAgdaGet the substitution from the context at a given checkpoint to the current context.OAgdaWrapper to tell O not to mark names as ;. Used when adding a user-provided, but already type checked, telescope to the context.OAgdaVarious specializations of addCtx.OAgda Modify a < in a computation. Warning: does not update the checkpoints. Use  updateContext instead.OAgda Modify the - part of context entries.OAgda7Change to top (=empty) context. Resets the checkpoints.OAgdaChange to top (=empty) context, but don't update the checkpoints. Totally not safe!OAgdaDelete the last n bindings from the context. Doesn't update checkpoints! Use O or `updateContext rho (drop n)` instead, for an appropriate substitution rho.OAgdaDelete the last n bindings from the context. Any occurrences of these variables are replaced with the given err.OAgda*Add a new checkpoint. Do not use directly!OAgdaGet the substitution from the context at a given checkpoint to the current context.OAgdaGet substitution   E  : m where  is the current context and m- is the module parameter telescope of module m.Returns Nothing, in case the we don't have a checkpoint for m.OAgda:Default implementation of addCtx in terms of updateContextOAgdaRun the given TCM action, and register the given variable as being shadowed by all the names with the same root that are added to the context during this TCM action.OAgda;Go under an abstraction. Do not extend context in case of -.OAgda"Go under an abstraction, treating - as -.OAgdaGo under an abstract without worrying about the type to add to the context.OAgdaMap a monadic function on the thing under the abstraction, adding the abstracted variable to the context.OAgdaAdd a let bound variableOAgdaAdd a let bound variableOAgdaGet the current context.OAgda$Get the size of the current context.OAgda Generate [var (n - 1), ..., var 0]% for all declarations in the context.OAgda Generate [var (n - 1), ..., var 0]% for all declarations in the context.OAgdaGet the current context as a -.OAgda1Get the names of all declarations in the context.OAgda0get type of bound variable (i.e. deBruijn index)OAgdaGet 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..GGGGGGOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO.OOOOOOOGOOGGGGGOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONone #$%-0235679>?u OAgdaThe coinductive primitives.OAgdagetTerm use name looks up name as a primitive or builtin, and throws an error otherwise. The use argument describes how the name is used for the sake of the error message.OAgda2Rewrite a literal to constructor form if possible.QAgdaTries to build a O.QAgdaCheck whether the type is actually an path (lhs D rhs) and extract lhs, rhs, and their type.Precondition: type is reduced.QAgdaNon dependent PathQAgda Revert the ,.Postcondition: type is reduced.QAgda"Get the name of the equality type.QAgdaCheck whether the type is actually an equality (lhs D rhs) and extract lhs, rhs, and their type.Precondition: type is reduced.QAgda Revert the ,.Postcondition: type is reduced.QAgda(Primitives with typechecking constrants.hijklmnopqrstuvwxyz{|}~GGOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQGGOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQNone #$%-0235679>?.QAgdaA deep view on sizes.QAgdaA useful view on sizes.QAgdaCheck if a type is the P type. The argument should be reduced.QAgda)Result of querying whether size variable i is bounded by another size.QAgdayes  i : Size< tQAgdaTest whether OPTIONS --sized-types and whether the size built-ins are defined.QAgda+Test whether the SIZELT builtin is defined.QAgda$Add polarity info to a SIZE builtin.QAgdaThe sort of built-in types SIZE and SIZELT.QAgdaThe type of built-in types SIZE and SIZELT.QAgdaThe built-in type SIZE with user-given name.QAgdaThe built-in type SIZE.QAgda The name of SIZESUC.QAgda>Transform list of terms into a term build from binary maximum.QAgdaExpects argument to be reduced.QAgdasizeViewComparable v w checks whether v >= w (then Left) or v <= w (then Right ). If uncomparable, it returns  NotComparable.QAgdasizeViewPred k v decrements v by k (must be possible!).QAgdasizeViewOffset v8 returns the number of successors or Nothing when infty.QAgda'Remove successors common to both sides.QAgdaTurn a size view into a term.QAgdamaxViewCons v ws = max v ws. It only adds v to ws+ if it is not subsumed by an element of ws.QAgdasizeViewComparableWithMax v ws tries to find w in ws that compares with v+ and singles this out. Precondition:  v /= DSizeInv.2QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ2QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQNone #$%-0235679>?QAgdaWe need: - Read access to the AbsToCon environment - Read access to the TC environment - Read access to the TC state - Read and write access to the stConcreteNames part of the TC state - Read access to the options - Permission to print debug messagesRAgda9Translate something in a context of the given precedence.RAgdaAssumes name is not '.QQQQQQQQRRRRRRRRRQQQRRRRRQQRRRQQQRNone #$%-0235679>?RAgda Variant of R- which does not insert outermost parentheses.RAgda Variant of R- which does not insert outermost parentheses.RRRRRRRRRRNone #$%-0235679>?RAgda:When making a function projection-like, we drop the first n arguments.RAgdaTo drop the first n 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.RAgdaUse for dropping initial lambdas in clause bodies. NOTE: does not reduce term, need lambdas to be present.RAgda,NOTE: does not work for recursive functions.RAgda=NOTE: This creates telescopes with unbound de Bruijn indices.RRRRNone! #$%-0235679>?e=GAgdaLookup the definition of a name. The result is a closed thing, all free variables have been abstracted over.GAgda Version that reports exceptions:GAgda4Lookup the rewrite rules with the given head symbol.GAgdaSignature lookup errors.GAgda8The name is not in the signature; default error message.GAgda0The name is not available, since it is abstract.GAgdaLookup a section telescope.If it doesn't exist, like in hierarchical top-level modules, the section telescope is empty.GAgdaUnless 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.RAgdaAdd a constant to the signature. Lifts the definition to top level.RAgda2Set termination info of a defined function symbol.RAgda1Set CompiledClauses of a defined function symbol.RAgda+Set SplitTree of a defined function symbol.RAgda!Modify the clauses of a function.RAgdaLifts clauses to the top-level and adds them to definition. Also adjusts the funCopatternLHS field if necessary.RAgda#Add a compiler pragma `{-# COMPILE  backend  name  text #-}`RAgdaAdd a section to the signature.The current context will be stored as the cumulative module parameters for this section.RAgdaSets the checkpoint for the given module to the current checkpoint.RAgdaGet 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.RAgda>Module application (followed by module parameter abstraction).RAgdaAdd a display form to a definition (could be in this or imported signature).RAgdaFind all names used (recursively) by display forms of a given name.RAgda#Check if a display form is looping.RAgdaCan be called on either a (co)datatype, a record type or a (co)constructor.RAgda?Does the given constructor come from a single-constructor type?5Precondition: The name has to refer to a constructor.RAgdaStandard eliminator for G.RAgdaGet the original name of the projection (the current one could be from a module application).RAgda%Look up the polarity of a definition.RAgdaLook up polarity of a definition and compose with polarity represented by .RAgda!Set the polarity of a definition.RAgda-Look up the forced arguments of a definition.RAgda*Get argument occurrence info for argument i of definition d (never fails).RAgda Sets the > for the given identifier (which should already exist in the signature).RAgdaReturns a list of length >. If no erasure analysis has been performed yet, this will be a list of ns.SAgda#add data constructors to a datatypeSAgdaGet the mutually recursive identifiers of a symbol from the signature.SAgda.Get the mutually recursive identifiers from a >.SAgda'Set the mutually recursive identifiers.SAgda5Check whether two definitions are mutually recursive.SAgda A functiondatarecord definition is nonRecursive if it is not even mutually recursive with itself.SAgda3Get the number of parameters to the current module.SAgdaCompute 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).SAgda7Compute 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 MA  where module MA  where f = ... module MA  where ... MA.MA.f [insert  raised by ] SAgdaInstantiate a closed definition with the correct part of the current context.SAgda'Give the abstract view of a definition.SAgdaEnter abstract mode. Abstract definition in the current module are transparent.SAgda:Not in abstract mode. All abstract definitions are opaque.SAgda?Ignore abstract mode. All abstract definitions are transparent.SAgdaEnter concrete or abstract mode depending on whether the given identifier is concrete or abstract.SAgdaCheck whether a name might have to be treated abstractly (either if we're S or it's not a local name). Returns true for things not declared abstract as well, but for those S will have no effect.SAgdaAndreas, 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).?<2SAgdaUnfreeze meta and its type if this is a meta again. Does not unfreeze deep occurrences of metas.SAgdaCheck whether all metas are instantiated. Precondition: argument is a meta (in some form) or a list of metas.SAgdaMonad service class for creating, solving and eta-expanding of metavariables.SAgdaGenerate a new meta variable with some instantiation given. For instance, the instantiation could be a ?.SAgdaAssign 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.SAgdaDirectly instantiate the metavariable. Skip pattern check, occurs check and frozen check. Used for eta expanding frozen metas.SAgdaEta expand a metavariable, if it is of the specified kind. Don't do anything if the metavariable is a blocked term.SAgda%Update the status of the metavariableSAgda/'speculateMetas fallback m' speculatively runs m, but if the result is S6 any changes to metavariables are rolled back and fallback is run instead.SAgdaVarious kinds of metavariables.SAgdaMeta variables of record type.SAgda7Meta variables of "hereditarily singleton" record type.SAgda;Meta variables of level type, if type-in-type is activated.SAgda All possible metavariable kinds.SAgdaSwitch off assignment of metas.SAgdaGet the meta store.SAgda8Run a computation and record which new metas it created.SAgdaLookup a meta variable.SAgdaType of a term or sort meta.SAgda7Update the information associated with a meta variable.SAgdaInsert a new meta variable with associated information into the meta store.SAgdaCompute the context variables that a meta should be applied to, accounting for pruning.SAgda=Given a meta, return the type applied to the current context.SAgda'Is it a meta that might be generalized?SAgdaReturns all metavariables in a constraint. Slightly complicated by the fact that blocked terms are represented by two meta variables. To find the second one we need to look up the meta listeners for the one in the UnBlock constraint.SAgdaCreate ? in the current environment.SAgdaRegister an interaction point during scope checking. If there is no interaction id yet, create one.SAgdaFind an interaction point by   by searching the whole map.?TAgdaStrenghtening.TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTNone #$%-0235679>?rNone #$%-0235679>?TTNone #$%-0235679>?TTNone #$%-0235679>?Ihijklmnopqrstuvwxyz{|}~>>>>??AAAA<=<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=====???<<<<<::::::<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<:::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=============================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=============>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@?@?@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@A@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSNone #$%-0235679>?ǕNone #$%-0235679>?None #$%-0235679>?None #$%-0235679>?dNone #$%-0235679>?_UAgdaEncodes something. To ensure relocatability file paths in positions are replaced with module names.UAgdaDecodes an uncompressed bytestring (without extra hashes or magic numbers). The result depends on the include path.Returns n$ if a decoding error is encountered.UAgdaEncodes an interface. To ensure relocatability file paths in positions are replaced with module names.An uncompressed bytestring corresponding to the encoded interface is returned.UAgda=Decodes an interface. The result depends on the include path.Returns n if the file does not start with the right magic number or some other decoding error is encountered.FUUUUUUUUUUUUUUFNone #$%-0235679>?eUAgdaGet all the clauses of a definition and convert them to rewrite rules.UAgda-Generate a sensible name for the given clauseUAgdaclauseToRewriteRule f q cl converts the clause cl of the function f to a rewrite rule with name q . Returns Nothing if  clauseBody cl is Nothing. Precondition:  clauseType cl is not Nothing.UUUUUUUUUUNone #$%-0235679>?;BGGUUUUGBGNone #$%-0235679>?ίUAgdaExpand literal integer pattern into suc/zero constructor patterns.UAgda7Expand away (deeply) all pattern synonyms in a pattern.UUUUUUUUNone #$%-0235679>?UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUNone #$%-0235679>?ϒUUUUUUNone #$%-0235679>?pVAgda3Contracts all eta-redexes it sees without reducing.VAgda5If record constructor, call eta-contraction function.VAgda%Try to contract a lambda-abstraction Lam i (Abs x b).VAgdaConstructor 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.VAgdaInfo i of the -.AgdaName x of the abstraction.AgdaBody (-) b of the -.AgdaLam i (Abs x b), eta-contracted if possible.VVVVVVVVVVVVVVVVNone! #$%-0235679>?; VAgdainstantiateFull' V5s metas everywhere (and recursively) but does not V.VAgdaOnly unfold definitions if this leads to simplification which means that a constructor/literal pattern is matched.VAgdaInstantiate 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).VAgdaNormalise the given term but also preserve blocking tags TODO: implement a more efficient version of this.VAgda+Meaning no metas left in the instantiation.VAgdaCase 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.VAgdaIf the first argument is n0, then a single delayed clause may be unfolded.VAgdaReduce a non-primitive definition if it is a copy linking to another def.VAgda*Reduce simple (single clause) definitions.VAgda!Unfold a single inlined function.VAgdaApply a definition using the compiled clauses, or fall back to ordinary clauses if no compiled clauses exist.VAgdaApply a defined function to it's arguments, using the compiled clauses. The original term is the first argument applied to the third.VAgdaApply a defined function to it's arguments, using the original clauses..VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV.VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVNone #$%-0235679>?$OAgdaA safe variant of M.OAgda+Gather leading s of a type in a telescope.WAgda  [ (i,(x,y)) ] = [(i=0) -> x, (i=1) -> y]WAgdaA telescope split in two.WAgda;The permutation takes us from the original telescope to firstPart ++ secondPart.WAgda(Flatten telescope: ( : Tel) -> [Type ]WAgdaOrder a flattened telescope in the correct dependeny order:  -> Permutation ( -> ~)Since reorderTel tel( uses free variable analysis of type in tel, the telescope should be Vd.WAgdaUnflatten: turns a flattened telescope into a proper telescope. Must be properly ordered.WAgdaRename the variables in the telescope to the given names Precondition: size xs == size tel.WAgda(Get the suggested names from a telescopeXAgda A variant of W 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.XAgda.Split the telescope at the specified position.XAgdaPermute 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):  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) XAgdaRecursively computes dependencies of a set of variables in a given telescope. Any dependencies outside of the telescope are ignored.XAgdaComputes the set of variables in a telescope whose type depend on one of the variables in the given set (including recursive dependencies). Any dependencies outside of the telescope are ignored.XAgdaSplit a telescope into the part that defines the given variables and the part that doesn't.See .XAgdaAs splitTelescope, but fails if any additional variables or reordering would be needed to make the first part well-typed.XAgdaTry 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.XAgdaTry to eta-expand one variable in the telescope (given by its de Bruijn level)XAgdatelViewUpTo n t takes off the first n function types of t. Takes off all if n < 0.XAgdatelViewUpTo' n p t takes off $t$ the first n (or arbitrary many if n < 0-) function domains as long as they satify p.XAgdatelViewUpToPath n t takes off $t$ the first n (or arbitrary many if n < 0!) function domains or Path types.XAgdaLike telViewUpToPath but also returns the Boundary expected by the Path types encountered. The boundary terms live in the telescope given by the TelView. Each point of the boundary has the type of the codomain of the Path type it got taken from, see  fullBoundary.XAgda8(TelV  b, [(i,t_i,u_i)]) <- telViewUpToPathBoundary n a Input:  E a Output:  E b  E i : I  E [ (i=0) -> t_i; (i=1) -> u_i ] : bXAgda9(TelV  b, [(i,t_i,u_i)]) <- telViewUpToPathBoundaryP n a Input:  E a Output: . E b . E T is the codomain of the PathP at variable i . E i : I . E [ (i=0) -> t_i; (i=1) -> u_i ] : T Useful to reconstruct IApplyP patterns after teleNamedArgs .XAgdateleElimsB args bs = es Input: . E args :  . E T is the codomain of the PathP at variable i . E i : I . E bs = [ (i=0) -> t_i; (i=1) -> u_i ] : T Output: . | PiPath  bs A E es : AXAgda'returns Left (a,b) in case the type is Pi a b or  PathP b _ _ assumes the type is in whnf.XAgdaDecomposing a function type.XAgdaIf the given type is a Pi, pass its parts to the first continuation. If not (or blocked), pass the reduced type to the second continuation.XAgdaIf the given type is a Pi, pass its parts to the first continuation. If not (or blocked), pass the reduced type to the second continuation.XAgda&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.XAgda&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.XAgdaCompute type arityXAgdaStrips all hidden and instance Pi's and return the argument telescope and head definition name, if possible.XAgda:Register the definition with the given type as an instanceXAgdaTry 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.XAgdaA set of de Bruijn indices.AgdaOriginal telescope.Agda firstPart mentions the given variables,  secondPart not.XAgdaA list of de Bruijn indicesAgdaThe telescope to splitAgda firstPart5 mentions the given variables in the given order,  secondPart contains all other variablesXAgdaE Agda! E var k : A de Bruijn _level_Agda  E u : AOOOWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXWWWWWWWWWWXXXXXWWWWWXXXXOXXXXWWXXXXXXXXXXXXXXXXXXXXXOOXWWWWWWXXXXNone #$%-0235679>?XAgda,Instantiate full as long as things are equalXAgda'Syntactic equality check for terms.  checkSyntacticEquality v v' = do (v, v') <- instantiateFull (v, v') return ((v, v'), v==v')  only that v, v' are only fully instantiated to the depth where they are equal.+This means in particular that the returned v,v' cannot be MetaVs that are instantiated.XAgda!Syntactic equality ignores sorts.XAgda Syntactic term equality ignores - stuff.XXXXNone #$%-0235679>?XAgdaAbbreviation: argN =  .XAgdaAbbreviation: argH =   .*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX*XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX4X4X4X9 X9 None #$%-0235679>?YAgda;Define a "ghcomp" version of gcomp. Normal comp looks like:comp^i A [ phi -> u ] u0 = hcomp^i A(1/i) [ phi -> forward A i u ] (forward A 0 u0)So for "gcomp" we compute:gcomp^i A [ phi -> u ] u0 = hcomp^i A(1/i) [ phi -> forward A i u, ~ phi -> forward A 0 u0 ] (forward A 0 u0)The point of this is that gcomp does not produce any empty systems (if phi = 0 it will reduce to "forward A 0 u".YAgda Tries to  primTransp a whole telescope of arguments, following the rule for  types. If a type in the telescope does not support transp,  transpTel throws it as an exception.YAgdaLike  transpTel but performing a transpFill..XXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYY.XXXXXXXXXXXXXXXXYYXXXYXXXXYYXXXYYYYYYYYYYYYYYYNone #$%'(-0235679>?YAgda:Convert a term (from a dot pattern) to a DeBruijn pattern.YYYYYYNone #$%-0235679>?u YAgdaA  SingleLevel is a Level3 that cannot be further decomposed as a maximum a E b.YAgdaGet the P as a -.YAgda-Raises an error if no level kit is available.YAgda,Checks whether level kit is fully available.YAgdaGiven a level l, find the maximum constant n such that  l = n + l'YAgdaGiven a level l, find the biggest constant n such that n <= lYAgdaGiven a constant n and a level l, find the level l' such that  l = n + l' (or Nothing if there is no such level). Operates on levels in canonical form.YAgdaGiven two levels a and b%, try to decompose the first one as  a = a' E b (for the minimal value of a').YAgda Return the maximum of the given  SingleLevels$QYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY$YYYYYYYYYYYYYYYYYQYYYYYYYYYYYYYYYYYYNone #$%-0235679>?JYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYNone #$%-0235679>?YAgdabuildList A ts builds a list of type List A. Assumes that the terms ts all have type A.YAgdamkPrimInjective takes two Set0 a and b and a function f of type a -> b5 and outputs a primitive internalizing the fact that f is injective.YAgda primEraseEquality : {a : Level} {A : Set a} {x y : A} -> x D y -> x D yYAgdaGet the + of the principal argument of BUILTIN REFL.Returns Nothing for e.g.  data Eq {a} {A : Set a} (x : A) : A C Set a where refl : Eq x x Returns Just ... for e.g.  data Eq {a} {A : Set a} : (x y : A) C Set a where refl : D x C Eq x x ZAgdaUsed for both  primForce and primForceLemma.FXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZ-FYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZNone #$%-0235679>?ZAgdasimplifyLevelConstraint c cs turns an c into an equality constraint if it is an inequality constraint and the reverse inequality is contained in cs.The constraints don'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.ZAgda Constraint c to simplify.Agda)Other constraints, enable simplification.AgdaJust,: list of constraints equal to the original c. Nothing: no simplification possible.ZZNone #$%-0235679>?$ZAgdaRun the given action. At the end take all new metavariables of type level for which the only constraints are upper bounds on the level, and instantiate them to the lowest level.ZZZZNone #$%-0235679>? )ZAgda!A variable can either not occur (Z) or it does occur (Z). In the latter case, the occurrence may disappear depending on the instantiation of some set of metas.ZAgdaTry to enforce a set of variables not occurring in a given type. Returns a possibly reduced version of the type and for each of the given variables whether it is either not free, or maybe free depending on some metavariables.ZZZZZZZZZZNone #$%-0235679>?aZAgdaSubstitute 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.ZAgdaClass Match for matching a term p, in the role of a pattern against a term v.The 0th variable in p plays the role of a place holder (pattern variable). Each occurrence of var 0 in p) stands for a different pattern variable.The 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 v, 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).ZAgda Convert a > into a -.ZAgda0Get the arities of all display forms for a name.ZAgda!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.ZAgdaMatch a ? q ps = v against q es. Return the > v[us]' if the match was successful, i.e., es / ps = Just us. ZZZZZZZZZ ZZZZZZZZZNone #$%-0235679>?LZAgdaRun before serialisation to remove any definitions that are not reachable from the public interface to the module.ZZNone #$%-0235679>?HAgdamatchCompiledE 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 nth 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.HH[[[HH[[[None #$%-0235679>?[AgdaGiven a list of formally mutually recursive functions, check for actual recursive calls in the bodies of these functions. Returns the actually recursive functions as strongly connected components.As a side effect, update the -: field in the clauses belonging to the given functions.[AgdaanysDef names a returns all definitions from names that are used in a.[[[[None #$%-0235679>?2[Agda.Adds a new unique name to the current context.[AgdaReturns the name of the variable with the given de Bruijn index.[AgdaTranslate reflected syntax to abstract, using the names from the current typechecking context.[Agda5Drop implicit arguments unless --show-implicit is on. [[[[[[[[[[[ [[[[[[[[[[[None! #$%-0235679>?[AgdaAlso tracks whether module parameters should be dropped from the patterns.[AgdaLike reify7 but instantiates blocking metas, useful for reporting.[AgdareifyDisplayFormP; tries to recursively rewrite a lhs with a display form.=Note: we are not necessarily in the empty context upon entry![AgdablankNotInScope e" replaces variables in expression e with _% if they are currently not in scope.[AgdaAssumes that pattern variables have been added to the context already. Picks pattern variable names from context.[AgdaSkip reification of implicit and irrelevant args if option is off.[AgdaLHS 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 #$%-0235679>?lGAgda\ without the brackets.[Agda2Pairing something with a node (for printing only).\Agda!Comma-separated list in brackets.\Agda,Pretty print with a given context precedence\Agda#Proper pretty printing of patterns:+GGGGGGGGGGGGGGGGG[[[[[[[[[[[[[[[\\\\\\\\\+GGGGGGGGGGGGGGGGG[[[[[[[[[[[[[[[\\\\\\\\\G5G6G6[5None #$%-0235679>? \AgdaIn an ambient context , telePiPath f  t bs builds a type that can be telViewPathBoundaryP'ed into (TelV  t, bs'). . E t bs = [(i,u_i)]  = 0,(i : I),1 D b D {0,1}. .0 | u_i .b : (telePiPath f 1 t bs)(i = b)  E telePiPath f  t bs\\\\None #$%-0235679>?/E\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.\AgdaCheck 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 C 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< C C i) (k : Size< j) (k' : Size< k). Throws a C if undecided.\AgdaCheck whether a variable in the context is bounded by a size expression. If  x : Size< a, then a is returned.\AgdaWhenever 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.\AgdaCompute 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\AgdaIf < then postpone as constraint, otherwise, fail hard. Failing is required if we speculatively test several alternatives.\Agda3Checked whether a size constraint is trivial (like X <= X+1).\Agda9Test whether a problem consists only of size constraints.\Agda-Test whether a constraint speaks about sizes.\Agda?Take out all size constraints of the given direction (DANGER!).\Agda4Find the size constraints of the matching direction.\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. \AgdaTurn a constraint over de Bruijn indices into a size constraint.\AgdaTurn a term with de Bruijn indices into a size expression with offset. Throws a C, if the term isn't a proper size expression.\AgdaCompute list of size metavariables with their arguments appearing in a constraint.\AgdaConvert 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.\AgdaMain 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.\AgdaTest for being a sized typeAgda Restriction to these directions.\AgdaSize metas and their arity.Agda(Size constraints (in preprocessed form).AgdaReturns False if solver fails.!\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\!\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\None #$%-0235679>?0\\None #$%-0235679>?0WG\\GNone #$%-0235679>?BGAgda,Is a type a proposition? (Needs reduction.)HAgdaModify the context whenever going from the l.h.s. (term side) of the typing judgement to the r.h.s. (type side).\AgdaCheck whether something can be used in a position of the given modality.This is a substitute for double-checking that only makes sure modalities are correct. See issue #2640.Used in unifier ( unifyStep Solution{}).This uses McBride-style modality checking. It does not differ from Pfenning-style if we are only interested in the modality of the free variables, used meta-variables, and used definitions.\AgdaCheck whether something can be used in a position of the given relevance.This is a substitute for double-checking that only makes sure relevances are correct. See issue #2640.Used in unifier ( unifyStep Solution{}).At the moment, this implements McBride-style irrelevance, where Pfenning-style would be the most accurate thing. However, these two notions only differ how they handle bound variables in a term. Here, we are only concerned in the free variables, used meta-variables, and used (irrelevant) definitions.\AgdaPrepare parts of a parameter telescope for abstraction in constructors and projections.\AgdaInternal 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.-Also allow the use of irrelevant definitions.\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.Precondition: Relevance /= Relevant\AgdaApply relevance rel the the relevance annotation of the (typing/equality) judgement. This is part of the work done when going into a rel -context.Precondition: Relevance /= Relevant\AgdaLike \ , but only act on context if --irrelevant-projections. See issue #2170.]Agda(Conditionally) wake up erased variables and make them unrestricted. For instance, in an erased function argument otherwise erased variables may be used, so they are awoken before type checking the argument.)Also allow the use of erased definitions.]Agda(Conditionally) wake up erased variables and make them unrestricted. For instance, in an erased function argument otherwise erased variables may be used, so they are awoken before type checking the argument.Precondition: Quantity /= Quantity1]AgdaApply quantity q the the quantity annotation of the (typing/equality) judgement. This is part of the work done when going into a q -context.Precondition: Quantity /= Quantity1]AgdaApply inverse composition with the given cohesion to the typing context.]Agda0Can we split on arguments of the given cohesion?]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.-Also allow the use of irrelevant definitions.]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.Precondition: Modality /= Relevant]AgdaApply modality m the the modality annotation of the (typing/equality) judgement. This is part of the work done when going into a m -context.Precondition: Modality /= Relevant]AgdaLike ]0, but only act on context (for Relevance) if --irrelevant-projections. See issue #2170.]AgdaWake 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 . 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).GH\\\\\\\\\\]]]]]]]]]]]]\H\\\\\]]]]]]]]]]]\\\\G]None #$%-0235679>?]-UAgdaCheck if a name refers to a record constructor. If yes, return record definition.UAgdaCheck if a constructor name is the internally generated record constructor.%Works also for abstract constructors.UAgda,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.1If all fields are erased, we cannot eta-contract.UAgda3Check if a name refers to an eta expandable record.UAgdaCheck 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.]AgdaThe type of the field.]Agda*Order the fields of a record construction.]AgdaA 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.]Agda1The name of the module corresponding to a record.]AgdaGet the definition for a record. Throws an exception if the name does not refer to a record or the record is abstract.]Agda.Get the record name belonging to a field name.]Agda Get the field names of a record.]Agda0Find all records with at least the given fields.]Agda Get the field types of a record.]Agda/Get the field names belonging to a record type.]AgdaReturns 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: ]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.]AgdaGiven a head and its type, compute the types of the eliminations.]AgdaGoing under one of these does not count as a decrease in size for the termination checker.]AgdaCheck if a name refers to a record which is not coinductive. (Projections are then size-preserving)]AgdaCheck if a type is an eta expandable record and return the record identifier and the parameters.]AgdaTurn off eta for unguarded recursive records. Projections do not preserve guardedness.]AgdaTurn on eta for inductive guarded recursive records. Projections do not preserve guardedness.]AgdaTurn on eta for non-recursive record, unless user declared otherwise.]Agda1Check whether record type is marked as recursive.9Precondition: record type identifier exists in signature.]Agda etaExpandBoundVar i = (, , )%Precondition: The current context is  = A, x:R pars, A where |A| = i and R4 is a eta-expandable record type with constructor c and fields '.Postcondition:  = A, ', A[c '] and   E  :  and   E  : .]Agda #expandRecordVar i  = (, , , ')Precondition:  = A, x:R pars, A where |A| = i and R7 is a eta-expandable record type with constructor c and fields '.Postcondition:  = A, ', A[c '] and   E  :  and   E  : .]AgdaPrecondition: variable list is ordered descendingly. Can be empty.]Agda curryAt v ( (y : R pars) -> B) n = ( v ->   ys C v  (c ys) {- curry -} , v ->   y C v  (p1 y) ... (pm y) {- uncurry -} ,  (ys : As) C B[c ys / y] )where  n = size .]AgdaetaExpand 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.]AgdaEta expand a record regardless of whether it's an eta-record or not.]AgdaIs the type a hereditarily singleton record type? May return a blocking metavariable.Precondition: The name should refer to a record type, and the arguments should be the parameters to the type.]AgdaReturn the unique (closed) inhabitant if exists. In case of counting irrelevance in, the returned inhabitant contains dummy terms.]AgdaCheck whether a type has a unique inhabitant and return it. Can be blocked by a metavar.]AgdaCheck whether a type has a unique inhabitant (irrelevant parts ignored). Can be blocked by a metavar.]AgdaChecks 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.]AgdaAuxiliary function.]Agda(Name of record type (for error message).AgdaHow to fill a missing field.AgdaField names of the record type.Agda6Provided fields with content in the record expression.Agda#Content arranged in official order.]Agda*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 .AgdaGiven fields enriched by placeholders for missing explicit fields.]Agda"Record type. Need not be reduced.]AgdaHead (record value).Agda Its type.Agda Projection.9UUUUUU]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]9]]]]]]]U]]]]]U]]]]]]]]]]]U]]]]UU]]]]]]]]]]]]]]U]]]]]]]]]]None #$%-0235679>?ib]AgdaState 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  to indicate that we came by an irrelevant projection and, hence, the rhs must be type-checked in irrelevant mode.]Agda%have we splitted with a PartialFocus?]Agda,The user patterns we still have to split on.]AgdaUser patterns which are typed (including the ones generated from implicit arguments).]AgdaList 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  In this sitation, for clause 2, we construct an initial problem  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.]AgdaThe code that checks the RHS.]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 ,).^AgdaClassify remaining patterns after splitting is complete into pattern variables, as patterns, dot patterns, and absurd patterns. Precondition: there are no more constructor patterns.^AgdaBuild 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. Names that are not also module parameters are preferred over those that are.^Agda"The telescope of pattern variablesAgda0The list of user names for each pattern variable=33333]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^^^^=^^^^^^]]]]]^^^]]]]]]]33333]]]]]^^^^]]]]]]]]]]]]]^^^^]]]]]]]^^None #$%-0235679>?nUAgdaIf matching is inconclusive (DontKnow) we want to know whether it is due to a particular meta variable.UAgdamatchCopatterns ps es matches spine es against copattern spine ps.Returns U and a substitution for the pattern variables (in form of IntMap Term) if matching was successful.Returns U3 if there was a constructor or projection mismatch.Returns U if an argument could not be evaluated to constructor form because of a blocking meta variable. In any case, also returns spine es in reduced form (with all the weak head reductions performed that were necessary to come to a decision).UAgdaBuilds a proper substitution from an IntMap produced by match(Co)patterns^Agda Instead of n, we need to use this lazy version of combining pattern matching computations.^AgdaMatch a single copattern.^AgdaMatch a single pattern.^AgdaMatch a single pattern.UUUUUUU^^^^^^^^^UUUU^U^^^U^U^^^^None #$%-0235679>?x ^AgdaPossible results of ^.^AgdaSuccess: this many implicits have to be inserted (list can be empty).^AgdaError: hidden argument where there should have been a non-hidden argument.^AgdaError: bad named argument.^AgdaimplicitArgs n expand t generates up to n* implicit argument metas (unbounded if n<0), as long as t is a function type and expand( holds on the hiding info of its domain.^AgdaimplicitNamedArgs n expand 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.^Agda'Create a metavariable according to the  info.^Agda'Create a questionmark according to the  info.^AgdaIf the next given argument is a and the expected arguments are ts insertImplicit' a ts returns the prefix of ts that precedes a.If a+ is named but this name does not appear in ts, the ^ exception is thrown.^AgdaIf the next given argument is a and the expected arguments are ts insertImplicit' a ts returns the prefix of ts that precedes a.If a+ is named but this name does not appear in ts, the ^ exception is thrown.^Agdan0, the maximum number of implicts to be inserted.Agdaexpand9, the predicate to test whether we should keep inserting.AgdaThe (function) type t we are eliminating.Agda1The eliminating arguments and the remaining type.^Agdan0, the maximum number of implicts to be inserted.Agdaexpand9, the predicate to test whether we should keep inserting.AgdaThe (function) type t we are eliminating.Agda1The eliminating arguments and the remaining type.^AgdaKind/relevance of meta.AgdaName suggestion for meta.AgdaCheck (CmpLeq ) or infer (CmpEq ) the type.Agda Type of meta.Agda#The created meta as id and as term.^AgdaKind/relevance of meta.AgdaName suggestion for meta.AgdaCheck (CmpLeq ) or infer (CmpEq ) the type.Agda Type of meta.Agda#The created meta as id and as term.^AgdaNext given argument a.AgdaExpected arguments ts.^AgdaNext given argument a.AgdaExpected arguments ts. ^^^^^^^^^^^ ^^^^^^^^^^^None #$%-0235679>?ze^Agda;Insert implicit patterns in a list of patterns. Even if <(, trailing SIZELT patterns are inserted.^Agda(Insert trailing SizeLt patterns, if any.^Agda;Insert implicit patterns in a list of patterns. Even if <(, trailing SIZELT patterns are inserted.^^^^^^^^None #$%-0235679>?S^AgdaRename 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: @Case : {A : Set} C Maybe A C Set C Set C Set Case nothing B C = B Case (just _) B C = Csample : {A : Set} (m : Maybe A) C Case m Bool (Maybe A C 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:  lhsTel = [A : Set, m : Maybe A] lhsOutPat = [A&, "m"] lhsProblem = Problem [A = _, "just a" = "a"] ["_", "just a"] ["just b"] [] 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.AgdaThe 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 #$%-0235679>?^AgdaExpand a clause to the maximal arity, by inserting variable patterns and applying the body to variables.^AgdaGet the name of defined symbol of the head normal form of a term. Returns n if no such head exists.^^^^None #$%-0235679>?^AgdaGiven the type of a constructor (excluding the parameters), decide which arguments are forced. Precondition: the type is of the form  C D vs and the vs are in normal form.^Agda(Assumes that the term is in normal form.^^^^^^None #$%-0235679>?TAgdaGet the name of the datatype constructed by a given constructor. Precondition: The argument must refer to a constructorTAgda(Get true constructor with record fields.^AgdaArity.^AgdaList of field names.^AgdaGet true constructor with fields, expanding literals to constructors if possible.^AgdaAugment constructor with record fields (preserve constructor name). The true constructor might only surface via reduce.^AgdaIs the datatype of this constructor a Higher Inductive Type? Precondition: The argument must refer to a constructor of a datatype or record.^AgdagetConType c t/ computes the constructor parameters from type t? and returns them plus the instantiated type of constructor c. This works also if t 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.^AgdaReturn 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.^AgdaCheck 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.^Agdan! if not data or record type name.^Agdan" if not data or record definition.^Agda,Precondition: Name is a data or record type.^Agdan! if not data or record type name.^AgdaFills in the fields.^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, ct 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, ct is the type of the constructor instantiated to the parameters.TT^^^^^^^^^^^^^^^^^^^T^^T^^^^^^^^^^^^^^^^^None  #$%-0235679>?^Agda9Get all symbols that a non-linear pattern matches against^Agda;Gather the set of pattern variables of a non-linear pattern_Agda,Convert from a non-linear pattern to a term._AgdaTurn 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). The third argument is the type of the term._Agda5Only computes free variables that are not bound (see ^), i.e., those in a >. ^^^^^____ ____^^^^^None #$%-0235679>?;_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._AgdaSplit tree annotated for record pattern translation. type RecordSplitTree = SplitTree' RecordSplitNode type RecordSplitTrees = SplitTrees' RecordSplitNode;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.________None! #$%-0235679>?%_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 n ++ n (n . _) is, for some n and is, where is! is decreasing (non-strictly)._AgdaName for D builtin._AgdaUsed to build _ and occurrence graphs._AgdaUsed to build _ and occurrence graphs._AgdaOnlyVarsUpTo n occs* discards occurrences of de Bruijn index >= n._AgdaCheck that the datatypes in the mutual block containing the given declarations are strictly positive.Also add information about positivity and recursivity of records to the signature._AgdaRemoves _ entries._AgdaAn interpreter for _.=WARNING: There can be lots of sharing between the generated   entries. Traversing all of these entries could be expensive. (See _ for an example.)_AgdaRunning the monad_Agda0Computes the number of occurrences of different _s in the given definition.2WARNING: There can be lots of sharing between the   entries. Traversing all of these entries could be expensive. (See _ for an example.)_Agda1Computes the occurrences in the given definition._Agda4Merges two edges between the same source and target._Agda2WARNING: There can be lots of sharing between the   entries in the edges. Traversing all of these entries could be expensive. (See _ for an example.)_AgdaComputes all non-2 occurrence graph edges represented by the given _.2WARNING: There can be lots of sharing between the   entries in the edges. Traversing all of these entries could be expensive. For instance, for the function F in  benchmarkmiscSlowOccurrences.agda, a large number of edges from the argument X to the function F* are computed. These edges have polarity  ,  or  , and contain the following   elements:  _ n (n [  F,   0]),  _ n (n [  F,   0,  ]),  _ n (n [  F,   0,  ,  ]),  _ n (n [  F,   0,  ,  ,  ]), and so on._Agda.The monoid laws only hold up to flattening of _._Agda1The semigroup laws only hold up to flattening of _._AgdaThese operations form a semiring if we quotient by the relation "the  components are equal"._AgdaExtension of the _#, usually a local variable context._Agda&The names in the current mutual block.AgdaThe current name.&______________________________________&______________________________________None #$%-0235679>?F GAgdaWhich Deftypes are eligible for the principle argument of a projection-like function?GAgdaTurn 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   C D  C C for D a name (Def ) which is G: data  record   postulate.The application of f should only get stuck if the principal argument is inferable (neutral). Thus:a. f cannot have absurd clauses (which are stuck even if the principal argument is a constructor).b. f 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 parameters. f. A rhs of f cannot be a record expression, since this will be translated to copatterns by recordExpressionsToCopatterns. Thus, an application of f waiting for a projection can be stuck even when the principal argument is a constructor.For internal reasons: f cannot be constructor headedf 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`Agda View for a Def f (Apply a : es) where isProjection f. Used for projection-like fs.`AgdaA projection or projection-like function, applied to its principal argument`AgdaJust a lone projection-like function, missing its principal argument (from which we could infer the parameters).`Agda*Not a projection or projection-like thing.`Agda Semantics of `.`Agda Top-level ` (no reduction).`AgdaReduce 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.)`AgdaTurn 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 n is n, a lone projection like function will be turned into a lambda-abstraction, expecting the principal argument. If the n is n , it will be returned unaltered.No precondition. Preserves constructorForm, since it really does only something on (applications of) projection-like functions. GG``````````` ```````````GGNone #$%-0235679>?`AgdaInfer the sort of another sort. If we can compute the bigger sort straight away, return that. Otherwise, return  UnivSort s and add a constraint to ensure we can compute the sort eventually.`AgdaInfer the sort of a pi type. If we can compute the sort straight away, return that. Otherwise, return  PiSort a s2 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`AgdaRecursively check that an iterated function type constructed by telePi is well-sorted.`AgdaResult is in reduced form.`AgdaReconstruct the sort of a type./Precondition: given term is a well-sorted type. ```````````` ````````````None #$%-0235679>?G`AgdaIf there are several warnings, remove the unsolved-constraints warning in case there are no interesting constraints to list.`AgdaTurns all warnings into errors.`AgdaDepending which flags are set, one may happily ignore some warnings. `````````` ``````````None #$%-0235679>? FAgda/What is the polarity of a function composition?FAgdaMain 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. >" is bottom (dominant for inf), > is top (neutral for inf).`Agda* negation, swapping monotone and antitone.`Agda#Get the next polarity from a list, > if empty.`AgdaReplace > by >&. (Arbitrary bias, but better than >, see issue 1596).`Agda6A quick transliterations of occurrences to polarities.`AgdaData and record parameters are used as phantom arguments all over the test suite (and possibly in user developments). enablePhantomTypes turns > parameters to > to enable phantoms.`AgdaMake arguments > if the type of a not-> later argument depends on it. Also, enable phantom types by turning > into something else if it is a data/record parameter but not a size argument. [See issue 1596]Precondition: the "phantom" polarity list has the same length as the polarity list.`AgdaCheck whether a variable is relevant in a type expression, ignoring domains of non-variant arguments.`AgdaHack 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 i a% checks that constructor target type a has form d ps (C@ i) idxs where  |ps| = np(d).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 `.FF````````````````F````F````````None #$%-0235679>?U `AgdaDo a full whnf and treat neutral terms as rigid. Used on the arguments to an injective functions and to the right-hand side.`AgdaDoes 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.`AgdaPrecondition: all the given clauses are non-absurd and contain a proper match.`AgdaIf 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 `_,_`.`AgdaTurn 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.`Agda,Argument should be in weak head normal form.`AgdaPrecondition: The first argument must be blocked and the second must be neutral.`AgdaThe second argument should be a blocked application and the third argument the inverse of the applied function.````````````````````````````````None #$%-0235679>?ǿ`AgdaFor each variable in the patterns of a split clause, we remember the de Bruijn-index and the literals excluded by previous matches.`AgdaVariable blocking a match.`Agda/De Bruijn index of variable blocking the match.`AgdaConstructors in this position.`AgdaLiterals in this position.`AgdaTrue if at least one clause has a variable pattern in this position.`AgdaTrue if at least one clause has a lazy pattern in this position.`Agda%Missing elimination blocking a match.`AgdaBlocked on unsplit projection.`Agda!Blocked on unintroduced argument.`AgdaTrue if there are also matching clauses without an unsplit copattern.`Agda Is the unintroduced argument an - pattern?`AgdaIf matching is inconclusive (Block) we want to know which variables or projections are blocking the match.`AgdaMatches unconditionally.`AgdaDefinitely does not match.`AgdaBlockedOnProj o" if the clause has a result split.`AgdaBlockingVar i cs ls o means variable i is blocked on constructors cs and literals ls.`Agda3Match the given patterns against a list of clauses.7If successful, return the index of the covering clause.`Agda-A pattern that matches anything (modulo eta).`AgdamatchClause qs i c checks whether clause c( covers a split clause with patterns qs.`Agda+Search for clause that covers the patterns.AgdaPatterns of the current  SplitClause.`AgdaSplit clause patterns qs.AgdaClause c to cover split clause.AgdaResult. If ` the instantiation rs such that (namedClausePats c)[rs] == qs.%`````````````````````````````````````%`````````````````````````````````````None #$%-0235679>?Ș ````aaaaaaa `aaaa```aaaNone #$%-0235679>?] aAgdaMatch a non-linear pattern against a neutral term, returning a substitution.aAgdaMatching against a term produces a constraint which we have to verify after applying the substitution computed by matching.aAgda+Telescope of free variables in the equationaAgda8Type of the equation, living in same context as the rhs.aAgda-Term from pattern, living in pattern context.aAgdaTerm from scrutinee, living in context where matching was invoked.aAgdaMonad for non-linear matching.aAgdaAdd substitution  i |-> v : a to result of matching.aAgda?Typed -equality, also handles empty record types. Returns n if the terms are equal, or `Just b` if the terms are not (where b contains information about possible metas blocking the comparison)aAgda3Are we currently matching in an irrelevant context?Agda"The telescope of pattern variablesAgda'The telescope of lambda-bound variablesAgdaThe type of the patternAgdaThe pattern to matchAgda*The term to be matched against the patternaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaNone #$%-0235679>?Y,aAgda6The call information is stored as free monoid over <. As long as we never look at it, only accumulate it, it does not matter whether we use Set, (nub) list, or Tree. Internally, due to lazyness, it is anyway a binary tree of n; nodes and singleton leafs. Since we define no order on <! (expensive), we cannot use a Set or nub list. Performance-wise, I could not see a difference between Set and list.aAgda2True if thing not eligible for structural descent.aAgdaThing.aAgdaExtract 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).aAgdaTermination monad.aAgda Termination monad service class.aAgdaThe termination environment.aAgdaAre we mining dot patterns to find evindence of structal descent?aAgda#The name of size successor, if any.aAgda2The name of the delay constructor (sharp), if any.aAgda/Depth at which to cut off the structural order.aAgda3The name of the function we are currently checking.aAgdaThe names of the functions in the mutual block we are checking. This includes the internally generated functions (with, extendedlambda, coinduction).aAgdaThe list of name actually appearing in the file (abstract syntax). Excludes the internally generated functions.aAgdaDoes the actual clause result from with-inlining? (If yes, it may be ill-typed.)aAgdaTarget type of the function we are currently termination checking. Only the constructors of a are considered guarding.aAgda%Are we checking a delayed definition?aAgdaOnly consider the b n< arguments for establishing termination. See issue #1023.aAgdaOnly consider guardedness if n (not masked).aAgda How many SIZELT relations do we have in the context (= clause telescope). Used to approximate termination for metas in call args.aAgda+The patterns of the clause we are checking.aAgdaNumber 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.aAgdaThe current guardedness status. Changes as we go deeper into the term. Updated during call graph extraction, hence strict.aAgdaWhen 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).aAgdaPattern variables that can be compared to argument variables using SIZELT.aAgdaThe current guardedness level.aAgda+The target of the function we are checking.aAgda!The mutual block we are checking.The functions are numbered according to their order of appearance in this list.aAgda!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.aAgda)Generic run method for termination monad.aAgdaRun TerM computation in default environment (created from options).bAgda Lens for a.bAgda Lens for a.bAgda Lens for a.bAgda9Compute usable vars from patterns and run subcomputation.bAgdaSet a when going under constructor c.bAgdaSet a$ for arguments following projection q. We disregard j j > k: in context. Returns 3 in this case. Overapproximates.bAgda*Print masked things in double parentheses.bAgda*Only show intermediate nodes. (Drop last <).aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbaaaaaaabbaaabNone #$%-0235679>?GAgdaProduces a function which drops the filename component of the qualified name.bAgda3Drops the filename component of the qualified name. GG``````bbb G`b`````bGbNone #$%-0235679>? bAgdafindInstance 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 Nothing when the type of the meta wasn't known when the constraint was generated. In that case, try to find its type again.bbbbbbbbNone #$%-0235679>?LAgdaguardConstraint c blocker tries to solve blocker 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.LAgda=Don't allow the argument to produce any blocking constraints.bAgdaAdd all constraints belonging to the given problem to the current problem(s).bAgda,Create a fresh problem for the given action.bAgdaWake constraints matching the given predicate (and aren't instance constraints if b).bAgda4Wake up the constraints depending on the given meta.bAgdaWake up all constraints.bAgdaSolve awake constraints matching the predicate. If the second argument is True solve constraints even if already L.LLLLLLbbbbbbbbbbbbbbbbbbbLbbLLLbbbbbLbbbbLNone! #$%-0235679>?bAgdathe kill list is empty or only FalsesbAgda0there is no possible kill (because of type dep.)bAgda%managed to kill some args in the listbAgda$all prescribed kills where performedbAgdaCollect the *definitely* rigid variables in a monoid. We need to successively reduce the expression to do this.bAgdaExtended occurs check.bAgdaUnfold definitions during occurs check? This effectively runs the occurs check on the normal form.bAgda6The passed modality is the one of the current context.bAgda6Extra environment for the occurs check. (Complements 0.)bAgda*The allowed variables with their variance.bAgdaThe meta we want to solve.bAgda/The size of the typing context upon invocation.bAgdaSet the names of definitions to be looked at to the defs in the current mutual block.bAgda,Is a def in the list of stuff to be checked?bAgda3Remove a def from the list of defs to be looked at.bAgdaCheck whether a free variable is allowed in the context as specified by the modality.bAgdaOccurs check fails if a defined name is not available since it was declared in irrelevant or erased context.bAgdaConstruct a test whether a de Bruijn index is allowed or needs to be pruned.cAgda"Leave the strongly rigid position.cAgdaWhen assigning  m xs := v , check that m does not occur in v# and that the free variables of v are contained in xs.cAgdaprune 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.cAgdahasBadRigid 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.)cAgdaCheck whether a term Def f es is finally stuck. Currently, we give only a crude approximation.cAgdaCheck 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.cAgdakillArgs [k1,...,kn] X prunes argument i from metavar X if ki==True. Pruning is carried out whenever > 0 arguments can be pruned.cAgda;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.cAgdaInstantiate a meta variable with a new one that only takes the arguments which are not pruneable.cAgdaMeta to prune.AgdaArguments to meta variable.Agda,Test for allowed variable (de Bruijn index).cAgda,Test for allowed variable (de Bruijn index).AgdaArgument of meta variable.Agda#Exception if argument is matchable.cAgda,Test for allowed variable (de Bruijn index).cAgda9Arguments 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./bbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccccccccccccccc/bbbbbbbbbbbbbbbbbbbccccccccbbbccccccbbbbbbbccccNone #$%'(-0235679>?*TAgdaCheck that the instantiation of the given metavariable fits the type of the metavariable. If the metavariable is not yet instantiated, add a constraint to check the instantiation later.TAgda1Create a sort meta that may be instantiated with - (Set).TAgdaCreate a new value meta with specific dependencies without -expanding.TAgdaCreate a new value meta with specific dependencies, possibly -expanding in the process.TAgda?Create a new metavariable, possibly -expanding in the process.TAgdanewInstanceMeta s t cands creates a new instance metavariable of type the output type of t with name suggestion s.TAgdaMiller pattern unification:assign dir x vs v a solves problem x vs <=(dir) v : a 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.For a reference to some of these extensions, read Andreas Abel and Brigitte Pientka's TLCA 2011 paper.TAgda!Do safe eta-expansions for meta (SingletonRecords,Levels).TAgda(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 ?.cAgda7Exceptions raised when substitution cannot be inverted.cAgdaCannot recover.cAgda=A potentially neutral arg: can't invert, but can try pruning.cAgda&Try to eta-expand var to remove projs.cAgda?Normalize just far enough to be able to eta-contract maximally.cAgda6Check whether one of the meta args is a projected var.cAgdaFind 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.cAgdaCheck whether a meta variable is a place holder for a blocked term.cAgda8Skip frozen check. Used for eta expanding frozen metas.cAgda4Create a sort meta that cannot be instantiated with - (Set).cAgda1Create a sort meta that may be instantiated with - (Set).cAgda,Create a new value meta without -expanding.cAgdaCreate a metavariable of record type. This is actually one metavariable for each field.cAgda6Construct a blocked constant if there are constraints.cAgdaunblockedTester t returns False if t is a meta or a blocked term.?Auxiliary function to create a postponed type checking problem.cAgda)Create a postponed type checking problem e : t that waits for type t to unblock (become instantiated or its constraints resolved).cAgda)Create a postponed type checking problem e : t that waits for conditon unblock. 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.cAgda1Type of the term that is produced by solving the ?.cAgda7Eta expand metavariables listening on the current meta.cAgda/Wake up a meta listener and let it do its thingcAgdaEta expand a metavariable, if it is of the specified kind. Don't do anything if the metavariable is a blocked term.cAgdaEta expand blocking metavariables of record type, and reduce the blocked thing.cAgdaassignMeta 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.cAgdaassignMeta' 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.cAgdaCheck that the instantiation of the metavariable with the given term is well-typed.cAgdaGiven two types a and b with a <: b , check that a == b.cAgdaTurn the assignment problem _X args <= SizeLt u into _X args = SizeLt (_Y args) and constraint  _Y args <= u.cAgda Eta-expand bound variables like z in  X (fst z).cAgdaEta-expand a de Bruijn index of record type in context and passed term(s).cAgdaTurn non-det substitution into proper substitution, if possible. Otherwise, raise the error.cAgdaCheck 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 Vars 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.cAgda Turn open metas into postulates.Preconditions: We are O.< is set to the top-level module.cAgdaSort metas in dependency order.cAgda)a possibly non-deterministic substitutioncAgda"Should the meta be created frozen?AgdaName of record typeAgdaParameters of record type.cAgda 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.cAgdaMeta variable arguments.AgdaRight hand side.TTTTTTTTTTTTTccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccTccTcccccTcTTTcccTTcTTcccccccccccccccTcccTccTccccccccccccccccccccccNone #$%-0235679>?! cAgda'Size constraint with de Bruijn indices.cAgdaDeBruijn indicescAgda Living in Context.cAgda Living in Context.cAgda'Size expression with de Bruijn indices.cAgdaSize metas in size expressions.cAgdaDe Bruijn indices.cAgda Identifiers for rigid variables.dAgda$Name for printing in debug messages.dAgdaDe Bruijn index.dAgda,Flag to control the behavior of size solver.dAgda2Instantiate all unconstrained size variables to D.dAgda,Leave unconstrained size variables unsolved.dAgda,Solve size constraints involving hypotheses.dAgda"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 A of N! extended by some local bindings A.  is the current context. The module parameter substitution from current M to N be   E  : A.If M == N=, we do not need the parameter substitution. We try raising.We first strengthen  E c to live in A and obtain cA = strengthen A c. We then transport cA to  and obtain cA = applySubst  cA.)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 A and then raise by A - A0. This "raising" might be a strengthening if A is shorter than A.:(TODO: If the module substitution does not exist, because N is not a parent of M, we cannot use the constraint, as it has been created in an unrelated context.)dAgda0A hazardous hack, may the Gods have mercy on us.To 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.dAgdaReturn the size metas occurring in the simplified constraints. A constraint like C _j =< D : Size simplifies to nothing, so _j would not be in this set.dAgda2Solve a cluster of constraints sharing some metas.dAgdaCollect constraints from a typing context, looking for SIZELT hypotheses.dAgdaConvert 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.dAgdaTurn a constraint over de Bruijn indices into a size constraint.dAgda#Turn a term into a size expression.Returns n, if the term isn't a proper size expression.dAgda&Turn a de size expression into a term.dAgda Only for 1.dAgda*An order which ignores the meta arguments.dAgda-An equality which ignores the meta arguments.dAgda$Assumes we are in the right context.cccccccccccccddddddddddddddddddddddddddddcdddccccccccccccdddNone #$%-0235679>?2ZAgda9Check 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.ZAgda.Check that the first sort equal to the second.ZAgda+equalTermOnFace  A u v = _ ,  E u = v : A[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 terms or types.[Agda!Type directed equality on values.dAgdaTry whether a computation runs without errors or new constraints (may create new metas, though). Restores state upon failure.dAgdaTry whether a computation runs without errors or new constraints (may create new metas, though). Return n$ the result upon success. Return n and restore state upon failure.dAgdaCheck if to lists of arguments are the same (and all variables). Precondition: the lists have the same length.dAgdaintersectVars 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.dAgda$Ignore errors in irrelevant context.dAgdaTry to assign meta. If meta is projected, try to eta-expand and run conversion check again.dAgdaCompute 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.dAgdaWhen 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.dAgdaCompare 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...)dAgda 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.dAgdaAccount for situations like k : (Size< j) <= (Size< k + 1)Actually, the semantics is (Size<= k) D (Size< j) E rhs which gives a disjunctive constraint. Mmmh, looks like stuff TODO."For now, we do a cheap heuristics.dAgdaPrecondition: levels are Vd.dAgdaleqInterval r q = r D q in the I lattice. (D r_i) D (D q_j) iff D i. D j. r_i D q_jdAgdaleqConj r q = r D q in the I lattice, when r and q are conjuctions. ' (D r_i) D (D q_j) iff ' (D r_i) D (D q_j) = (D r_i) iff ' {r_i | i} D {q_j | j} = {r_i | i} iff ' {q_j | j} E {r_i | i}d Agdacmp The comparison directionAgdaa1 The smaller domain.Agdaa2 The other domain.Agdab1 The smaller codomain.Agdab2 The bigger codomain.AgdaContinuation if mismatch in .AgdaContinuation if mismatch in .AgdaContinuation if mismatch in .AgdaContinuation if mismatch in . Agda)Continuation if comparison is successful.5ZZZZZZZZZZ[[[[[[[[[dddddddddddddddddddddddddddddddddd5ZddddZdZd[[dddd[dd[dddddddd[ddd[[ZddZ[ZZZdZddddddZ[ddNone #$%-0235679>?4dAgda"Argument should be a term of type  Term C 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).!ddddddddddddddddddddddddddddddddd!dddddddddddddddddddddddddddddddddNone #$%-0235679>?8eAgdaUnification succeeded.eAgdaTerms are not unifiable.eAgda1Some other error happened, unification got stuck.eAgda Result of e.eAgdaUnify indices.In unifyIndices gamma flex a us vs,us and vs3 are the argument lists to unify, eliminating type a.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.eAgdaDon't ever reduce the whole n, as it will destroy readability of the context in interactive editing! To make sure this insight is not lost, the following dummy instance should prevent a proper V instance for n.eAgda gammaAgda flexAgda aAgda usAgda vseeeeeeeeeeeeNone  #$%-0235679>?:#eAgdaCheck confluence of the given clause wrt rewrite rules of the constructors it matches againstCheck confluence of the given rewrite rules wrt all other rewrite rules (also amongst themselves).eeeeNone #$%'(-0235679>??e FAgdarewrite b v rules es tries to rewrite v applied to es with the rewrite rules rules. b is the default blocking tag.FAgdaCheck that the name given to the BUILTIN REWRITE is actually a relation symbol. I.e., its type should be of the form  C (lhs : A) (rhs : B) C Set B. Note: we do not care about hiding/non-hiding of lhs and rhs.eAgdaDeconstructing a type into  C t C t' C core.eAgdaThe whole telescope , t, t'.eAgda.eAgdat.eAgdat'.eAgdacore.eAgdaDeconstructing a type into  C t C t' C core . Returns Nothing if not enough argument types.eAgda?@FAgda)The entry point to the reduction machine.FFFFn2n2None #$%-0235679>?B?eAgda+addClause f (Clause {namedClausePats = ps}) checks that f ps$ reduces in a way that agrees with IApply reductions.eAgda"current context is of the form .eAgdaLike  unifyElims but  is from the the meta's MetaInfo and the context extension  is taken from the Closure.eAgda&variables to keep  E x_n .. x_0 : Agda variables to solve . E ts : eeeeeeeeNone #$%-0235679>?CzeAgda=Generalize a telescope over a set of generalizable variables.eAgda?Generalize a type over a set of (used) generalizable variables.eAgdaAllow returning additional information from the type checking action.eeeeeeNone #$%-0235679>?PG eAgdaReturn the parameters that share variables with the indices nonLinearParameters :: Int -> Type -> TCM [Int] nonLinearParameters nPars t =eAgdaA Type that either has sort Type l or is a closed definition. Such a type supports some version of transp. In particular we want to allow the Interval as a  ClosedType.eAgdaA Type with sort Type l/ Such a type supports both hcomp and transp.eAgdaType check a datatype definition. Assumes that the type has already been checked.eAgdaEnsure that the type is a sort. If it is not directly a sort, compare it to a c.eAgdaType check a constructor declaration. Checks that the constructor targets the datatype and that it fits inside the declared sort. Returns the non-linear parameters.eAgdaDefine projections for non-indexed data types (families don't work yet). Of course, these projections are partial functions in general.Precondition: we are in the context  of the data type parameters.eAgda&Bind the named generalized parameters.eAgda"Bind the parameters of a datatype.We allow omission of hidden parameters at the definition site. Example:  data D {a} (A : Set a) : Set a data D A where c : A -> D A eAgdaCheck that the arguments to a constructor fits inside the sort of the datatype. The third argument is the type of the constructor.6As a side effect, return the arity of the constructor.eAgdaWhen --without-K is enabled, we should check that the sorts of the index types fit into the sort of the datatype.eAgdaCheck that a type constructs something of the given datatype. The first argument is the number of parameters to the datatype and the second the number of additional non-parameters in the context (1 when generalizing, 0 otherwise).eAgda!Is the type coinductive? Returns n% if the answer cannot be determined.eAgdaName of data type.AgdaCheck universes?AgdaParameter telescope.Agda#Number of indices of the data type.AgdaSort of the data type.Agda)Constructor declaration (type signature).eAgdaPathCons, . E u : R Agda%how to apply a "projection" to a termAgdasome name, e.g. record nameAgda param types Agdafields' types  E Agda fields' namesAgdarecord type  E TeAgdaPathCons, . E u : R Agda%how to apply a "projection" to a termAgdasome name, e.g. record nameAgda param types Agdafields' types  E Agda fields' namesAgdarecord type  E TeAgda%how to apply a "projection" to a termAgdasome name, e.g. record nameAgda param types Agdafields' types  E Agda fields' namesAgdarecord type ( : ) E R[]eAgdaNumber of parametersAgdaBindings 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.eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeNone #$%-0235679>?T [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.[AgdaCheck if sort is well-formed.[Agda Check a type and infer its sort.Necessary because of PTS rule (SizeUniv, Set i, Set i) but SizeUniv is not included in any Set i.This algorithm follows Abel, Coquand, Dybjer, MPC 08, Verifying a Semantic -Conversion Test for Martin-Lf Type Theory[Agda/Entry point for e.g. checking WithFunctionType.[Agda(The default action is to not change the - at all.eAgda/Called on each subterm before the checker runs.eAgda/Called on each subterm after the type checking.fAgdaCalled for each ArgInfo. The first / is from the type, the second from the term.fAgdaCompute the sort of a type.[eeef[[[[[[[[[`f[[[[[[[eeef[[[f`None #$%-0235679>?U(ffffffffffNone #$%-0235679>?V-fAgdaEta-expand a term if its type is a function type or an eta-record type.fAgdaEta-expand functions and expressions of eta-record type wherever possible.ffffffNone #$%-0235679>?Yx fAgda subst u . absTerm u == idfAgdaisPrefixOf u v = Just es if v == u 1 es.fAgdaabstractType a v b[v] = b where a : v.fAgda3piAbstractTerm NotHidden v a b[v] = (w : a) -> b[w] 3piAbstractTerm Hidden v a b[v] = {w : a} -> b[w]fAgda (piAbstract (v, a) b[v] = (w : a) -> b[w]For rewrite, it does something special: piAbstract (prf, Eq a v v') b[v,prf] = (w : a) (w' : Eq a w v') -> b[w,w']fAgda This swaps var 0 and var 1.fAgdaIgnores irrelevant arguments and modality. (And, of course, origin and free variables).fAgdaIgnore the tactic.fAgda!Ignore origin and free variables.fAgdaIgnores -.fAgdaIgnores sorts. fffffffffff fffffffffffNone #$%-0235679>?lfAgda6Split pattern variables according to with-expressions.fAgdaAbstract with-expressions vs+ to generate type for with-helper function.Each  EqualityType, coming from a rewrite , will turn into 2 abstractions.fAgdaFrom a list of with and rewrite; expressions and their types, compute the list of final with" expressions (after expanding the rewrites).fAgdaCompute the clauses for the with-function given the original patterns.fAgda >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 D b  SEq as bs test : (s : Nat  Stream Nat) (t : Stream Nat) C SEq (delay s) t C 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) C (fst w D a)  SEq (snd w) as  = t a as p -- reorder to bring with-relevant (= needed) vars first  = a as t p C  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 [..] is to be understood as substitution. The projection patterns have vanished from ps' (as they are already in qs).fAgdaConstruct 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 fAgda1 context of types and with-arguments.Agda E t type of rhs.Agda  E vs : as+ with arguments and their types. Output:Agda(A,A,,t',vtys') where A:part of context needed for with arguments and their types.A>part of context not needed for with arguments and their types.*permutation from  to AA as returned by X. AA E t'type of rhs under  A E vtys'%with-arguments and their types under .fAgdaA8 context for types of with types.AgdaA,A E vs : raise A as. with and rewrite-expressions and their type.AgdaA E A> context extension to type with-expressions.Agda A,A E b type of rhs.AgdaA C wtel C A@ C b@ such that [vs/wtel]wtel = as and [vs/wtel]A@ = A and [vs/wtel]b@ = b+. Plus the final number of with-arguments.f 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.f 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 ).fAgdaThe name of parent function.AgdaThe name of the with -function.AgdaA The arguments of the with function before the with expressions.AgdaA 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.ffffffffffffffffNone! #$%'(-0235679>?p,fAgda:The result of termination checking a module. Must be a n and have .fAgda4Entry point: Termination check a single declaration.Precondition: < must be set correctly.fAgda8Entry point: Termination check the current mutual block.fAgda/Extract recursive calls from level expressions.fAgda$Extract recursive calls from a term.fAgda$Extract recursive calls from a type.fAgda*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.fAgdaThe function names defined in this block on top-level. (For error-reporting only.)ffffffNone #$%-0235679>?pfAgda Check that   E  : .ffffNone #$%-0235679>?pffNone #$%-0235679>?q?ffNone #$%-0235679>?qfAgdaLine reader. The line reader history is not stored between sessions.:Bf:BfNone #$%-0235679>?szfAgdaThe JSON version ofG , for encoding JSON value in TCMfAgdaTCM monadic version of objectfAgda'Pairs a key with a value wrapped in TCMfAgda"Abbreviation of `_ #= encodeTCM _`fAgdaA handy alternative of f with kind specifiedfAgdaA handy alternative of o with kind specified fffffff fffffff None #$%-0235679>?sffffffffffffffffNone #$%-0235679>?wefAgdaRecords already processed modules and maps them to an internal identifier.fAgdaSupply of internal identifiers.fAgdaEdges of dependency graph.fAgdaInternal module identifiers for construction of dependency graph.fAgda Translate a  to an internal f . Returns True if the  is new, i.e., has not been encountered before and is thus added to the map of processed modules.fAgda%Add an arc from importer to imported.fAgda4Recursively build import graph, starting from given @. Modifies the state in f and returns the f of the @.fAgdaGenerate a .dot file for the import graph starting with the given @ and write it to the file specified by the command line option. ffffffffffff ffffffffffffNone #$%-0235679>?xfAgda Converts the & and &1 fields to strings that are friendly to editors.fAgdaChoose which method to use based on HighlightingInfo and HighlightingMethodffffNone #$%-0235679>?xffffNone #$%-0235679>?y+ffNone #$%-0235679>?ytggNone #$%-0235679>?yggNone #$%-0235679>?z9gAgda'Takes the name of the data/record type.HggggHNone #$%-0235679>?zggggggggggggNone #$%-0235679>?zggNone #$%-0235679>?{0ggNone #$%-0235679>?|0gAgda$Insert unsafeCoerce (in the form of ) everywhere it's needed in the right-hand side of a definition.gAgda/The number of retained arguments after erasure.ggggNone #$%-0235679>?~gAgdaCalls 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).Uses the debug printout machinery to relay any progress information the compiler prints to stdout.gAgdaGeneralisation of  callCompiler) where the raised exception is returned.gAgda$Should we actually call the compilerAgdaThe path to the compilerAgdaCommand-line arguments.gAgdaThe path to the compilerAgdaCommand-line arguments.ggggNone #$%-0235679>?gAgda7Turns syntax highlighting information into a JSON valuegAgda:Must contain a mapping for every definition site's module.ggNone #$%-0235679>?3HAgdaHighlight a warning.gAgdaHighlighting levels.gAgdaFull highlighting. Should only be used after typechecking has completed successfully.gAgdaHighlighting without disambiguation of overloaded constructors.gAgdaGenerate syntax highlighting information for the given declaration, and (if appropriate) print it. If the boolean is n, then the state is additionally updated with the new highlighting info (in case of a conflict new info takes precedence over old info).The procedure makes use of some of the token highlighting info in A (that corresponding to the interval covered by the declaration). If the boolean is n, then this token highlighting info is additionally removed from A.gAgdaGenerate and return the syntax highlighting information for the tokens in the given file.gAgdaGenerate and return the syntax highlighting information for the tokens in the given file.gAgdaGenerate and return the syntax highlighting information for the tokens in the given string, which is assumed to correspond to the given range.gAgda-Prints syntax highlighting info for an error.gAgda Generate highlighting for error.gAgda*Generate syntax highlighting for warnings.gAgdaGenerates and prints syntax highlighting information for unsolved meta-variables and certain unsolved constraints.gAgdaGenerates syntax highlighting information for unsolved meta variables.gAgdaGenerates syntax highlighting information for unsolved constraints (ideally: that are not connected to a meta variable).gAgdaRemember a name disambiguation (during type checking). To be used later during syntax highlighting.gAgdaStore a disambiguation of record field tags for the purpose of highlighting.gAgdaUpdate the state?gAgdaThe module to highlight.Agda)The file contents. Note that the file is not read from disk.gAgda*Record field names in a record expression.Agda>Record field names in the corresponding record type definitionHKKgggggggggggggggggggggggggggKKHgggggNone #$%-0235679>? gAgda'Result of checking the LHS of a clause.gAgdaThe number of original module parameters. These are present in the the patterns.gAgda : The types of the pattern variables, in internal dependency order. Corresponds to -.gAgda The patterns in internal syntax.gAgda0Whether the LHS has at least one absurd pattern.gAgdaThe type of the body. Is b if  is defined. 8 to indicate the rhs must be checked in irrelevant mode.gAgdaSubstitution version of  lhsPatterns,, only up to the first projection pattern.  |- lhsPatSubst : . Where  is the argument telescope of the function. This is used to update inherited dot patterns in with-function clauses.gAgdaAs-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).gAgdahave we done a partial split?gAgdaA pattern is flexible if it is dotted or implicit, or a record pattern with only flexible subpatterns.gAgdaBind as patternsgAgdaCheck 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.gAgdaLists of flexible patterns are ^.gAgda Trace, e.g. = or =.Agda+The name of the definition we are checking.Agda The patterns.AgdaThe expected type  a =  C b.Agda4Module parameter substitution from with-abstraction.AgdaPatterns that have been stripped away by with-desugaring. ^ These should not contain any proper matches.Agda Continuation.ggggggggggggggggggggggggggggggggNone #$%-0235679>?r,FAgdaRun a tactic `tac : Term C TC E` in a hole (second argument) of the type given by the third argument. Runs the continuation if successful.FAgda=Checking a lambda whose domain type has already been checked.FAgdaInfer the type of an expression. Implemented by checking against a meta variable. Except for neutrals, for them a polymorphic type is inferred.FAgdaType check an expression.FAgdaCheck that an expression is a type and infer its (minimal) sort.gAgda(Flag to control resurrection on domains.gAgdaWe are checking a module telescope. We pass into the type world to check the domain type. This resurrects the whole context.gAgdaWe 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.gAgda#Check that an expression is a type.gAgda,Check that an expression is a type. * If  c == CmpEq3, the given sort must be the minimal sort. * If  c == CmpLeq(, the given sort may be any bigger sort.gAgda?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 t should not matter, as we are only checking whether its sort reduces to -.gAgdaCheck that an expression is a type which is equal to a given type.gAgdaType check a (module) telescope. Binds the variables defined by the telescope.gAgdaType check the telescope of a dependent function type. Binds the resurrected variables defined by the telescope. The returned telescope is unmodified (not resurrected).gAgdaType check a telescope. Binds the variables defined by the telescope.gAgdaCheck a typed binding and extends the context with the bound variables. The telescope passed to the continuation is valid in the original context.Parametrized by a flag wether we check a typed lambda or a Pi. This flag is needed for irrelevance.gAgdaAfter a typed binding has been checked, add the patterns it bindsgAgda7Check a tactic attribute. Should have type Term C TC E.gAgdaType check a lambda expression. "checkLambda bs e ty" means ( bs -> e) : tygAgdaCheck that modality info in lambda is compatible with modality coming from the function type. If lambda has no user-given modality, copy that of function type.gAgdaCheck 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.gAgdaCheck that quantity info in lambda is compatible with quantity coming from the function type. If lambda has no user-given quantity, copy that of function type.gAgdaCheck that cohesion info in lambda is compatible with cohesion coming from the function type. If lambda has no user-given cohesion, copy that of function type.gAgdaInsert hidden lambda until the hiding info of the domain type matches the expected hiding info. Throws :gAgdacheckAbsurdLambda i h e t# checks absurd lambda against type t. Precondition: e = AbsurdLam i hgAgda%checkExtendedLambda i di qname cs e t/ check pattern matching lambda. Precondition: e = ExtendedLam i di qname csgAgdaRun a computation.&If successful, that's it, we are done.If IlltypedPattern p a, NotADatatype a or CannotEliminateWithPattern p a is thrown and type a is blocked on some meta x?, reset any changes to the state and pass (the error and) x to the handler.If +SplitError (UnificationStuck c tel us vs _), is thrown and the unification problem us =?= vs : tel is blocked on some meta x pass x to the handler.(If another error was thrown or the type a# is not blocked, reraise the error.Note that the returned meta might only exists in the state where the error was thrown, thus, be an invalid  in the current state.gAgdaPicks up record field assignments from modules that export a definition that has the same name as the missing field.gAgdacheckRecordExpression fs e t) checks record construction against type t. Precondition  e = Rec _ fs.gAgda 'checkRecordUpdate cmp ei recexpr fs e tPreconditions: e = RecUpdate ei recexpr fs and t is reduced.gAgdaRemove top layers of scope info of expression and set the scope accordingly in the .gAgda*Unquote a TCM computation in a given hole.gAgda-Check an interaction point without arguments.gAgda&Check an underscore without arguments.gAgdaType check a meta variable.gAgdaInfer the type of a meta variable. If it is a new one, we create a new meta for its type.gAgdaType 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.gAgdaTurn a domain-free binding (e.g. lambda) into a domain-full one, by inserting an underscore for the missing type.gAgda,Check arguments whose value we already know.This 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.gAgdaCheck a single argument.gAgdaUsed to check aliases f = e. Switches off <+ for the checking of top-level application.gAgda?Check whether a de Bruijn index is bound by a module telescope.gAgda=Infer the type of an expression, and if it is of the form  {tel} -> D vs for some datatype D then insert the hidden arguments. Otherwise, leave the type polymorphic.FAgda Unreduced!gAgdaExpected hiding.AgdaExpected to be a function type.AgdaContinuation on blocked type.AgdaContinuation when expected hiding found. The continuation may assume that the Type is of the form (El _ (Pi _ _)).Agda!Term with hidden lambda inserted.gAgdaModules and field assignments.Agda#Names of fields of the record type.Agda)Completed field assignments from modules.gAgdaHow do we related the inferred type of the record expression to the expected type? Subtype or equal type?Agdamfs : modules and field assignments.AgdaMust be  A.Rec _ mfs.Agda#Expected type of record expression.Agda Record value in internal syntax.gAgda cmpAgda eiAgda recexprAgda fsAgda e = RecUpdate ei recexpr fsAgdaReduced.gAgda Not reduced!gAgda5User-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.9FFFFFFFgggggggggggggggggggggggggggggggggggggggggggggggggg9ggFggggggggggggggggggggggFgggggggggFFFgFgggggggggFgggggggNone #$%-0235679>?egAgdabindPostulatedName 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 > of q.gAgda&Bind a builtin thing to an expression.gAgda#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.ggggggggggggNone #$%-0235679>?UAgda3Binds the FLAT builtin, and changes its definition.UAgdaBinds the SHARP builtin, and changes the definitions of INFINITY and SHARP.UAgdaBinds the INFINITY builtin, but does not change the type's definition.UAgda The type of L.UAgda The type of L_.UAgda The type of D.UUUUUUUUUUUUNone  #$%-0235679>? gAgdaas seen from inside the modulegAgda*Temporary data type to scope check a file.hAgda/The file path from which we loaded this module.hAgdaThe expected module name (coming from the import statement that triggered scope checking this file).hAgdaThe file content.hAgdaThings that can be translated to abstract syntax are instances of this class.hAgdaThis operation does not affect the scope, i.e. the original scope is restored upon completion.hAgdaThe top-level module name.hAgdaContent of interaction hole.hAgda%Top-level declarations are always  (import|open)* -- a bunch of possibly opened imports module ThisModule ... -- the top-level module of this file hAgdaScope check an expression.ggggggghhhhhhhhhhhhhhhhhhhhhhhhhhhhgghhhgggghghhhhhhNone #$%-0235679>?ohAgdaA Covering is the result of splitting a h.hAgdaDe Bruijn level (counting dot patterns) of argument we split on.hAgdaCovering clauses, indexed by constructor/literal these clauses share.hAgdaType of variables in scPats.hAgdaThe patterns leading to the currently considered branch of the split tree.hAgdaSubstitution from h to old context. Only needed directly after split on variable: * To update h * To rename other split variables when splitting on multiple variables. scSubst is not ` transitive', i.e., does not record the substitution from the original context to h over a series of splits. It is freshly computed after each split by computeNeighborhood ; also h, which does not split on a variable, should reset it to the identity 1, lest it be applied to h again, leading to Issue 1294.hAgdaWe need to keep track of the module parameter checkpoints for the clause for the purpose of inferring missing instance clauses.hAgda'The type of the rhs, living in context h. o computes the new h by applying substitution h.hAgda,Project the split clauses out of a covering.hAgdaCreate a split clause from a clause in internal syntax. Used by make-case.hAgda1Top-level function for checking pattern coverage.Effects:3Marks unreachable clauses as such in the signature.0Adds missing instances clauses to the signature.hAgdaTop-level function for eliminating redundant clauses in the interactive case splitterhAgdaAdd more patterns to split clause if the target type is a function type. Returns the domains of the function type (if any).hAgdaEntry point from Interaction.MakeCase.hAgdaEntry point from TypeChecking.Empty and Interaction.BasicOps. splitLast CoInductive is used in the refine tactics.hAgdasplitResult for MakeCase, tries to introduce IApply or ProjP copatternshAgdaFor debugging only.hAgdaName f of definition.Agda7Absolute type (including the full parameter telescope).Agda Clauses of f!. These are the very clauses of f in the signature.]hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh]None #$%-0235679>?ZAgdaCheck whether one of the types in the given telescope is constructor-less and if yes, return its index in the telescope (0 = leftmost).ZAgdaEnsure that a type is empty. This check may be postponed as emptiness constraint.ZAgda0Check whether some type in a telescope is empty.ZAgdaCheck whether a type is empty.ZAgdaRange of the absurd pattern.AgdaType that should be empty (empty data type or iterated product of such).ZZZZZZZZNone #$%-0235679>?> HAgdaProcess 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.hAgdaStripped-down version of - used in clause compiler.hAgda8Pattern variables are considered in left-to-right order.hAgdaStrip down a clause. Don't forget to apply the substitution to the dot patterns!hAgdaGet 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.hAgdaIs is not a variable pattern? And if yes, is it a record pattern and/or a fallThrough one?hAgdaIs this a variable pattern?Maintain invariant: isVar = isNothing . properSplit!hAgdasplitOn single n cs* will force expansion of catch-alls if single.hAgda4Expand 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:  f x false = a f false = _ -> b f x true = c  case tree:  f x y = case y of true -> case x of true -> c false -> b false -> a Example from issue #3628:  f i j k (i = i0)(k = i1) = base f i j k (j = i1) = base  case tree:  f i j k o = case i of i0 -> case k of i1 -> base _ -> case j of i1 -> base _ -> case j of i1 -> base hAgda?ӐhAgda '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.iAgda(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 checkedh AgdaPosition and other info.AgdaRecord type identifier.AgdaCheck universes?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.iAgdaDatatype name.Agda parameters.AgdaProjection names.Agda E  field types.Agda E T target type.iAgdasome name, e.g. record nameAgda param types Agdafields' types  E Agda fields' namesAgdarecord type  E TiAgdasome name, e.g. record nameAgda param types Agdafields' types  E Agda fields' namesAgdarecord type  E ThiiiihiiiiNone #$%-0235679>?UAgdaSet =" according to termination info in 4, which comes from a possible termination pragma.UAgda)Enter a new section during type-checking.UAgda,Type check a definition by pattern matching.iAgda,Which argument indexes have a partial split.iAgdaParameters for creating a with -function.iAgdaParent function name.iAgdaWith function name.iAgdaType of the parent function.iAgdaContext of the parent patterns.iAgdaTypes of arguments to the with function before the with expressions (needed vars).iAgdaTypes of arguments to the with function after the with expressions (unneeded vars).iAgda-With and rewrite expressions and their types.iAgdaType of the right hand side.iAgdaParent patterns.iAgda.Number of module parameters in parent patternsiAgdaPermutation resulting from splitting the telescope into needed and unneeded vars.iAgda;Permutation reordering the variables in the parent pattern.iAgdaFinal permutation (including permutation for the parent clause).iAgda'The given clauses for the with functioniAgdaA single clause without arguments and without type signature is an alias.iAgda'Check a trivial definition of the form f = eiAgda,Type check a definition by pattern matching.iAgdaInsert some with-patterns into the with-clauses LHS of the given RHS. (Used for rewrite.)iAgdaInsert with-patterns before the trailing with patterns. If there are none, append the with-patterns.iAgdaThe LHS part of checkClause.iAgdaType check a function clause.iAgdaType check the with and rewrite lhss and/or the rhs.iAgdaInvoked in empty context.iAgdaType check a where clause.iAgdaSet 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)Agdadoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)Agdais it a with function (if so, what's the name of the parent function)Agda range infoAgdathe name of the functionAgdathe clauses to checki Agda'the type we expect the function to haveAgdais it irrelevant (for instance)Agda2are the clauses delayed (not unfolded willy-nilly)Agdadoes the definition come from an extended lambda (if so, we need to know some stuff about lambda-lifted args)Agdais it a with function (if so, what's the name of the parent function)Agda range infoAgdathe name of the functionAgdasubstitution (from with abstraction) that needs to be applied to module parametersAgdathe clauses to checkiAgda(Type of function defined by this clause.Agda?liAgda-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.iiiiNone #$%-0235679>? FAgdaChecking the type of an overloaded projection application. See o.FAgdaPrecondition: Application hd args = appView e.FAgdacheckApplication hd args e t) checks an application. Precondition: Application hs args = appView echeckApplication1 disambiguates constructors (and continues to o#) and resolves pattern synonyms.FAgdaCheck that a list of arguments fits a telescope. Inserts hidden arguments as necessary. Returns the type-checked arguments and the remaining telescope.FAgda!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.FAgda)Eagerly insert trailing hidden arguments?AgdaRange of application.AgdaArguments to check.Agda%Telescope to check arguments against.Agda8Checked arguments and remaining telescope if successful.FFFFFFFFFFNone #$%-0235679>?=FAgdaCheck an application of a section (top-level function, includes K).FAgda Type check a single declaration.FAgda&Type check a sequence of declarations.iAgdaCached checkDecliAgdaCheck 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).iAgdaRun a reflected TCM computatation expected to define a given list of names.iAgdaInstantiate all metas in > associated to . Makes sense after freezing metas. Some checks, like free variable analysis, are not in , so they will be more precise (see issue 1099) after meta instantiation. Precondition: name has been added to signature already.iAgdaHighlight a declaration. Called after checking a mutual block (to ensure we have the right definitions for all names). For modules inside mutual blocks we haven't highlighted their contents, but for modules not in a mutual block we have. Hence the flag.iAgda Termination check a declaration.iAgda+Check a set of mutual names for positivity.iAgdaCheck that all coinductive records are actually recursive. (Otherwise, one can implement invalid recursion schemes just like for the old coinduction.)iAgda7Check a set of mutual names for constructor-headedness.iAgda4Check 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.iAgda>Freeze metas created by given computation if in abstract mode.iAgdaType check an axiom.iAgdaData and record type signatures need to remember the generalized parameters for when checking the corresponding definition, so for these we pass in the parameter telescope separately.iAgda,Type check a primitive function declaration.iAgdaCheck a pragma.iAgda=Type check a bunch of mutual inductive recursive definitions.All definitions which have so far been assigned to the given mutual block are returned.iAgdaType check the type signature of an inductive or recursive definition.iAgdaType check a module.iAgda Helper for F.Matches the arguments of the module application with the module parameters.Returns the remaining module parameters as an open telescope. Warning: the returned telescope is not the final result, an actual instantiation of the parameters does not occur.iAgda"Check an application of a section.iAgdaType check an import declaration. Actually doesn't do anything, since all the work is done when scope checking.FAgdaName m1' of module defined by the module macro.AgdaThe module macro  tel C m2 args.AgdaImported names and modulesiAgdaName of applied module.AgdaThe module parameters.Agda(The arguments this module is applied to.Agda>The remaining module parameters (has free de Bruijn indices!).iAgdaName m1' of module defined by the module macro.AgdaThe module macro  tel C m2 args.AgdaImported names and modules$FFFiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii$iFFiiiiiiiiiiiiiiiiiiiiiiiiiiiFiiiiiNone #$%-0235679>?FFFFiFFiFFNone #$%-0235679>?UiAgda Formats the %1 tag for the Emacs backend. No quotes are added.iAgdaTurns syntax highlighting information into a list of S-expressions.iAgda:Must contain a mapping for every definition site's module.iiiiNone #$%-0235679>? iAgdaParses an expression.iAgdaAfter a give, redo termination etc. checks for function which was complemented.iAgdaTry to fill hole by expression.Returns the given expression unchanged (for convenient generalization to i).iAgda!Try to refine hole by expression e.)This amounts to successively try to give e, e ?, e ? ?3, ... Returns the successfully given expression.iAgda9Evaluate the given expression in the current environment iAgdaModifier for interactive commands, specifying the amount of normalization in the output.iAgdaModifier for the interactive computation command, specifying the mode of computation and result display.iAgdaModifier for interactive commands, specifying whether safety checks should be ignored.iAgdaGoals and WarningsiAgdaPrint open metas nicely.iAgda2Collecting the context of the given meta-variable.iAgdagetSolvedInteractionPoints True returns all solutions, even if just solved by another, non-interaction meta. getSolvedInteractionPoints False5 only returns metas that are solved by a non-meta.iAgdaCreate type of application of new helper function that would solve the goal.iAgdaGives a list of names and corresponding types. This list includes not only the local variables in scope, but also the let-bindings.iAgdaReturns 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.iAgdaThe intro tactic.Returns the terms (as strings) that can be used to refine the goal. Uses the coverage checker to find out which constructors are possible.iAgdaRuns 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.iAgda8Check whether an expression is a (qualified) identifier.iAgda3Returns the contents of the given module or record.iAgda4Returns the contents of the given record identifier.iAgda)Returns the contents of the given module.iAgdaSkip safety checks?AgdaHole.AgdaThe expression to give.Agda9If successful, the very expression is returned unchanged.iAgdaSkip safety checks when giving?AgdaHole.Agda'The expression to refine the hole with.Agda"The successfully given expression.iAgda Normalise?iAgda"How should the types be presented?AgdaThe range of the next argument.AgdaThe module name.AgdaModule names, context extension needed to print types, names paired up with corresponding types.iAgda!Amount of normalization in types.Agda%Expression presumably of record type.AgdaModule names, context extension, names paired up with corresponding types.iAgda!Amount of normalization in types.Agda Module name.AgdaModule names, context extension, names paired up with corresponding types.-iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii-iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiNone #$%-0235679>? jjNone #$%-0235679>? jAgdaLookup the clause for an interaction point in the signature. Returns the CaseContext, the previous clauses, the clause itself, and a list of the remaining ones.jAgdaParse variables (visible or hidden), returning their de Bruijn indices. Used in j.jAgda&Entry point for case splitting tactic.jAgdaMake the given pattern variables visible by marking their origin as  and pattern origin as , in the h.jAgda2Make clause with no rhs (because of absurd match).jAgda*Make a clause with a question mark as rhs.jAgdaThe 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).AgdaThe computed de Bruijn indices of the variables to split on, with information about whether each variable is in scope. jjjjjjjjjj jjjjjjjjjjNone #$%-0235679>? Q.jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj.jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjNone #$%-0235679>? !HAgdaAre we loading the interface for the user-loaded file or for an import?HAgdaFor the main file.+In this case state changes inflicted by j are preserved.HAgdaFor an imported file.+In this case state changes inflicted by j are not preserved.HAgdaIs the aim to type-check the top-level module, or only to scope-check it?HAgdaScope checks the given module. A proper version of the module name (with correct definition sites) is returned.jAgda'Some information about the source code.jAgda Source code.jAgdaSource file typejAgdaThe parsed module.jAgdaThe top-level module name.jAgda Computes a j record for the given file.jAgda"Should state changes inflicted by j be preserved?jAgda0Merge an interface into the current proof state.jAgdaIf 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 H is H j).jAgdaType 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 H is j, 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 (@). Note, however, that if the file has already been type-checked, then a complete interface is returned.jAgdaTries 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 j instead.jAgdaSee j.jAgdaA more precise variant of j. If warnings are encountered then they are returned instead of being turned into errors.jAgdaCheck if the options used for checking an imported module are compatible with the current options. Raises Non-fatal errors if not.jAgdaCheck whether interface file exists and is in cache in the correct version (as testified by the interface file hash).jAgda6Try to get the interface from interface file or cache.jAgda7Run the type checker on a file and create an interface.Mostly, this function calls j. 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.jAgdaFormats and outputs the Checking, Finished and "Loading " messages.jAgdaPrint the highlighting information contained in the given interface.jAgda.Read interface file corresponding to a module.jAgda-Writes the given interface to the given file..The written interface is decoded and returned.jAgdaTries 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.If appropriate this function writes out syntax highlighting information.jAgda8Collect all warnings that have accumulated in the state.jAgdaExpert version of j; if isMain is a H:, the warnings definitely include also unsolved warnings.jAgdaReconstruct the @ (not serialized) from the @ (serialized).jAgdaBuilds an interface for the current module, which should already have been successfully type checked.jAgdaReturns (iSourceHash, iFullHash) We do not need to check that the file exist because we only accept  InterfaceFile as an input and not arbitrary  AbsolutePath!jAgdaTrue if the first file is newer than the second file. If a file doesn't exist it is considered to be infinitely old. jAgdaImported user warningsAgda.Name of imported definitions which are partialjAgdaThe path to the file.Agda7Should the file be type-checked, or only scope-checked?Agda"Information about the source code.jAgda+Optional information about the source code.jAgda+Optional information about the source code.jAgdaModule name of file we process.AgdaFile we process.jAgdaModule name of file we process.AgdaFile we process.Agda+Optional information about the source code.AgdaBool' is: do we have to merge the interface?jAgdaModule name of file we process.AgdaFile we process.Agda+Optional information about the source code.AgdaBool' is: do we have to merge the interface?jAgdaThe prefix, like Checking, Finished, Loading .AgdaThe module name.AgdaOptionally: the file name.jAgdaThe corresponding file.jAgdaThe file to type check.AgdaThe expected module name.Agda$Are we dealing with the main module?Agda+Optional information about the source code.jAgda Source code.AgdaAgda file? Literate Agda file?Agdag for the current module.AgdaOptions set in OPTIONS pragmas.6HHHHjjHHHHHHjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj6jjjjjjjHjjHHHjjjHHHHHjjjjjjjjjjjjjjjjjjjjjjjjHjjjjjjjjNone #$%-0235679>? "kAgdaThe interaction loop.kAgdaSet < to  optInputFile.kAgda>The logo that prints when Agda is started in interactive mode.kAgdaThe help messagekkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkNone #$%-0235679>? &4kAgda6Result 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.kAgda#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. kkkkkkkkk kkkkkkkkkNone #$%-0235679>? 'kAgda$Sets up the compilation environment.kAgdaConjunctive semigroup (k is absorbing).kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkNone #$%-0235679>? *< kAgda Classify FOREIGN Haskell code.kAgda3A pragma that must appear before the module header.kAgdaAn import statement. Must appear right after the module header.kAgda1The rest. To appear after the import statements.kAgda GHC backend translation pragmas.kAgda'@COMPILE GHC X = data D (cA | ... | cA)kAgda COMPILE GHC x as fkAgdaGet content of  FOREIGN GHC pragmas, sorted by k2: file header pragmas, import statements, rest.kAgda Classify a  FOREIGN GHC declaration.kAgdaClassify a Haskell pragma into whether it is a file header pragma or not.kAgdaPartition a list by k attribute.kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkNone #$%-0235679>? +kAgda0Name for definition stripped of unused argumentslAgda:Can the character be used in a Haskell module name part (conid)? This function is more restrictive than what the Haskell report allows.2kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkll2kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkllNone #$%-0235679>? .lAgdaHaskell module names have to satisfy the Haskell (including the hierarchical module namespace extension) lexical syntax: 4modid -> [modid.] large {small | large | digit | ' }l is an injective function into the set of module names defined by modid. The function preserves .s, and it also preserves module names whose first name part is not k.3Precondition: The input must not start or end with ., and no two .s may be adjacent.llNone #$%-0235679>? .llllllllllllNone #$%-0235679>? 0lAgda7Check for "main" function, but only in the main module.lAgda7Check that the main function has type IO a, for some a.lAgda,Haskell modules to be imported for BUILT-INslAgda)Definition bodies for primitive functionslAgda"Are we looking at the main module?Agda The module.AgdaDid we find a "main" function? llllllllll llllllllllNone #$%-0235679>? 1llllllll_None" #$%'(-.0235679>? 7 Agda%Look for a backend of the given name.AgdaAsk the active backend whether a type may be erased. See issue #3732.lAgda0Optional version information to be printed with  --version.lAgdaDefault optionslAgdaBackend-specific command-line flags. Should at minimum contain a flag to enable the backend.lAgda%Unless the backend has been enabled, runAgda- will fall back to vanilla Agda behaviour.lAgdaCalled after type checking completes, but before compilation starts.lAgda3Called after module compilation has completed. The IsMain argument is NotMain if the  --no-main flag is present.lAgdaCalled 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.lAgda>>>??AAAA<=<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=====???<<<<<::::::<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<l9:::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=============================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=============>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@?@?@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@A@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSikkklllllllllllllllllllllllllllllllllllllllkkk9ihijklmnopqrstuvwxyz{|}~>>>>??AAAA<=<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=====???<<<<<::::::<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<:::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<=============================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=============>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@?@?@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@A@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSllllNone #$%&-0235679>? ZlAgda/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.llNone #$%-0235679>? j/ lAgda Restore both  and J.lAgdaRestore , do not touch J.lAgdaBuild an opposite action to o for state monads.lAgda Opposite of o for J1. Use only if main errors are already catched.lAgda?Lift a TCM action transformer to a CommandM action transformer.lAgdaDitto, but restore state.lAgda1Put a response by the callback function given by @.lAgda A Lens for J.lAgda A Lens for J.lAgda*Do setup and error handling for a command.lAgdaRun an J) value, catch the exceptions, emit output!If an error happens the state of J does not change, but stPersistent may change (which contains successfully loaded interfaces for example).lAgdaIf the next command from the command queue is anything but an actual command, then the command is returned.If the command is an J command, then the following happens: The given computation is applied to the command and executed. 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. If the computation was not interrupted, then its result is returned.lAgdaCreates a command queue, and forks a thread that writes commands to the queue. The queue is returned.lAgdaCan the command run even if the relevant file has not been loaded into the state?lAgdaShould && be issued after the command has run?lAgdaInterpret an interactionlAgdaSolved goals already instantiated internally The second argument potentially limits it to one specific goal.lAgda"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 j.lAgdaSet < to J , if any.lAgda)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 ii by the newly created interaction points in the state if safety checks pass (unless force is applied).lAgda/Sorts interaction points based on their ranges.lAgdaDisplays the current goal, the given document, and the current context.Should not modify the state.lAgdaShows all the top-level names in the given module, along with their types.lAgdaShows all the top-level names in scope which mention all the given identifiers in their type.lAgda"Explain why something is in scope.lAgdaSets the command line options and updates the status information.lAgda!Computes some status information.Does not change the state.lAgda'Displays or updates status information.Does not change the state.lAgda display_info does what  display_info' False does, but additionally displays some status information (see l and l).lAgdaParses and scope checks an expression (using the "inside scope" as the scope), performs the given command with the expression as input, and returns the result and the time it takes.lAgdaTell to highlight the code using the given highlighting info (unless it is Nothing).lAgdaTells the Emacs mode to go to the first error position (if any).lAgdarunAgdaliftAgda(reverse lift in double negative positionlAgdarunAgdaliftAgda(reverse lift in double negative positionlAgdaReturns the next command.lAgdaAllow unsolved meta-variables?Agda.Full type-checking, or only scope-checking?lAgda Should safety checks be skipped?lAgdaThe command to perform.AgdaThe expression to parse.,llllllllllllllllllllllllllllllllllllllllllll,llllllllllllllllllllllllllllllllllllllllllllNone #$%-0235679>? kvlAgdal is a fake ghci interpreter for both the Emacs the JSON frontendllNone #$%-0235679>? llAgdal is a fake ghci interpreter for the Emacs frontend and for interaction tests.l reads the Emacs frontend commands from stdin, interprets them and print the result into stdout.lAgdaSerializing Info_ErrorlAgda,Pretty-prints the type of the meta-variable.iillllliilllNone #$%-0235679>? n*lAgdal is a interpreter like l#, but outputs JSON-encoded strings.l( reads Haskell values (that starts from IOTCM ...) from stdin, interprets them, and outputs JSON-encoded strings. into stdout.llNone #$%-0235679>? rmAgda!The name of the default CSS file.mAgda-Prepare information for HTML page generation.The page generator receives the output directory as well as the module's top level module name, its source code, and its highlighting information.mAgdaGenerates a highlighted, hyperlinked version of the given module.mAgda+Constructs the web page, including headers.mAgda'Constructs token stream ready to print.mAgda(Constructs the HTML displaying the code.mAgdaPage generator.mAgdaPage renderer.AgdaOutput file extension.Agda&Directory in which to create files.AgdaModule to be highlighted.mAgdaURL to the CSS file.AgdaWhether to reserve literateAgdaModule to be highlighted.mAgdaThe contents of the module.AgdaHighlighting information.mAgda+Whether to generate non-code contents as-isAgdaSource file typemmmmmmmmmmmmmmNone #$%-0235679>? v mAgda9Environment for naming of local variables. Invariant: reverse ccCxt ++ ccNameSupplymAgdaSupply of fresh namesmAgdaNames currently in scopemAgda0This environment is no longer used for anything.mAgda"We do not erase types that have a k pragma. This is to ensure a stable interface to third-party code.mAgda.Initial environment for expression generation.mAgda%Term variables are de Bruijn indices.mAgda'Introduce n variables into the context.mAgdaExtract Agda term to Haskell expression. Erased arguments are extracted as (). Types are extracted as ().mAgdaTranslate a non-application, non-coercion, non-constructor, non-definition term.mAgda"Are we looking at the main module?Agda Path to the .agdai file.Agda2Could we confirm the existence of a main function?mAgda"Are we looking at the main module?AgdaCompiled module content.Agda2Could we confirm the existence of a main function?mAgda%Is the type inductive or coinductive?9gmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm9mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmgmmmmmmmmmmmmmmmmmmmmmmNone #$%-0235679>? x_mAgda3Ensure that there is at most one pragma for a name.nAgda*Primitives implemented in the JS Agda RTS.,mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnn,mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnn`None #$%-0235679>? {LnAgdaThe main functionnAgdaRun Agda with parsed command line options and with a custom HTML generatornAgdaPrint usage information.nAgdaPrint version information.nAgdaWhat to do for bad options.nAgda6Run a TCM action in IO; catch and pretty print errors.nAgdaMainnAgda8Backends only for printing usage and version informationAgdaHTML generating actionAgdaBackend interactionAgda program nameAgdaparsed command line options nnnnnnnnnn nnnnnnnnnn                           !!!!!!!!!!!!!!!!!!!!!!!!!!!!"###############################################################################################################################$$$$$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&''''''''''''''((((((((((((((((((((((((((((((((((((())))))**+++++++++++++++++,,,,,,,, , , , , , , , , , , , , , , , , , , , , , - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - . . . . . . . . . . / / / / 0 0 0 0 0 0 0 0 0 0 1 1111 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1     2 2 2222222222222222 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 7 77 7 7 7 7 7 7 7 7 7 7 7 88 8 9 9 9 9 9 99 9 9 9 9 9 9 9 9 9 9                          : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ; ; ; ; ; ; ; ; ; ; ; ; ; ; < < < < < < = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =             > > > >> > > > > > > > ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @ @ @@ @@ @@ @@ @@@ @ @@@ @ @ @ @ @ @ @ @   A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A B B B B B B B B B B B B B B B B B C C C C C C C C C C C C C C CDDDDDDDDDDDDDDEEEEEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJJJJJJJJJJJJJJJJJJK KKKKKKKKK K K K K K K KKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLM MMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN NNNNNNNNNNNNNNNNNNNNNNOOOOO OOOOOOOOOOOOOPPPP PPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV VVVVV VVVVVVVVVVVVVVVVVVVVVVVVVVV V V VVVVVWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[\]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^___`aaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb bbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcdddddddddddd d d d d d d d d d d d d d d d d d d dd d dd d d d d dd d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d e e e e e e e e e e e e e e e e e e e e e e e e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!e!f!f!f!f!f!f!ff!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!ff!f!f!f!f!ff!f!f!ff!ff!f!ff!f!f!ff!f!f!f!ff!f!f!f!f!f!f!f!f!f!fffff!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!f!fff!f!f!f!f!f!f!ff!f!f!f!f!f!f!f!f!f!f!f!f!f!f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"fff"ff"ff"f"f"f"ff"f"f"ffff"f"f"f"ff"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f"f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#f#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$gg$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$g$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$h$iii$i$i!i$i$i$i$i$i$i$i$i$i$i$ii$i$i$i$i$ii$i$ii$i$i$i$i$i$i$i$ii!i$i$i$i$i$i$i$i$i$i$i%i%i%i%i%i%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%j%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k%k k%k%k%k%k%k%k k%k%k%k%k%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%l%m%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&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&oo&o&o&o&o&o&o&o&o&o&o&o&o&o&oo&ooo!o&ooo!oo&o!o&oooo&oo&oo!o&oo&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&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'qq'q'q'q'qqqq'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'rr'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(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(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)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t)t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*t*uu*uu*u*uu*u*u*u*u*u*u*u*u*u*uu*u*u*u*u*u*u*u*uu*u*uu*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*w*w*w*w*w*w*w*w*w*w*w*w*w*w*w*wwww*w*w*w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+w+x+x+x+x+x x+x+x+xxxxxxx+x+x+x+x+x+x+x+x+y+y+y+y+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+z+{+{+{+{+{{+{+{+{+{+{+{+{+{+{+|+|+}+}+}+}}+}+}+}+}+}+}+}+}+}+}+}+}+} }+~+~+~+++++++++++++++++++++++++++++++}+}+~,~, ,,,, ,,,++++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,",,",",,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,$,,,,,,-----!--------------------$-"--------------------------------------------------------------------------------------------------------................................................................................................................................//////////////////////////////////////////////////////////////$///////////////////////////////////////////////////////////////////////00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 000000000000000000000000011$1!!11!1",","",1111*---11./1$./1111111111111111111111111111111111111111-1111111111111111111111111111111111111111111111111111111111111111111111!1",,,,,,"""""1"""!1!!!!!!!!!1111122!!!22222222!2222222222,2222222222222!!!!!!!!!""2!!222222!!!2!!!!!!!!!!)!1!!!!2!!!1!!222!!2222221222222"-!!""""""""""2"""""222222""222222222.22.2222222""""2222"2222###22#222##2#2222222#$#$22222222222#$222222222#$####222#$#222#$#22233333.....3333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333334%4%%%44!44"4444444444%4%4%4%4%44444444%4%%4%%%%%%4444444%%4%443344444,44444444%44%%4%4444444444444444444444&44444444444444444444444444444444444444444444444444455555555555555555555555555555555555&55555555555555555555551555555555552155555555555555555555555555555555555555555555555555.. 5 5 55 55555556666 66(  6 66    666*666666666 666 6666   666      666666666666666666666666666666666666666666666666666666666666!666666666666666666666666666666666666666667777777777777777777777777777777777777777777777777777777777777777777777777777M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M7M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8MM8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M8M9M8M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9MM9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9MM9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9MM9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M9M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M+M:M$M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:MM:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M1M:M:M:M&MMMM!M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M:M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M$M:M;M;M;M;M;M;M;M;M;M;M)M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;MM;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M;M2M2M;M;M;M;M;M;M;M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<MM<M<M<M)M)M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M!M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M!M<M<M<M<M<M<M<M<M<M<M<M<M<M M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M6M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M<M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M)M)M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=MM=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=M=MM=M=M=M=M=M=M=M=M=M=M=M=M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M)M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M>M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?M?MM?M?M?M?M?M?M?M@M@M@M@M@M M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M)M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@M@MAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAM6MAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAM1MAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMAMBMBM MBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBMBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB BBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD   DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD@D0DDDDDDDDDDDEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEFFFFFFFFFFFFFFFFFFFFFFFFFF2FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF1FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGpGpGpGp&pGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGpGp&pGpGpGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHH6HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHCHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIICIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ3JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNGNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOO OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO1OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPP!!PPPPPPPPPP0PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPEPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQKHQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRR$RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU"UUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV+VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV+VVVVVVWWWWWWWWWQWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWNN   #  WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY"Y"YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ[[[[[[[[[[[[[ [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[00[[[[[[[[[[[[[[[ X[  [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[ [[[[[[[[[[[[[[[[[[[[[[[\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\QQ\\\+\\\\\\\\\\\J\Z\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\+\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\]]]]]]]]]]]]]]]]]]]]]]<]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^P^^^^^^^^^^^^^^^^^^^^^^^^^^^^F^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^___2_______________________________XX____________________________________________________________________________"______________________``````````````````````````````````Q````````````````````````````````````````````````````````````````````````````````````````````````aaaaaaaaaaaaaaaaaaaaaaaaaVaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaUUUUaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa++bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb$bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccccccccccccccccccccccccccWWccc"cccWWcccWcccWccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee eeeeeeeeeeeeeeeeeeeeeeeeee0eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeFeeeeefffffffffffffdfffffffffffffffffffffffffffff"ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffgggggggggggggggggggggggggg_g_g__g_g_g_g_g_g_g_g_g_g_g_g_g_g__g_g_g_gggggg[ggggggggggggggggggggggggggggfggggggggggggggggfggggggggggggggggggggggggggggggggggghhhhh+_hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh+h+hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh+hhhhhh`h`h`h`h`h`h`h`h`h`hhhhhhhhhhhh7hhhhhhhhhhhhhhhhhhhhhh$h$hhhhhh  h h h    iiiiihhihiiiiiihiihiiiiiiiiiihhiiihiiiiihiiiiiiiiiiiiiihiihiiiiiiiiiiihiiiiiiiiiiiiiiiiiiiiiiiii6iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii_iiiiAgda-2.6.1.3-inplaceAgda.Utils.PrettyAgda.Utils.MonadAgda.Utils.SmallSetAgda.TypeChecking.PrettyAgda.Interaction.OptionsAgda.Interaction.JSONAgda.Utils.EitherAgda.Utils.AssocListAgda.Utils.FunctorAgda.Utils.TupleAgda.Utils.VarSetAgda.Utils.ExceptAgda.Interaction.Options.IORefsAgda.Syntax.BuiltinAgda.Termination.CutOffAgda.Termination.SemiringAgda.Utils.AffineHoleAgda.Utils.ApplicativeAgda.Utils.BiMapAgda.Utils.EnvironmentAgda.Utils.FailAgda.Utils.Function"Agda.TypeChecking.SizedTypes.UtilsAgda.Utils.Haskell.Syntax Agda.Utils.IOAgda.Utils.IO.BinaryAgda.Utils.IO.DirectoryAgda.Utils.IO.UTF8Agda.Utils.IO.TempFileAgda.Utils.IORefAgda.Utils.ImpossibleAgda.Utils.EmptyAgda.Utils.BagAgda.ImpossibleTestAgda.Auto.NarrowingSearchAgda.Utils.IntSet.InfiniteAgda.Utils.LensAgda.Utils.IndexedListAgda.Interaction.Library.BaseAgda.Auto.OptionsAgda.Utils.Lens.ExamplesAgda.Utils.MapAgda.Utils.MaybeAgda.Utils.ListT!Agda.Interaction.Options.WarningsAgda.Interaction.Options.HelpAgda.Utils.MemoAgda.Utils.MonoidAgda.Utils.NullAgda.Utils.Maybe.StrictAgda.Utils.PartialOrdAgda.Utils.POMonoidAgda.Utils.PointerAgda.Utils.SemiRingAgda.Utils.SingletonAgda.Utils.ClusterAgda.Utils.SizeAgda.Utils.Parser.MemoisedCPSAgda.Utils.FileNameAgda.Utils.Hash#Agda.TypeChecking.SizedTypes.SyntaxAgda.Utils.SuffixAgda.Utils.ThreeAgda.Utils.TrieAgda.Utils.ListAgda.Utils.StringAgda.Utils.TimeAgda.Interaction.EmacsCommandAgda.Utils.FloatAgda.Utils.BenchmarkAgda.Syntax.PositionAgda.Utils.PermutationAgda.Syntax.CommonAgda.Syntax.Parser.Literate+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.CaseSplit#Agda.Interaction.Highlighting.RangeAgda.Syntax.Parser.MonadAgda.Syntax.Abstract.NameAgda.Syntax.NotationAgda.Syntax.FixityAgda.Syntax.LiteralAgda.Syntax.Treeless$Agda.Compiler.Treeless.GuardsToPrims!Agda.Compiler.Treeless.AsPatternsAgda.Syntax.Parser.TokensAgda.Compiler.Backend Agda.MainAgda.Interaction.Library.Parse,Agda.Utils.Graph.AdjacencyMap.UnidirectionalAgda.Utils.Graph.TopSort+Agda.TypeChecking.SizedTypes.WarshallSolver'Agda.TypeChecking.Positivity.OccurrenceAgda.Syntax.ConcreteAgda.Syntax.Concrete.Pretty$Agda.TypeChecking.Coverage.SplitTreeAgda.BenchmarkingAgda.Syntax.Concrete.Pattern%Agda.Syntax.Concrete.Operators.ParserAgda.Syntax.Concrete.GenericAgda.Syntax.Concrete.FixityAgda.Syntax.Concrete.Attribute%Agda.Interaction.Highlighting.PreciseAgda.Interaction.ResponseAgda.Utils.FavoritesAgda.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.ParserAgda.Syntax.Internal%Agda.TypeChecking.Substitute.DeBruijn!Agda.TypeChecking.Free.PrecomputeAgda.TypeChecking.Free.LazyAgda.TypeChecking.Free"Agda.TypeChecking.Substitute.ClassAgda.Syntax.ReflectedAgda.Syntax.Internal.Generic Agda.TypeChecking.CompiledClauseAgda.Syntax.Internal.MetaVarsAgda.Syntax.Internal.DefsAgda.Syntax.AbstractAgda.Syntax.Internal.PatternAgda.Syntax.Abstract.Views$Agda.Syntax.Abstract.PatternSynonymsAgda.Syntax.Abstract.PatternAgda.Utils.TypeLevelAgda.Utils.TypeLitsAgda.Utils.Update Agda.Syntax.Concrete.DefinitionsAgda.Utils.WarshallAgda.Utils.WithDefaultAgda.Utils.Zipper Agda.VersionAgda.VersionCommitAgda.Interaction.Library Agda.TypeChecking.Serialise.BaseAgda.TypeChecking.Rules.TermAgda.TypeChecking.Rules.Decl#Agda.TypeChecking.Rules.ApplicationAgda.TypeChecking.RewritingAgda.TypeChecking.Reduce.FastAgda.TypeChecking.PrimitiveAgda.TypeChecking.Polarity Agda.TypeChecking.Monad.MetaVarsAgda.TypeChecking.Monad.ImportsAgda.TypeChecking.Monad.EnvAgda.TypeChecking.Monad.ContextAgda.TypeChecking.Monad.BuiltinAgda.TypeChecking.ErrorsAgda.TypeChecking.Monad.Debug"Agda.TypeChecking.Monad.Statistics!Agda.TypeChecking.Monad.Signature Agda.TypeChecking.ProjectionLikeAgda.TypeChecking.Pretty.CallAgda.TypeChecking.Monad.Caching!Agda.TypeChecking.Monad.BenchmarkAgda.TypeChecking.Irrelevance&Agda.TypeChecking.CompiledClause.Match(Agda.TypeChecking.CompiledClause.CompileAgda.Syntax.Internal.Names&Agda.Interaction.Highlighting.GenerateAgda.TypeChecking.WarningsAgda.Interaction.ImportsAgda.Compiler.Treeless.EraseAgda.TypeChecking.InliningAgda.Interaction.FindFile,Agda.TypeChecking.Serialise.Instances.Common2Agda.TypeChecking.Serialise.Instances.Highlighting.Agda.TypeChecking.Serialise.Instances.AbstractAgda.Interaction.BaseAgda.TypeChecking.Monad.StateAgda.TypeChecking.Monad.TraceAgda.TypeChecking.Monad.MutualAgda.TypeChecking.Monad.Closure#Agda.TypeChecking.Monad.ConstraintsAgda.TypeChecking.ConstraintsAgda.Syntax.Scope.MonadAgda.Syntax.Concrete.OperatorsAgda.Interaction.Options.LensesAgda.TypeChecking.Monad.OptionsAgda.TypeChecking.SubstituteAgda.TypeChecking.Monad.OpenAgda.TypeChecking.Telescope"Agda.TypeChecking.Monad.SizedTypesAgda.TypeChecking.Level*Agda.Syntax.Translation.AbstractToConcreteAgda.Syntax.Abstract.PrettyAgda.TypeChecking.DropArgsAgda.TypeChecking.MetaVarsAgda.TypeChecking.DatatypesAgda.Compiler.Treeless.SubstAgda.Compiler.Treeless.PrettyAgda.Compiler.Treeless.CompareAgda.Compiler.Treeless.Uncase/Agda.TypeChecking.Serialise.Instances.Compilers.Agda.TypeChecking.Serialise.Instances.Internal,Agda.TypeChecking.Serialise.Instances.Errors%Agda.TypeChecking.Serialise.InstancesAgda.TypeChecking.SerialiseAgda.TypeChecking.Rules.Def+Agda.TypeChecking.Rules.Builtin.Coinduction"Agda.TypeChecking.Rewriting.ClauseAgda.TypeChecking.Reduce.MonadAgda.TypeChecking.Records Agda.TypeChecking.Patterns.Match#Agda.TypeChecking.Patterns.AbstractAgda.TypeChecking.Names"Agda.TypeChecking.MetaVars.MentionAgda.TypeChecking.EtaContractAgda.TypeChecking.Reduce#Agda.TypeChecking.SyntacticEquality Agda.TypeChecking.Primitive.Base#Agda.TypeChecking.Primitive.Cubical#Agda.TypeChecking.Patterns.InternalAgda.TypeChecking.Quote"Agda.TypeChecking.LevelConstraintsAgda.TypeChecking.Level.SolveAgda.TypeChecking.Free.ReduceAgda.TypeChecking.EmptyAgda.TypeChecking.DisplayFormAgda.TypeChecking.DeadCodeAgda.TypeChecking.ConversionAgda.TypeChecking.CheckInternalAgda.Termination.RecCheck+Agda.Syntax.Translation.ReflectedToAbstract*Agda.Syntax.Translation.InternalToAbstract Agda.TypeChecking.Telescope.PathAgda.TypeChecking.SizedTypesAgda.TypeChecking.Rules.Display#Agda.TypeChecking.Rules.LHS.ProblemAgda.TypeChecking.Implicit$Agda.TypeChecking.Rules.LHS.Implicit'Agda.TypeChecking.Rules.LHS.ProblemRestAgda.TypeChecking.FunctionsAgda.TypeChecking.Forcing)Agda.TypeChecking.Rewriting.NonLinPattern Agda.TypeChecking.RecordPatternsAgda.TypeChecking.PositivityAgda.TypeChecking.Sort Agda.TypeChecking.Pretty.WarningAgda.TypeChecking.Injectivity Agda.TypeChecking.Coverage.Match!Agda.TypeChecking.Conversion.Pure'Agda.TypeChecking.Rewriting.NonLinMatchAgda.Termination.Monad#Agda.TypeChecking.InstanceArguments!Agda.TypeChecking.MetaVars.Occurs"Agda.TypeChecking.SizedTypes.SolveAgda.TypeChecking.Unquote!Agda.TypeChecking.Rules.LHS.Unify&Agda.TypeChecking.Rewriting.Confluence"Agda.TypeChecking.IApplyConfluenceAgda.TypeChecking.GeneralizeAgda.TypeChecking.Rules.Data'Agda.TypeChecking.ReconstructParametersAgda.TypeChecking.EtaExpandAgda.TypeChecking.AbstractAgda.TypeChecking.WithAgda.Termination.TermCheck Agda.Syntax.Internal.SanityCheckAgda.Syntax.IdiomBracketsAgda.Syntax.DoNotationAgda.Interaction.Monad!Agda.Interaction.Highlighting.Vim!Agda.Interaction.Highlighting.Dot$Agda.Interaction.Highlighting.CommonAgda.Compiler.Treeless.UnusedAgda.Compiler.Treeless.Simplify%Agda.Compiler.Treeless.NormalizeNamesAgda.Compiler.Treeless.Identity/Agda.Compiler.Treeless.EliminateLiteralPatterns(Agda.Compiler.Treeless.EliminateDefaultsAgda.Compiler.Treeless.BuiltinAgda.Compiler.MAlonzo.CompilerAgda.Compiler.MAlonzo.CoerceAgda.Compiler.CallCompiler"Agda.Interaction.Highlighting.JSONAgda.TypeChecking.Rules.LHSAgda.TypeChecking.Rules.Builtin*Agda.Syntax.Translation.ConcreteToAbstractAgda.TypeChecking.CoverageAgda.TypeChecking.Rules.RecordAgda.Compiler.ToTreeless#Agda.Interaction.Highlighting.EmacsAgda.Interaction.BasicOpsAgda.Interaction.SearchAboutAgda.Interaction.MakeCaseAgda.Auto.ConvertAgda.Interaction.CommandLineAgda.Auto.AutoAgda.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.LaTeXAgda.Interaction.InteractionTopAgda.Interaction.AgdaTopAgda.Interaction.EmacsTopAgda.Interaction.JSONTop"Agda.Interaction.Highlighting.HTMLAgda.Compiler.JS.CompilerPretty Agda.UtilsStringData.Traversablefor TraversableforM_Lazy listToMaybe maybeToList catMaybesmapMaybeforMifNull Data.List genericIndexData Bitraversable Data.Maybe fromMaybe fromMaybeMAgda.TypeChecking.SubstitutionliftSAgda.Syntax.Internal.Patterns numberPatVarsLHSTree APatternLikeData.MapmapKeysMonotonicQName whyInScope unifyStepcompileClauses NonLinMatch'foldTermAgda.Syntax.TranslationAbstractToConcrete' Paths_AgdaAbstractSyntax AtTopLevelinteractionLoop localStateAgda.TypeChecking.MonadAgda.TypeChecking.Testsprop_splitTelescopesimplifyLevelConstraint getConTypeAgda.TheTypeCheckerbaseGHC.Base<><*>GHC.IxIx SemigroupSystem.Console.GetOptOptionOptDescrOptArgReqArgNoArgArgDescr Control.Monadunless<=<>=> Data.EitherisRightisLeftGHC.Listlookup Data.Functor$><$> Data.Tupleswapwhen<$mplusmzero MonadPluscontainers-0.6.2.1Data.IntSet.InternalfromList toDescListtoList isSubsetOf intersection differenceunionunionsdelete singletonemptymembernulltransformers-0.5.6.2Control.Monad.Trans.ExceptExceptT mtl-2.2.2Control.Monad.Error.Class catchError throwError MonadError runExceptT mapExceptTpretty-1.1.3.6Text.PrettyPrint.HughesPJ fullRender renderStylerenderfsepfcatcatsep<+>$+$$$ punctuatehangnestvcathsephcatbracesbracketsparens doubleQuotesquotesrationaldoublefloatintegerintrbracelbracerbracklbrackrparenlparenequalsspacecoloncommasemiisEmpty zeroWidthText sizedTextptexttextcharDoc#Text.PrettyPrint.Annotated.HughesPJstylePStrChrribbonsPerLine lineLengthmodeStyle OneLineModeLeftMode ZigZagModePageModeModeUnicodeOrAscii UnicodeOk AsciiOnlyunicodeOrAscii builtinNat builtinSuc builtinZerobuiltinNatPlusbuiltinNatMinusbuiltinNatTimesbuiltinNatDivSucAuxbuiltinNatModSucAuxbuiltinNatEqualsbuiltinNatLess builtinWord64builtinIntegerbuiltinIntegerPosbuiltinIntegerNegSuc builtinFloat builtinChar builtinString builtinUnitbuiltinUnitUnit builtinSigma builtinBool builtinTrue builtinFalse builtinList builtinNil builtinCons builtinIO builtinId builtinConId builtinIdElim builtinPath builtinPathPbuiltinInterval builtinIMin builtinIMax builtinINeg builtinIZero builtinIOnebuiltinPartialbuiltinPartialP builtinIsOnebuiltinItIsOne builtinEquivbuiltinEquivFunbuiltinEquivProofbuiltinTranspProof builtinGlue builtin_gluebuiltin_unglue builtin_glueUbuiltin_unglueUbuiltinFaceForall builtinIsOne1 builtinIsOne2builtinIsOneEmpty builtinComp builtinPOr builtinTrans builtinHComp builtinSub builtinSubIn builtinSubOutbuiltinSizeUniv builtinSize builtinSizeLtbuiltinSizeSucbuiltinSizeInfbuiltinSizeMax builtinInf builtinSharp builtinFlatbuiltinEquality builtinReflbuiltinRewritebuiltinLevelMax builtinLevelbuiltinLevelZerobuiltinLevelSucbuiltinSetOmegabuiltinFromNatbuiltinFromNegbuiltinFromString builtinQNamebuiltinAgdaSortbuiltinAgdaSortSetbuiltinAgdaSortLitbuiltinAgdaSortUnsupported builtinHiding builtinHiddenbuiltinInstancebuiltinVisiblebuiltinRelevancebuiltinRelevantbuiltinIrrelevant builtinAssocbuiltinAssocLeftbuiltinAssocRightbuiltinAssocNonbuiltinPrecedencebuiltinPrecRelatedbuiltinPrecUnrelated builtinFixitybuiltinFixityFixity builtinArgbuiltinArgInfobuiltinArgArgInfo builtinArgArg builtinAbs builtinAbsAbsbuiltinAgdaTermbuiltinAgdaTermVarbuiltinAgdaTermLambuiltinAgdaTermExtLambuiltinAgdaTermDefbuiltinAgdaTermConbuiltinAgdaTermPibuiltinAgdaTermSortbuiltinAgdaTermLitbuiltinAgdaTermUnsupportedbuiltinAgdaTermMetabuiltinAgdaErrorPartbuiltinAgdaErrorPartStringbuiltinAgdaErrorPartTermbuiltinAgdaErrorPartNamebuiltinAgdaLiteralbuiltinAgdaLitNatbuiltinAgdaLitWord64builtinAgdaLitFloatbuiltinAgdaLitCharbuiltinAgdaLitStringbuiltinAgdaLitQNamebuiltinAgdaLitMetabuiltinAgdaClausebuiltinAgdaClauseClausebuiltinAgdaClauseAbsurdbuiltinAgdaPatternbuiltinAgdaPatVarbuiltinAgdaPatConbuiltinAgdaPatDotbuiltinAgdaPatLitbuiltinAgdaPatProjbuiltinAgdaPatAbsurdbuiltinAgdaDefinitionFunDefbuiltinAgdaDefinitionDataDefbuiltinAgdaDefinitionRecordDef$builtinAgdaDefinitionDataConstructorbuiltinAgdaDefinitionPostulatebuiltinAgdaDefinitionPrimitivebuiltinAgdaDefinitionbuiltinAgdaMetabuiltinAgdaTCMbuiltinAgdaTCMReturnbuiltinAgdaTCMBindbuiltinAgdaTCMUnifybuiltinAgdaTCMTypeErrorbuiltinAgdaTCMInferTypebuiltinAgdaTCMCheckTypebuiltinAgdaTCMNormalisebuiltinAgdaTCMReducebuiltinAgdaTCMCatchErrorbuiltinAgdaTCMGetContextbuiltinAgdaTCMExtendContextbuiltinAgdaTCMInContextbuiltinAgdaTCMFreshNamebuiltinAgdaTCMDeclareDefbuiltinAgdaTCMDeclarePostulatebuiltinAgdaTCMDefineFunbuiltinAgdaTCMGetTypebuiltinAgdaTCMGetDefinitionbuiltinAgdaTCMBlockOnMetabuiltinAgdaTCMCommitbuiltinAgdaTCMQuoteTermbuiltinAgdaTCMUnquoteTermbuiltinAgdaTCMIsMacrobuiltinAgdaTCMWithNormalisationbuiltinAgdaTCMDebugPrintbuiltinAgdaTCMNoConstraintsbuiltinAgdaTCMRunSpeculative builtinsNoDef sizeBuiltinsCutOff DontCutOff $fShowCutOff $fEqCutOff $fOrdCutOffSemiringaddmulzeroHasZero zeroElementintegerSemiring intSemiring boolSemiring $fHasZeroInt$fHasZeroInteger AffineHole ZeroHolesOneHole ManyHoles$fApplicativeAffineHole$fFunctorAffineHole?*>?$>BiMap biMapThere biMapBack invLookupinsert $fShowBiMap $fOrdBiMap $fEqBiMapexpandEnvironmentVariables $fEqToken $fShowTokenErrornoMsgstrMsg mkExceptT $fError[]FailrunFailrunFail_$fMonadFailFail $fFunctorFail$fApplicativeFail $fMonadFail iterWhile repeatWhile repeatWhileMtrampolineWhiletrampolineWhileM trampoline trampolineM iterateUntil iterateUntilMiterate' applyWhen applyUnless applyWhenM applyUnlessMDioidcompose unitComposeMeetSemiLatticemeetPlusplusToptopisTopdebug setDebuggingtracetraceM$fPlusIntIntInt Decoration traverseF distributeF<.><&>dmapdget$fDecoration(,)$fDecorationCompose$fDecorationIdentity TyVarBind UnkindedVarQOpQVarOpNameIdentSymbolQualUnQual ModuleNameLiteralIntFracCharAltExpVarConLitInfixAppAppLambdaLetIfCase ExpTypeSigNegAppFakeExpStmt Qualifier GeneratorPatPVarPLitPAsPat PWildCardPBangPatPApp PatTypeSigPIrrPatTypeTyForallTyFunTyConTyVarTyAppFakeTypeMatch GuardedRhsRhs UnGuardedRhs GuardedRhssBindsBDeclsDeriving StrictnessStrictConDecl DataOrNewDataTypeNewTypeDeclTypeDeclDataDeclTypeSigFunBindPatSynFakeDecl ImportSpecIVar ImportDecl importModuleimportQualified importSpecs ModulePragmaLanguagePragma OtherPragmaModuleunit_con$fEqDecl $fEqMatch$fEqRhs$fEqExp$fEqAlt $fEqBinds$fEqGuardedRhs$fEqStmt $fEqConDecl$fEqPat$fEqType $fEqTyVarBind$fEqQOp $fEqQName$fEqName$fEqModuleName$fOrdModuleName $fEqLiteral$fEqStrictness $fEqDataOrNewCatchIOcatchIO$fCatchIOWriterT $fCatchIOIOreadBinaryFile'copyDirContent readTextFile writeFilewriteTextToFilewriteToTempFilereadModifyIORef'CatchImpossiblecatchImpossiblecatchImpossibleJusthandleImpossiblehandleImpossibleJust Impossible UnreachableImpMissingDefinitionsthrowImpossiblewithFileAndLine'withFileAndLine__IMPOSSIBLE____UNREACHABLE__$fExceptionImpossible$fShowImpossible$fCatchImpossibleIOEmptyabsurd 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 $fNumCost$fEqCost $fOrdCost$fEqPrio $fOrdPrio $fNumPrioIntSetbelowabovefull toFiniteList invariant$fMonoidIntSet$fSemigroupIntSet $fEqIntSet $fShowIntSetLensMapLensSetLensGetLens'lFstlSnd^.setoverfocususe.=%=%==%%= locallyStateviewlocallylocally'keyIndexZeroSucAllNilConsSomewithSomemakeAll forgetAll forgetIndex mapWithIndexlIndex lookupIndex allIndices AgdaLibFile_libName_libFile _libIncludes _libDependsLibNamelibNameForCurrentDir emptyLibFilelibNamelibFile libIncludes libDepends$fShowAgdaLibFile AutoTokenMCRDLTSH AutoOptions autoHints autoTimeOutautoPickautoMode autoHintModeTimeOut getTimeOutHints AutoHintModeAHMNone AHMModuleMNormal MCaseSplitMRefineinitAutoOptionsaoHints aoTimeOutaoPickaoMode aoHintMode autoTokens parseTime parseArgs $fShowTimeOutRecordfield1field2 lensField1 lensField2 filterKeys mapMaybeKeys boolToMaybeunionMaybeWithunionsMaybeWith unzipMaybe filterMaybeforMaybe caseMaybeifJustmaybeM caseMaybeMifJustMwhenJust whenNothing whenJustM whenNothingMallJustMListTrunListTmapListTnilListT consListTsgListT caseListT foldListT sequenceListT concatListT runMListT consMListTsgMListT mapMListT mapMListT_alt liftListT$fMonadFailListT$fMonadStatesListT$fMonadReaderrListT$fMonadIOListT$fMonadTransListT $fMonadListT$fApplicativeListT$fMonadPlusListT$fAlternativeListT $fMonoidListT$fSemigroupListT$fFunctorListT WarningNameOverlappingTokensWarning_LibUnknownField_EmptyAbstract_ EmptyField_EmptyGeneralize_EmptyInstance_ EmptyMacro_ EmptyMutual_EmptyPostulate_EmptyPrimitive_ EmptyPrivate_EmptyRewritePragma_InvalidCatchallPragma_InvalidCoverageCheckPragma_InvalidNoPositivityCheckPragma_InvalidNoUniverseCheckPragma_InvalidTerminationCheckPragma_MissingDefinitions_NotAllowedInMutual_OpenPublicAbstract_OpenPublicPrivate_ PolarityPragmasButNotPostulates_PragmaCompiled_PragmaNoTerminationCheck_ShadowingInTelescope_UnknownFixityInMixfixDecl_UnknownNamesInFixityDecl_UnknownNamesInPolarityPragmas_UselessAbstract_UselessInstance_UselessPrivate_AbsurdPatternRequiresNoRHS_CantGeneralizeOverSorts_ClashesViaRenaming_CoverageIssue_CoverageNoExactSplit_DeprecationWarning_FixityInRenamingModule_GenericNonFatalError_GenericWarning_IllformedAsClause_InstanceArgWithExplicitArg_InstanceWithExplicitArg_InstanceNoOutputTypeName_InversionDepthReached_ModuleDoesntExport_ NotInScope_NotStrictlyPositive_ OldBuiltin_PragmaCompileErased_RewriteMaybeNonConfluent_RewriteNonConfluent_ SafeFlagEta_SafeFlagInjective_SafeFlagNoCoverageCheck_SafeFlagNonTerminating_SafeFlagNoPositivityCheck_SafeFlagNoUniverseCheck_SafeFlagPolarity_SafeFlagPostulate_SafeFlagPragma_SafeFlagTerminating_&SafeFlagWithoutKFlagPrimEraseEquality_TerminationIssue_UnreachableClauses_UnsolvedConstraints_UnsolvedInteractionMetas_UnsolvedMetaVariables_UselessInline_UselessPublic_ UserWarning_WithoutKFlagPrimEraseEquality_WrongInstanceDeclaration_CoInfectiveImport_InfectiveImport_ WarningMode _warningSet _warn2Error warningSet warn2ErrordefaultWarningSetdefaultWarningModewarningModeUpdate warningSets noWarningsunsolvedWarningsincompleteMatchWarnings errorWarnings allWarnings usualWarningsstring2WarningNamewarningName2String usageWarning$fEqWarningMode$fShowWarningMode$fEqWarningName$fOrdWarningName$fShowWarningName$fReadWarningName$fEnumWarningName$fBoundedWarningNameHelp GeneralHelpHelpFor allHelpTopicshelpTopicUsagestring2HelpTopic$fEqHelp $fShowHelp $fEqHelpTopic$fShowHelpTopicmemomemoRec memoUnsafe memoUnsafeHMaxNat getMaxNat$fMonoidMaxNat$fSemigroupMaxNat $fNumMaxNat $fEqMaxNat $fOrdMaxNat $fShowMaxNat $fEnumMaxNatNull ifNotNullifNullM ifNotNullMwhenNull unlessNull whenNullM unlessNullM $fNullStateT $fNullReaderT $fNullDoc $fNullMaybe $fNullSet $fNullSeq $fNullHashSet $fNullHashMap $fNullMap $fNullIntSet $fNullIntMap $fNullBag$fNull[]$fNullByteString $fNull(,)$fNull()strict-0.4.0.1-f888cc3004d6c7748c64073b6cab4c0108c65fbc8693c285f3148e74893fd108Data.Strict.MaybefromJustisJust isNothingmaybeMaybeJustNothingtoStricttoLazy$fApplicativeMaybe Inclusion inclusion Pointwise pointwise PartialOrd comparable ComparablePartialOrderingPOLTPOLEPOEQPOGEPOGTPOAnyleqPOoppPOorPOseqPO fromOrdering fromOrderings toOrderings comparableOrdrelated$fMonoidPartialOrdering$fSemigroupPartialOrdering$fPartialOrdPartialOrdering$fPartialOrd(,)$fPartialOrdEither$fPartialOrdMaybe$fPartialOrd()$fPartialOrdInteger$fPartialOrdInt$fPartialOrdPointwise$fPartialOrdInclusion$fPartialOrdInclusion0 $fEqInclusion$fOrdInclusion$fShowInclusion$fFunctorInclusion $fEqPointwise$fShowPointwise$fFunctorPointwise$fEqPartialOrdering$fShowPartialOrdering$fEnumPartialOrdering$fBoundedPartialOrderingLeftClosedPOMonoidinverseComposePOMonoid POSemigrouphasLeftAdjointPtrnewPtrderefPtr updatePtrsetPtr updatePtrM $fDataIORef $fNFDataPtr $fHashablePtr$fOrdPtr$fEqPtr$fTraversablePtr $fFoldablePtr $fFunctorPtr $fShowPtr $fDataPtr StarSemiRingostarSemiRingozeroooneoplusotimes$fSemiRingMaybe $fSemiRing()$fStarSemiRingMaybe$fStarSemiRing() Singleton$fSingleton(,)HashMap$fSingletonaHashSet$fSingleton(,)IntMap$fSingleton(,)Map$fSingletonIntIntSet$fSingletonaSet$fSingletonaSeq$fSingletonaNonEmpty$fSingletonaEndo$fSingletona->$fSingletona[]$fSingletonaMaybeclustercluster' SizedThingtheSize sizedThingSized sizeThing $fSizedSeq$fSizedHashSet$fSizedHashMap $fSizedSet $fSizedMap $fSizedIntSet $fSizedIntMap $fSized[]$fNullSizedThing$fSizedSizedThingpretty prettyPrec prettyList prettyShowpwordsfwords prettyList_mparensalign multiLineTextpshow singPluralprefixedThings $fDataDoc$fPrettyNonEmpty $fPretty[] $fPrettyMaybe $fPretty() $fPrettyDoc $fPrettyChar$fPrettyInteger $fPrettyInt32 $fPrettyInt $fPrettyBoolDocPParserWithGrammar ParserClassparsegrammarsat'annotatememoisememoiseIfPrintingParserdocsattokentokbindPchoicePseqPstarPatomP$fAlternativeParser$fApplicativeParser$fFunctorParser $fMonadParser$fParserClassParserkrtok#$fParserClassParserWithGrammarkrtok$fAlternativeParserWithGrammar$fApplicativeParserWithGrammar$fFunctorParserWithGrammar$fMonadParserWithGrammar AbsolutePathfilePath mkAbsoluterootPathabsolute===doesFileExistCaseSensitive$fPrettyAbsolutePath$fShowAbsolutePath$fEqAbsolutePath$fOrdAbsolutePath$fDataAbsolutePath$fHashableAbsolutePathHashhashByteString hashTextFilehashText combineHashes hashStringFlexsflexsRigidsrigidsTruncateOffsettruncateOffset 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[]$fShowSolution$fNullSolution $fEqPolarity $fOrdPolarity$fShowConstraint'$fFunctorConstraint'$fFoldableConstraint'$fTraversableConstraint' $fShowCmp$fEqCmp $fBoundedCmp $fEnumCmp$fShowSizeExpr' $fEqSizeExpr'$fOrdSizeExpr'$fFunctorSizeExpr'$fFoldableSizeExpr'$fTraversableSizeExpr'$fEqFlex $fOrdFlex $fEqRigid $fOrdRigid $fEqOffset $fOrdOffset $fNumOffset $fEnumOffsetSmallSettotal complement\\ mapMemberShipzipMemberShipWith fromAscListfromDistinctAscList $fEqSmallSet $fOrdSmallSet$fShowSmallSet$fDataSmallSetSuffixNoSuffixPrime SubscriptsubscriptAllowedisSubscriptDigittoSubscriptDigitfromSubscriptDigit nextSuffix suffixView addSuffixEither3In1In2In3ThreeOneTwo partition3partitionEithers3 mapEither3M forEither3M $fEqEither3 $fOrdEither3 $fShowEither3 $fEqThree $fOrdThree $fShowThree$fBoundedThree $fEnumThreeTrie everyPrefix unionWith insertWithadjusttoListOrderedBy mapSubTries lookupPath lookupTriefiltervalueAt $fNullTrie $fShowTrie$fEqTrie $fFunctorTrie$fFoldableTrieList2list2-*-mapFstmapSnd/\fst3snd3thd3uncurry3uncurry4mapPairMmapFstMmapSndM$fApplicativeList2 $fEqList2$fFunctorList2$fFoldableList2$fTraversableList2StrSufSt SSSMismatchSSSStrip SSSResultReversedSuffixPrefixsnoccaseList caseListMlistCaseheadWithDefault tailMaybetailWithDefault lastMaybelast2unconsmconsinitLast initMaybe!!!indexWithDefault findWithIndexgenericElemIndexdownFrom updateHead updateLastupdateAtsplitExactlyAtdropEndspanEnd takeWhileJustspanJustpartitionMaybe filterAndRestmapMaybeAndRest isSublistOfholes commonPrefix dropCommon stripPrefixBy commonSuffix stripSuffixstripReversedSuffixgroupOngroupBy'wordsBychopchopWhenhasElemsorteddistinct fastDistinct duplicates allDuplicatesnubOnuniqOnallEqualzipWith'zipWithKeepRest unzipWitheditDistanceSpec editDistanceStrunStrquotehaskellStringLiteral delimiter showIndexaddFinalNewLineindentshowThousandSepltrimrtrimtrim$fIsStringStateT$fIsStringReaderT $fShowStr$fEqStrCPUTime ClockTime getClockTimefromMilliseconds getCPUTime measureTime$fPrettyCPUTime $fEqCPUTime $fShowCPUTime $fOrdCPUTime $fNumCPUTime $fRealCPUTime $fEnumCPUTime$fIntegralCPUTimeLispAQresponse putResponse display_info'clearRunningInfo clearWarningdisplayRunningInfo $fShowLisp $fPrettyLisp$fEqLisp normaliseNaNdoubleToWord64floatEqfloatLttoStringWithoutDotZero whileLeft caseEitherMmapLeftmapRighttraverseEitherfromLeft fromRight fromLeftM fromRightM maybeLeft maybeRightallLeftallRight groupByEither maybeToEither==<<whenMunlessMguardMifMifNotMand2MandMallMor2MorManyMaltM1 orEitherMmapM'forM'mapMMforMMmapMM_forMM_ mapMaybeM mapMaybeMM forMaybeM forMaybeMM dropWhileM dropWhileEndM partitionM fromMaybeMP catMaybesMPfinallytryMaybetryCatchbracket_readM 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 backupPos 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(,)$fHasRangeNonEmpty $fHasRange[]$fHasRangeBool $fHasRange()$fHasRangeRange'$fHasRangeInterval'$fSetRangeMaybe $fSetRange[]$fSetRangeRange'$fKillRangeEither$fKillRangeMaybe$fKillRangeMaybe0$fKillRange(,,,)$fKillRange(,,)$fKillRange(,)$fKillRangeSet$fKillRangeMap $fKillRange[]$fKillRangeNonEmpty$fKillRange[]0$fKillRangeInteger$fKillRangeInt$fKillRangeBool $fKillRange()$fKillRangeVoid$fKillRangeRange'$fPrettyPrintRange$fEqPrintRange$fOrdPrintRange$fHasRangePrintRange$fSetRangePrintRange$fKillRangePrintRange $fDataRange' $fEqRange' $fOrdRange'$fFunctorRange'$fFoldableRange'$fTraversableRange'$fGenericRange'$fDataInterval' $fEqInterval'$fOrdInterval'$fFunctorInterval'$fFoldableInterval'$fTraversableInterval'$fGenericInterval'$fDataPosition'$fFunctorPosition'$fFoldablePosition'$fTraversablePosition'$fGenericPosition'DoDropdoDropdropMoreunDropDropdropNdropFromInversePermuteinversePermute PermutationPerm permRange permPickspermute safePermuteidPtakePdroppedPliftPcomposePinvertPcompactPreversePflipPexpandPtopoSort$fKillRangePermutation$fNullPermutation$fSizedPermutation$fShowPermutation$fInversePermute->[]$fInversePermute[][]$fInversePermute[]IntMap$fInversePermute[][]0$fKillRangeDrop$fDoDropPermutation $fDoDrop[]$fEqDrop $fOrdDrop $fShowDrop $fDataDrop $fFunctorDrop$fFoldableDrop$fTraversableDrop$fEqPermutation$fDataPermutationGenPartBindHole NormalHoleWildHoleIdPartNotationExpandedEllipsis NoEllipsis ellipsisRangeellipsisWithArgs RewriteEqn'RewriteInvert CoverageCheckYesCoverageCheckNoCoverageCheck UniverseCheckYesUniverseCheckNoUniverseCheckPositivityCheckYesPositivityCheckNoPositivityCheckTerminationCheckNoTerminationCheckNonTerminating TerminatingTerminationMeasure Renaming'RenamingrenFromrenTo renFixity renToRange ImportedName'ImportedModule ImportedNameUsing' UseEverythingUsingImportDirective'ImportDirectiveimportDirRangeusinghiding impRenaming publicOpen LensFixity' lensFixity' LensFixity lensFixityFixity' theFixity theNotation theNameRangeFixity fixityRange fixityLevel fixityAssoc AssociativityNonAssoc LeftAssoc RightAssoc FixityLevel UnrelatedRelatedPrecedenceLevel InteractionId interactionIdMaybePlaceholder Placeholder NoPlaceholderPositionInName BeginningMiddleEndConstrMetaIdmetaIdNameIdIsMacroMacroDef NotMacroDef IsInstance InstanceDefNotInstanceDef AnyIsAbstract anyIsAbstractLensIsAbstractlensIsAbstract IsAbstract AbstractDef ConcreteDefAccess PrivateAccess PublicAccessIsInfixInfixDef PrefixDef DataOrRecordIsDataIsRecord ProjOrigin ProjPrefix ProjPostfix ProjSystem ConOrigin ConOSystemConOConConORec ConOSplitRStringRawNameRangedrangeOf rangedThingArgNameNamedArg LensNamed lensNamed NamedNameNamed_NamednameOf namedThing Underscore underscore isUnderscoreArgargInfounArg LensArgInfo getArgInfo setArgInfo mapArgInfoArgInfo argInfoHidingargInfoModality argInfoOriginargInfoFreeVariablesLensFreeVariablesgetFreeVariablessetFreeVariablesmapFreeVariables FreeVariables UnknownFVsKnownFVs LensOrigin getOrigin setOrigin mapOrigin WithOriginwoOriginwoThingOrigin UserWrittenInserted Reflected CaseSplit Substitution LensCohesion getCohesion setCohesion mapCohesionCohesionFlat ContinuousSquash LensRelevance getRelevance setRelevance mapRelevance RelevanceRelevant NonStrict Irrelevant LensQuantity getQuantity setQuantity mapQuantityQuantity Quantity0 Quantity1 Quantityω QωOrigin QωInferredQω QωPlentyQ1Origin Q1InferredQ1Q1LinearQ0Origin Q0InferredQ0Q0Erased LensModality getModality setModality mapModalityModality modRelevance modQuantity modCohesion LensHiding getHiding setHiding mapHiding WithHidingwhHidingwhThingHidingHiddenInstance NotHidden Overlappable YesOverlap NoOverlap Induction Inductive CoInductiveHasEtaNoEtaYesEtaFileType AgdaFileType MdFileType RstFileType TexFileType OrgFileTypeDelayed NotDelayedArityNat mergeHidingvisible notVisiblehiddenhidehideOrKeepInstance makeInstance makeInstance'isOverlappable isInstance sameHidingdefaultModalitymoreUsableModalityusableModalitycomposeModality applyModalityinverseComposeModalityinverseApplyModality addModality zeroModality topModality sameModality lModRelevance lModQuantity lModCohesiongetRelevanceModsetRelevanceModmapRelevanceModgetQuantityModsetQuantityModmapQuantityModgetCohesionModsetCohesionModmapCohesionModdefaultQuantity sameQuantity addQuantity zeroQuantity topQuantity moreQuantitycomposeQuantity applyQuantityinverseComposeQuantityinverseApplyQuantity hasQuantity0 hasQuantity1 hasQuantityωnoUserQuantityusableQuantity allRelevancesdefaultRelevance isRelevant isIrrelevant isNonStrict moreRelevant sameRelevanceusableRelevancecomposeRelevanceapplyRelevanceinverseComposeRelevanceinverseApplyRelevance addRelevance zeroRelevance topRelevanceirrToNonStrictnonStrictToRelnonStrictToIrr allCohesionsdefaultCohesion moreCohesion sameCohesionusableCohesioncomposeCohesion applyCohesioninverseComposeCohesioninverseApplyCohesion addCohesion zeroCohesion topCohesionunknownFreeVariablesnoFreeVariablesoneFreeVariablefreeVariablesFromListhasNoFreeVariablesdefaultArgInfogetHidingArgInfosetHidingArgInfomapHidingArgInfogetModalityArgInfosetModalityArgInfomapModalityArgInfogetOriginArgInfosetOriginArgInfomapOriginArgInfogetFreeVariablesArgInfosetFreeVariablesArgInfomapFreeVariablesArgInfoisInsertedHidden defaultArg withArgsFromwithNamedArgsFromsameNameunnamednamed userNamed getNameOf setNameOf mapNameOf bareNameOfbareNameWithDefault namedSamefittingNamedArgnamedArgdefaultNamedArg unnamedArgupdateNamedArgupdateNamedArgA setNamedArgargNameToStringstringToArgNameappendArgNamesunrangedrawNameToStringstringToRawName bestConInfo noPlaceholdernoFixity defaultFixity noFixity' _fixityAssoc _fixityLeveldefaultImportDirisDefaultImportDirmapUsingsetImportedName noNotation$fKillRangeDelayed$fPrettyFileType$fNFDataHasEta$fKillRangeHasEta$fHasRangeHasEta$fNFDataInduction$fKillRangeInduction$fHasRangeInduction$fPrettyInduction$fNFDataOverlappable$fMonoidOverlappable$fSemigroupOverlappable$fNFDataHiding$fKillRangeHiding$fMonoidHiding$fSemigroupHiding$fPrettyHiding$fNFDataWithHiding$fKillRangeWithHiding$fSetRangeWithHiding$fHasRangeWithHiding$fApplicativeWithHiding$fDecorationWithHiding$fNFDataQ0Origin$fKillRangeQ0Origin$fSetRangeQ0Origin$fHasRangeQ0Origin$fNullQ0Origin$fMonoidQ0Origin$fSemigroupQ0Origin$fNFDataQ1Origin$fKillRangeQ1Origin$fSetRangeQ1Origin$fHasRangeQ1Origin$fNullQ1Origin$fMonoidQ1Origin$fSemigroupQ1Origin$fNFDataQωOrigin$fKillRangeQωOrigin$fSetRangeQωOrigin$fHasRangeQωOrigin$fNullQωOrigin$fMonoidQωOrigin$fSemigroupQωOrigin$fNFDataQuantity$fKillRangeQuantity$fSetRangeQuantity$fHasRangeQuantity$fLeftClosedPOMonoidQuantity$fPOMonoidQuantity$fPOSemigroupQuantity$fPartialOrdQuantity$fMonoidQuantity$fSemigroupQuantity$fLeftClosedPOMonoidRelevance$fPOMonoidRelevance$fPOSemigroupRelevance$fMonoidRelevance$fSemigroupRelevance$fPartialOrdRelevance$fOrdRelevance$fNFDataRelevance$fKillRangeRelevance$fSetRangeRelevance$fHasRangeRelevance$fLeftClosedPOMonoidCohesion$fPOMonoidCohesion$fPOSemigroupCohesion$fMonoidCohesion$fSemigroupCohesion$fPartialOrdCohesion $fOrdCohesion$fNFDataCohesion$fKillRangeCohesion$fSetRangeCohesion$fHasRangeCohesion$fNFDataModality$fKillRangeModality$fLeftClosedPOMonoidModality$fPOMonoidModality$fPOSemigroupModality$fPartialOrdModality$fMonoidModality$fSemigroupModality$fNFDataOrigin$fKillRangeOrigin$fNFDataWithOrigin$fKillRangeWithOrigin$fSetRangeWithOrigin$fHasRangeWithOrigin$fPrettyWithOrigin$fDecorationWithOrigin$fNFDataFreeVariables$fMonoidFreeVariables$fSemigroupFreeVariables$fNFDataArgInfo$fKillRangeArgInfo$fLensArgInfoArgInfo$fLensFreeVariablesArgInfo $fLensFreeVariablesFreeVariables$fLensOriginArgInfo$fLensOriginWithOrigin$fLensOriginOrigin$fLensModalityArgInfo$fLensModalityModality$fLensCohesionArgInfo$fLensCohesionCohesion$fLensCohesionModality$fLensRelevanceArgInfo$fLensRelevanceRelevance$fLensRelevanceModality$fLensQuantityArgInfo$fLensQuantityQuantity$fLensQuantityModality$fLensHidingArgInfo$fLensHidingWithHiding$fLensHidingHiding$fLensCohesionArg$fLensQuantityArg$fLensRelevanceArg$fLensFreeVariablesArg$fLensOriginArg$fLensModalityArg$fLensHidingArg$fLensArgInfoArg $fNFDataArg$fKillRangeArg $fSetRangeArg $fHasRangeArg$fDecorationArg$fUnderscoreDoc$fUnderscoreByteString$fUnderscore[] $fNFDataNamed$fKillRangeNamed$fSetRangeNamed$fHasRangeNamed$fDecorationNamed$fLensNamednameNamed$fLensNamednameMaybe$fLensNamednameArg$fNFDataRanged$fDecorationRanged$fKillRangeRanged$fHasRangeRanged $fOrdRanged $fEqRanged$fPrettyRanged$fKillRangeConOrigin$fKillRangeProjOrigin$fKillRangeAccess$fHasRangeAccess$fNFDataAccess$fPrettyAccess$fKillRangeIsAbstract$fMonoidIsAbstract$fSemigroupIsAbstract$fLensIsAbstractIsAbstract$fAnyIsAbstractMaybe$fAnyIsAbstract[]$fAnyIsAbstractIsAbstract$fNFDataIsInstance$fHasRangeIsInstance$fKillRangeIsInstance$fHasRangeIsMacro$fKillRangeIsMacro$fHashableNameId$fNFDataNameId $fEnumNameId$fPrettyNameId$fKillRangeNameId$fHashableMetaId$fNFDataMetaId $fShowMetaId$fPrettyMetaId$fNFDataMaybePlaceholder$fKillRangeMaybePlaceholder$fHasRangeMaybePlaceholder$fKillRangeInteractionId$fPrettyInteractionId$fNullFixityLevel$fNFDataFixity$fKillRangeFixity$fHasRangeFixity $fNullFixity $fOrdFixity $fEqFixity$fLensFixityFixity$fNFDataImportedName'$fKillRangeImportedName'$fHasRangeImportedName'$fNFDataUsing'$fKillRangeUsing'$fHasRangeUsing' $fNullUsing'$fMonoidUsing'$fSemigroupUsing'$fNFDataRenaming'$fKillRangeRenaming'$fHasRangeRenaming'$fNFDataImportDirective'$fKillRangeImportDirective'$fHasRangeImportDirective'$fNullImportDirective'$fNFDataTerminationCheck$fKillRangeTerminationCheck$fMonoidPositivityCheck$fSemigroupPositivityCheck$fKillRangePositivityCheck$fKillRangeUniverseCheck$fMonoidCoverageCheck$fSemigroupCoverageCheck$fKillRangeCoverageCheck$fKillRangeRewriteEqn'$fHasRangeRewriteEqn'$fPrettyRewriteEqn'$fNFDataRewriteEqn'$fNFDataExpandedEllipsis$fKillRangeExpandedEllipsis$fNullExpandedEllipsis$fNFDataGenPart$fKillRangeGenPart$fSetRangeGenPart$fHasRangeGenPart $fOrdGenPart $fEqGenPart$fLensFixityFixity'$fKillRangeFixity'$fNFDataFixity' $fNullFixity' $fEqFixity'$fLensFixity'Fixity' $fDataFixity' $fShowFixity' $fDataGenPart $fShowGenPart$fDataExpandedEllipsis$fShowExpandedEllipsis$fEqExpandedEllipsis$fDataRewriteEqn'$fEqRewriteEqn'$fShowRewriteEqn'$fFunctorRewriteEqn'$fFoldableRewriteEqn'$fTraversableRewriteEqn'$fEqCoverageCheck$fOrdCoverageCheck$fShowCoverageCheck$fBoundedCoverageCheck$fEnumCoverageCheck$fDataCoverageCheck$fEqUniverseCheck$fOrdUniverseCheck$fShowUniverseCheck$fBoundedUniverseCheck$fEnumUniverseCheck$fDataUniverseCheck$fEqPositivityCheck$fOrdPositivityCheck$fShowPositivityCheck$fBoundedPositivityCheck$fEnumPositivityCheck$fDataPositivityCheck$fDataTerminationCheck$fShowTerminationCheck$fEqTerminationCheck$fFunctorTerminationCheck$fDataImportDirective'$fEqImportDirective'$fDataRenaming' $fEqRenaming' $fDataUsing' $fEqUsing'$fDataImportedName'$fEqImportedName'$fOrdImportedName'$fShowImportedName' $fDataFixity $fShowFixity$fEqAssociativity$fOrdAssociativity$fShowAssociativity$fDataAssociativity$fEqFixityLevel$fOrdFixityLevel$fShowFixityLevel$fDataFixityLevel$fEqInteractionId$fOrdInteractionId$fShowInteractionId$fNumInteractionId$fIntegralInteractionId$fRealInteractionId$fEnumInteractionId$fDataInteractionId$fDataMaybePlaceholder$fEqMaybePlaceholder$fOrdMaybePlaceholder$fFunctorMaybePlaceholder$fFoldableMaybePlaceholder$fTraversableMaybePlaceholder$fShowMaybePlaceholder$fShowPositionInName$fEqPositionInName$fOrdPositionInName$fDataPositionInName $fEqMetaId $fOrdMetaId $fNumMetaId $fRealMetaId $fEnumMetaId$fIntegralMetaId $fDataMetaId$fGenericMetaId $fEqNameId $fOrdNameId $fDataNameId$fGenericNameId $fShowNameId $fDataIsMacro $fShowIsMacro $fEqIsMacro $fOrdIsMacro$fDataIsInstance$fShowIsInstance$fEqIsInstance$fOrdIsInstance$fDataIsAbstract$fShowIsAbstract$fEqIsAbstract$fOrdIsAbstract $fDataAccess $fShowAccess $fEqAccess $fOrdAccess $fDataIsInfix $fShowIsInfix $fEqIsInfix $fOrdIsInfix$fDataDataOrRecord$fEqDataOrRecord$fOrdDataOrRecord$fShowDataOrRecord$fDataProjOrigin$fShowProjOrigin$fEqProjOrigin$fOrdProjOrigin$fEnumProjOrigin$fBoundedProjOrigin$fDataConOrigin$fShowConOrigin $fEqConOrigin$fOrdConOrigin$fEnumConOrigin$fBoundedConOrigin $fDataRanged $fShowRanged$fFunctorRanged$fFoldableRanged$fTraversableRanged $fEqNamed $fOrdNamed $fShowNamed $fDataNamed$fFunctorNamed$fFoldableNamed$fTraversableNamed $fDataArg$fEqArg$fOrdArg $fShowArg $fFunctorArg $fFoldableArg$fTraversableArg $fDataArgInfo $fEqArgInfo $fOrdArgInfo $fShowArgInfo$fDataFreeVariables$fEqFreeVariables$fOrdFreeVariables$fShowFreeVariables$fDataWithOrigin$fEqWithOrigin$fOrdWithOrigin$fShowWithOrigin$fFunctorWithOrigin$fFoldableWithOrigin$fTraversableWithOrigin $fDataOrigin $fShowOrigin $fEqOrigin $fOrdOrigin$fDataModality $fEqModality $fOrdModality$fShowModality$fGenericModality$fDataCohesion$fShowCohesion $fEqCohesion$fEnumCohesion$fBoundedCohesion$fGenericCohesion$fDataRelevance$fShowRelevance $fEqRelevance$fEnumRelevance$fBoundedRelevance$fGenericRelevance$fDataQuantity$fShowQuantity$fGenericQuantity $fEqQuantity $fOrdQuantity$fDataQωOrigin$fShowQωOrigin$fGenericQωOrigin $fEqQωOrigin$fOrdQωOrigin$fDataQ1Origin$fShowQ1Origin$fGenericQ1Origin $fEqQ1Origin $fOrdQ1Origin$fDataQ0Origin$fShowQ0Origin$fGenericQ0Origin $fEqQ0Origin $fOrdQ0Origin$fDataWithHiding$fEqWithHiding$fOrdWithHiding$fShowWithHiding$fFunctorWithHiding$fFoldableWithHiding$fTraversableWithHiding $fDataHiding $fShowHiding $fEqHiding $fOrdHiding$fDataOverlappable$fShowOverlappable$fEqOverlappable$fOrdOverlappable$fDataInduction $fEqInduction$fOrdInduction$fShowInduction $fDataHasEta $fShowHasEta $fEqHasEta $fOrdHasEta$fDataFileType $fEqFileType $fOrdFileType$fShowFileType $fDataDelayed $fShowDelayed $fEqDelayed $fOrdDelayed ProcessorLayersLayer layerRoleinterval layerContent LayerRoleMarkupCommentCode atomizeLayersliterateSrcFileliterateProcessorsisCode isCodeLayer illiterateliterateExtsShortList literateTeX literateMd literateRsT literateOrg$fHasRangeLayer $fShowLayer$fShowLayerRole $fEqLayerRole PrecedenceKeyMemoKeyNodeK PostLeftsK PreRightsKTopKAppKNonfixK$fHashableMemoKey $fEqMemoKey $fShowMemoKey$fGenericMemoKeyIsNoNameisNoName LensInScope lensInScope isInScope mapInScope setInScope setNotInScope NameInScopeInScope NotInScopeNumHolesnumHolesTopLevelModuleNamemoduleNameRangemoduleNamePartsNamePartHoleIdNoName nameRange nameInScope nameNamePartsnameId isOpenMixfix nameToRawName namePartsnameStringPartsstringNameParts isOperatorisHoleisPrefix isPostfixisInfixisNonfixnextStrnextNamefirstNonTakenNamenameRootsameRootqualify unqualify qnameParts isQualified isUnqualifiedtoTopLevelModuleNamemoduleNameToFileName projectRootnoName_noName$fNFDataNamePart$fPrettyNamePart$fShowNamePart $fOrdNamePart $fEqNamePart$fKillRangeTopLevelModuleName$fSetRangeTopLevelModuleName$fHasRangeTopLevelModuleName$fPrettyTopLevelModuleName$fSizedTopLevelModuleName$fOrdTopLevelModuleName$fEqTopLevelModuleName $fNumHoles[]$fNFDataNameInScope $fNFDataName$fKillRangeName$fSetRangeName$fHasRangeName $fPrettyName $fShowName$fNumHolesName $fOrdName$fUnderscoreName $fNFDataQName$fKillRangeQName$fSetRangeQName$fHasRangeQName $fPrettyQName $fShowQName$fNumHolesQName$fUnderscoreQName$fLensInScopeQName$fLensInScopeName$fLensInScopeNameInScope$fIsNoNameWithOrigin$fIsNoNameRanged$fIsNoNameQName$fIsNoNameName$fIsNoNameByteString $fIsNoName[] $fDataQName $fOrdQName $fDataName$fEqNameInScope$fShowNameInScope$fDataNameInScope$fShowTopLevelModuleName$fDataTopLevelModuleName$fDataNamePart$fGenericNamePart ProblemId Comparison BackendNameModuleToSourceTCMTCMTunTCMTCStateTCEnvHighlightingLevelHighlightingMethod NamedMeta TCWarningTCErrWarningGlobalsglobalsUsesusesmodNameexports postscriptExportexpNamedefnMemberIdGlobalIdLocalIdSelfLocalGlobal UndefinedIntegerDoubleObjectApplyLookupBinOpPreOpPlainJS $fUsesExport $fUsesExp $fUsesMap$fUses[]$fGlobalsModule$fGlobalsExport $fGlobalsExp $fGlobalsMap $fGlobals[] $fShowModule $fShowExport $fShowExp $fEqMemberId $fOrdMemberId$fShowMemberId $fEqGlobalId $fOrdGlobalId$fShowGlobalId $fEqLocalId $fOrdLocalId $fShowLocalIdshift 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(,)$fEqElr$fEqEqReasoningState$fShowEqReasoningState 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$fLocalTerminationEnvHIRangesfromtorangesInvariant overlappingrangeToPositionsrangesToPositionsrToRrangeToEndPointsminus $fEqRanges $fShowRanges $fEqRange $fOrdRange $fShowRange ParseResultParseOk ParseFailed ParseWarningOverlappingTokensWarning warnRange ParseErrorOverlappingTokensErrorInvalidExtensionError ReadFileError errSrcFileerrPoserrInput errPrevTokenerrMsgerrRangeerrPath errValidExts errIOError ParseFlagsparseKeepComments LayoutContextNoLayoutLayoutLexState ParseStatePState parseSrcFileparsePos parseLastPosparseInp parsePrevCharparsePrevToken parseLayout parseLexState parseFlagsparseWarningName parseError initStatedefaultParseFlagsparsePosString parseFromSrc setParsePos setLastPos setPrevTokengetParseInterval getLexState pushLexState popLexState getParseFlags parseErrorAt parseError'parseErrorRangelexError topContext popContext pushContextpushCurrentContext$fHasRangeParseError$fPrettyParseError$fShowParseError$fHasRangeParseWarning$fPrettyParseWarning$fShowParseWarning$fShowParseResult$fDataParseWarning$fMonadStateParseStateParser$fMonadErrorParseErrorParser$fShowParseState$fShowParseFlags$fShowLayoutContextMkNamemkNamemkName_IsProjPisProjPAmbiguousQNameAmbQunAmbQMName mnameToListQNamedqnameqnamed qnameModule qnameName nameConcretenameBindingSite nameFixitynameIsRecordName uglyShowName unambiguousheadAmbQ isAmbiguousgetUnambiguousisAnonymousModuleName withRangesOf withRangesOfQ mnameFromList noModuleNamecommonParentModule qnameToList qnameFromList qnameToMName mnameToQName showQNameIdqnameToConcretemnameToConcretequalifyMqualifyQqualify_isLeParentModuleOfisLtParentModuleOfisLeChildModuleOfisLtChildModuleOf isInModule lensQNameName nameToArgName namedArgName$fLensFixityName$fLensFixity'Name$fHashableName$fNFDataModuleName$fSizedModuleName$fKillRangeModuleName$fSetRangeModuleName$fHasRangeModuleName$fPrettyModuleName$fShowModuleName $fSizedQName$fLensFixityQName$fLensFixity'QName$fHashableQName$fPrettyQNamed$fKillRangeAmbiguousQName$fHasRangeAmbiguousQName$fPrettyAmbiguousQName$fNumHolesAmbiguousQName $fIsProjPVoid$fIsProjPNamed $fIsProjPArg $fMkName[]$fEqAmbiguousQName$fOrdAmbiguousQName$fDataAmbiguousQName$fFunctorQNamed$fFoldableQNamed$fTraversableQNamed$fDataModuleName$fShowAmbiguousQName $fShowQNamedNotationSection sectNotationsectKind sectLevel sectIsSection NewNotationnotaName notaNames notaFixitynotationnotaIsOperator NotationKind InfixNotationPrefixNotationPostfixNotationNonfixNotation NoNotationHoleName LambdaHoleExprHole _bindHoleNameholeName isLambdaHole stringParts holeTargetisAHole isNormalHole isBindingHole notationKind mkNotationnamesToNotationuseDefaultFixity notationNamessyntaxOfmergeNotations _notaFixity noSection$fLensFixityNewNotation$fShowNotationSection$fShowNewNotation$fEqNotationKind$fShowNotationKindPrecedenceStack PrecedenceTopCtxFunctionSpaceDomainCtxLeftOperandCtxRightOperandCtx FunctionCtx ArgumentCtxInsideOperandCtx WithFunCtx WithArgCtx DotPatternCtxParenPreference PreferParenPreferParenlessThingWithFixity preferParenpreferParenlesspushPrecedenceheadPrecedence argumentCtx_ opBrackets opBrackets' lamBrackets appBrackets appBrackets'withAppBrackets piBracketsroundFixBrackets$fKillRangeThingWithFixity$fLensFixityThingWithFixity$fLensFixity'ThingWithFixity$fPrettyPrecedence$fShowPrecedence$fDataPrecedence$fEqPrecedence$fEqParenPreference$fOrdParenPreference$fShowParenPreference$fDataParenPreference$fFunctorThingWithFixity$fFoldableThingWithFixity$fTraversableThingWithFixity$fDataThingWithFixity$fShowThingWithFixityLitNat LitWord64LitFloat LitStringLitCharLitQNameLitMeta showString' showChar' compareFloat$fNFDataLiteral$fKillRangeLiteral$fSetRangeLiteral$fHasRangeLiteral $fOrdLiteral$fPrettyLiteral $fShowLiteral $fDataLiteral isUnreachableTError TUnreachableTAltTAConTAGuardTALitaConaArityaBodyaGuardaLitCaseInfocaseLazycaseTypeCaseTypeCTDataCTNatCTIntCTCharCTStringCTFloatCTQNameTPrimPAddPAdd64PSubPSub64PMulPMul64PQuotPQuot64PRemPRem64PGeqPLtPLt64PEqIPEq64PEqFPEqSPEqCPEqQPIfPSeqPITo64P64ToITTermTVarTDefTAppTLamTLitTConTLetTCaseTUnitTSortTErasedTCoerceArgsEvaluationStrategyLazyEvaluationEagerEvaluationCompiled cTreeless cArgUsageTPFnTPOpisPrimEq coerceViewmkTApptAppView coerceAppViewtLetViewtLamViewmkTLammkLettIntintView word64ViewtPlusK tNegPlusK plusKView negPlusKViewtOp tUnreachable tIfThenElse$fKillRangeCompiled$fUnreachableTTerm$fUnreachableTAlt$fDataCompiled$fShowCompiled $fEqCompiled $fOrdCompiled $fDataTTerm $fShowTTerm $fEqTTerm $fOrdTTerm $fDataTAlt $fShowTAlt$fEqTAlt $fOrdTAlt $fDataTError $fShowTError $fEqTError $fOrdTError$fDataCaseInfo$fShowCaseInfo $fEqCaseInfo $fOrdCaseInfo$fDataCaseType$fShowCaseType $fEqCaseType $fOrdCaseType $fDataTPrim $fShowTPrim $fEqTPrim $fOrdTPrim$fEqEvaluationStrategy$fShowEvaluationStrategy convertGuardsrecoverAsPatterns $fShowAsPatToken TokKeywordTokIdTokQId TokLiteral TokSymbol TokStringTokSetNTokPropNTokTeX TokMarkup TokCommentTokDummyTokEOFSymDotSymSemiSymVirtualSemiSymBarSymColonSymArrowSymEqual SymLambda SymUnderscoreSymQuestionMarkSymAs SymOpenParen SymCloseParenSymOpenIdiomBracketSymCloseIdiomBracketSymEmptyIdiomBracketSymDoubleOpenBraceSymDoubleCloseBrace SymOpenBrace SymCloseBraceSymOpenVirtualBraceSymCloseVirtualBrace SymOpenPragmaSymClosePragma SymEllipsis SymDotDot SymEndCommentKeywordKwLetKwInKwWhereKwDataKwCoDataKwDo KwPostulateKwMutual KwAbstract KwPrivate KwInstance KwOverlapKwOpenKwImportKwModule KwPrimitiveKwMacroKwInfixKwInfixLKwInfixRKwWith KwRewriteKwSetKwPropKwForallKwRecord KwConstructorKwField KwInductive KwCoInductiveKwEtaKwNoEtaKwHidingKwUsing KwRenamingKwToKwPublic KwOPTIONS KwBUILTINKwLINE KwFOREIGN KwCOMPILE KwIMPOSSIBLEKwSTATIC KwINJECTIVEKwINLINE KwNOINLINEKwETAKwNO_TERMINATION_CHECK KwTERMINATINGKwNON_TERMINATINGKwNON_COVERINGKwWARNING_ON_USAGEKwWARNING_ON_IMPORT KwMEASURE KwDISPLAY KwREWRITEKwQuote KwQuoteTerm KwUnquote KwUnquoteDecl KwUnquoteDefKwSyntax KwPatternSynKwTactic KwCATCHALL KwVariableKwNO_POSITIVITY_CHECK KwPOLARITYKwNO_UNIVERSE_CHECKlayoutKeywords$fHasRangeToken $fEqSymbol $fShowSymbol $fEqKeyword $fShowKeywordBackend lookupBackendactiveBackendMayEraseTypebuiltinBackends LineNumber LibWarning' UnknownFieldrunP parseLibFiletrimLineComment splitCommas$fShowGenericLine$fShowLibWarning'$fDataLibWarning'DAGdagGraphdagComponentMap dagNodeMapNodessrcNodestgtNodesallNodesEdgesourcetargetlabelGraphgraphedges neighbours neighboursMap edgesFromedgesTodiagonalnodes sourceNodes targetNodes computeNodes isolatedNodesdiscreteacyclic fromNodes fromNodeSet fromEdges fromEdgesWith insertEdgeinsertEdgeWith unionsWith mapWithEdge transposeEdge transposeclean removeNodes removeNode removeEdge filterEdgesunzip composeWithsccs'sccs dagInvariant oppositeDAG reachablesccDAG'sccDAG reachableFromreachableFromSetwalkSatisfyingcomplete completeIter1gaussJordanFloydWarshallMcNaughtonYamadaReference(gaussJordanFloydWarshallMcNaughtonYamadatransitiveClosure $fShowGraph $fPrettyGraph$fFunctorGraph $fPrettyEdge$fEqEdge $fOrdEdge $fFunctorEdge $fShowEdge $fEqGraphtopSortBounds 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 $fShowNode$fEqNode $fOrdNode $fShowLabel $fEqWeight $fShowWeight OccurrenceMixedJustNegJustPos StrictPosGuardPosUnusedWhere LeftOfArrowDefArgUnderInfVarArgMetaArg ConArgType IndArgTypeInClauseMatchedIsIndexInDefOf OccursWhereboundToEverySomeproductOfEdgesInBoundedWalk $fPrettyWhere$fSizedOccursWhere$fPrettyOccursWhere$fNullOccurrence$fStarSemiRingOccurrence$fSemiRingOccurrence$fKillRangeOccurrence$fNFDataOccurrence$fPrettyOccurrence$fDataOccurrence$fShowOccurrence$fEqOccurrence$fOrdOccurrence$fEnumOccurrence$fBoundedOccurrence$fShowOccursWhere$fEqOccursWhere$fOrdOccursWhere$fDataOccursWhere $fShowWhere $fEqWhere $fOrdWhere $fDataWhereAppView HoleContent HoleContent'HoleContentExprHoleContentRewritePragma OptionsPragma BuiltinPragma RewritePragma ForeignPragma CompilePragma StaticPragma InlinePragmaImpossiblePragma EtaPragmaWarningOnUsageWarningOnImportInjectivePragma DisplayPragmaCatchallPragmaTerminationCheckPragmaNoCoverageCheckPragmaNoPositivityCheckPragmaPolarityPragmaNoUniverseCheckPragma OpenShortHandDoOpenDontOpenModuleApplication SectionAppRecordModuleInstance DeclarationFieldSig GeneralizeField FunClauseDataSigDataDef RecordSig RecordDefInfix PatternSynMutualPrivate InstanceBMacro PrimitiveOpenImport ModuleMacro UnquoteDecl UnquoteDefTypeSignatureOrInstanceBlock TypeSignatureAsNameAsName'asNameasRange ExprWhere LamClauselamLHSlamRHSlamWhere lamCatchAll WhereClause'NoWhereAnyWhere SomeWhere WhereClauseRHS' AbsurdRHSRHSLHSCoreLHSHeadLHSProjLHSWith lhsDefNamelhsPats lhsDestructor lhsPatsLeftlhsFocuslhsHeadlhsWithPatternsWithExpr RewriteEqnlhsOriginalPattern lhsRewriteEqn lhsWithExprlhsExpandedEllipsis Telescope TypedBinding'TBind TypedBindingTacticAttribute BoundNameBName boundName bnameFixity bnameTactic LamBinding' DomainFree DomainFull LamBindingBinderBinder' binderPattern binderNameDoStmtDoBindDoThenDoLetPatternIdentPQuotePAppPRawAppPOpAppPHiddenP InstancePParenPWildPAbsurdPAsPDotPLitPRecPEqualP EllipsisPWithPExpr QuestionMarkRawAppOpAppWithApp HiddenArg InstanceArg AbsurdLam ExtendedLamFunSetNPropNRec RecUpdateParen IdiomBracketsDoBlockAbsurdAsDot DoubleDotETelQuote QuoteTermTacticUnquoteDontCareEqualEllipsis GeneralizedRecordAssignmentsRecordAssignmentModuleAssignment _qnameModA _exprModA_importDirModAFieldAssignmentFieldAssignment' _nameFieldA _exprFieldASyntaxBindingLambdaOrdinary fromOrdinary nameFieldA exprFieldA mkBinder_mkBinder mkBoundName_ mkBoundName countTelVarslamBindingsToTelescopemakePitopLevelModuleNamespanAllowedBeforeModuleappViewisSingleIdentifierPremoveSingletonRawAppP observeHiding isPattern isAbsurdP isBinderP$fNFDataFieldAssignment'$fKillRangeFieldAssignment'$fHasRangeFieldAssignment' $fNFDataRHS'$fNFDataWhereClause'$fNullWhereClause'$fNFDataDoStmt$fNFDataBoundName$fNFDataBinder'$fNFDataLamBinding'$fNFDataLamClause$fNFDataModuleAssignment $fNFDataLHS $fNFDataOpApp$fNFDataModuleApplication$fNFDataTypedBinding'$fNFDataAsName'$fNFDataPragma$fNFDataDeclaration$fNFDataPattern $fNFDataExpr$fKillRangeWhereClause'$fKillRangeTypedBinding'$fKillRangeRHS'$fKillRangePragma$fKillRangePattern$fKillRangeOpApp$fKillRangeModuleApplication$fKillRangeDoStmt$fKillRangeLamClause$fKillRangeLHS$fKillRangeLamBinding'$fKillRangeExpr$fKillRangeDeclaration$fKillRangeBoundName$fKillRangeBinder'$fKillRangeAsName'$fKillRangeModuleAssignment$fSetRangeTypedBinding'$fSetRangePattern$fHasRangePattern$fHasRangeAsName'$fHasRangePragma$fHasRangeDoStmt$fHasRangeLamClause$fHasRangeRHS' $fHasRangeLHS$fHasRangeDeclaration$fHasRangeModuleAssignment$fHasRangeModuleApplication$fHasRangeWhereClause'$fHasRangeBoundName$fHasRangeLamBinding'$fHasRangeTypedBinding'$fHasRangeBinder'$fHasRangeExpr$fHasRangeOpApp$fLensRelevanceTypedBinding'$fLensHidingTypedBinding'$fLensHidingLamBinding'$fHasRangeLHSCore$fFunctorHoleContent'$fFoldableHoleContent'$fTraversableHoleContent' $fDataLHSCore $fEqLHSCore $fDataPragma $fEqPragma $fDataPattern $fEqPattern $fDataExpr$fEqExpr$fDataDeclaration$fEqDeclaration$fDataModuleApplication$fEqModuleApplication$fDataTypedBinding'$fFunctorTypedBinding'$fFoldableTypedBinding'$fTraversableTypedBinding'$fEqTypedBinding'$fDataBoundName $fEqBoundName $fDataBinder' $fEqBinder'$fFunctorBinder'$fFoldableBinder'$fTraversableBinder' $fDataLHS$fEqLHS$fDataLamBinding'$fFunctorLamBinding'$fFoldableLamBinding'$fTraversableLamBinding'$fEqLamBinding'$fDataLamClause $fEqLamClause $fDataDoStmt $fEqDoStmt$fDataModuleAssignment$fEqModuleAssignment $fDataOpApp$fFunctorOpApp$fFoldableOpApp$fTraversableOpApp $fEqOpApp$fDataOpenShortHand$fEqOpenShortHand$fShowOpenShortHand $fDataAsName' $fShowAsName'$fFunctorAsName'$fFoldableAsName'$fTraversableAsName' $fEqAsName'$fDataWhereClause'$fFunctorWhereClause'$fFoldableWhereClause'$fTraversableWhereClause'$fEqWhereClause' $fDataRHS' $fFunctorRHS'$fFoldableRHS'$fTraversableRHS'$fEqRHS'$fDataFieldAssignment'$fFunctorFieldAssignment'$fFoldableFieldAssignment'$fTraversableFieldAssignment'$fShowFieldAssignment'$fEqFieldAssignment'Tel NamedBinding withHiding namedBindingSpecialCharacters_dbraces_lambda_arrow_forallQ_leftIdiomBrkt_rightIdiomBrkt_emptyIdiomBrktspecialCharactersbraces'dbracesforallQ leftIdiomBrktrightIdiomBrktemptyIdiomBrktbracesAndSemicolonsarrowlambda prettyHidingprettyRelevanceprettyQuantityprettyCohesion prettyTactic prettyTactic' isLabeledsmashTelpRecord prettyOpApp$fPrettyImportedName'$fPrettyRenaming'$fPrettyUsing'$fPrettyImportDirective'$fPrettyPattern $fPrettyNamed $fPrettyArg$fPrettyFixity'$fPrettyGenPart$fPrettyFixity$fPrettyPragma$fPrettyOpenShortHand$fPrettyDeclaration$fPrettyDoStmt$fPrettyModuleApplication$fPrettyLHSCore $fPrettyLHS$fPrettyWhereClause' $fPrettyRHS'$fPrettyBinder'$fPrettyBoundName$fPrettyLamClause$fPrettyModuleAssignment$fPrettyFieldAssignment'$fPrettyEither$fPrettyMaybePlaceholder $fPrettyOpApp$fPrettyCohesion$fPrettyQuantity$fPrettyQωOrigin$fPrettyQ1Origin$fPrettyQ0Origin$fPrettyRelevance$fPrettyWithHiding$fPrettyThingWithFixity$fPrettyTypedBinding'$fPrettyLamBinding'$fPrettyNamedBinding $fPrettyTel $fPrettyExpr $fShowDoStmt$fShowModuleApplication$fShowWhereClause'$fShowLamClause $fShowLHSCore $fShowLHS $fShowRHS' $fShowPragma$fShowRenaming' $fShowUsing'$fShowImportDirective'$fShowModuleAssignment$fShowBoundName$fShowLamBinding'$fShowTypedBinding' $fShowBinder' $fShowPattern$fShowDeclaration $fShowOpApp $fShowExprSplitTreeLabellblConstructorName lblSplitArglblLazy lblBindingsSplitTagSplitConSplitLit SplitCatchall SplitTrees' LazySplit StrictSplit SplitTree' SplittingDoneSplitAt splitBindingssplitArg splitLazy splitTrees SplitTrees SplitTreetoTreetoTrees$fKillRangeSplitTree'$fPrettySplitTree'$fKillRangeSplitTag$fPrettySplitTag$fPrettySplitTreeLabel$fShowSplitTag $fEqSplitTag $fOrdSplitTag$fDataSplitTag$fDataSplitTree'$fShowSplitTree'$fDataLazySplit$fShowLazySplit $fEqLazySplit$fOrdLazySplitPhaseParsingDeserializationScopingTyping Termination Positivity InjectivityProjectionLikenessCoverage Highlighting SerializationDeadCodeRecCheckReduceLevelCompareWith CompactionBuildInterface BinaryEncodeCompress OperatorsExprOperatorsPatternFree OccursCheckCheckLHSCheckRHSInstanceSearch UnifyIndicesInverseScopeLookup TopModule DefinitionisModuleAccount isDefAccountisInternalAccount benchmarksbillToIO billToPure$fMonadBenchPhaseIO $fPrettyPhase $fEqPhase $fOrdPhase $fShowPhase CPatternLike foldrCPatterntraverseCPatternAtraverseCPatternMLHSPatternViewLHSAppPLHSWithPIsWithPisWithP HasEllipsis hasEllipsis IsEllipsis isEllipsislhsPatternView lhsCoreApp lhsCoreWithlhsCoreAddSpinemapLhsOriginalPatternmapLhsOriginalPatternM hasCopatterns foldCPatternpreTraverseCPatternMpostTraverseCPatternM mapCPattern patternQNames patternNameshasWithPatterns isWithPatternnumberOfWithPatterns hasEllipsis'reintroduceEllipsis splitEllipsispatternAppView$fIsEllipsisPattern$fHasEllipsisLHS$fHasEllipsisPattern$fIsWithPNamed $fIsWithPArg$fIsWithPPattern$fCPatternLikeFieldAssignment'$fCPatternLikeMaybe$fCPatternLike[]$fCPatternLikeNamed$fCPatternLikeArg$fCPatternLike(,)$fCPatternLikePatternNKInPrePostNon OperatorType ParseSectionsDoNotParseSectionsIsExprexprView unExprView patternViewExprViewLocalVWildVOtherVAppVOpAppV HiddenArgV InstanceArgVLamVParenV placeholdermaybePlaceholdersatNoPlaceholderpartPatLeastTwoParts patternBinderopPargsPappP$fIsExprPattern $fIsExprExpr$fHasRangeExprView$fEqParseSections$fShowParseSectionsExprLikemapExpr traverseExprfoldExpr$fExprLikeDeclaration$fExprLikeModuleApplication$fExprLikeDoStmt$fExprLikeLamClause$fExprLikeRewriteEqn' $fExprLikeLHS$fExprLikeLamBinding'$fExprLikeOpApp$fExprLikeModuleAssignment$fExprLikeFieldAssignment'$fExprLikeExpr$fExprLike(,,,)$fExprLike(,,) $fExprLike(,)$fExprLikeWhereClause'$fExprLikeRHS'$fExprLikeTypedBinding'$fExprLikeEither$fExprLikeMaybePlaceholder$fExprLikeMaybe $fExprLike[] $fExprLikeArg$fExprLikeNamed$fExprLikeWithHiding$fExprLikeBool$fExprLikeQName$fExprLikeName $fExprLike()DoWarnNoWarnMonadFixityErrorthrowMultipleFixityDeclsthrowMultiplePolarityPragmaswarnUnknownNamesInFixityDecl!warnUnknownNamesInPolarityPragmaswarnUnknownFixityInMixfixDecl#warnPolarityPragmasButNotPostulatesFixitiesfixitiesAndPolarities$fMonoidMonadicFixPol$fSemigroupMonadicFixPol$fMonoidDeclaredNames$fSemigroupDeclaredNames $fEqDoWarn $fShowDoWarn LensAttribute AttributeRelevanceAttributeQuantityAttributeCohesionAttributerelevanceAttributeTablequantityAttributeTablecohesionAttributeTable attributesMapstringToAttributeexprToAttribute setAttribute setAttributessetPristineRelevancesetPristineQuantitysetPristineCohesionsetPristineAttributesetPristineAttributesisRelevanceAttributeisQuantityAttributeisTacticAttributerelevanceAttributesquantityAttributestacticAttributes$fKillRangeAttribute$fSetRangeAttribute$fHasRangeAttribute$fShowAttributeCompressedFilerangesHighlightingInfoFilemapping TokenBasedNotOnlyTokenBasedDefinitionSite defSiteModule defSitePos defSiteHere defSiteAnchorAspectsaspect otherAspectsnotedefinitionSite tokenBased OtherAspect DottedPattern UnsolvedMetaUnsolvedConstraintTerminationProblemPositivityProblemDeadcodeShadowingInTelescopeCoverageProblemIncompletePattern TypeChecksMissingDefinitionCatchallClauseConfluenceProblemNameKind GeneralizableFunctionArgumentAspectNumber PrimitiveType Background parserBasedseveralmerge smallestPostoMapcompressedFileInvariantcompress decompressnoHighlightingInRange singletonCseveralCmergeCsplitAtCselectC smallestPosC$fEqDefinitionSite$fMonoidTokenBased$fSemigroupTokenBased$fMonoidAspects$fSemigroupAspects $fEqAspects $fMonoidFile$fSemigroupFile$fMonoidCompressedFile$fSemigroupCompressedFile$fEqCompressedFile$fShowCompressedFile$fEqFile $fShowFile $fShowAspects$fEqTokenBased$fShowTokenBased$fShowDefinitionSite$fEqOtherAspect$fOrdOtherAspect$fShowOtherAspect$fEnumOtherAspect$fBoundedOtherAspect $fEqAspect $fShowAspect $fEqNameKind$fShowNameKindInteractionOutputCallbackStatus GiveResultRemoveTokenBasedHighlighting DisplayInfoMakeCaseVariantResponseResp_HighlightingInfo Resp_StatusResp_JumpToErrorResp_InteractionPointsResp_GiveAction Resp_MakeCase Resp_SolveAllResp_DisplayInfoResp_RunningInfoResp_ClearRunningInfoResp_ClearHighlightingResp_DoneAbortingResp_DoneExiting defaultInteractionOutputCallback CompareResult Dominates IsDominated dominated notDominated dominator FavoritescompareWithFavoritescompareFavorites unionComparedinsertCompared$fMonoidFavorites$fSemigroupFavorites $fEqFavorites$fFoldableFavorites$fShowFavorites$fNullFavorites$fSingletonaFavorites AssocListupdate mapWithKey mapWithKeyMSetBindingSitesetBindingSiteAllowAmbiguousNamesAmbiguousAnythingAmbiguousConProjsAmbiguousNothing UsingOrHiding UsingOnly HidingOnly ResolvedNameVarName DefinedName FieldNameConstructorNamePatternSynResName UnknownName resolvedVarresolvedBindingSourceAbstractModule AbsModuleamodName amodLineage NameMetadata NoMetadataGeneralizedVarsMetadata AbstractNameAbsName anameName anameKind anameLineage anameMetadata WhyInScopeDefinedOpenedApplied KindsOfNamesAllKindsOfNamesSomeKindsOfNamesExceptKindsOfNames KindOfNameConNameFldNamePatternSynNameGeneralizeNameDisallowedGeneralizeName MacroName QuotableNameDataNameRecNameFunName AxiomNamePrimName OtherDefName NameOrModule NameNotModule ModuleNotName inScopeTag InScopeTagNameTag ModuleTag InScopeSetModulesInScope NamesInScope ThingsInScope NameSpacensNames nsModules nsInScopeLocalVarlocalVarlocalBindingSourcelocalShadowedBy BindingSource LambdaBound PatternBoundLetBound LocalVars ModuleMapNameMap ScopeInfo _scopeCurrent _scopeModules_scopeVarsToBind _scopeLocals_scopePrecedence_scopeInverseName_scopeInverseModule _scopeInScope_scopeFixities_scopePolaritiesScopeNameSpaces NameSpaceId PrivateNSPublicNS ImportedNSScope scopeName scopeParentsscopeNameSpaces scopeImportsscopeDatatypeModule allNameSpaceslocalNameSpacenameSpaceAccessscopeNameSpaceupdateScopeNameSpacesupdateScopeNameSpacesM shadowLocalpatternToModuleBoundnotShadowedLocalnotShadowedLocals scopeCurrent scopeModulesscopeVarsToBind scopeLocalsscopePrecedencescopeInverseNamescopeInverseModule scopeInScope scopeFixitiesscopePolaritiesscopeFixitiesAndPolaritiesupdateVarsToBind setVarsToBindupdateScopeLocalssetScopeLocals inNameSpace isDefNameelemKindsOfNamesallKindsOfNamessomeKindsOfNamesexceptKindsOfNames lensAnameName lensAmodName mergeNamesmergeNamesManyemptyNameSpace mapNameSpace zipNameSpace mapNameSpaceM emptyScopeemptyScopeInfomapScope mapScope_ mapScopeNS mapScopeM mapScopeM_zipScope zipScope_recomputeInScopeSets filterScopeallNamesInScopeallNamesInScope'exportedNamesInScope namesInScopeallThingsInScope thingsInScope mergeScope mergeScopessetScopeAccess setNameSpacemodifyNameSpaceaddNameToScoperemoveNameFromScopeaddModuleToScope usingOrHidingapplyImportDirectiveapplyImportDirective_renameCanonicalNamesrestrictPrivaterestrictLocalPrivatedisallowGeneralizedVarsinScopeBecause publicModules publicNameseverythingInScopeeverythingInScopeQualified flattenScopeconcreteNamesInScope scopeLookup scopeLookup' isNameInScopeinverseScopeLookupinverseScopeLookup'recomputeInverseScopeMapsinverseScopeLookupNameinverseScopeLookupName'inverseScopeLookupModuleprettyNameSpace blockOfLines$fPrettyNameSpaceId$fSetRangeAbstractName$fHasRangeAbstractName$fPrettyAbstractName$fLensFixityAbstractName$fOrdAbstractName$fEqAbstractName$fPrettyLocalVar $fOrdLocalVar $fEqLocalVar$fPrettyAbstractModule$fOrdAbstractModule$fEqAbstractModule$fInScopeAbstractModule$fInScopeAbstractName$fPrettyNameSpace $fPrettyScope$fKillRangeScopeInfo$fPrettyScopeInfo $fEqScopeInfo$fPrettyResolvedName$fSetBindingSiteAbstractModule$fSetBindingSiteAbstractName$fSetBindingSiteModuleName$fSetBindingSiteQName$fSetBindingSiteName$fSetBindingSite[]$fEqAllowAmbiguousNames$fDataResolvedName$fShowResolvedName$fEqResolvedName$fDataScopeInfo$fShowScopeInfo $fDataScope $fEqScope $fShowScope$fDataNameSpace $fEqNameSpace$fShowNameSpace$fDataAbstractModule$fShowAbstractModule$fDataLocalVar$fShowLocalVar$fDataAbstractName$fShowAbstractName$fDataNameMetadata$fShowNameMetadata$fDataWhyInScope$fShowWhyInScope$fEqKindOfName$fOrdKindOfName$fShowKindOfName$fDataKindOfName$fEnumKindOfName$fBoundedKindOfName$fDataNameOrModule$fEqNameOrModule$fOrdNameOrModule$fShowNameOrModule$fEnumNameOrModule$fBoundedNameOrModule$fDataBindingSource$fShowBindingSource$fEqBindingSource$fDataNameSpaceId$fEqNameSpaceId$fBoundedNameSpaceId$fEnumNameSpaceId$fShowNameSpaceIddontDescendIntoinstanceUniverseBiT'instanceTransformBiMT' ConPatLazy ConPatEager ConPatInfo conPatOrigin conPatInfo conPatLazyPatInfoPatRangeLHSInfolhsRange lhsEllipsis MutualInfomutualTerminationCheckmutualCoverageCheckmutualPositivityCheck mutualRangeDeclInfodeclName declRangeDefInfo'DefInfo defFixity defAccess defAbstract defInstancedefMacrodefInfo defTacticLetInfoLetRange 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$fAnyIsAbstractDefInfo'$fLensIsAbstractDefInfo'$fKillRangeDefInfo'$fSetRangeDefInfo'$fHasRangeDefInfo'$fKillRangeMutualInfo$fHasRangeMutualInfo$fNullMutualInfo $fNullLHSInfo$fKillRangeLHSInfo$fHasRangeLHSInfo$fSetRangeConPatInfo$fKillRangeConPatInfo$fHasRangeConPatInfo$fDataConPatInfo$fEqConPatInfo$fShowConPatInfo$fDataConPatLazy$fEqConPatLazy$fOrdConPatLazy$fShowConPatLazy$fBoundedConPatLazy$fEnumConPatLazy $fDataPatInfo $fEqPatInfo $fNullPatInfo $fShowPatInfo$fSetRangePatInfo$fHasRangePatInfo$fKillRangePatInfo $fDataLHSInfo $fShowLHSInfo $fEqLHSInfo$fDataMutualInfo$fShowMutualInfo$fEqMutualInfo$fDataDefInfo'$fShowDefInfo' $fEqDefInfo'$fDataDeclInfo$fShowDeclInfo $fEqDeclInfo $fDataLetInfo $fShowLetInfo $fEqLetInfo $fNullLetInfo$fDataModuleInfo$fEqModuleInfo$fShowModuleInfo $fDataAppInfo $fShowAppInfo $fEqAppInfo $fOrdAppInfo$fDataExprInfo$fShowExprInfo $fEqExprInfo$fNullExprInfo$fDataMetaInfo$fShowMetaInfo $fEqMetaInfoDiagonalMatrixunMMIxrowcolSizerowscolssquaresupSize fromIndexList fromLists toSparseRowstoLists isSingleton zipAssocWith zipMatrices intersectWithinterAssocWith addColumnaddRow $fShowMatrix$fPartialOrdMatrix$fDiagonalMatrixb$fPrettyMatrix$fTransposeMatrix$fTransposeMIx$fTransposeSize $fEqMatrix $fOrdMatrix$fFunctorMatrix$fFoldableMatrix$fTraversableMatrix$fEqMIx$fOrdMIx $fShowMIx$fIxMIx$fEqSize $fOrdSize $fShowSizeNotWorsenotWorseOrderDecrUnknownMatincreasedecrease 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 $fShowCMSet$fSemigroupCMSet $fMonoidCMSet $fNullCMSet$fSingletonCallMatrixAugCMSet$fEqCallMatrixAug$fShowCallMatrixAug$fEqCallMatrix'$fOrdCallMatrix'$fShowCallMatrix'$fFunctorCallMatrix'$fFoldableCallMatrix'$fTraversableCallMatrix'$fPartialOrdCallMatrix'$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' LookAheadlookAheadErrorgetInputsetInputnextCharsyncrollback eatNextCharmatchmatch' runLookAhead$fFunctorLookAhead$fApplicativeLookAhead$fMonadLookAhead litStringlitCharinStateeof followedByliteral'literal identifiersymbolkeywordend_begin_endWith beginWithbegin withLayout withInterval' withIntervallexToken emptyLayoutnewLayoutContext offsideRule keepComments keepCommentsM nestedCommenthole skipBlock AlexReturnAlexEOF AlexErrorAlexSkip AlexTokennormallayout empty_layoutbolimp_dirlexercode alexScanUser tokensParser exprParserexprWhereParser moduleParsermoduleNameParserholeContentParser splitOnDots$fSetRangeAttr$fHasRangeAttr$fShowRHSOrTypeSigs$fEqRecordDirective$fShowRecordDirective withInterval_end openBrace closeBracePMunPMrunPMIO readFilePMacceptableFileExts parseFile $fFunctorPM$fApplicativePM $fMonadPM$fMonadErrorParseErrorPM $fMonadIOPMTermSizetermSizetsize IsProjElim isProjElim SuggestionSuggest suggestNameSgTelsgTel TelToArgs telToArgsListTelListTel' IntervalViewIZeroIOneIMinIMaxINegOTermPathViewPathTypeOTypepathSortpathName pathLevelpathTypepathLhspathRhs EqualityView EqualityType OtherTypeeqtSorteqtName eqtParamseqtTypeeqtLhseqtRhsPatternSubstitution Substitution'IdSEmptyS:# StrengthenWk PatternVars patternVarsConPatternInfoconPInfo conPRecordconPFallThroughconPTypeconPLazyDeBruijnPatternDBPatVar dbPatVarName dbPatVarIndexPattern'VarPConPProjPIApplyPDefP PatOrigin PatOSystem PatOSplitPatOVarPatODotPatOWildPatOConPatORecPatOLit PatOAbsurd PatternInfo patOrigin patAsNames PatVarNameclauseLHSRangeclauseFullRange clauseTelnamedClausePats clauseBody clauseTypeclauseCatchallclauseRecursiveclauseUnreachableclauseEllipsisNAPsBlocked_ NotBlockedtheBlockingMetaignoreBlockingblockingStatusStuckOn Underapplied AbsurdMatchMissingClausesReallyNotBlocked BraveTermunBrave LevelAtom LevelAtom' MetaLevel BlockedLevel NeutralLevelUnreducedLevel PlusLevel PlusLevel'Level'MaxSort'InfSizeUnivPiSortFunSortUnivSortMetaSDefSDummySTeleEmptyTel ExtendTelLensSortlensSortgetSortType'Type''El_getSortunElNoAbsabsNameunAbsElimsElimElim'ProjIApplyConInfoMetaVDummy LensConName getConName setConName mapConNameConHeadconName conInductive conFields NamedArgsDomDom'domInfo domFinitedomName domTacticunDom ClosedLevel argFromDomnamedArgFromDom domFromArgdomFromNamedArg defaultDom defaultArgDomdefaultNamedArgDomstuckOn clausePatspatVarNameToStringnameToPatVarNamedefaultPatternInfovarPdotPlitP namedVarP namedDBVarPabsurdPnoConPatternInfotoConPatternInfofromConPatternInfo patternInfo patternOriginproperlyMatchingproperlyMatching'isEqualityType isPathTypeisIOne absurdBody isAbsurdBodyabsurdPatternNameisAbsurdPatternNamevar dummyTerm' dummyLevel' dummyTerm__DUMMY_TERM__ dummyLevel__DUMMY_LEVEL__ dummySort__DUMMY_SORT__ dummyType__DUMMY_TYPE__dummyDom __DUMMY_DOM__ atomicLevelunreducedLevelsortvarSorttmSort levelPluslevelSucmkTypemkPropisSortimpossibleTerm mapAbsNamesM mapAbsNamesreplaceEmptyName telFromList' telFromList telToListlistTel blockingMetablocked notBlockedblocked_ notBlocked_ stripDontCarearitysuggestsunSpineunSpine'hasElims isApplyElim isApplyElim' allApplyElimssplitApplyElims argsFromElims allProjElimspDomprettyPrecLevelSucs $fPrettyDom'$fLensCohesionDom'$fLensQuantityDom'$fLensRelevanceDom'$fLensFreeVariablesDom'$fLensOriginDom'$fLensModalityDom'$fLensHidingDom'$fLensArgInfoDom'$fLensNamedWithOriginDom'$fEqDom'$fKillRangeDom'$fHasRangeDom'$fDecorationDom'$fKillRangeConHead$fHasRangeConHead$fPrettyConHead $fOrdConHead $fEqConHead$fLensConNameConHead$fSetRangeConHead $fNFDataElim' $fPrettyElim'$fKillRangeElim'$fLensOriginElim'$fKillRangeAbs $fSizedAbs $fShowAbs$fDecorationAbs$fKillRangeTele $fSizedTele $fNullTele $fNFDataDom'$fNFDataLevel' $fNFDataSort'$fNFDataType'' $fNFDataTerm$fPrettyType'' $fPrettySort'$fPrettyLevel' $fPrettyTele $fPrettyTerm$fKillRangeSort'$fKillRangeType''$fKillRangeLevel'$fKillRangeTerm$fMonoidNotBlocked$fSemigroupNotBlocked$fDecorationType''$fNFDataLevelAtom'$fPrettyLevelAtom'$fKillRangeLevelAtom'$fNFDataPlusLevel'$fPrettyPlusLevel'$fKillRangePlusLevel' $fLensSortArg$fLensSortDom'$fLensSortType''$fKillRangeBlocked$fApplicativeBlocked$fMonoidBlocked$fSemigroupBlocked$fKillRangePatOrigin$fKillRangePatternInfo$fPrettyDBPatVar$fKillRangeDBPatVar$fKillRangeConPatternInfo$fPrettyPattern'$fKillRangePattern'$fIsProjPPattern'$fPrettyClause$fKillRangeClause $fNullClause$fHasRangeClause$fPatternVarsa[]$fPatternVarsaArg$fPatternVarsaArg0$fPrettySubstitution'$fNullSubstitution'$fKillRangeSubstitution'$fTelToArgsTele $fTelToArgs[] $fSgTelDom' $fSgTelDom'0 $fSgTel(,) $fSuggestTerm $fSuggestName $fSuggestAbs $fSuggest[]$fIsProjElimElim'$fTermSizeSubstitution'$fTermSizeLevelAtom'$fTermSizePlusLevel'$fTermSizeLevel'$fTermSizeSort'$fTermSizeTerm $fTermSizet$fShowIntervalView$fShowSubstitution'$fFunctorSubstitution'$fFoldableSubstitution'$fTraversableSubstitution'$fDataSubstitution' $fDataClause $fShowClause$fDataPattern'$fShowPattern'$fFunctorPattern'$fFoldablePattern'$fTraversablePattern'$fDataConPatternInfo$fShowConPatternInfo$fDataDBPatVar$fShowDBPatVar $fEqDBPatVar$fDataPatternInfo$fShowPatternInfo$fEqPatternInfo$fDataPatOrigin$fShowPatOrigin $fEqPatOrigin $fDataBlocked $fShowBlocked$fFunctorBlocked$fFoldableBlocked$fTraversableBlocked$fDataBraveTerm$fShowBraveTerm$fShowNotBlocked$fDataNotBlocked $fDataTerm $fShowTerm $fShowLevel' $fDataLevel'$fShowPlusLevel'$fDataPlusLevel'$fShowLevelAtom'$fDataLevelAtom' $fDataSort' $fShowSort' $fDataType'' $fShowType''$fFunctorType''$fFoldableType''$fTraversableType'' $fDataTele $fShowTele $fFunctorTele$fFoldableTele$fTraversableTele $fDataAbs $fFunctorAbs $fFoldableAbs$fTraversableAbs $fDataElim' $fShowElim'$fFunctorElim'$fFoldableElim'$fTraversableElim' $fDataConHead $fShowConHead $fDataDom' $fShowDom' $fFunctorDom'$fFoldableDom'$fTraversableDom'DeBruijn deBruijnVardebruijnNamedVar deBruijnView$fDeBruijnDBPatVar$fDeBruijnLevel'$fDeBruijnPlusLevel'$fDeBruijnLevelAtom'$fDeBruijnTermPrecomputeFreeVarsprecomputeFreeVarsprecomputeFreeVars_precomputedFreeVars$fPrecomputeFreeVars(,)$fPrecomputeFreeVarsMaybe$fPrecomputeFreeVars[]$fPrecomputeFreeVarsElim'$fPrecomputeFreeVarsType''$fPrecomputeFreeVarsLevelAtom'$fPrecomputeFreeVarsPlusLevel'$fPrecomputeFreeVarsLevel'$fPrecomputeFreeVarsSort'$fPrecomputeFreeVarsTerm$fPrecomputeFreeVarsAbs$fPrecomputeFreeVarsDom'$fPrecomputeFreeVarsArg freeVars'FreeMFreeTFreeEnv SingleVarVariableFreeEnv'feExtra feFlexRig feModality feSingleton IgnoreSorts IgnoreNotIgnoreInAnnotations IgnoreAll FlexRigMap theFlexRigMap TheFlexRigMapVarMap TheVarMapVarMap' theVarMap TheVarMap'IsVarSet withVarOccVarOccVarOcc' varFlexRig varModality LensFlexRig lensFlexRigFlexRigFlexRig'Flexible WeaklyRigid Unguarded StronglyRigidMetaSet theMetaSet insertMetaSet foldrMetaSet isFlexible isUnguarded isWeaklyRigidisStronglyRigid addFlexRig zeroFlexRig omegaFlexRigcomposeFlexRig oneFlexRig topVarOcc composeVarOcc oneVarOcc mapVarMap lookupVarMap mapFlexRigMap feIgnoreSorts initFreeEnvrunFreeMvariablesubVar underBinder underBinder' underModalityunderRelevance underFlexRigunderConstructor$fSingletonMetaId()$fSingletonMetaIdMetaSet$fLensFlexRigaFlexRig'$fMonoidVarOcc'$fSemigroupVarOcc'$fLensFlexRigaVarOcc'$fLensQuantityVarOcc'$fLensRelevanceVarOcc'$fLensModalityVarOcc' $fEqVarOcc'$fIsVarSetaVarMap'$fMonoidVarMap'$fSemigroupVarMap'$fSingletonIntVarMap'$fLensQuantityFreeEnv'$fLensRelevanceFreeEnv'$fLensModalityFreeEnv'$fLensFlexRigaFreeEnv'$fIsVarSet()FlexRigMap$fMonoidFlexRigMap$fSemigroupFlexRigMap$fMonoidReaderT$fSemigroupReaderT$fFreeEqualityView $fFreeClause $fFreeTele $fFreeAbs $fFreeDom' $fFreeArg $fFreeElim' $fFree(,,) $fFree(,)$fFreeWithHiding $fFreeMaybe$fFree[]$fFreeLevelAtom'$fFreePlusLevel' $fFreeLevel' $fFreeSort' $fFreeType'' $fFreeTerm$fShowFlexRigMap$fSingleton(,)FlexRigMap$fEqIgnoreSorts$fShowIgnoreSorts $fEqVarMap' $fShowVarMap' $fShowVarOcc' $fEqFlexRig'$fShowFlexRig'$fFunctorFlexRig'$fFoldableFlexRig' $fEqMetaSet $fShowMetaSet $fNullMetaSet$fSemigroupMetaSet$fMonoidMetaSet VarCounts varCountsrunFreevarOccurrenceInflexRigOccurrenceInfreeInfreeInIgnoringSorts isBinderUsedrelevantInIgnoringSortAnn relevantInclosed allFreeVarsallRelevantVarsIgnoringallRelevantVars filterVarMapfilterVarMapToListstronglyRigidVars unguardedVars rigidVarsallVars$fIsVarSet()All$fIsVarSet()Any$fIsVarSet()[]$fIsVarSet()IntSet$fSingletonIntVarCounts$fIsVarSet()VarCounts$fMonoidVarCounts$fSemigroupVarCounts$fIsVarSetMetaSetSingleVarOcc$fMonoidSingleVarOcc$fSemigroupSingleVarOcc$fIsVarSet()SingleFlexRig$fMonoidSingleFlexRig$fSemigroupSingleFlexRig$fIsVarSetaRelevantIn$fSemigroupRelevantIn$fMonoidRelevantInSubst applySubstabstractapplyEapplysapply1raise raiseFrom strengthen substUnderidSwkSraiseSconsS singletonSinplaceSdropScomposeSsplitS++#prependS parallelScompactS strengthenSlookupSlistSabsApp lazyAbsAppnoabsAppabsBodymkAbsreAbsunderAbs underLambdas$fSubstTermQNameFunDefDataConstructorAxiom AbsurdClauseSetSLitSUnknownSExtLam argsToElims$fShowDefinition $fShowSortTermLike traverseTermMcopyTerm$fTermLikeEqualityView$fTermLikeSort'$fTermLikeType''$fTermLikeLevelAtom'$fTermLikePlusLevel'$fTermLikeLevel'$fTermLikeTerm$fTermLike(,,,)$fTermLike(,,) $fTermLike(,)$fTermLikeWithHiding$fTermLikeTele$fTermLikeBlocked $fTermLikeAbs$fTermLikeMaybe $fTermLike[]$fTermLikeDom' $fTermLikeArg$fTermLikeElim'$fTermLikeQName$fTermLikeChar$fTermLikeInteger $fTermLikeInt$fTermLikeBoolCompiledClausesCompiledClauses'DoneBranches projPatterns conBranches etaBranch litBranchescatchAllBranch fallThrough lazyMatch WithAritycontentlitCaseconCaseetaCaseprojCasecatchAllcheckLazyMatch hasCatchAllhasProjectionPatterns prettyMap$fTermLikeWithArity$fKillRangeWithArity$fPrettyWithArity$fMonoidWithArity$fSemigroupWithArity$fTermLikeCase$fKillRangeCase $fPrettyCase $fNullCase $fMonoidCase$fSemigroupCase$fTermLikeCompiledClauses'$fKillRangeCompiledClauses'$fPrettyCompiledClauses'$fDataCompiledClauses'$fFunctorCompiledClauses'$fTraversableCompiledClauses'$fFoldableCompiledClauses'$fShowCompiledClauses' $fDataCase $fFunctorCase$fFoldableCase$fTraversableCase $fShowCase$fDataWithArity$fFunctorWithArity$fFoldableWithArity$fTraversableWithArity$fShowWithArityallMetas allMetasListnoMetas firstMetaGetDefsgetDefs MonadGetDefsdoDefdoMeta GetDefsEnv lookupMetaembDefGetDefsMgetDefs' $fGetDefs(,) $fGetDefsAbs $fGetDefsDom' $fGetDefsArg$fGetDefsElim' $fGetDefs[]$fGetDefsMaybe$fGetDefsLevelAtom'$fGetDefsPlusLevel'$fGetDefsLevel'$fGetDefsSort'$fGetDefsType''$fGetDefsMetaId $fGetDefsTerm$fGetDefsClause$fMonadGetDefsReaderTPatterns PatternSynPLHSCore'lhsInfolhsCoreSpineLHS spLhsInfo spLhsDefName spLhsPatsWithRHS RewriteRHSrhsExpr rhsConcrete rewriteExprsrewriteStrippedPats rewriteRHSrewriteWhereDecls SpineClauseWhereDeclarations WhereDecls whereModule whereDeclsClause' clauseLHSclauseStrippedPats clauseRHSclauseWhereDecls ProblemEq problemInPat problemInst problemType DataDefParamsdataDefGeneralizedParams dataDefParamsGeneralizeTelescope GeneralizeTelgeneralizeTelVars generalizeTel TacticAttr LetBindingLetBind LetPatBindLetApplyLetOpenLetDeclaredVariableBuiltinNoDefPragmaSectionRecSigRecDef PatternSynDef ScopedDecl ScopeCopyInfo renModulesrenNamesRenFunSigNoFunSig RecordAssigns RecordAssignAssignsAssign ScopedExprBindNameunBind mkBindName generalized initCopyInfoextractPattern mkDomainFreemkTBindnoDataDefParams noWhereDecls $fOrdBindName $fEqBindName$fKillRangeScopeCopyInfo$fPrettyScopeCopyInfo$fSetRangePattern'$fHasRangePattern'$fKillRangeLHSCore'$fHasRangeLHSCore'$fKillRangeLetBinding$fKillRangeWhereDeclarations$fKillRangeRHS$fKillRangeProblemEq$fKillRangeClause'$fKillRangeTypedBinding$fKillRangeDataDefParams$fKillRangeGeneralizeTelescope$fKillRangeLamBinding$fHasRangeLetBinding$fHasRangeWhereDeclarations $fHasRangeRHS$fHasRangeClause'$fHasRangeTypedBinding$fHasRangeLamBinding$fLensHidingTypedBinding$fLensHidingLamBinding$fUnderscoreExpr $fIsProjPExpr$fEqRHS $fEqProblemEq$fKillRangeSpineLHS$fHasRangeSpineLHS$fDataSpineLHS$fShowSpineLHS $fEqSpineLHS $fDataClause' $fShowClause'$fFunctorClause'$fFoldableClause'$fTraversableClause' $fEqClause' $fDataRHS $fShowRHS$fDataWhereDeclarations$fShowWhereDeclarations$fEqWhereDeclarations$fDataDataDefParams$fShowDataDefParams$fEqDataDefParams$fDataLamBinding$fShowLamBinding$fEqLamBinding$fDataTypedBinding$fShowTypedBinding$fEqTypedBinding$fDataLetBinding$fShowLetBinding$fEqLetBinding$fDataGeneralizeTelescope$fShowGeneralizeTelescope$fEqGeneralizeTelescope$fDataProblemEq$fShowProblemEq$fDataLHSCore'$fShowLHSCore'$fFunctorLHSCore'$fFoldableLHSCore'$fTraversableLHSCore' $fEqLHSCore' $fEqPattern'$fEqScopeCopyInfo$fShowScopeCopyInfo$fDataScopeCopyInfo $fDataAxiom $fEqAxiom $fOrdAxiom $fShowAxiom$fShowBindName$fDataBindName$fHasRangeBindName$fKillRangeBindName$fSetRangeBindName$fUniverseBiDeclarationQName%$fUniverseBiDeclarationAmbiguousQName$fUniverseBiDeclarationExpr!$fUniverseBiDeclarationLetBinding!$fUniverseBiDeclarationLamBinding#$fUniverseBiDeclarationTypedBinding$fUniverseBiDeclarationPattern' $fUniverseBiDeclarationPattern'0"$fUniverseBiDeclarationDeclaration!$fUniverseBiDeclarationModuleName!$fUniverseBiDeclarationModuleInfo$fUniverseBiDeclarationArg$fUniverseBiDeclarationArg0$fUniverseBiDeclarationArg1$fUniverseBiDeclarationArg2 SubstExpr substExprPatternSynDefnsPatternSynDefn NameToExpr nameToExpr AnyAbstract anyAbstractAllNamesallNames axiomNameapp patternToExprlambdaLiftExprinsertImplicitPatSynArgs$fUniverseBiDeclarationQuantity$fAllNamesModuleApplication$fAllNamesLetBinding$fAllNamesTypedBinding$fAllNamesLamBinding$fAllNamesExpr$fAllNamesWhereDeclarations $fAllNamesRHS$fAllNamesRewriteEqn'$fAllNamesClause'$fAllNamesDeclaration$fAllNamesQName$fAllNames(,,) $fAllNames(,)$fAllNamesNamed $fAllNamesArg$fAllNamesMaybe $fAllNames[]$fAnyAbstractDeclaration$fAnyAbstract[]$fNameToExprResolvedName$fNameToExprAbstractName$fSubstExprTypedBinding$fSubstExprLetBinding$fSubstExprExpr$fSubstExprFieldAssignment'$fSubstExprModuleName$fSubstExprName$fSubstExprEither$fSubstExpr(,)$fSubstExprNamed$fSubstExprArg $fSubstExpr[]$fSubstExprMaybePatternVarModalitiespatternVarModalitiesCountPatternVarscountPatternVars 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$fPatternVarModalitiesArgx$fPatternVarModalitiesNamedx$fPatternVarModalities[]x recurseExprLamViewAppView' ApplicationappView'maybeProjTurnPostfix unAppViewlamViewasViewisSetunScope deepUnscopedeepUnscopeDeclsdeepUnscopeDecl$fExprLikeSpineLHS$fExprLikeLHSCore'$fExprLikePragma$fExprLikeWhereDeclarations $fExprLikeRHS$fExprLikeClause'$fExprLikePattern'$fExprLikeLetBinding$fExprLikeTypedBinding$fExprLikeDataDefParams$fExprLikeGeneralizeTelescope$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[]b KnownBoolboolSingSBoolSTrueSFalse eraseSBoolboolVal$fKnownBoolFalse$fKnownBoolTrueUpdater2updater2updates2update2Updater1updater1updates1update1UpdaterChangeUpdaterTChangeT MonadChange tellDirty listenDirty runChangeT mapChangeT runUpdaterT runChange runUpdaterdirtyifDirtysharing$fMonadChangeIdentityT$fMonadChangeIdentity$fMonadChangeChangeT $fUpdater1[]$fUpdater1Maybe$fUpdater2Either $fUpdater2(,)$fFunctorChangeT$fApplicativeChangeT$fMonadChangeT$fMonadTransChangeT$fMonadFailChangeT$fMonadIOChangeTNiceDeclarationWarning EmptyAbstract EmptyFieldEmptyGeneralize EmptyInstance EmptyMacro EmptyMutualEmptyPostulate EmptyPrivateEmptyPrimitiveInvalidCatchallPragmaInvalidCoverageCheckPragmaInvalidNoPositivityCheckPragmaInvalidNoUniverseCheckPragmaInvalidTerminationCheckPragmaMissingDefinitionsNotAllowedInMutualOpenPublicPrivateOpenPublicAbstractPolarityPragmasButNotPostulatesPragmaNoTerminationCheckPragmaCompiledUnknownFixityInMixfixDeclUnknownNamesInFixityDeclUnknownNamesInPolarityPragmasUselessAbstractUselessInstanceUselessPrivateDeclarationExceptionMultipleEllipses InvalidNameDuplicateDefinitionMissingWithClausesWrongDefinitionDeclarationPanicWrongContentBlockAmbiguousFunClausesInvalidMeasureMutualUnquoteDefRequiresSignature BadMacroDefNiceTypeSignatureNiceConstructorMeasureNiceDeclaration NiceFieldPrimitiveFunction NiceMutual NiceModuleNiceModuleMacroNiceOpen NiceImport NicePragma NiceRecSig NiceDataSig NiceFunClause NiceDataDef NiceRecDefNicePatternSynNiceGeneralizeNiceUnquoteDeclNiceUnquoteDefdeclarationWarningNameunsafeDeclarationWarningrunNiceniceDeclarationsnotSoNiceDeclarationsniceHasAbstract$fPrettyNiceDeclaration$fHasRangeNiceDeclaration$fPrettyDeclarationWarning$fHasRangeDeclarationWarning$fShowDataRecOrFun$fEqDataRecOrFun$fPrettyDeclarationException$fHasRangeDeclarationException$fMakeAbstractWhereClause'$fMakeAbstractClause$fMakeAbstractNiceDeclaration$fMakeAbstractIsAbstract$fMakeAbstract[]$fMakePrivateWhereClause'$fMakePrivateClause$fMakePrivateNiceDeclaration$fMakePrivateAccess$fMakePrivate[] $fEqDeclKind$fShowDeclKind $fFunctorNice$fApplicativeNice $fMonadNice$fMonadStateNiceEnvNice$$fMonadErrorDeclarationExceptionNice$fDataDeclarationException$fShowDeclarationException$fDataDataRecOrFun $fEqInMutual$fShowInMutual$fDataKindOfBlock$fEqKindOfBlock$fOrdKindOfBlock$fShowKindOfBlock$fDataDeclarationWarning$fShowDeclarationWarning$fDataNiceDeclaration$fShowNiceDeclarationVarSetsubtractSizeVar SizeConst LegendMatrixmatrixrowdescrcoldescrGM flexScopenodeMapintMapnextNode ConstraintsNewFlexArcNodeIdRConstRVarFiniteInfiniteAdjListwarshall warshallGincinfiniteisBelowemptyConstraints initGraphaddFlexaddNode addConstraint buildGraphmkMatrixextendSolution sizeRigidsolve$fSemiRingWeight$fShowConstraint$fShowLegendMatrix$fShowSizeExpr WithDefaultDefaultValue setDefaultcollapseDefault$fEqWithDefault$fShowWithDefault ComposeZipper ComposeZip ListZipperListZipZipperCarrierElement firstHoleplugHolenextHole$fZipperListZipper$fZipperComposeZipper$fEqListZipper$fOrdListZipper$fShowListZipper$fFunctorListZipper$fFoldableListZipper$fTraversableListZipperversionversionWithCommitInfo commitInfoLibM LibWarningLibPositionInfo libFilePos lineNumPosfilePos VersionViewvvBase vvNumberslibraryWarningNamefindProjectRootgetDefaultLibrariesgetInstalledLibrarieslibraryIncludePathsfindLib' versionView unVersionView$fPrettyLibWarning'$fPrettyLibWarning$fShowLibError'$fShowLibWarning$fDataLibWarning$fShowLibPositionInfo$fDataLibPositionInfo$fEqVersionView$fShowVersionView$fShowLibrariesFileFlagOptM PragmaOptionsoptShowImplicitoptShowIrrelevant optUseUnicode optVerboseoptPropoptAllowUnsolvedoptAllowIncompleteMatchoptDisablePositivityoptTerminationCheckoptTerminationDepthoptCompletenessCheckoptUniverseCheckoptOmegaInOmega optSubtypingoptCumulativity optSizedTypesoptGuardednessoptInjectiveTypeConstructorsoptUniversePolymorphismoptIrrelevantProjectionsoptExperimentalIrrelevance optWithoutK optCopatternsoptPatternMatching optExactSplitoptEta optForcingoptProjectionLike optRewriting optCubicaloptPostfixProjectionsoptKeepPatternVariablesoptInstanceSearchDepthoptOverlappingInstancesoptInversionMaxDepthoptSafeoptDoubleCheckoptSyntacticEqualityoptCompareSortsoptWarningModeoptCompileNoMain optCachingoptCountClusters optAutoInlineoptPrintPatternSynonyms optFastReduceoptConfluenceCheck optFlatSplitCommandLineOptionsOptionsoptProgramName optInputFileoptIncludePathsoptAbsoluteIncludePaths optLibrariesoptOverrideLibrariesFileoptDefaultLibs optUseLibsoptShowVersion optShowHelpoptInteractiveoptGHCiInteractionoptJSONInteractionoptOptimSmashing optCompileDiroptGenerateVimFileoptGenerateLaTeXoptGenerateHTMLoptHTMLHighlightoptDependencyGraph optLaTeXDir optHTMLDir optCSSFileoptIgnoreInterfacesoptIgnoreAllInterfacesoptLocalInterfacesoptPragmaOptionsoptOnlyScopeCheckingoptWithCompiler HtmlHighlight HighlightAll HighlightCode HighlightAuto Verbosity VerboseLevel VerboseKeymapFlagdefaultVerbositydefaultInteractionOptionsdefaultOptionsdefaultPragmaOptions defaultCutOffrunOptM checkOptsunsafePragmaOptionsrestartOptionsinfectiveOptionscoinfectiveOptions inputFlagsafeFlagstandardOptionsdeadStandardOptionsstandardOptions_ getOptSimpleparsePragmaOptionsparsePluginOptionsusagestripRTS defaultLibDir$fEqRestartCodomain$fShowCommandLineOptions$fShowPragmaOptions$fEqPragmaOptions$fShowHtmlHighlight$fEqHtmlHighlightMonadTCMliftTCMIM MonadTCStategetTCputTCmodifyTC MonadTCEnvaskTClocalTC MonadReduce liftReduceReduceM unReduceM ReduceEnvredEnvredSt HasOptions pragmaOptionscommandLineOptions TypeError Exception IOException PatternErr tcErrState tcErrClosErr LHSOrPatSynIsLHSIsPatSyn InternalErrorNotImplemented NotSupportedCompilationErrorPropMustBeSingletonDataMustEndInSort#ShouldEndInApplicationOfTheDatatype&ShouldBeAppliedToTheDatatypeParametersShouldBeApplicationOf!ConstructorPatternInWrongDatatype6CantResolveOverloadedConstructorsTargetingSameDatatypeDoesNotConstructAnElementOfWrongHidingInLHSWrongHidingInLambdaWrongHidingInApplicationWrongNamedArgumentWrongIrrelevanceInLambdaWrongQuantityInLambdaWrongCohesionInLambdaQuantityMismatchHidingMismatchRelevanceMismatchUninstantiatedDotPattern ForcedConstructorNotInstantiatedIlltypedPatternIllformedProjectionPatternCannotEliminateWithPattern!WrongNumberOfConstructorArguments ShouldBeEmpty ShouldBeASort ShouldBePi ShouldBePathShouldBeRecordTypeShouldBeRecordPatternNotAProjectionPatternNotAProperTermInvalidTypeSort InvalidTypeFunctionTypeInSizeUnivSplitOnIrrelevantSplitOnUnusableCohesionSplitOnNonVariableDefinitionIsIrrelevantDefinitionIsErasedVariableIsIrrelevantVariableIsErasedVariableIsOfUnusableCohesion UnequalLevel UnequalTerms UnequalTypesUnequalRelevanceUnequalQuantityUnequalCohesion UnequalHiding UnequalSorts UnequalBecauseOfUniverseConflict NotLeqSortMetaCannotDependOnMetaOccursInItselfMetaIrrelevantSolutionMetaErasedSolution GenericErrorGenericDocErrorBuiltinMustBeConstructorNoSuchBuiltinNameDuplicateBuiltinBindingNoBindingForBuiltinNoSuchPrimitiveFunctionDuplicatePrimitiveBindingShadowedModuleBuiltinInParameterisedModuleIllegalLetInTelescopeIllegalPatternInTelescopeNoRHSRequiresAbsurdPattern TooManyFieldsDuplicateFieldsDuplicateConstructorsWithOnFreeVariableUnexpectedWithPatternsWithClausePatternMismatchFieldOutsideRecordModuleArityMismatchGeneralizeCyclicDependencyGeneralizeUnsolvedMeta SplitErrorImpossibleConstructorTooManyPolaritiesLocalVsImportedModuleClashSolvedButOpenHolesCyclicModuleDependency FileNotFoundOverlappingProjectsAmbiguousTopLevelModuleNameModuleNameUnexpectedModuleNameDoesntMatchFileNameClashingFileNamesForModuleDefinedInOtherFileBothWithAndRHSAbstractConstructorNotInScope NoSuchModule AmbiguousNameAmbiguousModuleClashingDefinitionClashingModuleClashingImportClashingModuleImportPatternShadowsConstructorDuplicateImportsInvalidPatternRepeatedVariablesInPatternGeneralizeNotSupportedHereMultipleFixityDeclsMultiplePolarityPragmasNotAModuleExprNotAnExpressionNotAValidLetBindingNotValidBeforeFieldNothingAppliedToHiddenArgNothingAppliedToInstanceArgBadArgumentsToPatternSynonymTooFewArgumentsToPatternSynonym$CannotResolveAmbiguousPatternSynonymUnusedVariableInPatternSynonymNoParseForApplicationAmbiguousParseForApplication NoParseForLHSAmbiguousParseForLHSOperatorInformationInstanceNoCandidate UnquoteFailedDeBruijnIndexOutOfScopeNeedOptionCopatternsNeedOptionRewritingNeedOptionPropNonFatalErrorsInstanceSearchDepthExhaustedTriedToCopyConstrainedPrim UnquoteError BadVisibilityConInsteadOfDefDefInsteadOfCon NonCanonical BlockedOnMeta UnquotePanicUnificationFailureUnifyIndicesNotVarsUnifyRecursiveEqUnifyReflexiveEqUnifyUnusableModalityNegativeUnification UnifyConflict UnifyCycle NotADatatypeIrrelevantDatatypeErasedDatatypeCoinductiveDatatypeUnificationStuckCosplitCatchallCosplitNoTargetCosplitNoRecordTypeCannotCreateMissingClauseGenericSplitErrorcantSplitConName cantSplitTelcantSplitConIdxcantSplitGivenIdxcantSplitFailuresTerminationErrortermErrFunctions termErrCallsCallInfocallInfoTarget callInfoRange callInfoCalltcWarningRange tcWarningtcWarningPrintedWarningtcWarningCached NicifierIssueTerminationIssueUnreachableClauses CoverageIssueCoverageNoExactSplitNotStrictlyPositiveUnsolvedMetaVariablesUnsolvedInteractionMetasUnsolvedConstraintsCantGeneralizeOverSortsAbsurdPatternRequiresNoRHS OldBuiltinEmptyRewritePragmaIllformedAsClauseClashesViaRenaming UselessPublic UselessInlineWrongInstanceDeclarationInstanceWithExplicitArgInstanceNoOutputTypeNameInstanceArgWithExplicitArgInversionDepthReachedGenericWarningGenericNonFatalErrorSafeFlagPostulateSafeFlagPragmaSafeFlagNonTerminatingSafeFlagTerminating%SafeFlagWithoutKFlagPrimEraseEqualityWithoutKFlagPrimEraseEqualitySafeFlagNoPositivityCheckSafeFlagPolaritySafeFlagNoUniverseCheckSafeFlagNoCoverageCheckSafeFlagInjective SafeFlagEtaLibraryWarningDeprecationWarning UserWarningFixityInRenamingModuleModuleDoesntExportInfectiveImportCoInfectiveImportRewriteNonConfluentRewriteMaybeNonConfluentPragmaCompileErased NotInScopeW Candidate candidateTerm candidateTypecandidateOverlappable ExpandHidden ExpandLastDontExpandLastReallyDontExpandLast AbstractMode ConcreteModeIgnoreAbstractMode LetBindings ContextEntryContext UnquoteFlags_unquoteNormalise LensTCEnv lensTCEnv envContextenvLetBindingsenvCurrentModuleenvCurrentPathenvAnonymousModules envImportPathenvMutualBlockenvTerminationCheckenvCoverageCheck envMakeCaseenvSolvingConstraintsenvCheckingWhereenvWorkingOnTypesenvAssignMetasenvActiveProblemsenvAbstractMode envModalityenvDisplayFormsEnabledenvRangeenvHighlightingRange envClauseenvCallenvHighlightingLevelenvHighlightingMethodenvModuleNestingLevel envExpandLast envAppDefenvSimplificationenvAllowedReductionsenvInjectivityDepthenvCompareBlockedenvPrintDomainFreePienvPrintMetasBareenvInsideDotPatternenvUnquoteFlagsenvInstanceDepthenvIsDebugPrintingenvPrintingPatternLambdas envCallByNeedenvCurrentCheckpointenvCheckpointsenvGeneralizeMetasenvGeneralizedVarsenvCheckOptionConsistencyenvActiveBackendNameDirectIndirectNoneNonInteractive InteractiveBuiltinPrim BuiltinThings BuiltinInfo builtinName builtinDescBuiltinDescriptor BuiltinDataBuiltinDataCons BuiltinPrimBuiltinPostulateBuiltinUnknownTempInstanceTable InstanceTable CheckClause CheckPatternCheckLetBinding InferExpr CheckExprCallCheckDotPatternCheckProjection IsTypeCallIsType_InferVarInferDefCheckArgumentsCheckMetaSolutionCheckTargetType CheckDataDef CheckRecDefCheckConstructorCheckConstructorFitsInCheckFunDefCall CheckPragmaCheckPrimitive CheckIsEmptyCheckConfluenceCheckWithFunctionTypeCheckSectionApplicationCheckNamedWhereScopeCheckExprScopeCheckDeclaration ScopeCheckLHSNoHighlightingModuleContents StatisticsMutualIdMutIdTermHeadSortHeadPiHeadConsHeadVarHead UnknownHeadFunctionInverse' NotInjectiveInverse InversionMapFunctionInversePrimFun primFunName primFunArityprimFunImplementation PrimitiveImplPrimImplAllowedReductionsAllowedReductionProjectionReductionsInlineReductionsCopatternReductionsFunctionReductionsRecursiveReductionsLevelReductionsTypeLevelReductionsUnconfirmedReductionsNonTerminatingReductionsMaybeReducedElimsMaybeReducedArgs MaybeReducedMaybeRed isReduced ignoreReduced IsReduced NotReducedReduced NoReduction YesReductionSimplificationYesSimplificationNoSimplificationFieldsDefn DataOrRecSigGeneralizableVar AbstractDefn datarecPars funClauses funCompiled funSplitTree funTreeless funCoveringfunInv funMutualfunAbstr funDelayed funProjectionfunFlags funTerminates funExtLamfunWithdataParsdataIxs dataClausedataConsdataSort dataMutual dataAbstr dataPathConsrecPars recClause recConHead recNamedCon recFieldsrecTel recMutualrecEtaEquality' recInductionrecAbstrrecCompconParsconArity conSrcConconDataconAbstrconIndconCompconProj conForced conErased primAbstrprimName primClausesprimInv primCompiledCompKit nameOfHComp nameOfTransp FunctionFlag FunStatic FunInlineFunMacro EtaEquality SpecifiedInferredtheEtaEqualityProjLams getProjLams Projection projProperprojOrig projFromType projIndexprojLams ExtLamInfo extLamModule extLamSysSystem systemTel systemClausesFaceCompiledRepresentationCompilerPragmaIsForcedForced NotForced Covariant Contravariant Invariant NonvariantNumGeneralizableArgsNoGeneralizableArgsSomeGeneralizableArgs defArgInfodefNamedefType defPolaritydefArgOccurrencesdefArgGeneralizabledefGeneralizedParams defDisplay defMutualdefCompiledRepdefCopy defMatchabledefNoCompilation defInjectivedefCopatternLHS defBlockedtheDef RewriteRulerewName rewContextrewHeadrewPatsrewRHSrewType RewriteRulesNLPSortPTypePPropPInf PSizeUnivNLPType nlpTypeSort nlpTypeUnElPElimsNLPatPDefPLamPPiPSort PBoundVarPTerm DisplayTermDWithAppDConDDefDDotDTermLocalDisplayForm DisplayFormDisplay dfFreeVarsdfPatsdfRHS _secTelescope DisplayFormsRewriteRuleMap DefinitionsSections SignatureSig _sigSections_sigDefinitions_sigRewriteRulesIPClause IPNoClauseipcQName ipcClauseNoipcType ipcWithSub ipcClause ipcClosure ipcBoundary IPBoundary IPBoundary' ipbEquationsipbValue ipbMetaAppipbOverapplied OverappliedNotOverappliedInteractionPointsInteractionPointipRangeipMetaipSolvedipClause MetaStore nmSuggestionnmidMetaNameSuggestion miClosRangemiMetaOccursCheckmiNameSuggestionmiGeneralizableRunMetaOccursCheckDontRunMetaOccursCheck MetaPriorityTypeCheckingProblem CheckExpr CheckArgsCheckProjAppToKnownPrincipalArg CheckLambda DoQuoteTerm CheckedTargetNotCheckedTargetMetaInstantiationInstV OpenInstance BlockedConstPostponedTypeCheckingProblemFrozen InstantiableListener EtaExpandCheckConstraint MetaVariableMetaVarmvInfo mvPriority mvPermutation mvJudgementmvInstantiation mvListenersmvFrozenmvTwinGeneralizedValuegenvalCheckpoint genvalTerm genvalType DoGeneralize YesGeneralize NoGeneralize JudgementHasTypeIsSortjMetaId jComparison jMetaType OpenThingopenThingCheckpoint openThing CompareAs AsTermsOfAsSizesAsTypesCompareDirectionDirEqDirLeqDirGeqCmpEqCmpLeqValueCmpValueCmpOnFaceElimCmpTelCmpSortCmpLevelCmp HasBiggerSort HasPTSRule CheckMetaInstUnBlockGuardedIsEmptyCheckSizeLtSat FindInstance CheckFunDef UnquoteTacticProblemConstraintPConstrconstraintProblems theConstraint LensClosure lensClosureClosure clSignatureclEnvclScopeclModuleCheckpointsclValue Interface iSourceHashiSource iFileTypeiImportedModules iModuleNameiScope iInsideScope iSignature iDisplayForms iUserWarningsiImportWarningiBuiltin iForeignCode iHighlightingiPragmaOptions iOptionsUsed iPatternSyns iWarnings iPartialDefs ForeignCodeDecodedModulesVisitedModules miInterface miWarnings miPrimitiveMonadStConcreteNamesrunStConcreteNamesuseConcreteNamesmodifyConcreteNamesSourceToModule FreshName freshName_ CheckpointId MonadFreshfreshHasFresh freshLens nextFresh'TypeCheckAction EnterSection LeaveSectionPragmasCurrentTypeCheckLogCachedTypeCheckLogLoadedFileCache lfcCached lfcCurrentPersistentTCStatePersistentTCStstDecodedModulesstPersistentOptionsstInteractionOutputCallback stBenchmarkstAccumStatisticsstPersistLoadedFileCachestPersistBackends MutualBlock mutualInfo mutualNamesPostScopeStatestPostSyntaxInfostPostDisambiguatedNamesstPostMetaStorestPostInteractionPointsstPostAwakeConstraintsstPostSleepingConstraints stPostDirtystPostOccursCheckDefsstPostSignaturestPostModuleCheckpointsstPostImportsDisplayFormsstPostCurrentModulestPostInstanceDefsstPostConcreteNamesstPostUsedNamesstPostShadowingNamesstPostStatisticsstPostTCWarningsstPostMutualBlocksstPostLocalBuiltinsstPostFreshMetaIdstPostFreshMutualIdstPostFreshProblemIdstPostFreshCheckpointIdstPostFreshIntstPostFreshNameIdstPostAreWeCachingstPostPostponeInstanceSearchstPostConsideringInstancestPostInstantiateBlockingstPostLocalPartialDefs ConcreteNamesDisambiguatedNames PreScopeState stPreTokens stPreImportsstPreImportedModulesstPreModuleToSourcestPreVisitedModules stPreScopestPrePatternSynsstPrePatternSynImportsstPreGeneralizedVarsstPrePragmaOptionsstPreImportedBuiltinsstPreImportedDisplayFormsstPreImportedInstanceDefsstPreForeignCodestPreFreshInteractionIdstPreImportedUserWarningsstPreLocalUserWarningsstPreWarningOnImportstPreImportedPartialDefs ReadTCState getTCStatelocallyTCState withTCStateTCStstPreScopeStatestPostScopeStatestPersistentStateinitPersistentStateinitPreScopeStateinitPostScopeStatestTokens stImportsstImportedModulesstModuleToSourcestVisitedModulesstScope stPatternSynsstPatternSynImportsstGeneralizedVarsstPragmaOptionsstImportedBuiltins stForeignCodestFreshInteractionIdstImportedUserWarningsstLocalUserWarningsgetUserWarningsstWarningOnImportstImportedPartialDefsstLocalPartialDefsgetPartialDefsstLoadedFileCache stBackends stFreshNameId stSyntaxInfostDisambiguatedNames stMetaStorestInteractionPointsstAwakeConstraintsstSleepingConstraintsstDirtystOccursCheckDefs stSignaturestModuleCheckpointsstImportsDisplayFormsstImportedDisplayFormsstCurrentModulestImportedInstanceDefsstInstanceDefsstConcreteNames stUsedNamesstShadowingNames stStatistics stTCWarningsstMutualBlocksstLocalBuiltins stFreshMetaIdstFreshMutualIdstFreshProblemIdstFreshCheckpointId stFreshIntstAreWeCachingstPostponeInstanceSearchstConsideringInstancestInstantiateBlockingstBuiltinThings nextFresh freshName freshNoName freshNoName_freshRecordNamesourceToModulelookupModuleFromSource iFullHash buildClosurefromCmpflipCmpdirToCmpnormalMetaPrioritylowMetaPriorityhighMetaPriority getMetaInfo getMetaScope getMetaEnv getMetaSiggetMetaRelevancegetMetaModality metaFrozen_mvInfo sigSectionssigDefinitionssigRewriteRules secTelescopeemptySignaturedefaultDisplayForm theDefLens defaultDefn jsBackendNameghcBackendName noCompiledRep modifySystem projDropPars projArgInfosetEtaEquality emptyCompKit recRecursiverecEtaEquality emptyFunctionfunFlag funStatic funInlinefunMacroisMacroisEmptyFunctionisCopatternLHSrecCon defIsRecorddefIsDataOrRecorddefConstructors redReturnredBind notReducedreduced allReductionsreallyAllReductionsprimFun defClauses defCompiled defParameters defInversedefCompilerPragmas defDelayeddefNonterminatingdefTerminationUnconfirmed defForced"ifTopLevelAndHighlightingLevelIsOr ifTopLevelAndHighlightingLevelIsinitEnvdefaultUnquoteFlagsunquoteNormaliseeUnquoteNormaliseeContext eLetBindingseCurrentModule eCurrentPatheAnonymousModules eImportPath eMutualBlockeTerminationCheckeCoverageCheck eMakeCaseeSolvingConstraintseCheckingWhereeWorkingOnTypes eAssignMetaseActiveProblems eAbstractMode eModality eRelevance eQuantityeDisplayFormsEnabledeRangeeHighlightingRangeeCalleHighlightingLeveleHighlightingMethodeModuleNestingLevel eExpandLasteAppDefeSimplificationeAllowedReductionseInjectivityDeptheCompareBlockedePrintDomainFreePieInsideDotPattern eUnquoteFlagseInstanceDeptheIsDebugPrintingePrintingPatternLambdas eCallByNeedeCurrentCheckpoint eCheckpointseGeneralizeMetaseGeneralizedVarseActiveBackendName aDefToMode aModeToDefisDontExpandLast warningNametcWarningOriginsizedTypesOptionguardednessOptionwithoutKOptiongetIncludeDirs enableCaching mapRedEnvmapRedSt mapRedEnvSt reduceEnvreduceSt onReduceEnv fmapReduceapReduce bindReduce runReduceM runReduceFuseRaskRlocalRasksTCviewTC locallyTCgetsTC modifyTC'useTC setTCLens modifyTCLens modifyTCLensM stateTCLens stateTCLensMmapTCMTpureTCM returnTCMTbindTCMTthenTCMTfmapTCMTapTCMTrunIM catchError_finally_patternViolation internalError genericErrorgenericDocError typeError typeError_runTCM runTCMTop runTCMTop' runSafeTCMforkTCMpatternInTeleNameextendedLambdaNameisExtendedLambdaNameabsurdLambdaNameisAbsurdLambdaNamegeneralizedFieldNamegetGeneralizedFieldName$fNullMutualBlock$fMonadFreshiStateT$fMonadFreshiReaderT$fPrettyProblemId$fShowProblemId$fPrettyCheckpointId$fShowCheckpointId $fFreshName()$fFreshNameRange' $fFreshName[]$fFreshName(,)$fMonadStConcreteNamesStateT$fMonadStConcreteNamesReaderT$fPrettyComparison$fPrettyCompareDirection$fTermLikeCompareAs$fFreeCompareAs$fKillRangeOpen$fDecorationOpen$fShowJudgement$fKillRangeDoGeneralize$fPrettyNamedMeta$fKillRangeSection$fPrettySection$fKillRangeDisplayTerm$fPrettyDisplayTerm$fFreeDisplayTerm$fKillRangeDisplayForm$fFreeDisplayForm$fKillRangeNLPSort$fKillRangeNLPType$fKillRangeNLPat$fKillRangeRewriteRule$fKillRangeHashMap$fKillRangeNumGeneralizableArgs$fKillRangePolarity$fKillRangeIsForced$fHasRangeCompilerPragma$fKillRangeMap0$fKillRangeSystem$fKillRangeExtLamInfo$fKillRangeProjLams$fKillRangeProjection$fKillRangeEtaEquality$fKillRangeFunctionFlag$fKillRangeCompKit$fMonoidSimplification$fSemigroupSimplification$fNullSimplification$fIsProjElimMaybeReduced$fKillRangeTermHead$fPrettyTermHead$fKillRangeFunctionInverse'$fKillRangeDefn $fPrettyDefn$fKillRangeMutualId$fKillRangeDefinition$fPrettyDefinition$fLensRelevanceDefinition$fLensQuantityDefinition$fLensModalityDefinition$fLensArgInfoDefinition$fKillRangeHashMap0$fKillRangeSignature$fHasRangeCall $fPrettyCall$fKillRangeClosure$fLensQuantityTCEnv$fLensRelevanceTCEnv$fLensModalityTCEnv $fEqIPClause$fLensIsAbstractTCEnv$fHasRangeClosure $fShowClosure$fLensTCEnvTCEnv$fLensIsAbstractClosure$fLensTCEnvClosure$fEqInteractionPoint$fSetRangeMetaInfo$fLensIsAbstractMetaInfo$fLensClosureRange'MetaInfo$fLensClosureaClosure$fFreeCandidate$fTermLikeConstraint$fFreeConstraint$fHasRangeConstraint$fHasRangeProblemConstraint $fOrdListener $fEqListener$fAllNamesCallInfo$fPrettyCallInfo $fEqTCWarning$fHasRangeTCWarning$fPrettyInterface$fHasOptionsWriterT$fHasOptionsStateT$fHasOptionsReaderT$fHasOptionsMaybeT$fHasOptionsListT$fHasOptionsIdentityT$fHasOptionsExceptT$fHasOptionsChangeT$fMonadTCEnvIdentityT$fMonadTCEnvChangeT$fMonadTCEnvStateT$fMonadTCEnvWriterT$fMonadTCEnvReaderT$fMonadTCEnvExceptT$fMonadTCEnvListT$fMonadTCEnvMaybeT $fNullTCMT$fMonadBenchPhaseTCMT $fMonoidTCMT$fSemigroupTCMT$fIsStringTCMT$fCatchImpossibleTCMT$fMonadTCEnvTCMT$fMonadFailTCMT $fMonadTCMT$fMonadTransTCMT$fApplicativeTCMT $fFunctorTCMT$fMonadTCEnvReduceM$fMonadFailReduceM$fMonadReduceM$fApplicativeReduceM$fFunctorReduceM$fLensClosureRange'MetaVariable$fSetRangeMetaVariable$fHasRangeMetaVariable$fShowMetaInstantiation$fMonadStConcreteNamesTCMT $fShowTCState$fMonadTCStateTCMT$fMonadTCStateIdentityT$fMonadTCStateChangeT$fMonadTCStateStateT$fMonadTCStateWriterT$fMonadTCStateReaderT$fMonadTCStateExceptT$fMonadTCStateListT$fMonadTCStateMaybeT$fHasOptionsTCMT$fMonadErrorTCErrTCMT $fMonadIOTCMT$fExceptionTCErr$fHasRangeTCErr $fShowTCErr $fErrorTCErr$fHasFreshCheckpointId$fHasFreshProblemId $fHasFreshInt$fHasFreshNameId$fHasFreshInteractionId$fHasFreshMutualId$fHasFreshMetaId$fMonadFreshiTCMT$fReadTCStateTCMT$fHasOptionsReduceM$fReadTCStateReduceM$fReadTCStateStateT$fReadTCStateWriterT$fReadTCStateReaderT$fReadTCStateExceptT$fReadTCStateListT$fReadTCStateMaybeT$fMonadReduceReduceM$fMonadReduceStateT$fMonadReduceWriterT$fMonadReduceReaderT$fMonadReduceExceptT$fMonadReduceListT$fMonadReduceMaybeT$fMonadTCMWriterT$fMonadTCMStateT$fMonadTCMReaderT$fMonadTCMMaybeT$fMonadTCMListT$fMonadTCMIdentityT$fMonadTCMExceptT$fMonadTCMChangeT$fMonadTCMTCMT$fMonadErrorTCErrTCMT0$fMonadReduceTCMT$fShowTypeError$fShowUnquoteError$fEqLHSOrPatSyn$fShowLHSOrPatSyn$fShowSplitError$fShowUnificationFailure$fShowNegativeUnification$fShowInterface$fShowTCWarning $fShowWarning $fDataWarning$fDataTerminationError$fShowTerminationError$fDataCallInfo$fShowCallInfo$fDataProblemConstraint$fShowProblemConstraint$fDataConstraint$fShowCandidate$fDataCandidate $fDataTCEnv$fDataIPClause $fDataClosure$fFunctorClosure$fFoldableClosure$fEqExpandHidden$fDataExpandHidden$fDataAbstractMode$fShowAbstractMode$fEqAbstractMode$fDataUnquoteFlags$fEqHighlightingMethod$fShowHighlightingMethod$fReadHighlightingMethod$fDataHighlightingMethod$fEqHighlightingLevel$fOrdHighlightingLevel$fShowHighlightingLevel$fReadHighlightingLevel$fDataHighlightingLevel $fShowBuiltin$fFunctorBuiltin$fFoldableBuiltin$fTraversableBuiltin $fDataCall$fDataSignature$fShowSignature$fDataDefinition$fDataMutualId $fEqMutualId $fOrdMutualId$fShowMutualId $fNumMutualId$fEnumMutualId $fDataDefn $fShowDefn$fDataFunctionInverse'$fShowFunctionInverse'$fFunctorFunctionInverse'$fDataTermHead $fEqTermHead $fOrdTermHead$fShowTermHead$fShowAllowedReduction$fEqAllowedReduction$fOrdAllowedReduction$fEnumAllowedReduction$fBoundedAllowedReduction$fIxAllowedReduction$fDataAllowedReduction$fFunctorMaybeReduced$fFunctorReduced$fDataSimplification$fEqSimplification$fShowSimplification $fNullFields $fDataCompKit $fEqCompKit $fOrdCompKit $fShowCompKit$fDataFunctionFlag$fEqFunctionFlag$fOrdFunctionFlag$fEnumFunctionFlag$fShowFunctionFlag$fDataEtaEquality$fShowEtaEquality$fEqEtaEquality$fDataProjection$fShowProjection$fDataProjLams$fShowProjLams$fNullProjLams$fDataExtLamInfo$fShowExtLamInfo $fDataSystem $fShowSystem$fDataCompilerPragma$fShowCompilerPragma$fEqCompilerPragma$fDataIsForced$fShowIsForced $fEqIsForced$fDataPolarity$fShowPolarity$fDataNumGeneralizableArgs$fShowNumGeneralizableArgs$fDataRewriteRule$fShowRewriteRule $fDataNLPSort $fShowNLPSort $fDataNLPat $fShowNLPat $fDataNLPType $fShowNLPType$fDataDisplayForm$fShowDisplayForm$fDataDisplayTerm$fShowDisplayTerm $fDataSection $fShowSection$fShowIPBoundary'$fDataIPBoundary'$fFunctorIPBoundary'$fFoldableIPBoundary'$fTraversableIPBoundary'$fEqOverapplied$fShowOverapplied$fDataOverapplied$fEqRunMetaOccursCheck$fOrdRunMetaOccursCheck$fShowRunMetaOccursCheck$fEqMetaPriority$fOrdMetaPriority$fShowMetaPriority $fEqFrozen $fShowFrozen$fShowGeneralizedValue$fDataGeneralizedValue$fEqDoGeneralize$fOrdDoGeneralize$fShowDoGeneralize$fDataDoGeneralize $fDataOpen $fShowOpen $fFunctorOpen$fFoldableOpen$fTraversableOpen$fDataCompareAs$fShowCompareAs$fEqCompareDirection$fShowCompareDirection$fEqComparison$fDataComparison$fShowComparison$fShowForeignCode$fDataCheckpointId$fEqCheckpointId$fOrdCheckpointId$fEnumCheckpointId$fRealCheckpointId$fIntegralCheckpointId$fNumCheckpointId$fDataProblemId $fEqProblemId$fOrdProblemId$fEnumProblemId$fRealProblemId$fIntegralProblemId$fNumProblemId$fShowMutualBlock$fEqMutualBlockVALUvaluN' valueArgsICODE icodeArgsEmbPrjicodeicod_valueStnodeEstringEtextEintegerEdoubleEnodeMemomodFileincludesMemoUDictnodeDstringDtextDintegerDdoubleDtermDnameDqnameDnodeCstringCtextCintegerCdoubleCtermCnameCqnameCstats collectStatsabsPathDQNameId FreshAndReusefarFresh HashTablefarEmpty lensFreshqnameId emptyDict malformed tickICode runGetStateicodeX icodeInteger icodeDouble icodeString icodeNode icodeMemovcaseicodeNicodeN'valuNvalueN$fICODE->False $fICODEtTrue $fVALU->False $fVALUtTrue unquoteTactic doQuoteTermcheckPostponedLambda inferExpr checkExpr' checkExprisType_checkSectionApplication checkDecl checkDeclscheckProjAppToKnownPrincipalArginferApplicationcheckApplicationcheckArguments_checkArgumentsrewriteverifyBuiltinRewrite fastNormalise fastReduceprimitiveFunctions composePolcomputePolarityMonadInteractionPointsfreshInteractionIdmodifyInteractionPoints addImportaddImportCycleCheck getImports isImported getImportPath visitModulesetVisitedModulesgetVisitedModules isVisitedgetVisitedModulemapVisitedModulegetDecodedModulessetDecodedModulesgetDecodedModulestoreDecodedModuledropDecodedModulewithImportPathcheckForImportCycle currentModulewithCurrentModulegetCurrentPathgetAnonymousVariableswithAnonymousModulewithEnvgetEnvwithIncreasedModuleNestingLevelwithHighlightingLevelwithoutOptionsChecking doExpandLastdontExpandLastreallyDontExpandLastperformedSimplificationperformedSimplification'getSimplificationupdateAllowedReductionsmodifyAllowedReductionsputAllowedReductionsonlyReduceProjectionsallowAllReductionsallowNonTerminatingReductionsonlyReduceTypestypeLevelReductionsinsideDotPatternisInsideDotPattern callByNameMonadAddContextaddCtxaddLetBinding' updateContext withFreshNamecheckpointSubstitution HasBuiltinsgetBuiltinThingtopLevelModuleDropper prettyErrorTraceStraceSReportSreportS MonadDebugdisplayDebugMessagetraceDebugMessageformatDebugMessage getVerbosityisDebugPrintingnowDebugPrintingverboseBracketcatchAndPrintImpossible reportSLn__IMPOSSIBLE_VERBOSE__ reportSDoc reportResultunlessDebugPrintingtraceSLn traceSDocopenVerboseBracketcloseVerboseBracketparseVerboseKey hasVerbosityhasExactVerbositywhenExactVerbosity__CRASH_WHEN__verboseSapplyWhenVerboseS verbosity$fMonadDebugIdentityT$fMonadDebugChangeT$fMonadDebugWriterT$fMonadDebugStateT$fMonadDebugReaderT$fMonadDebugMaybeT$fMonadDebugListT$fMonadDebugExceptT$fMonadDebugTCMT $fReportSDoc $fReportS[] $fReportS[]0 $fReportS[]1 $fReportS[]2 $fReportSTCMT $fTraceSDoc $fTraceS[] $fTraceS[]0 $fTraceS[]1 $fTraceS[]2 $fTraceSTCMTMonadStatistics modifyCounter getStatisticsmodifyStatisticsticktickNtickMaxprintStatistics$fMonadStatisticsTCMT$fMonadStatisticsWriterT$fMonadStatisticsStateT$fMonadStatisticsReaderT$fMonadStatisticsMaybeT$fMonadStatisticsExceptT HasConstInfo getConstInfo getConstInfo'getRewriteRulesForSigError SigUnknown SigAbstract lookupSectioninFreshModuleIfFreeParamseligibleForProjectionLikemakeProjection PrettyContext PrettyTCM prettyTCM MonadPrettysayWhen cachingStarts areWeCachingwriteToCurrentLogrestorePostScopeState localCache withoutCachereadFromCachedLogcleanCachedLogactivateLoadedFileCachecacheCurrentLogupdateBenchmarkingStatusprintisPropM workOnTypesmatchCompiledE matchCompiledPSynNamesInnamesIn$fNamesInAmbiguousQName$fNamesInPattern'$fNamesInDisplayTerm$fNamesInDisplayForm $fNamesInOpen$fNamesInConHead$fNamesInQName$fNamesInElim'$fNamesInLiteral$fNamesInLevelAtom'$fNamesInPlusLevel'$fNamesInLevel' $fNamesInTerm$fNamesInSort'$fNamesInType''$fNamesInPattern'0 $fNamesInCase$fNamesInCompiledClauses'$fNamesInClause $fNamesInDefn$fNamesInDefinition$fNamesInCompKit$fNamesIn(,,,) $fNamesIn(,,) $fNamesIn(,)$fNamesInFieldAssignment' $fNamesInTele$fNamesInWithArity $fNamesInAbs$fNamesInNamed $fNamesInDom' $fNamesInArg$fNamesInNonEmpty $fNamesIn[]$fNamesInMaybe $fNamesInPSynhighlightWarningWarningsAndNonFatalErrors tcWarningsnonFatalErrors WhichWarnings ErrorWarnings AllWarnings MonadWarning addWarninggenericWarninggenericNonFatalErrorwarning_warningswarningisUnsolvedWarning isMetaWarningisMetaTCWarningonlyShowIfUnsolvedclassifyWarningemptyWarningsAndNonFatalErrorsclassifyWarningsrunPM$fSemigroupStateT$fMonadWarningTCMT$fMonadWarningStateT$fMonadWarningReaderT$fEqWhichWarnings$fOrdWhichWarnings MainInterfaceNotMainInterface MaybeWarningsMaybeWarnings' NoWarnings SomeWarningsgetMaybeWarningsscopeCheckImport isErasable autoInline FindErrorNotFound Ambiguous InterfaceFile intFilePath SourceFile srcFilePathmkInterfaceFiletoIFilereplaceModuleExtensionfindErrorToTypeErrorfindFile findFile' findFile''findInterfaceFile'findInterfaceFilecheckModuleName moduleNamerootNameModule$fEqSourceFile$fOrdSourceFileSerialisedRangeunderlyingRange$fEmbPrjExpandedEllipsis $fEmbPrjEmpty$fEmbPrjImpossible$fEmbPrjDelayed$fEmbPrjIsAbstract$fEmbPrjLiteral$fEmbPrjProjOrigin$fEmbPrjConOrigin$fEmbPrjFreeVariables$fEmbPrjWithOrigin$fEmbPrjOrigin$fEmbPrjRelevance$fEmbPrjModality$fEmbPrjCohesion$fEmbPrjQuantity$fEmbPrjQωOrigin$fEmbPrjQ1Origin$fEmbPrjQ0Origin$fEmbPrjHiding$fEmbPrjInduction$fEmbPrjHasEta $fEmbPrjArg$fEmbPrjWithHiding$fEmbPrjHashMap$fEmbPrjNameId$fEmbPrjArgInfo$fEmbPrjRanged $fEmbPrjNamed$fEmbPrjFieldAssignment'$fEmbPrjModuleName$fEmbPrjAmbiguousQName $fEmbPrjQName$fEmbPrjMetaId$fEmbPrjGenPart$fEmbPrjFixity'$fEmbPrjFixity$fEmbPrjFixityLevel$fEmbPrjAssociativity$fEmbPrjImportedName'$fEmbPrjQName0$fEmbPrjNameInScope$fEmbPrjNamePart $fEmbPrjName$fEmbPrjRange'$fEmbPrjInterval' $fEmbPrjSeq $fEmbPrjTrie$fEmbPrjIntSet $fEmbPrjSet $fEmbPrjMap $fEmbPrjBiMap$fEmbPrjNonEmpty $fEmbPrj[]$fEmbPrjTopLevelModuleName$fEmbPrjWithDefault$fEmbPrjPosition'$fEmbPrjAbsolutePath$fEmbPrjDataOrRecord$fEmbPrjFileType $fEmbPrjBool $fEmbPrjMaybe$fEmbPrjMaybe0$fEmbPrjEither $fEmbPrj(,,) $fEmbPrj(,) $fEmbPrj() $fEmbPrjVoid$fEmbPrjDouble $fEmbPrjChar $fEmbPrjInt $fEmbPrjInt32$fEmbPrjWord64$fEmbPrjInteger $fEmbPrjText $fEmbPrj[]0 $fEmbPrjName0$fEmbPrjSerialisedRange$fEmbPrjTokenBased$fEmbPrjCompressedFile$fEmbPrjDefinitionSite$fEmbPrjAspects$fEmbPrjOtherAspect$fEmbPrjAspect$fEmbPrjNameKind $fEmbPrjRangeAbsNameWithFixity toAbsName fromAbsName$fEmbPrjNameOrModule$fEmbPrjScopeInfo$fEmbPrjPrecedence$fEmbPrjParenPreference$fEmbPrjPattern'$fEmbPrjConPatLazy$fEmbPrjConPatInfo$fEmbPrjLocalVar$fEmbPrjBindingSource$fEmbPrjKindOfName$fEmbPrjAbstractModule$fEmbPrjNameMetadata$fEmbPrjAbstractName$fEmbPrjWhyInScope$fEmbPrjNameSpace$fEmbPrjAccess$fEmbPrjNameSpaceId $fEmbPrjScope$fEmbPrjBindName$fEmbPrjAbsNameWithFixityOutputContextEntry ContextVar ContextLetOutputConstraint'OfType'ofNameofExprOutputConstraintOfType CmpInTypeCmpElimJustTypeCmpTypes CmpLevelsCmpTelesJustSortCmpSortsGuard TypedAssignPostponedCheckArgs IsEmptyType SizeLtSatFindInstanceOF PTSInstancePostponedCheckFunDef OutputFormUseForce WithForce WithoutForce ComputeModeDefaultComputeIgnoreAbstractUseShowInstanceAsIs Instantiated HeadNormal Simplified NormalisedCompilerBackendLaTeX QuickLaTeX OtherBackendParseRemoveKeepIOTCM'IOTCM Interaction'Cmd_load Cmd_compileCmd_constraints Cmd_metas!Cmd_show_module_contents_toplevelCmd_search_about_toplevel Cmd_solveAll Cmd_solveOne Cmd_autoOne Cmd_autoAllCmd_infer_toplevelCmd_compute_toplevelCmd_load_highlighting_infoCmd_tokenHighlighting Cmd_highlightShowImplicitArgsToggleImplicitArgsCmd_give Cmd_refine Cmd_introCmd_refine_or_intro Cmd_contextCmd_helper_function Cmd_infer Cmd_goal_typeCmd_elaborate_giveCmd_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_abortCmd_exit Interaction CommandQueuecommandsabortCommandCommand'CommandMOldInteractionScopes CommandStatetheInteractionPointstheCurrentFileoptionsOnReloadoldInteractionScopes commandQueueinitCommandState readsToParseparseToReadsPrecexact readParseparens'$fReadPosition'$fReadAbsolutePath$fReadInterval' $fReadRange'$fReadInteractionId$fReadCompilerBackend$fShowCompilerBackend$fFunctorOutputForm$fFunctorOutputConstraint $fShowIOTCM' $fReadIOTCM'$fFunctorIOTCM'$fFoldableIOTCM'$fTraversableIOTCM'$fShowInteraction'$fReadInteraction'$fFunctorInteraction'$fFoldableInteraction'$fTraversableInteraction' $fEqUseForce$fReadUseForce$fShowUseForce$fShowComputeMode$fReadComputeMode$fEqComputeMode $fShowRewrite $fReadRewrite$fEqCompilerBackend $fShowRemove $fReadRemove$fShowCommand' Give_String Give_Paren Give_NoParensShowImplicitArgumentssCheckedResponseContextEntry respOrigName respReifNamerespType respLetValue respInScope GoalTypeAuxGoalOnly GoalAndHaveGoalAndElaboration Info_ErrorInfo_GenericErrorInfo_CompilationErrorInfo_HighlightingParseError Info_HighlightingScopeCheckErrorGoalsGoalDisplayInfoGoal_HelperFunctionGoal_NormalForm Goal_GoalTypeGoal_CurrentGoalGoal_InferredTypeInfo_CompilationOkInfo_ConstraintsInfo_AllGoalsWarnings Info_TimeInfo_Intro_NotFoundInfo_Intro_ConstructorUnknown Info_AutoInfo_ModuleContentsInfo_SearchAboutInfo_WhyInScopeInfo_NormalFormInfo_InferredType Info_Context Info_VersionInfo_GoalSpecificExtendedLambdaRemoveHighlightingKeepHighlightingSpeculateResultSpeculateAbortSpeculateCommit resetState resetAllState localTCStatelocalTCStateSavinglocalTCStateSavingWarningsspeculateTCStatespeculateTCState_freshTCMlensPersistentStateupdatePersistentStatemodifyPersistentStatelensAccumStatisticsPlensAccumStatisticsgetScopesetScope modifyScope_ modifyScopeuseScope locallyScope withScope withScope_ localScopenotInScopeErrornotInScopeWarning printScopemodifySignaturemodifyImportedSignature getSignaturemodifyGlobalDefinition setSignature withSignatureaddRewriteRulesForsetMatchableSymbolslookupDefinitionupdateDefinitionsupdateDefinition updateTheDef updateDefTypeupdateDefArgOccurrencesupdateDefPolarityupdateDefCompiledRepaddCompilerPragmaupdateFunClausesupdateCoveringupdateCompiledClausesupdateDefCopatternLHSupdateDefBlockedsetTopLevelModulewithTopLevelModuleaddForeignCodegetInteractionOutputCallbackappInteractionOutputCallbacksetInteractionOutputCallbackgetPatternSynssetPatternSynsmodifyPatternSynsgetPatternSynImportsgetAllPatternSynslookupPatternSynlookupSinglePatternSyn theBenchmarkupdateBenchmarkaddImportedInstancesupdateInstanceDefsmodifyInstanceDefsgetAllInstanceDefsgetAnonInstanceDefsclearAnonInstanceDefsaddUnknownInstanceaddNamedInstanceinterestingCall traceCallM traceCallCPS traceCalltraceClosureCallgetCurrentRangesetCurrentRangehighlightAsTypeCheckedprintHighlightingInfo noMutualBlock inMutualBlocksetMutualBlockInfoinsertMutualBlockInfosetMutualBlockcurrentOrFreshMutualBlocklookupMutualBlock mutualBlockOf enterClosure withClosure mapClosureMonadConstraintaddAwakeConstraintcatchPatternErrsolveConstraintsolveSomeAwakeConstraintswakeConstraintsstealConstraintsmodifyAwakeConstraintsmodifySleepingConstraintsConstraintStatusAwakeConstraintSleepingConstraintsolvingProblemsolvingProblemsisProblemSolvedgetConstraintsForProblemgetAwakeConstraintsdropConstraintstakeConstraintsputConstraintsToSleepputAllConstraintsToSleepholdConstraintstakeAwakeConstrainttakeAwakeConstraint'getAllConstraintswithConstraintbuildProblemConstraintbuildProblemConstraint_buildConstraintaddConstraint'addAwakeConstraint'addConstraintTonowSolvingConstraintsisSolvingConstraintscatchConstraintmapAwakeConstraintsmapSleepingConstraints$fEqConstraintStatus$fShowConstraintStatusdebugConstraintsguardConstraintifNoConstraintsifNoConstraints_ noConstraintssolveAwakeConstraints'OpenKind LetOpenModule TopOpenModuleImportedNameMapinameMap imoduleMap ScopeMemo memoNames memoModulesWSMScopeM printLocalsisDatatypeModulegetCurrentModulesetCurrentModulewithCurrentModule' getNamedScopegetCurrentScope createModule modifyScopesmodifyNamedScope setNamedScopemodifyNamedScopeMmodifyCurrentScopemodifyCurrentScopeMmodifyCurrentNameSpacesetContextPrecedencewithContextPrecedence getLocalVarsmodifyLocalVars setLocalVars withLocalVarsoutsideLocalVarswithCheckNoShadowingcheckNoShadowing getVarsToBind addVarToBindbindVarsToBindfreshAbstractNamefreshAbstractName_freshAbstractQNamefreshAbstractQName'freshConcreteName resolveName resolveName'tryResolveName resolveModulegetConcreteFixitygetConcretePolaritycomputeFixitiesAndPolarities getNotation bindVariableunbindVariablebindName bindName' rebindName bindModule bindQModule stripNoNamesmemoToScopeInfo copyScopecheckNoFixityInRenamingModuleapplyImportDirectiveM mapImportDirimportedNameMapFromListlookupImportedName mapRenamingnoGeneralizedVarsIfLetOpen openModule_ openModule$fMonadFixityErrorTCMTparseLHS parsePatternparsePatternSynparseApplicationparseModuleApplication $fEqExprKind$fShowExprKindLensPersistentVerbositygetPersistentVerbositysetPersistentVerbositymapPersistentVerbosityPersistentVerbosityLensIncludePathsgetIncludePathssetIncludePathsmapIncludePathsgetAbsoluteIncludePathssetAbsoluteIncludePathsmapAbsoluteIncludePaths LensSafeMode getSafeMode setSafeMode mapSafeModeSafeModeLensCommandLineOptionsgetCommandLineOptionssetCommandLineOptionsmapCommandLineOptions LensVerbosity setVerbosity mapVerbosityLensPragmaOptionsgetPragmaOptionssetPragmaOptionsmapPragmaOptionslensPragmaOptionsmodifyPragmaOptionsmodifyVerbosity putVerbositymodifyCommandLineOptionsmodifySafeMode putSafeMode builtinModulesWithSafePostulates"builtinModulesWithUnsafePostulatesprimitiveModulesbuiltinModulesisBuiltinModule!isBuiltinModuleWithSafePostulatesmodifyIncludePathsputIncludePathsmodifyAbsoluteIncludePathsputAbsoluteIncludePathsmodifyPersistentVerbosityputPersistentVerbosity$fLensPragmaOptionsTCState%$fLensPragmaOptionsCommandLineOptions$fLensVerbosityTCState$fLensVerbosityPragmaOptions$fLensCommandLineOptionsTCState)$fLensCommandLineOptionsPersistentTCState$fLensSafeModeTCState$fLensSafeModePersistentTCState $fLensSafeModeCommandLineOptions$fLensSafeModePragmaOptions$fLensIncludePathsTCState#$fLensIncludePathsPersistentTCState$$fLensIncludePathsCommandLineOptions $fLensPersistentVerbosityTCState*$fLensPersistentVerbosityPersistentTCState+$fLensPersistentVerbosityCommandLineOptions&$fLensPersistentVerbosityPragmaOptionssetCommandLineOptions'libToTCMsetLibraryPathssetLibraryIncludesaddDefaultLibrariessetOptionsFromPragmaenableDisplayFormsdisableDisplayFormsdisplayFormsEnabledsetIncludeDirs setInputFile getInputFile getInputFile' hasInputFile isPropEnabledhasUniversePolymorphismshowImplicitArgumentsshowIrrelevantArgumentswithShowAllArgumentswithShowAllArguments'withPragmaOptionsignoreInterfacesignoreAllInterfacespositivityCheckEnabled typeInType etaEnabledmaxInstanceSearchDepthmaxInversionDepth TeleNoAbs teleNoAbsTelVtheTeltheCoreTelView applyTermE canProjectconAppdefApp argToDontCare relToDontCarepiApplytelVars namedTelVars abstractArgsrenaming renamingRrenamePapplySubstTermapplyNLPatSubstapplyNLSubstToDomfromPatternSubstitution applyPatSubst usePatOriginusePatternInfoprojDropParsApplytelView' telView'UpTo bindsToTel' bindsToTelnamedBindsToTeldomFromNamedArgNamemkPimkLamtelePi'telePitelePi_ telePiVisibleteleLamtypeArgsWithTelcompiledClauseBody univSort'univSortunivInffunSort'funSortpiSort'piSortlevelMaxlevelLublevelTm unLevelAtom $fOrdElim' $fEqElim'$fOrdAbs$fEqAbs $fOrdTerm$fEqTerm $fOrdType'' $fEqType''$fOrdLevelAtom'$fEqLevelAtom'$fOrdPlusLevel'$fSubstTermRange'$fSubstPattern'Pattern'$fDeBruijnPattern'$fSubstTermEqualityView$fSubstTermCandidate $fSubstt(,,,) $fSubstt(,,) $fSubstt(,) $fSubstTerm()$fSubsttWithHiding $fSubsttMap $fSubstt[] $fSubsttMaybe $fSubsttDom' $fSubsttNamed $fSubsttArg $fSubsttAbs $fSubsttElim'$fSubstTermCompareAs$fSubstTermConstraint $fSubsttTele$fSubstTermDisplayTerm$fSubstTermDisplayForm$fSubsttBlocked$fSubstNLPatRewriteRule$fSubstNLPatNLPSort$fSubstNLPatNLPType$fSubstNLPatNLPat$fDeBruijnNLPat$fDeBruijnBraveTerm$fSubstTermProblemEq$fSubstTermPattern'$fSubstTermConPatternInfo $fSubstTerm[]$fSubstTermName$fSubsttLevelAtom'$fSubsttPlusLevel'$fSubsttLevel' $fSubsttSort'$fSubsttType''$fSubstBraveTermBraveTerm$fSubstTermTerm$fSubstaSubstitution'$fAbstractHashMap $fAbstractMap$fAbstractMaybe $fAbstract[]$fAbstractFunctionInverse'$fAbstractCase$fAbstractWithArity$fAbstractCompiledClauses'$fAbstractClause$fAbstractPrimFun$fAbstractDefn$fAbstractSystem$fAbstractProjLams$fAbstractProjection$fAbstractNumGeneralizableArgs $fAbstract[]0 $fAbstract[]1$fAbstractRewriteRule$fAbstractDefinition$fAbstractTele$fAbstractSort'$fAbstractType''$fAbstractTerm$fAbstractPermutation$fApplyPermutation$fAbstractDrop $fApplyDrop $fApply(,,) $fApply(,)$fApplyHashMap $fApplyMap $fApplyMaybe $fApplyMaybe0$fApplyBlocked $fApply[]$fApplyDisplayTerm$fApplyFunctionInverse' $fApplyCase$fApplyWithArity $fApplySystem$fApplyExtLamInfo$fApplyCompiledClauses' $fApplyClause$fApplyPrimFun $fApplyDefn$fApplyProjLams$fApplyProjection $fApply[]0$fApplyNumGeneralizableArgs $fApply[]1 $fApply[]2$fApplyRewriteRule$fApplyDefinition $fApplyTele $fApplySort'$fApplyBraveTerm $fApplyTerm$fTeleNoAbsTele $fTeleNoAbs[] $fShowTelV $fFunctorTelV $fOrdDom' $fEqSection $fEqCompareAs $fOrdTele$fEqTele $fEqCandidate $fEqBlocked$fEqNotBlocked$fEqPlusLevel' $fOrdLevel' $fEqLevel' $fOrdSort' $fEqSort'$fOrdSubstitution'$fEqSubstitution' $fOrdTelV$fEqTelVmakeOpengetOpen tryGetOpenisClosed KeepNames AddContext addContext contextSizeunsafeModifyContextmodifyContextInfo inTopContextunsafeInTopContextunsafeEscapeContext escapeContext checkpointcheckpointSubstitution'getModuleParameterSub defaultAddCtxwithFreshName_withShadowingNameTCMaddRecordNameContextunderAbstractionunderAbstraction'underAbstractionAbsunderAbstractionAbs'underAbstraction_mapAbstractiongetLetBindingsdefaultAddLetBinding' addLetBinding getContextgetContextSizegetContextArgsgetContextTermsgetContextTelescopegetContextNames lookupBV'lookupBVdomOfBVtypeOfBV nameOfBV'nameOfBV getVarInfo$fMonadAddContextTCMT$fMonadAddContextListT$fMonadAddContextStateT$fMonadAddContextWriterT$fMonadAddContextReaderT$fMonadAddContextExceptT$fMonadAddContextMaybeT$fAddContextTele$fAddContext[]$fAddContextName$fAddContextDom'$fAddContext(,)$fAddContext(,)0$fAddContext(,)1$fAddContext(,)2$fAddContext(,)3$fAddContextDom'0$fAddContextDom'1$fAddContext(,)4$fAddContext[]0$fAddContextKeepNames$fAddContext(,)5PiApplyMpiApplyMtelViewCoinductionKit nameOfInf nameOfSharp nameOfFlatlitTypesetBuiltinThingsbindBuiltinName bindPrimitive getBuiltin getBuiltin' getPrimitive' getPrimitivegetPrimitiveTermgetPrimitiveTerm'getTerm'getName'getTermconstructorFormconstructorForm' primIntegerprimIntegerPosprimIntegerNegSuc primFloatprimChar primStringprimBool primSigmaprimUnit primUnitUnitprimTrue primFalseprimListprimNilprimConsprimIOprimId primConId primIdElimprimPath primPathP primInterval primIZeroprimIOneprimIMinprimIMaxprimINeg primPartial primPartialP primIsOne primItIsOne primTrans primHComp primEquiv primEquivFunprimEquivProofprimTranspProof prim_glueU prim_unglueUprimGlue prim_glue prim_unglueprimFaceForall primIsOne1 primIsOne2primIsOneEmptyprimSub primSubIn primSubOutprimNatprimSucprimZero primNatPlus primNatMinus primNatTimesprimNatDivSucAuxprimNatModSucAuxprimNatEquality primNatLess primWord64 primSizeUnivprimSize primSizeLt primSizeSuc primSizeInf primSizeMaxprimInf primSharpprimFlat primEqualityprimRefl primRewrite primLevel primLevelZero primLevelSuc primLevelMax primSetOmega primFromNat primFromNegprimFromString primQNameprimArg primArgArgprimAbs primAbsAbs primAgdaSort primHiding primHidden primInstance primVisible primRelevance primRelevantprimIrrelevant primAssoc primAssocLeftprimAssocRight primAssocNonprimPrecedenceprimPrecRelatedprimPrecUnrelated primFixityprimFixityFixity primArgInfoprimArgArgInfoprimAgdaSortSetprimAgdaSortLitprimAgdaSortUnsupported primAgdaTermprimAgdaTermVarprimAgdaTermLamprimAgdaTermExtLamprimAgdaTermDefprimAgdaTermConprimAgdaTermPiprimAgdaTermSortprimAgdaTermLitprimAgdaTermUnsupportedprimAgdaTermMetaprimAgdaErrorPartprimAgdaErrorPartStringprimAgdaErrorPartTermprimAgdaErrorPartNameprimAgdaLiteralprimAgdaLitNatprimAgdaLitWord64primAgdaLitFloatprimAgdaLitCharprimAgdaLitStringprimAgdaLitQNameprimAgdaLitMetaprimAgdaPatternprimAgdaPatConprimAgdaPatVarprimAgdaPatDotprimAgdaPatLitprimAgdaPatProjprimAgdaPatAbsurdprimAgdaClauseprimAgdaClauseClauseprimAgdaClauseAbsurdprimAgdaDefinitionFunDefprimAgdaDefinitionDataDefprimAgdaDefinitionRecordDef!primAgdaDefinitionDataConstructorprimAgdaDefinitionPostulateprimAgdaDefinitionPrimitiveprimAgdaDefinition primAgdaMeta primAgdaTCMprimAgdaTCMReturnprimAgdaTCMBindprimAgdaTCMUnifyprimAgdaTCMTypeErrorprimAgdaTCMInferTypeprimAgdaTCMCheckTypeprimAgdaTCMNormaliseprimAgdaTCMReduceprimAgdaTCMCatchErrorprimAgdaTCMGetContextprimAgdaTCMExtendContextprimAgdaTCMInContextprimAgdaTCMFreshNameprimAgdaTCMDeclareDefprimAgdaTCMDeclarePostulateprimAgdaTCMDefineFunprimAgdaTCMGetTypeprimAgdaTCMGetDefinitionprimAgdaTCMQuoteTermprimAgdaTCMUnquoteTermprimAgdaTCMBlockOnMetaprimAgdaTCMCommitprimAgdaTCMIsMacroprimAgdaTCMWithNormalisationprimAgdaTCMDebugPrintprimAgdaTCMNoConstraintsprimAgdaTCMRunSpeculativecoinductionKit'coinductionKit getPrimNamegetBuiltinName'getPrimitiveName' isPrimitive intervalView' intervalViewintervalUnviewintervalUnview'pathView pathView' idViewAsPath boldPathView pathUnviewprimEqualityName equalityViewequalityUnviewconstrainedPrimsgetNameOfConstrained$fHasBuiltinsTCMT$fHasBuiltinsWriterT$fHasBuiltinsStateT$fHasBuiltinsReaderT$fHasBuiltinsListT$fHasBuiltinsExceptT$fHasBuiltinsMaybeT SizeMaxView' SizeMaxViewSizeViewComparable NotComparableYesAboveYesBelow DeepSizeViewDSizeInfDSizeVar DSizeMeta DOtherSizeSizeViewSizeInfSizeSuc OtherSize IsSizeType isSizeType BoundedSize BoundedLt BoundedNoisSizeTypeTestgetBuiltinDefNamegetBuiltinSizeisSizeNameTestisSizeNameTestRawhaveSizedTypes haveSizeLtbuiltinSizeHooksizeSortsizeUniv sizeType_sizeType sizeSucNamesizeSucsizeSuc_sizeMaxsizeViewsizeViewComparable sizeViewSuc_ sizeViewPredsizeViewOffset removeSucs unSizeViewunDeepSizeView maxViewMax maxViewConssizeViewComparableWithMax maxViewSuc_ unMaxView$fIsSizeTypeCompareAs$fIsSizeTypeTerm$fIsSizeTypeType''$fIsSizeType(,)$fIsSizeTypeDom'$fPrettyDeepSizeView$fFunctorSizeViewComparable$fShowDeepSizeView$fEqBoundedSize$fShowBoundedSizereallyUnLevelViewRangeAndPragma ToConcrete toConcretebindToConcreteAbsToCon MonadAbsToConEnvpreserveInteractionIds noTakenNames runAbsToConabstractToConcreteScopeabstractToConcreteCtxabstractToConcrete_abstractToConcreteHiding toConcreteCtx$fMonadDebugAbsToCon$fHasOptionsAbsToCon$fMonadStConcreteNamesAbsToCon$fReadTCStateAbsToCon$fMonadTCEnvAbsToCon$fMonadReaderEnvAbsToCon$fMonadFailAbsToCon$fMonadAbsToCon$fApplicativeAbsToCon$fFunctorAbsToCon$fToConcreteNamedMetaExpr$fToConcreteInteractionIdExpr$fToConcreteMaybeMaybe$fToConcreteLHSCore'Pattern$fToConcreteLHSLHS$fToConcreteSpineLHSLHS.$fToConcreteModuleApplicationModuleApplication$fToConcreteClause'[]$fToConcreteConstrDeclaration$fToConcreteMaybeMaybe0"$fToConcreteRewriteEqn'RewriteEqn'$fToConcreteRHS(,,,))$fToConcreteWhereDeclarationsWhereClause'$fToConcreteLetBinding[]%$fToConcreteTypedBindingTypedBinding'!$fToConcreteLamBindingLamBinding'$fToConcreteBinder'Binder',$fToConcreteFieldAssignment'FieldAssignment'$fToConcreteResolvedNameQName$fToConcreteAbstractNameQName$fToConcreteModuleNameQName$fToConcreteQNameQName$fToConcreteBindNameBoundName$fToConcreteNameName$fToConcreteNamedNamed $fToConcreteWithHidingWithHiding$fToConcreteArgArg$fToConcrete(,,)(,,)$fToConcrete(,)(,)$fToConcreteEitherEither$fToConcrete[][]$fToConcreteBoolBool$fToConcrete()() $fToConcreteRangeAndPragmaPragma$fToConcreteDeclaration[]$fToConcreteUserPatternArg$fToConcreteUserPatternPattern'$fToConcretePattern'Pattern$fToConcreteSplitPatternArg $fToConcreteSplitPatternPattern'"$fToConcreteBindingPatternPattern'$fToConcreteFreshenNameName$fToConcreteExprExpr$fHasRangeMaybeSection$fEqMaybeSection$fShowMaybeSection$fFunctorMaybeSection$fFoldableMaybeSection$fTraversableMaybeSectionshowAprettyAprettyAsshowATop prettyATopDropArgsdropArgs$fDropArgsSplitTree'$fDropArgsCompiledClauses'$fDropArgsTerm$fDropArgsFunctionInverse'$fDropArgsClause$fDropArgsPermutation$fDropArgsTele$fDropArgsMaybe addConstant setTerminatessetCompiledClauses setSplitTreemodifyFunClauses addClausesmkPragma addPragmagetUniqueCompilerPragmasetFunctionFlag markStatic markInline markInjectiveunionSignatures addSectionsetModuleCheckpoint getSectionaddDisplayForms applySection applySection'addDisplayFormisLocalgetDisplayFormschaseDisplayFormshasLoopingDisplayForm canonicalNamesameDef whatInductionsingleConstructorTypesigErrordefaultGetRewriteRulesForgetOriginalProjectiondefaultGetConstInfo getConInfo getPolarity' setPolarity getForcedArgsgetArgOccurrencesetArgOccurrencesmodifyArgOccurrences setTreelesssetCompiledArgUse getCompiledgetErasedConArgssetErasedConArgs getTreelessgetCompiledArgUse addDataCons getMutual getMutual_ setMutualmutuallyRecursivedefinitelyNonRecursive_getCurrentModuleFreeVars getDefModulegetDefFreeVarsfreeVarsToApplygetModuleFreeVarsmoduleParamsToApplyinstantiateDefinstantiateRewriteRuleinstantiateRewriteRules makeAbstractinAbstractModeinConcreteModeignoreAbstractModeinConcreteOrAbstractModetreatAbstractlytreatAbstractly' typeOfConst relOfConstmodalityOfConst droppedPars isProjection isProjection_ isStaticFun isInlineFunisProperProjectionprojectionArgsusesCopatternsapplyDef$fHasConstInfoWriterT$fHasConstInfoStateT$fHasConstInfoReaderT$fHasConstInfoMaybeT$fHasConstInfoListT$fHasConstInfoIdentityT$fHasConstInfoExceptT$fHasConstInfoChangeT$fHasConstInfoTCMT UnFreezeMeta unfreezeMetaIsInstantiatedMetaisInstantiatedMetaMonadMetaSolvernewMeta'assignV assignTerm' etaExpandMeta updateMetaVarspeculateMetas KeepMetas RollBackMetasMetaKindRecordsSingletonRecordsLevels allMetaKindsdontAssignMetas getMetaStoremodifyMetaStoremetasCreatedBy lookupMeta'metaTypeupdateMetaVarTCM insertMetaVargetMetaPriority isSortMeta isSortMeta_ getMetaTypegetMetaContextArgsgetMetaTypeInContextisGeneralizableMetaisInstantiatedMeta'constraintMetascreateMetaInfocreateMetaInfo'setValueMetaNamegetMetaNameSuggestionsetMetaNameSuggestionsetMetaArgInfoupdateMetaVarRangesetMetaOccursCheckregisterInteractionPointfindInteractionPoint_connectInteractionPointremoveInteractionPointgetInteractionPointsgetInteractionMetasgetInteractionIdsAndMetasisInteractionMetalookupInteractionPointlookupInteractionIdlookupInteractionMetalookupInteractionMeta_ newMetaTCM'getInteractionRange getMetaRangegetInteractionScope withMetaInfo' withMetaInfogetMetaVariableSetgetMetaVariablesgetInstantiatedMetas getOpenMetas isOpenMeta listenToMetaunlistenToMetagetMetaListenersclearMetaListenerswithFreezeMetas freezeMetas freezeMetas' unfreezeMetasunfreezeMetas'isFrozen$fIsInstantiatedMetaAbs$fIsInstantiatedMetaArg$fIsInstantiatedMetaMaybe$fIsInstantiatedMeta[]$fIsInstantiatedMetaLevelAtom'$fIsInstantiatedMetaPlusLevel'$fIsInstantiatedMetaLevel'$fIsInstantiatedMetaTerm$fIsInstantiatedMetaMetaId$fMonadInteractionPointsTCMT$fMonadInteractionPointsStateT$fMonadInteractionPointsReaderT$fUnFreezeMetaAbs$fUnFreezeMeta[]$fUnFreezeMetaLevelAtom'$fUnFreezeMetaPlusLevel'$fUnFreezeMetaLevel'$fUnFreezeMetaSort'$fUnFreezeMetaTerm$fUnFreezeMetaType''$fUnFreezeMetaMetaId $fEqMetaKind$fEnumMetaKind$fBoundedMetaKind$fShowMetaKind Condition checkMetaInst newSortMeta newTelMetanewNamedValueMeta'newNamedValueMeta newValueMetanewInstanceMetaassignetaExpandMetaSafe assignTerm newArgsMeta newArgsMeta'getConstructorData getConHeadInSeqHasFreeOccursSeqArg UnderLambdaonceinSeq underLambdaoccursIn tryStrengthen$fSubstTTermTAlt$fSubstTTermTTerm$fDeBruijnTTerm$fMonoidOccurs$fSemigroupOccurs $fHasFree(,) $fHasFree[] $fHasFreeInt $fHasFreeTAlt$fHasFreeBinder$fHasFreeTTerm$fHasFreeInSeq $fEqOccurs $fOrdOccurs $fShowOccurs $fEqSeqArg $fOrdSeqArg $fShowSeqArg$fSemigroupSeqArg$fMonoidSeqArg$fEqUnderLambda$fOrdUnderLambda$fShowUnderLambda$fSemigroupUnderLambda$fMonoidUnderLambda $fPrettyTTerm equalTerms caseToSeq$fEmbPrjForeignCode$fEmbPrjCompilerPragma$fEmbPrjSubstitution'$fEmbPrjBuiltin$fEmbPrjPatOrigin$fEmbPrjPatternInfo$fEmbPrjDBPatVar$fEmbPrjConPatternInfo$fEmbPrjClause$fEmbPrjTermHead$fEmbPrjFunctionInverse'$fEmbPrjCompiledClauses' $fEmbPrjCase$fEmbPrjWithArity$fEmbPrjFunctionFlag$fEmbPrjSplitTree'$fEmbPrjSplitTag$fEmbPrjLazySplit $fEmbPrjDefn$fEmbPrjEtaEquality$fEmbPrjOccurrence$fEmbPrjDoGeneralize$fEmbPrjNumGeneralizableArgs$fEmbPrjIsForced$fEmbPrjPolarity$fEmbPrjExtLamInfo$fEmbPrjSystem$fEmbPrjProjLams$fEmbPrjProjection$fEmbPrjRewriteRule$fEmbPrjNLPSort$fEmbPrjNLPType $fEmbPrjNLPat$fEmbPrjBlocked$fEmbPrjNotBlocked$fEmbPrjDefinition$fEmbPrjCompKit$fEmbPrjMutualId$fEmbPrjDisplayTerm$fEmbPrjCheckpointId $fEmbPrjOpen$fEmbPrjDisplayForm $fEmbPrjSort'$fEmbPrjLevelAtom'$fEmbPrjPlusLevel'$fEmbPrjLevel' $fEmbPrjTerm $fEmbPrjAbs$fEmbPrjType''$fEmbPrjConHead $fEmbPrjElim' $fEmbPrjDrop$fEmbPrjPermutation $fEmbPrjTele$fEmbPrjSection$fEmbPrjSignature $fEmbPrjDom'$fEmbPrjCutOff$fEmbPrjWarningName$fEmbPrjWarningMode$fEmbPrjPragmaOptions $fEmbPrjDoc$fEmbPrjLibPositionInfo$fEmbPrjLibWarning'$fEmbPrjLibWarning$fEmbPrjDeclarationWarning$fEmbPrjWarning$fEmbPrjTCWarning$fEmbPrjInterfaceencodedecodeencodeInterface encodeFiledecodeInterface decodeHashes decodeFile useTerPragma newSection checkFunDef' checkFunDefbindBuiltinFlatbindBuiltinSharpbindBuiltinInf typeOfFlat typeOfSharp typeOfInfToNLPattoNLPatgetClausesAsRewriteRules clauseQNameclauseToRewriteRule$fToNLPatArgElim'$fToNLPatArgElim'0$fToNLPatAbsAbs$fToNLPatElim'Elim'$fToNLPatDom'Dom' $fToNLPat[][]$fHasConstInfoReduceM$fMonadDebugReduceM$fMonadAddContextReduceM$fHasBuiltinsReduceMisRecordConstructorisGeneratedRecordConstructoretaContractRecordgetRecordFieldNames_ isEtaRecordisRecordYesNoDontKnowmatchCopatterns matchPatternsbuildSubstitutionExpandPatternSynonymsexpandPatternSynonymsexpandLitPatternexpandPatternSynonyms'$fExpandPatternSynonymsPattern''$fExpandPatternSynonymsFieldAssignment'$fExpandPatternSynonymsNamed$fExpandPatternSynonymsArg$fExpandPatternSynonyms[]$fExpandPatternSynonymsMaybeNamesNamesTunName runNamesTrunNames currentCxtcxtSubstinCxtcl'clopenbind'bindglamglamNlamilam$fHasBuiltinsNamesT$fFunctorNamesT$fApplicativeNamesT $fMonadNamesT$fMonadFailNamesT$fMonadTransNamesT$fMonadStatesNamesT$fMonadIONamesT$fHasOptionsNamesT$fMonadDebugNamesT$fMonadTCEnvNamesT$fMonadTCStateNamesT$fMonadTCMNamesT$fReadTCStateNamesT$fMonadReduceNamesT$fMonadErroreNamesT$fMonadAddContextNamesT MentionsMeta mentionsMetas mentionsMeta$fMentionsMetaCompareAs$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'IsMetaisMeta Instantiate instantiate' instantiateinstantiateFullreducereduceB normalise normaliseBsimplifyisFullyInstantiatedMeta ifBlocked isBlocked reduceIApply blockedOrMeta reduceIApply'shouldTryFastReducemaybeFastReduceTermslowReduceTermunfoldCorecursionEunfoldCorecursionunfoldDefinitionunfoldDefinitionEunfoldDefinition'unfoldDefinitionStep reduceDefCopy reduceHead unfoldInlinedappDef_appDefE_appDefappDefEappDef'appDefE'simplifyBlocked'slowNormaliseArgs$fInstantiateEqualityView$fInstantiateCandidate$fInstantiateCompareAs$fInstantiateConstraint$fInstantiateClosure$fInstantiateDom'$fInstantiateSort'$fInstantiateBlocked$fInstantiateLevelAtom'$fInstantiatePlusLevel'$fInstantiateLevel'$fInstantiateType''$fInstantiateTerm$fInstantiate(,,)$fInstantiate(,)$fInstantiateTele$fInstantiateElim'$fInstantiateArg$fInstantiateAbs$fInstantiateMaybe$fInstantiateMaybe0$fInstantiateMap$fInstantiate[]$fIsMetaCompareAs $fIsMetaSort'$fIsMetaLevel'$fIsMetaType'' $fIsMetaTerm$fReduceIPBoundary'$fReduceEqualityView$fReduceCandidate $fReduceMap$fReduceCompareAs$fReduceConstraint $fReduceTele$fReduceClosure $fReduceTerm$fReducePattern' $fReduce(,,) $fReduce(,) $fReduceDom' $fReduceArg $fReduce[] $fReduceAbs$fReduceLevelAtom'$fReducePlusLevel'$fReduceLevel' $fReduceElim' $fReduceSort'$fReduceType''$fSimplifyEqualityView$fSimplifyCandidate$fSimplifyDisplayForm$fSimplifyCompareAs$fSimplifyConstraint$fSimplifyProblemConstraint$fSimplifyTele$fSimplifyClosure$fSimplifyDom' $fSimplifyAbs$fSimplifyLevelAtom'$fSimplifyPlusLevel'$fSimplifyLevel'$fSimplifySort'$fSimplifyType''$fSimplifyTerm$fSimplifyBool$fSimplify(,,) $fSimplify(,)$fSimplifyIPBoundary'$fSimplifyNamed$fSimplifyElim' $fSimplifyArg$fSimplifyMaybe$fSimplifyMaybe0 $fSimplifyMap $fSimplify[]$fNormaliseEqualityView$fNormaliseCandidate$fNormaliseDisplayForm$fNormalisePattern'$fNormaliseConPatternInfo$fNormaliseCompareAs$fNormaliseConstraint$fNormaliseProblemConstraint$fNormaliseTele$fNormaliseClosure$fNormaliseDom'$fNormaliseArg$fNormaliseAbs$fNormaliseLevelAtom'$fNormalisePlusLevel'$fNormaliseLevel'$fNormaliseElim'$fNormaliseTerm$fNormaliseType''$fNormaliseSort'$fNormaliseDBPatVar$fNormaliseInt$fNormaliseChar$fNormaliseBool$fNormalise(,,)$fNormalise(,)$fNormaliseWithHiding$fNormaliseIPBoundary'$fNormaliseNamed$fNormaliseMaybe$fNormaliseMaybe0$fNormaliseMap $fNormalise[]$fInstantiateFullEqualityView$fInstantiateFullCandidate$fInstantiateFullBuiltin$fInstantiateFullInterface$fInstantiateFullClause!$fInstantiateFullCompiledClauses'$fInstantiateFullCase!$fInstantiateFullFunctionInverse'$fInstantiateFullSystem$fInstantiateFullExtLamInfo$fInstantiateFullDefn$fInstantiateFullDisplayTerm$fInstantiateFullDisplayForm$fInstantiateFullRewriteRule$fInstantiateFullNLPSort$fInstantiateFullNLPType$fInstantiateFullNLPat$fInstantiateFullDefinition$fInstantiateFullTele$fInstantiateFullSection$fInstantiateFullSignature$fInstantiateFullCompareAs$fInstantiateFullConstraint"$fInstantiateFullProblemConstraint$fInstantiateFullClosure$fInstantiateFullDom'$fInstantiateFullAbs$fInstantiateFullPattern'$fInstantiateFullConPatternInfo$fInstantiateFullSubstitution'$fInstantiateFullLevelAtom'$fInstantiateFullPlusLevel'$fInstantiateFullLevel'$fInstantiateFullTerm$fInstantiateFullType''$fInstantiateFullSort'$fInstantiateFullDBPatVar$fInstantiateFullConHead$fInstantiateFullScope$fInstantiateFullQName$fInstantiateFullName$fInstantiateFullModuleName$fInstantiateFullInt$fInstantiateFullChar$fInstantiateFullBool$fInstantiateFull(,,,)$fInstantiateFull(,,)$fInstantiateFull(,)$fInstantiateFullWithArity$fInstantiateFullOpen$fInstantiateFullNamed$fInstantiateFullElim'$fInstantiateFullArg$fInstantiateFullMaybe$fInstantiateFullMaybe0$fInstantiateFullMap$fInstantiateFullHashMap$fInstantiateFull[]OutputTypeName OutputTypeVarOutputTypeVisiblePiOutputTypeNameNotYetKnownNoOutputTypeName Boundary'BoundarySplitTel firstPart secondPart splitPerm flattenTel reorderTel reorderTel_ unflattenTel renameTel teleNames teleArgNamesteleArgsteleDoms teleNamedArgstele2NamedArgssplitTelescopeAt permuteTelvarDependencies varDependentssplitTelescopesplitTelescopeExactinstantiateTelescopeexpandTelescopeVar telViewUpTo telViewUpTo' telViewPathtelViewUpToPathtelViewUpToPathBoundary' fullBoundarytelViewUpToPathBoundarytelViewUpToPathBoundaryPtelViewPathBoundaryP teleElims pathViewAsPi pathViewAsPi'pathViewAsPi'whnfpiOrPathtelView'UpToPath telView'PathisPath telePatterns telePatterns'mustBePiifPiifPiTypeifNotPi ifNotPiTypeifNotPiOrPathType typeAritygetOutputTypeNameaddTypedInstanceresolveUnknownInstanceDefsgetInstanceDefs $fPiApplyM[]$fPiApplyMNamed $fPiApplyMArg$fPiApplyMTermSynEqcheckSyntacticEquality$fSynEqArgInfo $fSynEqDom' $fSynEqArg $fSynEqAbs $fSynEqElim' $fSynEq[] $fSynEqType'' $fSynEqSort'$fSynEqLevelAtom'$fSynEqPlusLevel' $fSynEqLevel' $fSynEqTerm $fSynEqBoolSigmaKit sigmaNamesigmaConsigmaFstsigmaSnd-->.-->..-->garrgpihPinPihPi'nPi'pPi'el'elInfnolamvarMgApplygApply'<@><#><..><@@>listiopatheltset sSizeUniv tSizeUnivargNdomNargHdomHlookupPrimitiveFunctionlookupPrimitiveFunctionQgetBuiltinName isBuiltin getSigmaKit $fEqSigmaKit$fShowSigmaKit TermPositionHead Eliminated FamilyOrNotIsFamIsNotfamThing TranspOrHCompDoTranspDoHComprequireCubical primINeg' primDepIMin'primIBin primIMin' primIMax'imaximinprimIdJ primIdElim'primPOr primPartial' primPartialP' primSubOut' primIdFace' primIdPath' primTrans' primHComp' cmdToNamemkGCompunglueTranspGlueheadStopcompGlue compHCompUprimTransHCompprimComp prim_glueU' prim_unglueU' primGlue' prim_glue' prim_unglue'primFaceForall'decomposeIntervaldecomposeInterval' transpTel trFillTel$fReduceFamilyOrNot$fEqTermPosition$fShowTermPosition$fEqFamilyOrNot$fShowFamilyOrNot$fFunctorFamilyOrNot$fFoldableFamilyOrNot$fTraversableFamilyOrNot$fEqTranspOrHComp$fShowTranspOrHComp TermToPattern termToPatterndotPatternsToPatterns$fTermToPatternTermPattern'$fTermToPatternNamedNamed$fTermToPatternArgArg$fTermToPattern[][] SingleLevel SingleClosed SinglePlusLevelKitlvlTypelvlSuclvlMaxlvlZerotypeNamesucNamemaxNamezeroName levelType isLevelTypelevelSucFunctionbuiltinLevelKit requireLevels haveLevelsunLevelunlevelWithKitunConstVunPlusV maybePrimCon maybePrimDef levelView levelView' levelPlusViewlevelLowerBoundsubLevel levelMaxDiff unSingleLevelunSingleLevels levelMaxViewsingleLevelView$fFreeSingleLevel$fSubstTermSingleLevel$fEqSingleLevel$fShowSingleLevel QuotingKitquoteTermWithKitquoteTypeWithKitquoteClauseWithKitquoteDomWithKitquoteDefnWithKitquoteListWithKit quotingKit quoteString quoteNamequoteNat quoteConName quoteMeta quoteTerm quoteTypequoteDom quoteDefn quoteListPredRelOpFromTermfromTermFromTermFunctionToTermtoTermtoTermRPrimTermprimTermPrimTypeprimTypeLvlunLvlunNat buildListfromReducedTerm fromLiteralmkPrimInjectiveprimMetaToNatInjectiveprimCharToNatInjectiveprimStringToListInjectiveprimWord64ToNatInjectiveprimFloatToWord64InjectiveprimQNameToWord64sInjectivegetReflprimEraseEqualitygetReflArgInfo genPrimForce primForceprimForceLemmamkPrimLevelZeromkPrimLevelSucmkPrimLevelMaxmkPrimSetOmega mkPrimFun1TCM mkPrimFun1 mkPrimFun2 mkPrimFun4 $fShowNat $fTermLikeNat $fIntegralNat $fShowLvl $fPrimTermIO $fPrimTerm[]$fPrimTermFixity'$fPrimTermType''$fPrimTermMetaId$fPrimTermQName $fPrimTermLvl $fPrimTermNat $fPrimTermStr$fPrimTermDouble$fPrimTermChar$fPrimTermBool$fPrimTermWord64$fPrimTermInteger $fPrimTypea $fPrimTerm(,) $fPrimTerm-> $fToTerm[] $fToTerm(,)$fToTermFixityLevel$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$fEqLvl$fOrdLvl$fEqNat$fOrdNat$fNumNat $fEnumNat $fRealNat $fShowLeq$fEqLeqdefaultOpenLevelsToZerodefaultLevelsToZero ForceNotFreeIsFree MaybeFreeNotFree forceNotFree$fForceNotFreeSort'$fForceNotFreeLevelAtom'$fForceNotFreePlusLevel'$fForceNotFreeLevel'$fForceNotFreeTerm$fForceNotFreeType''$fForceNotFreeElim'$fForceNotFree[]$fForceNotFreeAbs$fForceNotFreeDom'$fForceNotFreeArg $fEqIsFree $fShowIsFree checkEmptyTelensureEmptyType isEmptyTel isEmptyTypeSubstWithOriginsubstWithOriginMonadDisplayForm dtermToTermdisplayFormArities displayFormmatchDisplayForm $fMatchLevel' $fMatchSort' $fMatchTerm $fMatchElim' $fMatchArg $fMatch[]$fSubstWithOriginArg$fSubstWithOriginDisplayTerm$fSubstWithOriginTerm$fSubstWithOriginArg0$fSubstWithOriginElim'$fSubstWithOrigin[]eliminateDeadCodeMonadConversionleqSortleqLevelleqType equalLevel equalSort equalTypeequalTermOnFace equalTerm compareLevel compareSort compareTel compareType compareElims compareArgs compareAtomcompareTermOnFace compareAs compareTermStackFrameActionMonadCheckInternalinfercheckInternal' checkInternal checkSort checkType' checkTypeeraseUnusedAction defaultAction recursiveanyDefs ToAbstract toAbstractMonadReflectedToAbstractwithNameaskName toAbstract_toAbstractWithoutImplicitmkDefmkSettoAbstractPats$fToAbstract[][]$fToAbstractQNamedClause'$fToAbstractPattern(,)$fToAbstractSortExpr$fToAbstractTermExpr$fToAbstractLiteralExpr$fToAbstractAbs(,)$fToAbstract(,)Expr$fToAbstract(,)Expr0$fToAbstract(,)TypedBinding$fToAbstract[][]0$fToAbstractArgArg$fToAbstractNamedNamed NamedClauseReifyreify reifyWhen MonadReifyreifyUnblockedreifyDisplayFormPblankNotInScope reifyPatterns$fReify(,,,)(,,,)$fReify(,,)(,,) $fReify(,)(,) $fReify[][]$fReifyElim'Elim'$fReifyDom'Arg $fReifyTele[] $fReifyAbs(,)$fReifyLevel'Expr$fReifySort'Expr$fReifyType''Expr$fReifyQNamed[] $fReifyArgArg$fReifyNamedNamed$fReifyTermExpr$fReifyLiteralExpr$fReifyDisplayTermExpr$fReifyMetaIdExpr$fReifyExprExpr$fReifyNameName$fReifyBoolBool$fReifyNamedClauseClause'$fReifyQNamedClause'$fMonoidMonoidMap$fSemigroupMonoidMap$fBlankVarsTypedBinding$fBlankVarsLamBinding$fBlankVarsRHS$fBlankVarsModuleName$fBlankVarsPattern'$fBlankVarsLHSCore'$fBlankVarsLHS$fBlankVarsProblemEq$fBlankVarsEither$fBlankVars(,)$fBlankVarsFieldAssignment' $fBlankVars[]$fBlankVarsNamed$fBlankVarsArg $fBinder(,) $fBinderMaybe $fBinder[] $fBinderNamed $fBinderArg$fBinderFieldAssignment'$fBinderLetBinding$fBinderBindName$fBinderTypedBinding$fBinderLamBinding$fBinderBinder'$fBinderPattern'$fBinderLHSCore' $fBinderLHS$fBlankVarsExpr$fBlankVarsClause'WithNode prettyTCMCtxprettyRprettyTCMPatternsprettyTCMPatternList$fPrettyTCMSplitTag$fPrettyTCMOccurrence$fPrettyTCMRewriteRule$fPrettyTCMType''$fPrettyTCMElim'$fPrettyTCMNLPSort$fPrettyTCMNLPType$fPrettyTCMNLPat$fPrettyTCMElim'0$fPrettyTCMPattern'$fPrettyTCMDBPatVar$fPrettyTCMTele$fPrettyTCMConHead$fPrettyTCMModuleName$fPrettyTCMQName$fPrettyTCMName$fPrettyTCMWithHiding$fPrettyTCMTypeCheckingProblem$fPrettyTCMCompareAs$fPrettyTCMConstraint$fPrettyTCMProblemConstraint$fPrettyTCMModality$fPrettyTCMQuantity$fPrettyTCMRelevance$fPrettyTCMTypedBinding$fPrettyTCMExpr$fPrettyTCMEqualityView$fPrettyTCMMaybeReduced$fPrettyTCMElim'1 $fPrettyTCM[]$fPrettyTCMMap$fPrettyTCMDom'$fPrettyTCMArg$fPrettyTCMNamed$fPrettyTCMBlocked$fPrettyTCMMetaId$fPrettyTCMJudgement$fPrettyTCMClause$fPrettyTCMSubstitution'$fPrettyTCMIsForced$fPrettyTCMPolarity$fPrettyTCMPermutation$fPrettyTCMLevel'$fPrettyTCMQNamed$fPrettyTCMNamedClause$fPrettyTCMDisplayTerm$fPrettyTCMSort'$fPrettyTCMType''0$fPrettyTCMTerm$fPrettyTCM(,,)$fPrettyTCM(,)$fPrettyTCM[]0$fPrettyTCMClosure$fPrettyTCMCheckpointId$fPrettyTCMRange'$fPrettyTCMProblemId$fPrettyTCMInt$fPrettyTCMLiteral$fPrettyTCMComparison$fPrettyTCMQName0$fPrettyTCMName0$fPrettyTCMBool$fPrettyTCMPrettyContext$fPrettyTCMGraph$fPrettyTCMWithNode telePiPath iApplyVarsOldSizeConstraintLeq OldSizeExprSizeMetacheckSizeLtSatcheckSizeNeverZerocheckSizeVarNeverZero isBoundedboundedSizeMetaHook trySizeUniv deepSizeView sizeMaxView compareSizescompareMaxViewscompareBelowMaxcompareSizeViewsgiveUptrivial isSizeProblemisSizeConstraintmkIsSizeConstraintisSizeConstraint_takeSizeConstraintsgetSizeConstraints getSizeMetasoldComputeSizeConstraintsoldComputeSizeConstraint oldSizeExprflexibleVariablesoldCanonicalizeSizeConstraintoldSolveSizeConstraints oldSolver$fPrettyOldSizeExpr$fPrettyOldSizeConstraint$fShowOldSizeConstraint$fEqOldSizeExpr$fShowOldSizeExprcheckDisplayPragmasayWhere$fPrettyTCMCall$fPrettyTCMCallInfoUsableModality usableModUsableRelevance usableRelhideAndRelParams workOnTypes'applyRelevanceToContextapplyRelevanceToContextOnlyapplyRelevanceToJudgementOnlyapplyRelevanceToContextFunBodyapplyQuantityToContextapplyQuantityToContextOnlyapplyQuantityToJudgementOnlyapplyCohesionToContextapplyCohesionToContextOnlysplittableCohesionapplyModalityToContextapplyModalityToContextOnlyapplyModalityToJudgementOnlyapplyModalityToContextFunBodywakeIrrelevantVarsisIrrelevantOrPropM$fUsableRelevanceAbs$fUsableRelevanceDom'$fUsableRelevanceArg$fUsableRelevanceElim'$fUsableRelevance(,)$fUsableRelevance[]$fUsableRelevanceLevelAtom'$fUsableRelevancePlusLevel'$fUsableRelevanceLevel'$fUsableRelevanceSort'$fUsableRelevanceType''$fUsableRelevanceTerm$fUsableModalityAbs$fUsableModalityDom'$fUsableModalityArg$fUsableModalityElim'$fUsableModality(,)$fUsableModality[]$fUsableModalityLevel'$fUsableModalitySort'$fUsableModalityType''$fUsableModalityTermNormaliseProjPnormaliseProjPElimTypeArgTProjTprojTRec projTFieldmkCon orderFieldsinsertMissingFields recordModule getRecordDefgetRecordOfFieldgetRecordFieldNamesrecordFieldNamesfindPossibleRecordsgetRecordFieldTypesgetRecordTypeFieldsgetRecordConstructor isRecordType tryRecordTypeorigProjection getDefType projectTyped typeElimsisEtaCon#isEtaOrCoinductiveRecordConstructorisInductiveRecordisEtaRecordTypeunguardedRecordrecursiveRecordnonRecursiveRecordisRecursiveRecordetaExpandBoundVarexpandRecordVarexpandRecordVarsRecursivelycurryAtetaExpandRecordforceEtaExpandRecordetaExpandRecord'etaExpandRecord_etaExpandRecord'_etaExpandAtRecordTypeisSingletonRecord isSingletonRecordModuloRelevanceisSingletonRecord'isSingletonTypeisSingletonTypeModuloRelevanceisSingletonType'isEtaVaremap$fPrettyTCMElimType$fNormaliseProjPPattern'$fNormaliseProjPNamed$fNormaliseProjPArg$fNormaliseProjP[]$fNormaliseProjPClauseLeftoverPatternspatternVariables asPatterns dotPatternsabsurdPatterns otherPatternsLHSState_lhsTel _lhsOutPat _lhsProblem _lhsTarget_lhsPartialSplit AbsurdPattern DotPattern AsBindingAsBProblem _problemEqs_problemRestPats _problemCont ChooseFlex chooseFlex FlexChoice ChooseLeft ChooseRight ChooseEither ExpandBoth FlexibleVar flexArgInfo flexForcedflexKindflexPosflexVarFlexibleVarKind RecordFlex ImplicitFlexDotFlex OtherFlex FlexibleVars allFlexVars problemEqsproblemRestPats problemCont problemInPatslhsTel lhsOutPat lhsProblem lhsTargetgetLeftoverPatternsgetUserVariableNames$fPrettyTCMProblemEq$fLensModalityFlexibleVar$fLensOriginFlexibleVar$fLensHidingFlexibleVar$fLensArgInfoFlexibleVar$fMonoidFlexChoice$fSemigroupFlexChoice$fChooseFlexFlexibleVar$fChooseFlexInt$fChooseFlexOrigin$fChooseFlexHiding$fChooseFlexIsForced$fChooseFlexArgInfo$fChooseFlexMaybe$fChooseFlex[]$fChooseFlexFlexibleVarKind$fInstantiateFullAsBinding$fPrettyAsBinding$fPrettyTCMAsBinding$fSubstTermAsBinding$fPrettyTCMDotPattern$fSubstTermDotPattern$fPrettyTCMAbsurdPattern$fSubstTermAbsurdPattern$fPrettyTCMLHSState$fSubstTermProblem$fPrettyTCMLeftoverPatterns$fMonoidLeftoverPatterns$fSemigroupLeftoverPatterns$fShowPatVarPosition$fEqPatVarPosition $fShowProblem$fEqFlexChoice$fShowFlexChoice$fEqFlexibleVar$fShowFlexibleVar$fFunctorFlexibleVar$fFoldableFlexibleVar$fTraversableFlexibleVar$fEqFlexibleVarKind$fShowFlexibleVarKind matchedArgs foldMatch mergeElim mergeElimsmatchCopattern matchPatternyesSimplification matchPatternPmatchPatternsP $fMonoidMatch$fSemigroupMatch $fNullMatch$fFunctorMatchImplicitInsertion ImpInsert BadImplicits NoSuchNameNoInsertNeeded implicitArgsimplicitNamedArgs newMetaArgnewInteractionMetaArginsertImplicitinsertImplicit'$fShowImplicitInsertion implicitPinsertImplicitPatternsinsertImplicitSizeLtPatternsinsertImplicitPatternsTuseNamesFromPatternuseNamesFromProblemEqs useOriginFrom noProblemRest initLHSStateupdateProblemRestetaExpandClausegetDefcomputeForcingAnnotationsisForced nextIsForced$fForcedVariablesTerm$fForcedVariablesArg$fForcedVariablesElim'$fForcedVariables[]ConstructorInfoDataCon RecordCon getConFormgetOrigConHead consOfHITgetFullyAppliedConTypegetConstructorInfo isDatatypeisDataOrRecordTypeisDataOrRecordgetNumberOfParametersgetConstructorsgetConstructors'getConstructors_ getConHeads getConHeads' makeConHead GetMatchables getMatchables NLPatVarsnlPatVarsUnder nlPatVars NLPatToTerm nlPatToTerm PatternFrom patternFrom $fFreeNLPSort $fFreeNLPType $fFreeNLPat$fPatternFromType''TermNLPat$fPatternFrom()Level'NLPat$fPatternFrom()Sort'NLPSort$fPatternFrom()Type''NLPType$fPatternFromtDom'Dom'$fPatternFrom(,)[][]$fPatternFromDom'ArgArg$fNLPatToTermNLPSortSort'$fNLPatToTermNLPTypeType''$fNLPatToTermNLPatLevel'$fNLPatToTermNLPatTerm$fNLPatToTermIntTerm$fNLPatToTermAbsAbs$fNLPatToTermElim'Elim'$fNLPatToTermDom'Dom'$fNLPatToTermArgArg$fNLPatToTerm[][]$fNLPatVarsAbs$fNLPatVars(,)$fNLPatVarsNLPat$fNLPatVarsNLPSort$fNLPatVarsNLPType $fNLPatVarsf$fGetMatchablesRewriteRule$fGetMatchablesTerm$fGetMatchablesNLPSort$fGetMatchablesNLPType$fGetMatchablesNLPat$fGetMatchables(,)$fGetMatchablesAbs$fGetMatchablesElim'$fGetMatchablesDom'$fGetMatchablesArg$fGetMatchables[]recordPatternToProjectionstranslateCompiledClausestranslateSplitTreetranslateRecordPatterns $fDropFrom[] $fDropFrom(,)$fDropFromSplitTree' $fPrettyTCM-> $fPretty->$fPrettyTCMEither$fEqKind$fFunctorRecPatM$fApplicativeRecPatM$fMonadRecPatM$fMonadIORecPatM$fMonadTCMRecPatM$fHasOptionsRecPatM$fMonadTCEnvRecPatM$fMonadTCStateRecPatMDefNodeArgNodeComputeOccurrences occurrencesOccMOccEnvvarsinfOccurrencesBuilder'Concat' OccursAs' OccursHere'OccurrencesBuilderConcatOccursAs OccursHere OnlyVarsUpTo OccurrencesItemAnArgADefcheckStrictlyPositive getDefArity preprocessflattenwithExtendedOccEnvwithExtendedOccEnv'getOccurrencescomputeOccurrencescomputeOccurrences' mergeEdgesbuildOccurrenceGraph computeEdges$fPrettyTCMSeq$fHasRangeItem$fMonoidOccurrencesBuilder$fSemigroupOccurrencesBuilder$fComputeOccurrences(,)$fComputeOccurrencesMaybe$fComputeOccurrences[]$fComputeOccurrencesDom'$fComputeOccurrencesArg$fComputeOccurrencesElim'$fComputeOccurrencesAbs$fComputeOccurrencesTele$fComputeOccurrencesType''$fComputeOccurrencesLevelAtom'$fComputeOccurrencesPlusLevel'$fComputeOccurrencesLevel'$fComputeOccurrencesTerm$fComputeOccurrencesClause$fPrettyTCMNode$fSemiRingEdge$fEqItem $fOrdItem $fShowItemProjectionViewLoneProjectionLike NoProjection projViewProj projViewSelf projViewSpine unProjViewprojViewreduceProjectionLikeelimView inferUnivSort sortFitsIn hasBiggerSort inferPiSort inferFunSortptsRuleptsRule' hasPTSRulecheckTelePiSortifIsSort shouldBeSortsortOfprettyConstraintinterestingConstraintprettyInterestingConstraints prettyWarningprettyTCWarningsprettyTCWarnings'filterTCWarningstcWarningsToErrorapplyFlagsToTCWarnings'applyFlagsToTCWarnings$fPrettyTCMWarning$fPrettyTCMTCWarning HasPolarity polaritiesneg polFromOcc nextPolaritypurgeNonvariantpolarityFromPositivityenablePhantomTypesdependentPolarityrelevantInIgnoringNonvariant sizePolaritycheckSizeIndexpolarity$fHasPolarityLevelAtom'$fHasPolarityPlusLevel'$fHasPolarityLevel'$fHasPolarityTerm$fHasPolarityElim'$fHasPolarityType''$fHasPolarity(,)$fHasPolarity[]$fHasPolarityAbs$fHasPolarityDom'$fHasPolarityArgInvViewInvNoInv headSymbol headSymbol' topLevelArg joinHeadMaps updateHeadscheckInjectivitycheckInjectivity'checkOverapplicationinstantiateVarHeadsfunctionInverseuseInjectivityinvertFunctionforcePiUsingInjectivity SplitPattern SplitPatVarsplitPatVarNamesplitPatVarIndexsplitExcludedLits BlockingVars BlockingVar blockingVarNoblockingVarConsblockingVarLitsblockingVarOverlapblockingVarLazy ApplyOrIApplyIsApplyIsIApplyBlockedOnResult BlockedOnProjBlockedOnApplyNotBlockedOnResultblockedOnResultOverlapblockedOnResultIApplyBlockblockedOnResult blockedOnVarstoSplitPatternsfromSplitPatterns toSplitPSubstapplySplitPSubstisTrivialPatternsetBlockingVarOverlap matchClause$fPrettyBlockingVar$fDeBruijnSplitPatVar$fPrettyTCMSplitPatVar$fPrettySplitPatVar$fShowSplitPatVar$fShowBlockingVarPureConversionTunPureConversionT FreshThingsfreshIntfreshProblemId freshNameId pureEqualTerm pureCompareAsrunPureConversion$fMonadFreshIntPureConversionT!$fMonadFreshNameIdPureConversionT$$fMonadFreshProblemIdPureConversionT $fMonadStatisticsPureConversionT$fMonadWarningPureConversionT%$fMonadStConcreteNamesPureConversionT'$fMonadInteractionPointsPureConversionT $fMonadMetaSolverPureConversionT $fMonadConstraintPureConversionT$fNullPureConversionT$fIsStringPureConversionT$fSemigroupPureConversionT$fFunctorPureConversionT$fApplicativePureConversionT$fMonadPureConversionT $fMonadErrorTCErrPureConversionT&$fMonadStateFreshThingsPureConversionT$fMonadDebugPureConversionT $fMonadAddContextPureConversionT$fMonadReducePureConversionT$fReadTCStatePureConversionT$fMonadTCEnvPureConversionT$fHasOptionsPureConversionT$fHasConstInfoPureConversionT$fHasBuiltinsPureConversionT$fMonadFailPureConversionTPostponedEquationsPostponedEquation eqFreeVarseqTypeeqLhseqRhsNLMState_nlmSub_nlmEqsNLMnlmSubnlmEqsrunNLMmatchingBlockedtellSubtellEq reallyFreemakeSubstitutioncheckPostponedEquations nonLinMatchequal$fNullNLMState$fMatchType''NLPatTerm$fMatch()NLPatLevel'$fMatch()NLPSortSort'$fMatch()NLPTypeType''$fMatchtDom'Dom'$fMatch(,)[][]$fMatchDom'ArgArgCallPath callInfosMaskedgetMask getMaskedMaskedDeBruijnPatternsUsableSizeVarsusableSizeVarsTerMterMMonadTerterAskterLocalterAsksTerEnvterUseDotPatterns terSizeSucterSharp terCutOff terCurrent terMutual terUserNamesterHaveInlinedWith terTarget terDelayed terMaskArgs terMaskResult _terSizeDepth terPatternsterPatternsRaise terGuarded terUseSizeLt terUsableVarsTarget MutualNames defaultTerEnvrunTer runTerDefaultterGetUseDotPatternsterSetUseDotPatterns terGetSizeSuc terGetCurrent terSetCurrent terGetSharp terGetCutOff terGetMutualterGetUserNames terGetTarget terSetTargetterGetHaveInlinedWithterSetHaveInlinedWith terGetDelayed terSetDelayedterGetMaskArgsterSetMaskArgsterGetMaskResultterSetMaskResultterGetPatternsterSetPatternsterRaise terGetGuardedterModifyGuarded terSetGuarded terUnguarded terSizeDepthterGetUsableVarsterModifyUsableVarsterSetUsableVarsterGetUseSizeLtterModifyUseSizeLtterSetUseSizeLtwithUsableVars conUseSizeLt projUseSizeLtisProjectionButNotCoinductiveisCoinductiveProjection patternDepth unusedVarmasked notMaskedterSetSizeDepth$fPrettyTCMMasked$fDecorationMasked $fMonoidTerM$fSemigroupTerM$fUsableSizeVars[]$fUsableSizeVarsMasked$fUsableSizeVars[]0$fUsableSizeVarsPattern'$fMonadTerTerM$fPrettyCallPath$fShowCallPath$fSemigroupCallPath$fMonoidCallPath$fAllNamesCallPath $fFunctorTerM$fApplicativeTerM $fMonadTerM$fMonadFailTerM$fMonadErrorTCErrTerM$fMonadBenchPhaseTerM$fMonadStatisticsTerM$fHasOptionsTerM$fHasBuiltinsTerM$fMonadDebugTerM$fHasConstInfoTerM $fMonadIOTerM$fMonadTCEnvTerM$fMonadTCStateTerM$fMonadTCMTerM$fReadTCStateTerM$fMonadReduceTerM$fMonadAddContextTerM $fEqMasked $fOrdMasked $fShowMasked$fFunctorMasked$fFoldableMasked$fTraversableMasked tcErrString stringTCErrdropTopLevelModule$fPrettyTCMNegativeUnification$fPrettyTCMSplitError$fPrettyTCMTCErr$fPrettyUnequalType''$fPrettyUnequalTerm$fVerbalizeCohesion$fVerbalizeQuantity$fVerbalizeRelevance$fVerbalizeHiding$fPrettyTCMUnificationFailure$fVerbalizeIndefinite$fPrettyTCMTypeError findInstanceisInstanceConstraintshouldPostponeInstanceSearchpostponeInstanceConstraints$fShowYesNoMaybecatchPatternErrTCMaddConstraintTCMwakeConstraintsTCMstealConstraintsTCM newProblem newProblem_whenConstraintswakeConstraints'wakeupConstraintswakeupConstraints_solveAwakeConstraintssolveSomeAwakeConstraintsTCMsolveConstraintTCMsolveConstraint_checkTypeCheckingProblem$fMonadConstraintTCMT PruneResultNothingToPrune PrunedNothingPrunedSomethingPrunedEverythingAnyRigidanyRigidoccurs metaOccursUnfoldStrategy YesUnfoldNoUnfold AllowedVarOccursM OccursCtx OccursExtra occUnfoldoccVarsoccMeta occCxtSizemodifyOccursCheckDefsinitOccursCheckdefNeedsCheckingtallyDef variableCheckdefinitionCheck allowedVarsdefArgsunfoldBunfoldweaklystronglyflexiblypatternViolation' occursCheckmetaOccursQNameprune hasBadRigid isNeutralrigidVarsNotContainedInkillArgs killedTypereallyNotFreeIn performKill$fIsVarSet()-> $fOccurs(,) $fOccursMaybe $fOccurs[] $fOccursDom' $fOccursArg $fOccursAbs $fOccursElim' $fOccursSort'$fOccursType''$fOccursLevelAtom'$fOccursPlusLevel'$fOccursLevel'$fOccursClause $fOccursDefn $fOccursQName $fAnyRigid(,) $fAnyRigid[]$fAnyRigidElim'$fAnyRigidDom' $fAnyRigidArg $fAnyRigidAbs$fAnyRigidLevelAtom'$fAnyRigidPlusLevel'$fAnyRigidLevel'$fAnyRigidSort'$fAnyRigidType''$fAnyRigidTerm $fOccursTerm$fEqPruneResult$fShowPruneResult$fEqUnfoldStrategy$fShowUnfoldStrategy InvertExcept CantInvert NeutralArg ProjectedVarRes SubstCandFVsReduceAndEtaContractreduceAndEtaContract ProjVarExcNoProjectedVarnoProjectedVarfindIdx isBlockedTermisEtaExpandableassignTermTCM'newSortMetaBelowInfnewSortMetaCtx newTypeMeta' newTypeMeta newTypeMeta_ newLevelMetanewInstanceMetaCtxnewValueMetaCtx newValueMeta'newValueMetaCtx' trueConditionnewArgsMetaCtxnewArgsMetaCtx' newRecordMetanewRecordMetaCtxnewQuestionMarknewQuestionMark' blockTermblockTermOnProblemblockTypeOnProblemunblockedTesterpostponeTypeCheckingProblem_postponeTypeCheckingProblemetaExpandListenerswakeupListeneretaExpandMetaTCMetaExpandBlocked assignWrapper assignMeta assignMeta'checkSolutionForMetacheckSubtypeIsEqualsubtypingForSizeLtexpandProjectedVarsetaExpandProjectedVarcheckLinearity inverseSubstopenMetasToPostulatesdependencySortMetas$fMonadMetaSolverTCMT$fNoProjectedVar[]$fNoProjectedVarArg$fNoProjectedVarTerm$fReduceAndEtaContractTerm$fReduceAndEtaContractArg$fReduceAndEtaContract[]HypSizeConstraint 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$fShowSizeMeta$fShowNamedRigid$fEqDefaultToInfty$fOrdDefaultToInfty$fShowDefaultToInftyConj tryConversiontryConversion'sameVars intersectVars equalAtom convErrorassignE compareAsDir compareAs' compareTerm'compareAtomDircomputeElimHeadType compareDomcompareRelevancecompareQuantitycompareCohesion antiUnify antiUnifyArgs antiUnifyTypeantiUnifyElimscompareIrrelevantcompareWithPol polFromCmpcoerce coerceSize equalLevel'forallFaceMapscompareInterval isCanonical leqIntervalleqConjcompareTermOnFace' bothAbsurd ErrorPartStrPartTermPartunquote UnquoteResUnquoteM UnquoteStateDirtyClean agdaTermType agdaTypeType qNameTypeunpackUnquoteM packUnquoteM runUnquoteMliftU1liftU2inOriginalContextisConisDefreduceQuotedTermunquoteNchoice ensureDef ensureConpickName unquoteStringunquoteNString 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 $fEqDirtyUnificationResult'UnifiesNoUnifyUnificationResult unifyIndices$fReduceEquality$fPrettyTCMUnifyState$fReduceUnifyState$fPrettyTCMUnifyStep$fMonoidUnifyOutput$fSemigroupUnifyOutput$fEqRetryNormalised$fShowRetryNormalised$fShowUnifyStep$fShowUnifyState$fShowUnificationResult'$fFunctorUnificationResult'$fFoldableUnificationResult'$fTraversableUnificationResult'checkConfluenceOfRulescheckConfluenceOfClause$fAllHolesLevelAtom'$fAllHolesPlusLevel' $fAllHoles[]$fAllHolesLevel'$fAllHolesSort'$fAllHolesTerm$fAllHolesType'' $fAllHoles[]0 $fAllHolesAbs$fAllHolesAbs0$fAllHolesDom' $fAllHolesArg$fMetasToVars(,,,)$fMetasToVars(,,)$fMetasToVars(,)$fMetasToVarsTele$fMetasToVarsLevelAtom'$fMetasToVarsPlusLevel'$fMetasToVarsLevel'$fMetasToVarsSort'$fMetasToVarsType''$fMetasToVarsTerm$fMetasToVarsAbs$fMetasToVarsElim'$fMetasToVarsDom'$fMetasToVarsArg$fMetasToVars[]$fFunctorOneHoleRelView relViewTel relViewDelta relViewType relViewType' relViewCorerequireOptionRewritingrelViewaddRewriteRulescheckRewriteRule rewriteWith$fPrettyFastCase$fPrettyFastCompiledClauses $fPrettyThunk$fPrettyClosure$fPrettyPointer$fPrettyCatchAllFrame$fPrettyMatchStack$fZipperElimZipper$fPrettyControlFrame $fPrettyAM$fEqElimZipper$fOrdElimZipper$fShowElimZipper$fFunctorElimZipper$fFoldableElimZipper$fTraversableElimZipper$fFunctorThunk$fEqNormalisationcheckIApplyConfluence_checkIApplyConfluence unifyElimsunifyElimsMetageneralizeTelescopegeneralizeTypegeneralizeType' IsPathConsPathCons PointConsCType ClosedTypeLTypeLEl checkDataDef forceSortcheckConstructordefineCompDatadefineProjectionsfreshAbstractQName'_ fromLType lTypeLeveltoLType fromCTypetoCTypedefineTranspOrHCompForFieldsdefineTranspForFieldsdefineHCompForFieldsgetGeneralizedParametersbindGeneralizedParametersbindParameters bindParameterfitsIncheckIndexSorts constructs isCoinductive$fSubstTermLType$fSubstTermCType$fEqIsPathCons$fShowIsPathCons $fEqCType $fShowCType $fEqLType $fShowLType preAction postActionrelevanceAction inferSortreconstructParametersInTypereconstructParametersInTelreconstructParametersInEqViewreconstructParametersdropParameters etaExpandOnce deepEtaExpandetaExpandActionEqualSyequalSyAbsTermabsTerm IsPrefixOf isPrefixOf abstractTypepiAbstractTerm piAbstract abstractTermswap01 $fAbsTerm(,) $fAbsTermAbs$fAbsTermMaybe $fAbsTerm[] $fAbsTermDom' $fAbsTermArg$fAbsTermElim'$fAbsTermLevelAtom'$fAbsTermPlusLevel'$fAbsTermLevel'$fAbsTermSort'$fAbsTermType'' $fAbsTermTerm $fEqualSyArg $fEqualSyDom'$fEqualSyArgInfo $fEqualSyAbs$fEqualSyElim'$fEqualSyType''$fEqualSySort'$fEqualSyLevelAtom'$fEqualSyPlusLevel'$fEqualSyLevel' $fEqualSyTerm $fEqualSy[]$fIsPrefixOfTerm$fIsPrefixOf[]$fIsPrefixOf[]0splitTelForWithwithFunctionType countWithArgs withArgumentsbuildWithFunctionstripWithClausePatternswithDisplayForm patsToElimsResulttermDecl termMutual$fExtractCallsLevelAtom'$fExtractCallsPlusLevel'$fExtractCallsLevel'$fExtractCallsTerm$fExtractCallsType''$fExtractCallsSort'$fExtractCalls(,)$fExtractCalls[]$fExtractCallsElim'$fExtractCallsDom'$fExtractCallsArg$fExtractCallsAbs$fStripAllProjectionsTerm$fStripAllProjections[]$fStripAllProjections[]0$fStripAllProjectionsArgsanityCheckVarssanityCheckSubstparseIdiomBracketsSeqdesugarDoNotationreadline EncodeTCM encodeTCMobj#=@=kindkind'$fToJSONAbsolutePath $fToJSONDoc$fEncodeTCMMaybe$fEncodeTCMDoc$fEncodeTCMValue$fEncodeTCMInt32$fEncodeTCMInt$fEncodeTCMBool $fEncodeTCM[]$fEncodeTCM[]0vimFileescape wordBoundedmatchestoVimgenerateVimFileDotMDotState dsModules dsNameSupply dsConnectionModuleIdinitialDotState addModule addConnectiondottify generateDottoAtomschooseHighlightingMethod usedArgumentsstripUnusedArguments simplifyTTerm $fShowAtom$fEqAtom $fOrdAtomnormalizeNamesdetectIdentityFunctions$fSemigroupIdentityIncomputeErasedConstructorArgs eraseTerms $fEqTypeInfo$fShowTypeInfo BuiltinKitnateliminateLiteralPatterns transformeliminateCaseDefaultstranslateBuiltins closedTerm addCoercions erasedArity callCompiler callCompiler'jsonifyHighlightingInfo$fToJSONTokenBased$fEncodeTCMTokenBasedFullPartialgenerateAndPrintSyntaxInfogenerateTokenInfogenerateTokenInfoFromSourcegenerateTokenInfoFromStringprintSyntaxInfoprintErrorInfoerrorHighlightingwarningHighlightingprintUnsolvedInfocomputeUnsolvedMetaWarningscomputeUnsolvedConstraintsstoreDisambiguatedNamedisambiguateRecordFields LHSResult lhsParameters lhsVarTele lhsPatterns lhsHasAbsurd lhsBodyType lhsPatSubst lhsAsBindingslhsPartialSplitIsFlexiblePatternmaybeFlexiblePatternisFlexiblePatternbindAsPatternscheckLeftHandSidecheckSortOfSplitVar$fIsFlexiblePatternNamed$fIsFlexiblePatternArg$fIsFlexiblePattern[]$fIsFlexiblePatternPattern'$fIsFlexiblePatternPattern'0$fInstantiateFullLHSResultLamOrPiLamNotPiPiNotLamisTypeisType' checkLevelnoFunctionsIntoSize isTypeEqualToleqType_checkGeneralizeTelescopecheckTelescopecheckPiTelescopecheckTelescope'checkTypedBindingsaddTypedPatternscheckTacticAttributeifPath checkPath checkLambdalambdaModalityChecklambdaIrrelevanceChecklambdaQuantityChecklambdaCohesionChecklambdaAddContextinsertHiddenLambdascheckAbsurdLambdacheckExtendedLambda!catchIlltypedPatternBlockedOnMetaexpandModuleAssignscheckRecordExpressioncheckRecordUpdate checkLiteral scopedExprunquoteMcheckQuestionMarkcheckUnderscore checkMeta inferMetacheckOrInferMeta domainFreecheckKnownArgumentscheckKnownArgument checkNamedArg inferExpr'defOrVarcheckDontExpandLastisModuleFreeVarinferExprForWithcheckLetBindingscheckLetBinding $fEqLamOrPi $fShowLamOrPibindPostulatedName bindBuiltinisUntypedBuiltinbindUntypedBuiltinbindBuiltinNoDefbuiltinKindOfName AbstractRHS TopLevelInfo topLevelDecls topLevelScopeTopLevel topLevelPathtopLevelExpectedNametopLevelTheThing OldModuleNameNewModuleQName NewModuleNameAPatNamePatNameOldNameOldQNameNewNameconcreteToAbstract_concreteToAbstractlocalToAbstract$$fToAbstractHoleContent'HoleContent'$fToAbstractPattern'Pattern'$fToAbstractLHSCore'LHSCore' $fToAbstractWithHidingWithHiding"$fToAbstractRewriteEqn'RewriteEqn'#$fToAbstractRewriteEqn'RewriteEqn'0,$fToAbstractFieldAssignment'FieldAssignment'$fToAbstractMaybeMaybe$fToAbstractEitherEither$fToAbstract(,,)(,,)$fToAbstract(,)(,)$fToAbstract()()%$fToAbstractRecordConstructorTypeExpr!$fToAbstractLamBinding'LamBinding$fToAbstractBinder'Binder'$fToAbstractNewNameBindName$fToAbstractNewNameName$fToAbstractPatternPattern'$fToAbstractMaybeOldQNameMaybe$fToAbstractOldQNameExpr$fToAbstractLHSCoreLHSCore'$$fToAbstractResolveQNameResolvedName$fToAbstractPatNameAPatName$fToAbstractOldNameQName$fToQNameQName $fToQNameName#$fToAbstractNewModuleNameModuleName$$fToAbstractNewModuleQNameModuleName$fToAbstractModuleAssignment(,)#$fToAbstractOldModuleNameModuleName$fEnsureNoLetStms[]$fEnsureNoLetStmsArg$fEnsureNoLetStmsNamed$fEnsureNoLetStmsLamBinding'$fEnsureNoLetStmsTypedBinding'$fEnsureNoLetStmsBinder' $fToAbstractTopLevelTopLevelInfo%$fToAbstractTypedBinding'TypedBinding$fToAbstractExprExpr$fToAbstractLetDef[]$fToAbstractLetDefs[]%$fToAbstractGenTelGeneralizeTelescope$fToAbstractGenTelAndType(,)$fLivesInCurrentModuleQName"$fLivesInCurrentModuleAbstractName!$fToAbstractConstrDeclDeclaration&$fToAbstractNiceDeclarationDeclaration$fToAbstractRHS'AbstractRHS$$fToAbstractRightHandSideAbstractRHS$fToAbstractAbstractRHSRHS$fToAbstractLeftHandSideLHS$fToAbstractClauseClause'$fToAbstractPragma[]$fFunctorNewNameCovering covSplitArgcovSplitClauses SplitClauseSClausescTelscPatsscSubst scCheckpointsscTarget splitClausesclauseToSplitClause coverageCheck isCoveredinsertTrailingArgssplitClauseWithAbsurd splitLast splitResult$fPrettyTCMSplitClause$fEqAllowPartialCover$fShowAllowPartialCover$fEqInsertTrailing$fShowInsertTrailing$fMonoidErrorNonEmpty$fSemigroupErrorNonEmptyClsClclPatsclBodyRunRecordPatternTranslationDontRunRecordPatternTranslationcompileClauses'unBruijncompileWithSplitTreecompile nextSplit properSplitisVarsplitOnsplitCexpandCatchAllsensureNPatterns substBody$$fPrecomputeFreeVarsCompiledClauses' $fPrettyCl$fShowCl$fEqRunRecordPatternTranslation checkRecDefaddCompositionForRecorddefineCompKitRdefineTranspOrHCompRcheckRecordProjectionsClausesPostChecksCPCcpcPartialSplitsWithFunctionProblemNoWithFunction WithFunction wfParentNamewfName wfParentType wfParentTel wfBeforeTel wfAfterTelwfExprs wfRHSType wfParentPatswfParentParams wfPermSplit wfPermParent wfPermFinal wfClausescheckMacroTypeisAlias checkAlias checkFunDefSinsertPatternsinsertPatternsLHSCorecheckSystemCoveragecheckClauseLHS checkClausecheckRHS checkWithRHScheckWithFunction checkWhereatClause$fMonoidClausesPostChecks$fSemigroupClausesPostChecks toTreelessclosedTermToTreelessShowHeadshowHeadHighlightModuleContentsDontHightlightModuleContentsDoHighlightModuleContents FinalCheckscheckDeclCached mutualChecksrevisitRecordPatternTranslationcheckUnquoteDeclcheckUnquoteDef unquoteTopinstantiateDefinitionType highlight_checkTermination_checkPositivity_checkCoinductiveRecordscheckInjectivity_checkProjectionLikeness_whenAbstractFreezeMetasAftercheckGeneralize checkAxiom checkAxiom'checkPrimitive checkPragma checkMutualcheckTypeSignaturecheckTypeSignature' checkSectioncheckModuleAritycheckSectionApplication' checkImportdebugPrintDecl$fShowHeadDeclaration$fEqHighlightModuleContentslispifyTokenBasedlispifyHighlightingInfo parseExpr parseExprIngiveExpr redoChecksgiverefine evalInCurrent evalInMeta normalFormcomputeIgnoreAbstractcomputeWrapInput showComputed outputFormIdreifyElimToExprprettyConstraintsgetConstraints namedMetaOfgetConstraintsMentioningstripConstraintPidsgetConstraints' getIPBoundarygetGoals showGoalsgetWarningsAndNonFatalErrorsgetResponseContextgetSolvedInteractionPoints typeOfMetaMI typeOfMeta typeOfMeta'typesOfVisibleMetastypesOfHiddenMetasmetaHelperType contextOfMeta typeInCurrent typeInMetawithInteractionId withMetaId introTactic atTopLevel parseNameisQNamemoduleContentsgetRecordContentsgetModuleContents$fPrettyIPBoundary'"$fToConcreteIPBoundary'IPBoundary'$fReifyIPBoundary'IPBoundary'.$fToConcreteOutputConstraint'OutputConstraint'$fPrettyOutputConstraint',$fToConcreteOutputConstraintOutputConstraint $fToConcreteOutputFormOutputForm$fPrettyOutputConstraint$fPrettyOutputForm!$fReifyConstraintOutputConstraint$fReifyProblemConstraintClosure findMentions ClauseZipper CaseContextparseVariablesgetClauseZipperForIPrecheckAbstractClausemakeCasemakePatternVarsVisiblemakeAbsurdClausemakeAbstractClauseanyEllipsisVar ConversionconvertMOTTOMsConstssMetassEqssCurMeta sMainMetaMapSTModeTMAllHinthintIsConstructor hintQNameinitMapSpopMapStomygetdfvgetMetagetEqscopatternsNotImplementedliteralsNotImplementedhitsNotImplementedtomyIneqfmTypefmExpfmExpsfmLevelicnvh frommyExps abslamvarnamemodifyAbstractExprmodifyAbstractClause constructPats frommyClausecontains_constructornegtypefindClauseDeep matchType$fConversionExceptTExpTerm$fConversionExceptTExpType''$fConversionExceptTAbsAbs$fConversionExceptTMMb$fConversionStateT[]MM$fConversionStateTArg(,)$fConversionStateTTermMM$fConversionStateTType''MM$fConversionStateTArgPat$fConversionStateTClauseMaybe$fConversionStateT[][] $fEqTMode ScopeCheck TypeCheck SourceInfosiSource siFileTypesiModule siModuleName sourceInfoincludeStateChangesmergeInterfaceaddImportedThingsapplyFlagsToMaybeWarnings hasWarningsalreadyVisited typeCheckMain getInterface getInterface_ getInterface'checkOptionsCompatibleisCachedgetStoredInterface typeCheckchaseMsghighlightFromInterface readInterfacereadInterface'writeInterfaceremovePrivatesconcreteOptionsToOptionPragmascreateInterfacegetUniqueMetasRangesgetUnsolvedMetasgetAllUnsolvedgetAllWarningsgetAllWarnings'getMaybeWarnings'getAllWarningsOfTCErrconstructIScopebuildInterfacegetInterfaceFileHashesgetInterfaceFileHashes' moduleHash isNewerThan$fNullMaybeWarnings'$fShowMaybeWarnings'$fFunctorMaybeWarnings'$fFoldableMaybeWarnings'$fTraversableMaybeWarnings'$fEqMainInterface$fShowMainInterface$fEqMode $fShowModeExitCodeContinue ContinueInReturn matchCommand interaction continueAfterwithCurrentFileloadFileshowConstraints showMetas showScope metaParseExpr actOnMetagiveMeta refineMetaretryConstraintsevalInevalTermtypeOftypeIn showContext splashScreenhelp AutoResult autoProgress autoMessage AutoProgress Solutions FunClauses RefinementautoIsMainNotMain doCompile setInterfacecurIFcurSigcurMNamecurDefssortDefssigMName compileDirrepl inCompilerEnv$fMonoidIsMain$fSemigroupIsMain $fEqIsMain $fShowIsMainKindOfForeignCodeForeignFileHeaderPragma ForeignImport ForeignOther HaskellPragmaHsDefnHsTypeHsDataHsExport HaskellType HaskellCode parsePragmaparseHaskellPragmagetHaskellPragmasanityCheckPragmagetHaskellConstructorforeignHaskellclassifyForeignclassifyPragmapartitionByKindOfForeignCode$fPrettyHaskellPragma$fHasRangeHaskellPragma$fShowHaskellPragma$fEqHaskellPragmacurHsModihnameunqhnametlmodOfxqualxhqnhsNameconhqnbltQualdnamedunamehsPrimOp hsPrimOpApphsInt hsTypedInt hsTypedDoublehsLethsVarUQ 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 RecompileBackend' backendNamebackendVersionoptionscommandLineFlags isEnabled preCompile postCompile preModule postModule compileDefscopeCheckingSuffices mayEraseType callBackend activeBackendparseBackendOptionsbackendInteraction generateLaTeX $fEqDebug $fShowDebug $fShowOutput$fShowAlignmentColumn $fShowKind GiveRefineGiveRefineIntro ElaborateGivelocalStateCommandMliftLocalStaterevLift revLiftTC commandMToIO liftCommandMTliftCommandMTLocalStatemodifyTheInteractionPointsmodifyOldInteractionScopesinsertOldInteractionScoperemoveOldInteractionScopegetOldInteractionScopehandleCommand_ handleCommandrunInteraction maybeAbortinitialiseCommandQueue independentupdateInteractionPointsAfter interpretsolveInstantiatedGoals cmd_load'give_gen highlightExprsortInteractionPointscmd_goal_type_context_andshowModuleContents searchAboutsetCommandLineOptsstatus displayStatus display_infoparseAndDoAtToplevel maybeTimedtellToUpdateHighlightingtellEmacsToJumpToError$fEqGiveRefine$fShowGiveRefine mimicGHCi showInfoErrorexplainWhyInScopeprettyTypeOfMetajsonREPL$fEncodeTCMResponse$fEncodeTCMGoalTypeAux$fEncodeTCMDisplayInfo$fEncodeTCMOutputForm$fToJSONComputeMode$fEncodeTCMComputeMode$fToJSONCPUTime$fEncodeTCMCPUTime$fToJSONRewrite$fEncodeTCMRewrite$fToJSONMakeCaseVariant$fEncodeTCMMakeCaseVariant$fToJSONGiveResult$fEncodeTCMGiveResult$fToJSONInteractionId$fEncodeTCMInteractionId$fToJSONProblemId$fEncodeTCMProblemId$fToJSONRange'$fEncodeTCMRange'$fToJSONPosition'$fEncodeTCMPosition'$fEncodeTCMResponseContextEntry$fToJSONCommandState$fEncodeTCMCommandState$fToJSONStatus$fEncodeTCMStatus$fToJSONNameInScope$fEncodeTCMNameInScopedefaultCSSFile generateHTMLgenerateHTMLWithPageGen generatePagepage tokenStream CCContext NameSupplyCCEnv _ccNameSupply _ccContext GHCModuleEnv GHCOptions optGhcCompile optGhcCallGhc optGhcFlags ghcBackend ghcBackend'defaultGHCOptionsghcCommandLineFlags ghcPreCompileghcPostCompile ghcPreModule ghcPostModule ghcCompileDefghcMayEraseTypeimports definitionconstructorCoverageCode ccNameSupply ccContext initCCEnv freshNamesintroscheckConstructorType checkCovermkIfterm noApplicationhsCoerce compilePrimalthslitlitqname litqnamepatcondeclcompiledcondeclcompiledTypeSynonymtvaldeclinfodeclcopyRTEModules 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 primitivesrunAgdarunAgda'defaultInteractionrunAgdaWithOptions printUsage backendUsage printVersion optionErrorrunTCMPrettyErrorsmainghc-prim GHC.TypesBoolinteger-wired-inGHC.Integer.TypeGHC.Num+FunctorGHC.IO.ExceptionGHC.IOcatch GHC.IORefIORef Data.IORefatomicWriteIORefatomicModifyIORef modifyIORef' modifyIORef mkWeakIORefatomicModifyIORef' writeIORef readIORefnewIORefBelowAboveData.Map.InternalmapKeysTrue GHC.MaybeControl.Monad.Reader.Class MonadReader Applicative Data.FoldableFoldableOrdering GHC.ClassesOrdGHC.ShowShowshowEqFilePathdirectory-1.3.6.0System.DirectorycanonicalizePath doesFileExist text-1.2.4.1Data.Text.Internal.LazyTextFalseinitlast==. Data.OldListsortBycomparegroupByelemzipWith System.IOputStrLneitherEitherLeftRight dropWhilemax<=GHC.EnummaxBoundfmapfoldr1orall&&anymapMmemptyMonoidgeniplate-mirror-0.7.7-caad84bf57899c0e1dca2ecca7f4009ee67cab84e66c746b62e5d13f22d2b38aData.Generics.GeniplateinstanceUniverseBiT universeBiinstanceTransformBiMT transformBiMlengthmappendHappyStkData.IntMap.Internal getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNamefindAgdaLibFilesfindLibControl.Monad.State.Class MonadStateControl.Monad.Trans.State.LazyStateTControl.Monad.Trans.ReaderReaderThashtables-1.2.4.1-576ae6e62078ea39c31ee4a6fed668fed9cb0257a5cc241e02a423e379599ff6Data.HashTable.IOCuckooHashTableBasicHashTableLinearHashTable Text.ReadreadszipWithMData.Sequence.InternalvarTel UnifyState:>>:aeson-1.5.5.1-0358151cfa59b6bdaa5cc061ba2c11e42f7ad19a640ebb6ef9d7f5e4f26d0881Data.Aeson.Types.Internal fixTargetType&inferOrCheckProjAppToKnownPrincipalArgcheckConstructorApplication compilerMainControl.Monad.Trans.ClassControl.Monad.IO.ClassliftIO