c3cb8a4Correct module namesBenjamin Saunders
2308c53More optimization-friendly intToBitsBenjamin Saunders
88eb2bfC codegen for bitmanip and bit comparatorsErkin Batu Altunbaş
ebacfeeEquality result typeBenjamin Saunders
df10078Complement primitive for bit typesBenjamin Saunders
12615d4Swapped bitsEq Either ordering to be in the spirit of Right=successBenjamin Saunders
c3f27f7Safe bitsEqBenjamin Saunders
927fd18Machine integer comparison primitives and a proofy interface to the equality caseBenjamin Saunders
0b96076Cast instances for Mod2 <=> Bits and Int => BitsBenjamin Saunders
ef96397Replace general modulo type with modulo 2^n typeBenjamin Saunders
1006d3aCorrect behavior of operations on non-native bit widthsBenjamin Saunders
5a26a74Show instance for ModuloBenjamin Saunders
279b02dAccess qualifiers for ModuloBenjamin Saunders
8252b94Strongly-typed bitsBenjamin Saunders
001469dCast Int (Bits n) instanceBenjamin Saunders
8216c7fBasic bit-twiddling primitivesBenjamin Saunders
348cf91String primitivesBenjamin Saunders
0045b68Resolve implicit definition warnings relating to bitstringsBenjamin Saunders
5734ddfBeginnings of generic machine integer supportBenjamin Saunders
e2807a1Verified numbersBenjamin Saunders
b3ba46ePrimitives for interconversion of Bits32 and IntBenjamin Saunders
103d65eflooring log2 for NatsBenjamin Saunders
7518b0cAbsolutely untested implementations of a few bitstring primitives.Irene Knapp
b896224Primitive types for groups of 8, 16, 32, and 64 bits, and basic arithmetic and mutual conversion operations on themBenjamin Saunders
bfd5b51Make sure names are not defined more than once Fixes issue #124Edwin Brady
496cf41Abstract from everything to make 'with' more magicEdwin Brady
8d83f38Abstract matched terms from goal type in with clauses (like 'magic with' in Agda)Edwin Brady
11dbfc0Correct totality check of f=f, and add regression testEdwin Brady
bc3e807Merge pull request #136 from DanielWaterworth/useful_functionsEdwin Brady
28b68fdMerge pull request #135 from DanielWaterworth/masterEdwin Brady
449e292Tweak totality checkerEdwin Brady
906862aFix traversal of size change graphs Fixes issue #134 - new regression test addedEdwin Brady
8d090c0A couple of small improvements to termination checking * inlining to help out * %assert_total doesn't allow inlining so as not to break totality for functions which rely on the asserted function * bug fix for mutual recursion - build size graphs before doing any totality checkingEdwin Brady
d087deaAdded a function, 'range', that returns all of the elements of a finite set, in order, in a vectorDaniel Waterworth
34392c9Added a function, 'last', that returns the last element in a finite setDaniel Waterworth
f383b59Added zip and unzip definitions for VectDaniel Waterworth
bf1c22eMake traverse_ totalEdwin Brady
0a70480Merge branch 'type' of https://github.com/raichoo/Idris-dev into raichoo-typeEdwin Brady
7ef4be9Mark traverse_ partialEdwin Brady
5eac0eeMerge pull request #128 from startling/record-docEdwin Brady
2b30118Merge pull request #130 from startling/alternativeEdwin Brady
b88e7f2Merge pull request #133 from ozgurakgun/fix-linesEdwin Brady
dd5001fmake TT aware of Set -> Typeraichoo
6f1f358lines isn't wordsOzgur Akgun
811a3cdRewrote 'mapM' and 'mapM_' as 'traverse' and 'traverse_'.startling
e75227bWe no longer need MonadPlus, now that we've got Alternative.startling
583c726infixl declaration for (<|>).startling
bdef7ec'sequence' and 'sequence_' don't need Monad, either.startling
112f92aDefined (<$) and ($>), analogous to Haskell's (<*) and (*>)startling
4f93ab6You know, 'when' doesn't need Monad either.startling
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list