Received: from mx0.gmx.net (mx0.gmx.net [213.165.64.100]) by h1439878.stratoserver.net (8.14.2/8.14.2/Debian-2build1) with SMTP id p9JGKSpI024232 for ; Wed, 19 Oct 2011 18:20:29 +0200 Received: (qmail 16868 invoked by alias); 19 Oct 2011 16:20:23 -0000 Delivered-To: GMX delivery to rainer.schoepf@gmx.net Received: (qmail invoked by alias); 19 Oct 2011 16:20:22 -0000 Received: from relay2.uni-heidelberg.de (EHLO relay2.uni-heidelberg.de) [129.206.210.211] by mx0.gmx.net (mx016) with SMTP; 19 Oct 2011 18:20:22 +0200 Received: from listserv.uni-heidelberg.de (listserv.uni-heidelberg.de [129.206.100.94]) by relay2.uni-heidelberg.de (8.13.8/8.13.8) with ESMTP id p9JGHClj010008 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 19 Oct 2011 18:17:13 +0200 Received: from listserv.uni-heidelberg.de (localhost.localdomain [127.0.0.1]) by listserv.uni-heidelberg.de (8.13.1/8.13.1) with ESMTP id p9JDKlOE018922; Wed, 19 Oct 2011 18:17:11 +0200 Received: by LISTSERV.UNI-HEIDELBERG.DE (LISTSERV-TCP/IP release 16.0) with spool id 1862515 for LATEX-L@LISTSERV.UNI-HEIDELBERG.DE; Wed, 19 Oct 2011 18:17:11 +0200 Received: from relay2.uni-heidelberg.de (relay2.uni-heidelberg.de [129.206.210.211]) by listserv.uni-heidelberg.de (8.13.1/8.13.1) with ESMTP id p9JGHBhP020221 for ; Wed, 19 Oct 2011 18:17:11 +0200 Received: from mail-yw0-f49.google.com (mail-yw0-f49.google.com [209.85.213.49]) by relay2.uni-heidelberg.de (8.13.8/8.13.8) with ESMTP id p9JGGw4W009844 (version=TLSv1/SSLv3 cipher=RC4-SHA bits=128 verify=FAIL) for ; Wed, 19 Oct 2011 18:17:03 +0200 Received: by ywe9 with SMTP id 9so2612691ywe.22 for ; Wed, 19 Oct 2011 09:16:58 -0700 (PDT) MIME-Version: 1.0 Received: by 10.223.57.139 with SMTP id c11mr11934172fah.24.1319041017952; Wed, 19 Oct 2011 09:16:57 -0700 (PDT) Received: by 10.152.4.193 with HTTP; Wed, 19 Oct 2011 09:16:56 -0700 (PDT) References: <4E95A9C2.6020607@residenset.net> <4E95C086.7060806@morningstar2.co.uk> <4E96F7BF.9070700@residenset.net> <4E9EA1CF.4040807@residenset.net> Content-Type: text/plain; charset=ISO-8859-1 X-Spam-Whitelist: Message-ID: Date: Wed, 19 Oct 2011 12:16:56 -0400 Reply-To: Mailing list for the LaTeX3 project Sender: Mailing list for the LaTeX3 project From: Bruno Le Floch Subject: Re: Church booleans To: LATEX-L@listserv.uni-heidelberg.de In-Reply-To: <4E9EA1CF.4040807@residenset.net> Precedence: list List-Help: , List-Unsubscribe: List-Subscribe: List-Owner: List-Archive: X-GMX-Antispam: 0 (BackTrace mail analyze); Detail=5D7Q89H36p4L00VTXC6D4q0N+AH0PUCnGL2vqOgpaBYL16oitsMrgDt/NQNpSCZFFjDOy 97xb7Zpf+wZnd5ZXNcvLDXR3Wg3wRjdQbwEMh8=V1; X-Resent-By: Forwarder X-Resent-For: rainer.schoepf@gmx.net X-Resent-To: rainer@rainer-schoepf.de Status: R X-Status: X-Keywords: X-UID: 6952 > A better formatting would be > > \bool_if:nTF { > \bool_pred:n{\l_my_first_bool} && ( > \bool_pred:n{\l_my_second_bool} && > ! \bool_pred:n{\l_my_third_bool} > ) > } Still unreadable in my view, because the \bool_pred:n add no information, and are just there to make TeX happy. Since we can avoid them altogether, let's do it. \bool_if:nTF { \l_my_first_bool && ( \l_my_second_bool && ! \l_my_third_bool ) } > :) But maybe the problem is that &&, (, ), !, and || do not really stand out > from the background of braces and backslashes (far less than against the > background of alphanumeric identifiers you'd encounter in C)? Fortanish > .AND., .OR., and .NOT. would be more eye-catching, but the parentheses are > probably a lost cause readability-wise. I find && and || to be more visible than AND and OR in fact (probably a matter of syntax highlighting in the editor). > Well, it depends on the parsing scheme one uses. If instead going for > delimited-argument style subformula grabbing, then it wouldn't matter how > many tokens an expression terminal (predicate) consists of, and as a > side-effect operation priority becomes straightforward (the operation you > split at first gets the lowest priority). What would be tricky for this > approach is the handling of parentheses, since in that case there are two > distinct possibilities for "the next token of interest here", but I think it > is doable (first split on one, then try to split on the second, and treat > the combination of the outcomes as a case). The other problem with this approach is that my working copy with Church booleans is now catcode agnostic, while delimited arguments would require one particular catcode. You are right on the other arguments for that approach. > I believe one could preferably structure the whole thing as an expand-only > rewrite of infix boolean expression to Church-style compositions of > booleans. It probably wouldn't be good at catching certain syntax errors, > though. That's a pretty big change. I need some time to ponder it. (And in any case, changes won't happen before a few weeks from now.) > Consider a command whose role is similar to that of the 2e \makelabel: A > user-definable command which gets its argument(s) from more basic levels of > LaTeX, and is supposed to do something in a configurable way. ((In the > future all such commands should be template keys, you say? Why, yes, it may > well be. Template instances will often be defined with \ExplSyntaxOff, I > think.)) Suppose further that one of these arguments is a boolean. ((Poor > design? Well, such things will happen; it's an open system.)) Now, if said > boolean is a Church boolean (effectively \use_i:nn or \use_ii:nn), then it > can be used directly to select between two pieces of code, e.g. like > > \def\makesomething#1#2{% Assuming \ExplSyntaxOff > % #1 is some text > % #2 is the boolean > #1% > #2{ \thetheorem}{}% > .\ % > } What about \let \ifthenelse \bool_if:nTF ? That doesn't assume anything about the internals, and allows precisely what you describe (and is slightly more general, since the user can now use boolean expressions). > Here, \makesomething{Theorem}{\use_i:nn} will produce e.g. "Theorem 3.4. ", > whereas \makesomething{Theorem}{\use_ii:nn} produces "Theorem. " > > Yes, templates tend to handle these situations by having two separate keys > for the two cases. No, I don't think that package authors will therefore > never decide to pass booleans to these kinds of commands. I still haven't caught up on the whole template business, so I can't follow you there yet. Does giving a user level alias for \bool_if:nTF solve that problem? Another relevan function (which I discovered when changing the implementation) is \bool_set:Nn. >> If the issue is with >> preserving spaces, then \ExplNames(On|Off) is also provided, > > No, and using that adds even further complications. You have a point, both for \ExplSyntaxOn and \ExplNamesOn. >> and (infix) boolean expressions work there as well. > > Within \ExplNamesOn, you mean? Making sure that *all* stray spaces are > *always* gobbled could be difficult to prove, but I can see that there at > least is a fair chance of this happening (thanks to undelimited macro > arguments skipping spaces). With the current approach, it is clear: everything is either grabbed as an undelimited argument, or expanded with \number, except when we skip the end of a parenthesis group, in which case the delimited argument is meant to be dropped eventually. So no stray space remains. >> We could provide \bool_and:nn etc. (or some variation thereof). One >> problem is where to stop: here you've used the three argument variant >> \add:nnn, but we should then provide a four argument variant, etc. > > Even if you include everything up to the nine argument forms, you'll end up > with fewer macros in total than for the alternative. ;-) True with the current code, I think, but my new code doesn't need two separate branches, so that statement becomes false :). Then it _is_ true that 18 cs is not that much. However, \bool_if:nTF { \bool_and:nnnnnnn % n? \l_i_bool \l_ii_bool \l_iii_bool \l_iv_bool \l_v_bool \l_vi_bool \l_vii_bool \l_viii_bool } is not exactly obvious to update if a boolean is added. The && version is simple: add "&& \l_last_bool". > A couple of years ago, the Tcl community faced a similar situation: > Arithmetic had always been expressed in an infix fashion (using the [expr] > command, which is very similar semantically to these \XX_eval:n), even > though the language as such is strongly prefix in nature. Proposals were > made to add prefix arithmetic commands as a supplement. Some argued against, > mostly on aestethic grounds ("ugly", "unreadable", "adds nothing new", > etc.), but in the end the prefix forms were added. In the years since, they > have proven to be quite useful at times, even though hardly anyone uses them > exclusively. My position is that infix notation should definitely remain. Adding prefix notation may make sense, perhaps. > Well, count this as brainstorming. It occurred to me that in the vast > majority of cases, it wouldn't matter to me whether I got > \YesValue{} or simply . Thanks a lot for proposing ideas. It helps clarify what is needed, and how to improve things. Regards, Bruno