http://blog.gmane.org/gmane.lisp.scheme.scheme48 hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.lisp.scheme.scheme48/2518 <pre>http://www.cse.yorku.ca/~oz/hash.html vm/data/struct.scm has (define (vm-string-hash s) (let ((n (vm-string-length s))) (do ((i 0 (+ i 1)) (h 0 (+ h (char-&gt;ascii (vm-string-ref s i))))) ((&gt;= i n) h)))) also other places in the source (but not srfi-13) I'm not complaining, just thought this might want to go on the to-do-someday list. Interesting coincidence, this page was the top google hit for "string hash", and its author was the first person to get ahold of scheme48 (beyond Richard and me) Jonathan </pre> Jonathan Rees 2012-05-16T18:29:31 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2517 <pre> COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012 CUFP 2012 http://cufp.org/conference CALL FOR PRESENTATIONS Copenhagen, Denmark Sep 13-15 Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 29 June 2012 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk ================== If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: Experience reports are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to sperber(at)deinprogramm(dot)de or avsm2(at)cl(dot)cam(dot)ac(dot)uk by 29 June 2012 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Program Committee ================= Mike Sperber (Active Group), co-chair Anil Madhavapeddy (University of Cambridge), co-chair Ashish Agarwal (New York University) Thomas Arts (QuviQ AB) Chris Houser (LonoCloud) Tomas Petricek (University of Cambridge) Heiko Seeberger (Typesafe) Stefan Wehr (factis research) Noel Welsh (untyped) More information ================ For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk ==================================== Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly. </pre> Michael Sperber 2012-05-14T18:18:58 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2516 <pre> COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012 CUFP 2012 http://cufp.org/conference CALL FOR PRESENTATIONS Copenhagen, Denmark Sep 13-15 Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 29 June 2012 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk ================== If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: Experience reports are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to sperber(at)deinprogramm(dot)de or avsm2(at)cl(dot)cam(dot)ac(dot)uk by 29 June 2012 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Program Committee ================= Mike Sperber (Active Group), co-chair Anil Madhavapeddy (University of Cambridge), co-chair Ashish Agarwal (New York University) Thomas Arts (QuviQ AB) Chris Houser (LonoCloud) Tomas Petricek (University of Cambridge) Heiko Seeberger (Typesafe) Stefan Wehr (factis research) Noel Welsh (untyped) More information ================ For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk ==================================== Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly. </pre> Michael Sperber 2012-02-21T18:57:26 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2515 <pre>This message is being posted to various lists to inform members of the Scheme community on the development of R7RS. I am pleased to announce that the sixth draft version of R7RS ("small" language) has been completed by working group 1 and is now available at the following URL: http://trac.sacrideo.us/wg/raw-attachment/wiki/WikiStart/r7rs-draft-6.pdf A copy will also be posted on schemers.org . Other documents produced by working group 1, including previous drafts and progress reports are available at the following URL: http://www.scheme-reports.org/2012/working-group-1.html The editors of working groups 1 and 2, in consultation with the Scheme language steering committee, have provided a mechanism for comment and discussion. For details, including instructions on how to submit a formal comment, please see this document: http://www.scheme-reports.org/2012/process1.html The comment period is now open and will continue until June 30, 2012. The steering committee thanks the editors for their intensive work on the draft R7RS, and looks forward to the public comment period on this sixth draft. Enjoy! For the Scheme language Steering Committee, </pre> Marc Feeley 2012-02-17T06:44:54 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2511 <pre>Hi, xanadu is a scheme Xanadu using XML scheming and trees for filesystem xml features. I't is in development and in the git repo. Enjoy, Johan </pre> erana Owl 2012-01-22T21:57:42 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2508 <pre>Hi, I've put a scheme coded perldoc .pod reader in sunterlib. It's in the git repo. There's preliminary .sod and scriblle features coming up. Enjoy, Johan </pre> erana Owl 2012-01-22T21:53:40 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2496 <pre> In case you aren't aware of it, the community went through a big effort to get scheme48 and most of the other copyrighted code unified under an open source license many years ago (modified BSD). I don't know how much is preserved in public archives, but I'm pointing you to the history so you can be aware of it when you make your decisions. </pre> Anthony Carrico 2012-01-11T08:03:50 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2486 <pre>Hi all, I'm working on a scsh/s48 mailer demon. The code now has a response system and a socket listener etc. See http://soft.vub.ac.be/~jceuppen/scheme/tmail-0.2.tar.gz Cya, Johan </pre> erana Owl 2012-01-08T23:12:04 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2476 <pre>Goodday schemers, I've made an extension to octrees, called a 27-tree. Paper is here : http://soft.vub.ac.be/~jceuppen/papers/paper27tree.ps Python code with ultima 8 game is here: http://soft.vub.ac.be/~jceuppen/python/koboldsquest-2.1.tar.gz Finally a scheme implementation which can be used with my former framebuffer code, to make a 3D engine, is here: http://soft.vub.ac.be/~jceuppen/scheme/ (version 0.3 has been tested in guile and s48, fb extension is also in that directory) Enjoy, Johan </pre> erana Owl 2012-01-06T14:15:21 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2486 <pre>Hi all, I'm working on a scsh/s48 mailer demon. The code now has a response system and a socket listener etc. See http://soft.vub.ac.be/~jceuppen/scheme/tmail-0.2.tar.gz Cya, Johan </pre> erana Owl 2012-01-08T23:12:04 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2476 <pre>Goodday schemers, I've made an extension to octrees, called a 27-tree. Paper is here : http://soft.vub.ac.be/~jceuppen/papers/paper27tree.ps Python code with ultima 8 game is here: http://soft.vub.ac.be/~jceuppen/python/koboldsquest-2.1.tar.gz Finally a scheme implementation which can be used with my former framebuffer code, to make a 3D engine, is here: http://soft.vub.ac.be/~jceuppen/scheme/ (version 0.3 has been tested in guile and s48, fb extension is also in that directory) Enjoy, Johan </pre> erana Owl 2012-01-06T14:15:21 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2486 <pre>Hi all, I'm working on a scsh/s48 mailer demon. The code now has a response system and a socket listener etc. See http://soft.vub.ac.be/~jceuppen/scheme/tmail-0.2.tar.gz Cya, Johan </pre> erana Owl 2012-01-08T23:12:04 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2476 <pre>Goodday schemers, I've made an extension to octrees, called a 27-tree. Paper is here : http://soft.vub.ac.be/~jceuppen/papers/paper27tree.ps Python code with ultima 8 game is here: http://soft.vub.ac.be/~jceuppen/python/koboldsquest-2.1.tar.gz Finally a scheme implementation which can be used with my former framebuffer code, to make a 3D engine, is here: http://soft.vub.ac.be/~jceuppen/scheme/ (version 0.3 has been tested in guile and s48, fb extension is also in that directory) Enjoy, Johan </pre> erana Owl 2012-01-06T14:15:21 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2467 <pre>What is changeset 0306c5a64775 intended to do? Robert Ransom </pre> Robert Ransom 2011-12-31T03:28:10 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2465 <pre>Hello, I don't understand the following Scheme behaviour: + '+ 1 + 1 #{Procedure 93 +} Why in the second interaction is the input '+' read as a procedure, but in the first as a symbol? I am very new to Scheme, so my apologies if this is a silly question. I'm trying to write an RPN interpreter in Scheme, and I thought I'd apply the procedure read from the input to a stack of operands, however, because of the first case, this method isn't robust. I don't understand how to 'unsymbolise' a symbol into its corresponding procedure. Maybe there is a better way to do this? Thanks for reading. </pre> Frank Lay 2011-12-17T23:52:41 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2463 <pre>Hi, I tried to load the package defs from SSAX and it killed the macro expander. It appears that when BIND-ALIASES was switched to the new cenv representation it stopped including macro eval in the cenvs it generated, and SSAX touches it somehow, causing a (force #f). I put up a one-line patch to BIND-ALIASES so that it includes macro eval, as it did before, at https://bitbucket.org/wnoble/s48. However, I don't know exactly how SSAX triggers the access and didn't try too hard to come up with a simple macro to reproduce the faulty expansion. So, if someone would explain whether this is the correct fix, and why or why not, I would be grateful! And Mike: thanks for integrating my POSIX patch! Best, Will </pre> Will Noble 2011-12-01T02:30:18 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2458 <pre> My system is opensuse 11.4,I download the source code (v1.8) and compile it .During 'make',a small error occured.I didn't record it .but i will try to explain it to you. file: ./c/unix/socket.c line: 354 func:gethostbyname_thread host-&gt;h_addr---&gt;I was told that struct host has no member 'h_addr' host----------&gt;struct hostent The same error happend in func s48_get_host_by_name (line 385) and i checked my defination of struct hostent(netdb.h) struct hostent { char *h_name; /* Official name of host. */ char **h_aliases; /* Alias list. */ int h_addrtype; /* Host address type. */ int h_length; /* Length of address. */ char **h_addr_list; /* List of addresses from name server. */ #if defined __USE_MISC || defined __USE_GNU # define h_addr h_addr_list[0] /* Address, for backward compatibility.*/ #endif }; It seems some thing wrong with the marco defination.so i changed the h_addr to h_addr_list[0] ,and it wored.I don't know whether other distributions has this problem. hope it maybe helps to you </pre> =?GBK?B?48a6vQ==?= 2011-10-29T08:25:41 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2454 <pre>Hi all, I modified the POSIX module so that Scheme code instead of C code manages PID/errno/signal objects. So, where before posix_kill took a PID record and a signal record, now it takes ints. I think the comments hinted towards something along these lines. This removes a good chunk of awkward (in my view) Scheme-written-in-C code. I put up a repo at bitbucket.org/wnoble/scheme48. I've only tested the code lightly, and thought lightly about the general approach, so I definitely would appreciate any suggestions! Best, Will </pre> Will Noble 2011-10-25T19:58:08 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2452 <pre>Hi, s48 with framebuffer initialising code and putpixel method : check the last version 0.1.7 (./configure &amp;&amp; make &amp;&amp; make install) : http://soft.vub.ac.be/~jceuppen/scheme/ Regards, Johan </pre> erana Owl 2011-09-30T15:33:52 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2451 <pre>Hi, here's a rough Wii port, not too much UNIX : http://soft.vub.ac.be/~jceuppen/embedded/ and here's a fb (C) code all packaged up, no configure needed just make: http://soft.vub.ac.be/~jceuppen/scheme/ to use the last one in this s48 shell type : (let ((rgb 255) (x 10) (y 10)) ,open posix-i/o (initfb) (putpixel x y rgb) ) Enjoy, all else to /dev/null. Love, erana </pre> erana Owl 2011-09-29T22:06:01 http://comments.gmane.org/gmane.lisp.scheme.scheme48/2446 <pre>Sires, I've chosen Scheme48 as one of implementations of Scheme to evaluate some scheme code I'm developing. I didn't found any reference to a profiler for Scheme48, although I've found references to a tracer. Is such profiling tool available? If so, where can I find any references to it? Thank you in advance. </pre> Paulo Silva Filho 2011-08-17T14:44:29 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.lisp.scheme.scheme48