Hi, To clarify my (rough) idea: no indentation processing in brackets, but special syntax processing.
If I understand sweet correctly, wisp ( a : b : c ) should be same as sweet ( a $ b $ c ) but very different from sweet ( a \\ b \\ c ) Best wishes, Arne Am Sonntag, 21. April 2013, 09:39:04 schrieb Arne Babenhauserheide: > Hi, > > I’m currently writing real code with wisp, and while thinking about ways to > make non-tail-call functions as elegant as tail-called ones, I found a form > which should work with sweet, too: > > let : : origfile ( open-file : nth 1 : command-line ) "r" > > Essentially that’s the realization, that brackets are much less visually > jarring, if they are (a) used sparingly and (b) are used to actually > structure the code without taking over the code. > > The requirement for that it to keep limited non-indetation syntax active > inside brackets (what wisp currently does not do). Essentially it means > providing the optimizations for whitespace sensitive syntax also for code in > brackets. > > For sweet, that could mean > > a ( b c \\ d e \\ f g ) h > > compare the lisp > > (a (b c) (d c) (f g) h) > > that way, the brackets become a way to structure the code. > > Best wishes, > Arne > -- Konstruktive Kritik: - http://draketo.de/licht/krude-ideen/konstruktive-kritik
signature.asc
Description: This is a digitally signed message part.
------------------------------------------------------------------------------ Precog is a next-generation analytics platform capable of advanced analytics on semi-structured data. The platform includes APIs for building apps and a phenomenal toolset for data science. Developers can use our toolset for easy data analysis & visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter
_______________________________________________ Readable-discuss mailing list Readable-discuss@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/readable-discuss
