Gambit-list Août 2007

gambit-list@iro.umontreal.ca

34 participants
37 discussions

Schelog and inlining eqv?
by Bradley Lucier 21 Aoû '07

21 Aoû '07

Marc: Discussing schelog again brought to mind my suggestion about how the compiler should inline eqv?: https://webmail.iro.umontreal.ca/pipermail/gambit-list/2006-October/ 000885.html Some results on the naive reverse% benchmark are at https://webmail.iro.umontreal.ca/pipermail/gambit-list/2006-October/ 000890.html Even on the "houses" puzzle, which spends a lot of time in the "occurs" check, the change in how to compile eqv? makes a big difference with the declarations: > (declare (standard-bindings) (extended-bindings) (block)) > (declare (not safe)) > (declare (inlining-limit 1000)) New eqv?: > [brad:~/Desktop/schelog/examples] lucier% gsc -:m100000 > Gambit Version 4.0 beta 23 > > > (load "../gambit-unix-version-of-schelog") > "/Users/lucier/Desktop/schelog/examples/../gambit-unix-version-of- > schelog.o2" > > (load "houses") > "/Users/lucier/Desktop/schelog/examples/houses.o1" > > (load "puzzle") > "/Users/lucier/Desktop/schelog/examples/puzzle.o1" > > (time (solve-puzzle %houses)) > (time (solve-puzzle %houses)) > 395 ms real time > 366 ms cpu time (268 user, 98 system) > no collections > 66951840 bytes allocated > no minor faults > no major faults > ((solution= ((japan owns the zebra) (norway drinks water)))) > > > *** EOF again to exit Old eqv?: > [brad:~/Desktop/schelog/examples] lucier% gsc -:m100000 > Gambit Version 4.0 beta 23 > > > (load "../gambit-unix-version-of-schelog.o1") > "/Users/lucier/Desktop/schelog/examples/../gambit-unix-version-of- > schelog.o1" > > (load "houses") > "/Users/lucier/Desktop/schelog/examples/houses.o1" > > (load "puzzle") > "/Users/lucier/Desktop/schelog/examples/puzzle.o1" > > (time (solve-puzzle %houses)) > (time (solve-puzzle %houses)) > 709 ms real time > 657 ms cpu time (551 user, 106 system) > no collections > 66952160 bytes allocated > no minor faults > no major faults > ((solution= ((japan owns the zebra) (norway drinks water)))) > > > *** EOF again to exit

1 0

does gambit-c have any strategy when one day those 80 cores cpus are available?
by naruto canada 21 Aoû '07

21 Aoû '07

hi does gambit-c have any strategy when one day those 80 cores cpus are available? maybe I am thinking about this too earlier. just find this page on register: http://www.theregister.co.uk/2007/08/20/tilera_tile64_chip/

3 2

Commercial Users of Functional Programming: program is published, registration is open
by Matthew Flatt 21 Aoû '07

21 Aoû '07

[posted on behalf of the organizers] Friends, The program for the 2007 Commercial Users of Functional Programming workshop is now published. http://cufp.galois.com/ The workshop is co-located with ICFP, and will be held in Freiburg, Germany, on 4 October 2007. We had a terrific response to our call for talks, and there are twelve (!) speakers describing commercial applications, variously written in Caml Erlang F# Haskell ML Scheme The talks are informal, and there are no proceedings. We'll just have fun learning about functional programming used to solve real problems. Do come! Kathleen Fisher Simon Peyton Jones

1 0

Re: [gambit-list] floating point number representation
by Marc Feeley 20 Aoû '07

20 Aoû '07

On 20-Aug-07, at 5:11 PM, naruto canada wrote: > On 8/21/07, naruto canada <narutocanada(a)gmail.com> wrote: >> On 8/21/07, Marc Feeley <feeley(a)iro.umontreal.ca> wrote: >>> >>> On 20-Aug-07, at 3:41 PM, naruto canada wrote: >>> >>>> hi >>>> >>>> (+ 1.0 3.0) >>>> ;; 4. >>>> >>>> can I have "4.0" instead? >>>> where do I have to change in "lib/_num.scm"? (I am guessing) >>> >>> In lib/_num.scm change >>> >>> (##define-macro (macro-chez-fp-syntax) #f) >>> >>> to >>> >>> (##define-macro (macro-chez-fp-syntax) #t) >>> >>> and do a "make". >> >> I've just tried it, it segfaults. >> (+ 4.0 5.0) >> Segmentation fault > > Gambit Version 4.0 beta 22 >> (+ 4.0 5.0) > Segmentation fault Strange... it works fine when I make the change: > (+ 4.0 5.0) 9.0 Marc

2 2

Re: [gambit-list] (eval (cons func '(1 2))) don't work
by Marc Feeley 20 Aoû '07

20 Aoû '07

On 20-Aug-07, at 5:34 PM, naruto canada wrote: >> >> I'm not sure what you tried but Gambit supports a multiple argument >> apply (the last argument is a list of the remaining arguments. So: >> >>> (apply + '(1 2 3 4)) >> 10 >>> (apply + 1 '(2 3 4)) >> 10 >>> (apply + 1 2 '(3 4)) >> 10 >>> (apply + 1 2 3 '(4)) >> 10 >>> (apply + 1 2 3 4 '()) >> 10 >> >> Marc >> >> > > You are right, I had a mismatch of arity. It works now. > Still, both methods should be equivalent. In general (apply E1 E2) != (eval (cons E1 E2)) because eval tries to recursively evaluate its argument. It will try to evaluate the **result** of evaluating E1, and all the elements of the list **resulting** from the evaluation of E2. With apply the second round of evaluation does not occur. Note that sometimes there is no difference because 5 = (eval 5) = (eval (eval 5)) = ... but in other cases there is a difference because car = (eval 'car) != (eval (eval 'car)) != ... Marc

2 1

Re: [gambit-list] (eval (cons func '(1 2))) don't work
by naruto canada 20 Aoû '07

20 Aoû '07

On 8/21/07, naruto canada <narutocanada(a)gmail.com> wrote: > On 8/21/07, Etienne Laurin <laurieti(a)iro.umontreal.ca> wrote: > > On Tue, Aug 21, 2007 at 02:08:43AM +0800, naruto canada wrote: > > > ;; propositional calculator > > > (map (lambda (p) (implies p p)) (list #t #f)) > > > (cross-product '((0 1) (0 1) (0 1) ) ) > > > (cross-product '((0 1) (0 1) (0 1) (0 1)) ) > > > (define (prop-calc func lst) > > > (map (lambda (x) (eval (cons func x))) lst) > > > ) > > > (prop-calc (lambda (p) (implies p p)) (bag-of (list (amb-list (list #t > > > #f))))) ;; test tautology > > > 'done (exit) > > > > You can use apply instead: > > > > (map (lambda (x) (apply func x)) lst) > > > > Unless you really need to evaluate arbitrary scheme expressions, > > eval doesn't need to be used and shouldn't have to be. > oops, forgot to reply to list. apply won't work more then one parameters (I've tried it): (prop-calc (lambda (p q) (iff (implies p q) (implies (not q) (not p)))) (cross-product '((#t #f)(#t #f))) ) Besides, when I start on predicate calculus, it's going to become ugly (symbolic), I need to make sure I can still evaluate arbitrary lambdas before planning out data structure. > > > > > Etienne Laurin > > >

2 1

floating point number representation
by naruto canada 20 Aoû '07

20 Aoû '07

hi (+ 1.0 3.0) ;; 4. can I have "4.0" instead? where do I have to change in "lib/_num.scm"? (I am guessing) Thanks

2 1

http://www.iro.umontreal.ca/~gambit/ only has 4.0b22
by naruto canada 20 Aoû '07

20 Aoû '07

http://www.iro.umontreal.ca/~gambit/ only has 4.0b22, where can I obtain 4.0b23? Thanks.

1 0

(eval (cons func '(1 2))) don't work
by naruto canada 20 Aoû '07

20 Aoû '07

hi how to make this code work with gambit-c? (define (func x y) (+ x y)) (eval (cons func '(1 2))) Thanks.

2 1

Re: [gambit-list] (eval (cons func '(1 2))) don't work
by andrew cooke 20 Aoû '07

20 Aoû '07

[replying to list this time - realised my last example below is probably what you intended] it think it does work - the error seems reasonable to me. what are you trying to do? > (define (func x y) (+ x y)) > (eval (func 1 2)) 3 1> (eval '(func 1 2)) 3 > (eval `(func ,@'(1 2))) 3 1> (eval '(cons 4 (func 1 2))) (4 . 3) 1> (eval (cons 'func '(1 2))) 3 (eval (func 1 2)) is (eval 3) which is 3 (eval '(func 1 2)) evaluates the quoted expression (eval `(func ,@'(1 2))) is (eval '(func 1 2)) (eval (cons 'func '(1 2))) is (eval (func 1 2)) andrew

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 Août 2007