*To*: Lucas Cavalcante <lu_cavalcante_ at hotmail.com>*Subject*: Re: [isabelle] How to fix it?*From*: Tobias Nipkow <nipkow at in.tum.de>*Date*: Sun, 03 Jun 2007 12:23:09 +0200*Cc*: cl-isabelle-users at lists.cam.ac.uk*In-reply-to*: <BAY126-W145167151D4208217BF2E8D2230@phx.gbl>*References*: <BAY126-W145167151D4208217BF2E8D2230@phx.gbl>*User-agent*: Thunderbird 2.0.0.0 (Macintosh/20070326)

In your two examples you need to relace ~X by (~X). Tobias Lucas Cavalcante schrieb:

I'd like to provetheorem negeq: "EX xs. ((neg_eq Formula) = ~xs (*here*) | (neq_eq Formula) = xs)" Applying induction over Formula, but Isar says "Inner lexical error at: = ~xs". Just as happen at neg_eq's recursive funcion definition: consts neg_eq :: "sbf => sbf"primrec"neg_eq P = P" (*here*)"neg_eq ~P = ~P" "neg_eq ~~P = neg_eq P" Isar says "Inner lexical error at: = P".How to fix it?Regards,LucasPS.: THIS MENSAGE: (http://paste.ubuntubrasil.org/4300), THE THEORY: (http://paste.ubuntubrasil.org/4299). _________________________________________________________________ Veja só alguns dos novos serviços online no Windows Live Ideas — são tão novos que ainda não foram disponibilizados oficialmente. http://ideas.live.com

**References**:**[isabelle] How to fix it?***From:*Lucas Cavalcante

- Previous by Date: Re: [isabelle] How to fix it?
- Next by Date: Re: [isabelle] How to fix it?
- Previous by Thread: Re: [isabelle] How to fix it?
- Next by Thread: Re: [isabelle] How to fix it?
- Cl-isabelle-users June 2007 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list