Gambit-list Janvier 2012

gambit-list@iro.umontreal.ca

27 participants
25 discussions

Question on "buffering:" option for vector-port
by Meng Zhang 24 Jan '12

24 Jan '12

I expect the reading option may block the thread with "buffering: #f". For example: (let ((chan (open-vector '(buffering: #f)))) (thread-start! (make-thread (lambda () (write "Value" chan) (pp "Write done")))) (thread-start! (make-thread (lambda () (thread-sleep! 1) (pp "Start reading") (pp (read chan))))) (thread-sleep! 5)) My expectation: Outputs: "Start reading" "Write done" or "Value", in any order. Result for 4.6.3, osx 10.6.7: Outputs: "Write done" "Start reading" "Value" Obviously, the "read" option doesn't block the spawned thread even "buffering" is set to #f. Did I misunderstand it? -- Meng Zhang Sent with Sparrow (http://www.sparrowmailapp.com/?sig)

2 2

Back to trying to figure out blackhole
by Hendrik Boom 24 Jan '12

24 Jan '12

In http://dynamo.iro.umontreal.ca/~gambit/wiki/index.php/Black_Hole it says Make sure you put the blackhole-libs into a directory called "std" in ~~/ lib/modules I find this sentence unclear. Not being a regular Gambit user yet, I don't know where ~~ is. I've got a /usr/local/Gambit-C/v4.6.3/lib. Am I supposed to create modules in there and copy the contents of blackhole-libs into it? Or copy the directory blackhole-libs in as a sudirectory of modules? -- hendrik

3 2

Re: [gambit-list] slime (swank) and gambit
by Marc Feeley 23 Jan '12

23 Jan '12

On 2012-01-19, at 6:37 PM, Steve Graham wrote: > Nice picture. > > What is picobit? > > > Steve Sorry, that message wasn't meant for the whole list... But given that you ask, picobit is a Scheme compiler for a very compact VM that I wrote a few years ago for embedded applications. Here's the paper Vicent St-Amour and I published at IFL09 (it won the "best paper award"): http://www.iro.umontreal.ca/~feeley/papers/StAmourFeeleyIFL09.pdf Marc

4 5

Re: [gambit-list] Idiomatic Scheme
by Roger Wilson 19 Jan '12

19 Jan '12

Hi, Thanks for all the input guys. It all makes sense. I have a question on the cond/case option though. More one for StackOverflow really but... (define (make-f) (lambda (message . arguments) (case message (('get!) (display "get")) (('size) (display "size")) (else (display "no match"))))) (define f (make-f)) (f 'size) > "no match" (define (make-g) (lambda (message . arguments) (display message) (newline) (cond ((eq? message 'get!) (display "get")) ((eq? message 'size) (display "size")) (else (display "no match"))))) (define g (make-g)) (g 'size) > "size" How do I get the make-f variant using case to do what I want? I guess this is a eqv? vs eq? thing, or am I missing a quote somewhere? Thanks, Roger. > > ---------- Forwarded message ---------- > From: "Adrien Piérard" <pierarda(a)iro.umontreal.ca> > To: Mikael <mikael.rcv(a)gmail.com> > Cc: gambit-list(a)iro.umontreal.ca > Date: Thu, 19 Jan 2012 21:50:29 +0900 > Subject: Re: [gambit-list] Idiomatic Scheme > Hi again, > > I couldn't resist answering more :) > > >> In particular I'm unhappy with the way the message arguments are > accessed as (car arguments) rather than by explicit name. I can see that > being a potential cause of bugs if the number of arguments grows and they > vary with each message. > > You'll probably enjoy optional parameters, then, even though my code > sample is not really portable extensible: > > (lambda (message #!optional arg1) > (case message > ((:put-name!) > (push (make-blob-name arg1) unused-name-list) > (randomise-list)) > ...)) > > By the way, why sort the list? > Why not also let the constructor of your data type assign the random value? > I barely use DEFINE-TYPE, but I guess there's a way to make the > constructor call a function to generate the random value or something > like that. > Unfortunately, (random init: (random-integer 42)) doesn't work. > > > maybe switch the cond to a case? > > Indeed, that too. > > P! > -- > Français, English, 日本語, 한국어 > > > _______________________________________________ > Gambit-list mailing list > Gambit-list(a)iro.umontreal.ca > https://webmail.iro.umontreal.ca/mailman/listinfo/gambit-list > >

2 1

Idiomatic Scheme
by Roger Wilson 19 Jan '12

19 Jan '12

Hi, I'm still using Gambit Scheme from time to time and having a lot of fun with it. I've a newbie question however, I'm trying to figure out the best way to structure code. With that in mind are there any comments on the following code? I'm trying to create an 'object' that holds a list of names, can return a random one on request that can later be returned to it. What's the proper Scheme way of doing this kind of thing? Here's my stab, it returns a function that then accepts 'messages' as parameters.... (define (make-name-list seed-names) ;; The type the list is built from (define-type blob-name name (random init: 0)) ; Used for sorting (let ((unused-name-list '())) (define (randomise-list) ; Assign each name a random number and then sort them (map (lambda (x) (blob-name-random-set! x (random-integer 65536))) unused-name-list) (sort! unused-name-list (lambda (x y) (if (< (blob-name-random x) (blob-name-random y)) #t #f)))) ;; Put all the seed names in the list (map (lambda (x) (push (make-blob-name x) unused-name-list)) seed-names) (lambda (message . arguments) (cond ((eq? message ':get-name!) (if (null? unused-name-list) "No names available" (begin (let ((name (blob-name-name (car unused-name-list)))) (set! unused-name-list (cdr unused-name-list)) name)))) ; Add a name to the list, used to return names once they're no longer needed ((eq? message ':put-name!) (push (make-blob-name (car arguments)) unused-name-list) (randomise-list)) ; Debug, print the internal display ((eq? message ':display) (display unused-name-list)) (else (error 'name-list "unrecognized message")))))) ;; Test drive code....... (define name-list (make-name-list (list "Albert" "Bruce" "Clive"))) (display (name-list ':get-name!)) (name-list ':put-name! "David") (name-list ':put-name! "Edgar") (name-list ':put-name! "Frederick") (display (name-list ':display)) Some points: In particular I'm unhappy with the way the message arguments are accessed as (car arguments) rather than by explicit name. I can see that being a potential cause of bugs if the number of arguments grows and they vary with each message. I realise that the randomise-list function is probably called too often and maintaining a 'dirty bit' would allow it to be only called when necessary when getting a name. I've years of C/C++ programming behind me, which is probably readily apparent. How can I improve the code? Thanks, Roger.

5 6

[ANN] Gambit-C v4.6.3 released
by gambit＠iro.umontreal.ca 19 Jan '12

19 Jan '12

Gambit-C v4.6.3 is now available. Changelog: http://www.iro.umontreal.ca/~gambit/repo/.cgit.cgi/Gambit/log/ The sources and prebuilt distributions can be obtained from the Gambit web site by visiting one of the following links. sources: http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/source/gambc-v4_6_… (for typical users) http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/source/gambc-v4_6_… (for developers) prebuilt: http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/prebuilt/gambc-v4_… http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/prebuilt/gambc-v4_… http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/prebuilt/gambc-v4_… http://www.iro.umontreal.ca/~gambit/download/gambit/v4.6/prebuilt/gambc-v4_…

6 9

Re: [gambit-list] [ANN] Gambit-C v4.6.3 released
by Marc Feeley 19 Jan '12

19 Jan '12

On 2012-01-19, at 11:39 AM, Jeff Read wrote: > Shoot, I have a 64-bit machine... :) The code I sent works on x86-64. The x86 assembler works for both x86-32 and x86-64, so it covers all bases. Marc

1 0

Strange side effect after redefinition of apply
by Sascha Ziemann 17 Jan '12

17 Jan '12

I got a strange side effect with my silex apply hack. I was able to simplify it down to this test case where I define the two macros apply and token. The file a.scm works: $ cat a.scm (define gambit-apply apply) (define-syntax apply (syntax-rules (string-append) ((_ string-append list) (append-strings list)) ((_ func list) (gambit-apply func list)))) (display (gambit-apply string-append (list "a"))) (newline) $ gsi -:s a.scm a The file b.scm works also: $ cat b.scm (define-syntax token (syntax-rules () ((_ name value) (cons name value)) ((_ name) (cons name '())))) (define (b) (token "b")) (display (car (b))) (newline) $ gsi -:s b.scm b But when I concatenate the two files I get an error: $ cat a.scm b.scm > c.scm $ gsi -:s c.scm *** ERROR IN #<procedure #2>, "c.scm"@7.7 -- Unbound variable: gambit-apply How could gambit-apply get lost?

3 2

shell-command failing in Gambit 4.6.2 (MinGW build)
by REPLeffect 17 Jan '12

17 Jan '12

The shell-command procedure under the MinGW build of Gambit 4.6.2 seems to be broken. When running gsi under the MinGW MSys shell (by running gsi.exe -:d-), things worked fine under Gambit 4.6.0 (as shown below). However, in Gambit 4.6.2, it appears that only the program name passed in the shell command is being recognized. Thus, I could run (shell-command "ls 1 2 3") while in a directory where no such files existed, and I got the contents of the directory (as if the command had only been "ls", with no arguments). ==== Output running under Msys: (gsi.exe -:d-) ========== Gambit v4.6.0 > (shell-command "ls 1 2 3") ls: 1: No such file or directory ls: 2: No such file or directory ls: 3: No such file or directory 512 > Gambit v4.6.2 > (shell-command "ls 1 2 3") INSTALL.txt LGPL.txt LICENSE-2.0.txt README bin config.guess config.log config.status config.sub configure configure.ac doc examples gsc gsc-comp.exe gsi include install-sh lib makefile makefile.in misc mkidirs prebuilt relpath tests 0 > The results get even worse when running Gambit 4.6.2 directly from the Windows start menu. Here again, version 4.6.0 does what I expected. However, when I run version 4.6.2, I can't get the shell-command to work no matter what command I pass it: ====== Output running gsi.exe directly from the Windows Start Menu: ====== Gambit v4.6.0 > (shell-command "dir 1 2 3") Volume in drive C has no label. Volume Serial Number is 14C2-1C72 Directory of C:\test\Gambit-C\v4_6_0\v4.6.0\bin Directory of C:\test\Gambit-C\v4_6_0\v4.6.0\bin Directory of C:\test\Gambit-C\v4_6_0\v4.6.0\bin File Not Found 256 > Gambit v4.6.2 > (shell-command "dir 1 2 3") *** ERROR IN (console)(a)1.1 -- No such file or directory (open-process '(path: "sh" arguments: ("-c" "dir 1 2 3") stdin-redirection: #f stdout-red... ) 1> > (shell-command "dir") *** ERROR IN (console)(a)5.1 -- No such file or directory (open-process '(path: "sh" arguments: ("-c" "dir") stdin-redirection: #f stdout-redirecti... ) 1> -------------------------------------------------------------- All of these tests were run against the current prebuilt versions of Gambit 4.6.0 and 4.6.2 downloaded from Gambit's web site. I'll be happy to test any patches or other changes needed to fix this problem.

3 4

ICFP 2012 Call for papers
by Wouter Swierstra 17 Jan '12

17 Jan '12

===================================================================== ICFP 2012: International Conference on Functional Programming Copenhagen, Denmark, September 9 - 15, 2012 http://www.icfpconference.org/icfp2012 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Monday Mar 12, 2012 14:00 UTC Author response: Monday May 07, 2012 14:00 UTC - May 9 14:00 UTC Notification: Monday May 28, 2012 Final copy due: Monday Jul 02, 2012 Scope ~~~~~ ICFP 2012 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency and distribution; modules; components and composition; metaprogramming; interoperability; type systems; relations to imperative, object-oriented, or logic programming * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation * Applications and Domain-Specific Languages: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia programming; scripting; system administration; security * Education: teaching introductory programming; parallel programming; mathematical proof; algebra * Functional Pearls: elegant, instructive, and fun essays on functional programming * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By March 12 2012, 14:00 UTC, submit a full paper of at most 12 pages (6 pages for an Experience Report), including bibliography and figures. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.acm.org/sigplan/republicationpolicy.htm * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions are expected to transfer the copyright to the ACM. Presentations will be videotaped and released online if the presenter consents. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. If this requirement is a hardship, make contact with the program chair at least one week before the deadline. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available: http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted only online via the ICFP website. Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 48-hour period, starting at 14:00 UTC on Monday May 7th 2012, to read reviews and respond to them. Special Journal Issue: There will be a special issue of the Journal of Functional Programming with papers from ICFP 2012. The program committee will invite the authors of select accepted papers to submit a journal version to this issue. Conference Chair: Peter Thiemann, University of Freiburg Program Chair: Robby Findler, Northwestern University Program Committee: Andreas Rossberg, Google Andrew Tolmach, Portland State University Brigitte Pientka, McGill University Colin Runciman, University of York Eijiro Sumii, Tohoku University Jan Midtgaard, Aarhus University John Hughes, Chalmers University of Technology and Quviq AB Lars Birkedal, IT University of Copenhagen Manuel Fähndrich, Microsoft Research Mariangiola Dezani-Ciancaglini, University of Turin Matthias Blume, Google R. Kent Dybvig, Cisco and Indiana University Sam Tobin-Hochstadt, Northeastern University Satnam Singh, Google Research Simon Marlow, Microsoft Research Zena M. Ariola, University of Oregon

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Gambit-list Janvier 2012