#
f969d86b |
|
05-Oct-2017 |
Andreas Lööw <AndreasLoow@users.noreply.github.com> |
Various doc fixes
|
#
32bf1e49 |
|
02-Feb-2015 |
Piotr Trojanek <piotr.trojanek@gmail.com> |
extra semicolons removed from (some) .sig files
|
#
d92257e5 |
|
31-Oct-2014 |
Piotr Trojanek <piotr.trojanek@gmail.com> |
Prim_rec: whitespace cleanup in both .sig and .doc
|
#
8f169224 |
|
17-Aug-2014 |
Michael Norrish <michael.norrish@nicta.com.au> |
New prove_case_eq_thm entrypoint for Prim_rec
|
#
214d72b4 |
|
07-Aug-2014 |
Michael Norrish <michael.norrish@nicta.com.au> |
Implement function to prove a case-constant elimination rewrite
|
#
9d480c01 |
|
07-Aug-2014 |
Michael Norrish <michael.norrish@nicta.com.au> |
Implement and document a new prove_case_rand_thm function in Prim_rec. This will be the basis for a general tool that moves case-constants up within a term and then eliminates them, subsuming, for example, the functionality in boolSimps.COND_elim_ss, which does this but only for the boolean case-constant (aka if-then-else).
|
#
9fd06068 |
|
09-Dec-2012 |
Michael Norrish <michael.norrish@nicta.com.au> |
Clean up code that relies on constant and theorem names for case constants. Rather than code having to know that the constant is called “type_CASE” and that its definition is stored in “type_case_def”, use ML entrypoints in Prim_rec to abstract these details. This is progress with github issue #97.
|
#
1bc9f344 |
|
13-Jan-2011 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Change src/bool to src/1 as a prelude to experimentation!
|