Thank you, this was perfect!
> On Aug 8, 2018, at 2:31 AM, Heiko Becker wrote:
>
> Hello Dylan,
>
> There are two ways (I know of) to easily work on subgoals:
>
> 1) You use the >- symbol and not \\ or THEN as it only applies to the first
> subgoal
>
> 2) You use THENL an give it a list of t
Hi,
Great!. This really helps alot...:) However, I may be interested in
defining it for [image: \forall P] so that I don't need to instantiate
every time with a specific instance of P. I tried this by myself but every
time I lost in connecting my definition in llist form to its corresponding
opti
The function is already ready for use with any P; the final until_thm looks like
val until_thm =
⊢ (until P [||] = [||]) ∧
(until P (h:::t) = if P h then [|h|] else h:::until P t): thm
meaning that one can write things like
until (\x. x MOD 3 = 0) ll
for example. This seems like a su
++
The Logic and Computation Group at the Research School of Computer
Science, The Australian National University has a number of PhD
scholarship available for bright, enthusiastic doctoral students in
the following subjects:
- Logic and
