| #
55cb5e0c |
|
29-Jul-2016 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Fix unification theories in light of pat_assum rename
|
| #
190ccd60 |
|
02-Feb-2016 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
F.o. unification uses U+275C (❜) for subst_APPLY
Previously it used '' (double ASCII apostrophe) and this clashed with a
use in wordsTheory (which had it at a different fixity).
|
| #
a574fc44 |
|
10-Apr-2014 |
Michael Norrish <michael.norrish@nicta.com.au> |
Rename implicational theorems in relation to make room for equivalences
This affects TC_CASES1 and TC_CASES2 that were hardly ever being used.
See the release notes change for more discussion.
|
| #
979bf337 |
|
06-May-2013 |
Ramana Kumar <ramana.kumar@gmail.com> |
avoid infix clash at 750 in examples/unification
(Commit eadd8e1 introduced a constant at Infixr 750.)
|
| #
a2328149 |
|
23-Sep-2011 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
Adopt ML-style syntax for case expressions and use freed up "||" for bitwise-or. See issue #24.
|
| #
c26105ad |
|
14-Apr-2011 |
Ramana Kumar <ramana.kumar@gmail.com> |
New examples: unification algorithms in accumulator-passing style
|