*To*: Lars Noschinski <noschinl at in.tum.de>*Subject*: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]*From*: Makarius <makarius at sketis.net>*Date*: Fri, 23 Nov 2012 16:27:41 +0100 (CET)*Cc*: cl-isabelle-users at lists.cam.ac.uk*In-reply-to*: <50AE690A.80005@in.tum.de>*References*: <50916DB3.4030707@cs.bham.ac.uk> <B342CF2B-EEC3-4932-A98D-193702F57A14@cam.ac.uk> <5091CE53.6020006@cs.bham.ac.uk> <C76381F2-5127-48DF-B198-DE2B3AABEAB1@cam.ac.uk> <50AE3314.8060002@cs.bham.ac.uk> <alpine.LNX.2.00.1211221732160.24280@macbroy21.informatik.tu-muenchen.de> <50AE5C0F.3080802@in.tum.de> <50AE63B1.4080702@informatik.tu-muenchen.de> <50AE690A.80005@in.tum.de>*User-agent*: Alpine 2.00 (LNX 1167 2008-08-23)

On Thu, 22 Nov 2012, Lars Noschinski wrote:

On 22.11.2012 18:41, Florian Haftmann wrote:(In contrast HOL --> and ! are old-fashioned/cumbersome, where Pure ==> and !! would do the job better.)Is there actually a drawback when using == instead of = or is it a mere matter of style? I like using Pure equality because it saves me a level of parentheses when I have a binder on the right hand side.It is simpler: a) Uniformity b) Less symbolsOk, these are stylistic reasons and both only hold when always using =,and not <-> (<-> can be used for all of definition, primrec, fun(ction),but only for boolean valued functions. And I don't like it fordefinitions anyway ;)).

Makarius

**References**:**[isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Christoph LANGE

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Lawrence Paulson

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Christoph LANGE

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Makarius

*From:*Lars Noschinski

*From:*Florian Haftmann

*From:*Lars Noschinski

- Previous by Date: Re: [isabelle] Length of Proofs
- Next by Date: [isabelle] Postdoc position at UIUC in programming languages
- Previous by Thread: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Next by Thread: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Cl-isabelle-users November 2012 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