on 55ec9cb help sign in
12 files
../ CaseTree.hsNew size change graph builder Looks at patterns, rather than case tree, and therefore finds it easier to spot structurally smaller arguments which are more complex. Constraints.hsDocumentation comment additions CoreParser.hsParse empty comments Elaborate.hsAdded 'mrefine' tactic Like refine, but uses matching instead of unification to resolve implicit arguments. All will become clear, I hope :). This is intended for an additional style of pattern matching (on types) for better explanation of proofs. Evaluate.hsFix Haddock parser error Execute.hsExtract getOp to top level defn ProofShell.hsRemove the unused arg from lookup functions ProofState.hsAdded 'mrefine' tactic Like refine, but uses matching instead of unification to resolve implicit arguments. All will become clear, I hope :). This is intended for an additional style of pattern matching (on types) for better explanation of proofs. ShellParser.hsFiddle with elaborator; update interp sample and test TT.hsImplement 'pretty' for B{8,16,32,64} Typecheck.hsCheck that explicitly given implicit args unify with inferred versions Also exposed a unification bug which unified things which shouldn't be: f x = f y does not imply x = y unless f is injective, and this was not properly checked. Unify.hsAdded 'mrefine' tactic Like refine, but uses matching instead of unification to resolve implicit arguments. All will become clear, I hope :). This is intended for an additional style of pattern matching (on types) for better explanation of proofs.