Changeset 21838 in project for gazette


Ignore:
Timestamp:
12/07/10 04:26:27 (9 years ago)
Author:
syn
Message:

gazette #15: fix a few typos (thanks florz), add chicken talk and update contribution note

File:
1 edited

Legend:

Unmodified
Added
Removed
  • gazette/src/issues/15.wiki

    r21835 r21838  
    99== 1. The Hatching Farm
    1010
    11 * In his ever lasting quest to provide the best documentation tooling
     11* In his everlasting quest to provide the best documentation tooling
    1212  of all, [[user:jim-ursetto|Jim Ursetto]] created yet another
    1313  [[egg:chicken-doc|chicken-doc]] spin-off. Luckily it is not called
     
    2828  the handy [[egg:progress-indicators|progress-indicators]] extension.
    2929 
    30 * Lastly, our ever daring [[user:peter-bex|Peter Bex]] wrestled with
    31   the [[egg:openssl|openssl]] once again. The new release 1.5 should
     30* Lastly, our daring [[user:peter-bex|Peter Bex]] wrestled with
     31  [[egg:openssl|openssl]] once again. The new release 1.5 should
    3232  hopefully fix the remaining issues we had with the
    3333  [[http://wiki.call-cc.org/|Chicken Wiki]].
     
    5454== 3. Chicken Talk
    5555
    56 A lot!
     56Readers of [[/issues/11.html|issue 11]] may remember the
     57[[http://www.call-cc.org/pictures/t-dose2010/index.html|T-DOSE picture gallery]]. Be
     58informed that it now contains a few additional pictures, some of which
     59are quite okay!
     60
     61The chicken-users list was dominated by [[user:alyn.post|Alan Post]]'s
     62ongoing effort to create a Lojban parser this week, spanning across
     63two threads. In the first of them he
     64[[http://www.mail-archive.com/chicken-users@nongnu.org/msg12661.html|details his progress on optimizing the code's compilation]]
     65while in the second
     66[[http://www.mail-archive.com/chicken-users@nongnu.org/msg12705.html|he reports on problems he encountered when running it for the first time]]. As
     67it turned out, they were caused by using {{equal?}} on a list
     68containing circular data resulting in an endless recursion and finally
     69in a stack overflow. A change request is imminent to ameliorate this
     70situation.
     71
     72Christian Kellermann kindly announced the all new
     73[[http://www.mail-archive.com/chicken-users@nongnu.org/msg12711.html|Gazette authorship organisation scheme]]. Check
     74it out if you are interested in contributing or helping with a future
     75Gazette issue!
    5776
    5877== 4. Omelette Recipes
     
    7089
    7190But first, let's look at what {{amb}} does (and a little about how it
    72 works). Basically, {{amb}} is a form (it can be a macro oor a
     91works). Basically, {{amb}} is a form (it can be a macro or a
    7392procedure, and the difference in effect is immaterial for our purposes
    7493in this recipe) that has a variable number of arguments and, in
     
    7897do not provide any kind of pre-emption; each "thread" runs until it
    7998terminates, then lets another run), but to explore different possible
    80 control flows. As such, there is a {{amb-assert}} form that, if its
     99control flows. As such, there is an {{amb-assert}} form that, if its
    81100argument is #f, kills the current "thread" and runs another.
    82101
    83102So every time your program performs an {{amb}}, multiple threads pop
    84 into existance; and whenever it performs an {{amb-assert}}, some threads
     103into existence; and whenever it performs an {{amb-assert}}, some threads
    85104are culled. The principle is, whenever you have a point in your
    86105program where a choice must be made, you can use {{amb}} to have the
     
    102121possibilities (potentially infinite!), with solutions dotted around
    103122the tree; and our goal is to find perhaps all the solutions, perhaps
    104 just any solution, or perhaps the solution nearest the root of the
     123just any solution, or perhaps the solution nearest to the root of the
    105124tree. Practical examples include finding a record in a B-Tree (where
    106125the tree structure actually corresponds to physical index blocks on
     
    118137one in the tree and recursively call the function on each in
    119138turn. This forces a "depth-first" search, as the recursion will only
    120 botton out if a solution is found (that terminates the search
     139bottom out if a solution is found (that terminates the search
    121140entirely) or a subtree is totally exhausted of options. Going for a
    122141"breadth-first" search, where every child of the current position is
     
    446465[[http://gazette.call-cc.org]] or you can follow it in your feed
    447466reader at [[http://gazette.call-cc.org/feed.atom]]. If you'd like to
    448 write an issue,
    449 [[http://bugs.call-cc.org/browser/gazette/README.txt|check out the instructions]]
    450 and come and find us in #chicken on Freenode!
     467write an issue, [[http://wiki.call-cc.org/gazette|consult the wiki]]
     468for the schedule and instructions!
Note: See TracChangeset for help on using the changeset viewer.