Gambit-list Mai 2012

gambit-list@iro.umontreal.ca

11 participants
17 discussions

Edge triggered I/O with libevent
by Adam Langley 04 Avr '13

04 Avr '13

Gambit uses the select call on POSIX systems to multiplex IO operations. This is fine for small numbers of file descriptors, but falls apart quickly with large numbers[1]. libevent[2] is a wrapper library around a number of modern IO multiplexing systems (epoll on Linux, kqueue on the BSDs as well as poll and select). Attached is a patch which converts Gambit to using edge triggered I/O with epoll and libevent. This also requires a patch (attached) of libevent since the standard distribution doesn't include edge triggering support and the upstream appears to be on holiday. (epoll is required because I don't have a BSD box on which to develop edge triggering support for kqueue) This patch (for Gambit) preprocesses away to nothing unless --enable-libevent is passed to the configure script. (Note that, since this patches the configure.ac script, you'll need to run autoconf to regenerate). I hope I've not broken anything, but at this stage I've only tested that the console and tcp ports work. This patch (in the future) should also allow people, who write programs which use socket calls directly, to integrate into the main event loop at some point. Testing is more than welcome and, if you find a form of IO which is broken, please email me. [1] http://monkey.org/~provos/libevent/libevent-benchmark2.jpg [2] http://monkey.org/~provos/libevent/ -- Adam Langley agl(a)imperialviolet.org http://www.imperialviolet.org (+44) (0)7906 332512 PGP: 9113 256A CC0F 71A6 4C84 5087 CDA5 52DF 2CB6 3D60

2 2

What papers and strategies underly Gambit's design, in particular the compiler & VM?
by Mikael 13 Jui '12

13 Jui '12

Hi, In the purpose of making it clear and easy-enough for the unintroduced to understand the inner workings of Gambit in its current version, it'd be great to know what strategies/philosophies, papers and other reference documents underly Gambit - its compiler, environment and so on, beyond the Scheme (R5RS etc.) and SRFI specs. I'd be happy to make a Wiki page, Theory and papers, or alike, of this. My best understanding is that compilation to C/asm of Scheme with callcc support generally is perceived as a process that's intricate and of an abstract nature, asking this quite a lot therefore. :-) The papers I'm aware of are basically those on Marc's homepage and those listed by Alex below. And, beyond knowing which they are, it'd be great to have a clue of how central the respective paper is in Gambit's particular design / how strictly it was adhered to, on the scale from directly/being implemented as it is to indirectly/used rather for inspiration. Things whose answers can be found in the papers would include: * How the internal value, object, procedure and closure representations look and fit together Closures effectively special-purpose vectors of boxes? All values and object references are internally native-size integers with a number of reserved bytes describing the value type, what about them? * Value and object allocations, made how and what optimizations for fast dead object detection and subsequent reclaim are there * The layout of the asm/C-level stack and trampolines and how the GC resolves the locations of all object reference, anatomy of a procedure call and return * How the CPS transformation works * What optimizations are made, in terms of register use optimizations, compile-time pre-evaluation or deductions of datatype At some point I got that generally |cdr| is translated to +1 in asm/c, for instance * What does the internal form of interpreted code actually look/work like * Interrupt checks, made provenly at what granularity * Code debuggability, made in compiled code on what basis * Motivations for the GVM code's design * Hashtable algorithm * Number handling I suppose there's key areas beyond these also. And, I suppose quite possibly, some key things are not described in any paper. Find below an attempt to figure out which of Marc's papers are in use for these respects of Gambit today. If you know such papers/docs or you see areas beyond those listed above that ought to be considered as in the scope too, please tell. Kind regards, Mikael * Marc Feeley. *Speculative inlining of predefined procedures in an R5RS Scheme to C compiler. *In Olaf Chitil, Zoltán Horváth, and Viktória Zsók, editors, *Implementation and Application of Functional Languages (IFL'07)*, volume 5083 of *Lecture Notes in Computer Science*, pages 237-253, 2008. [PDF] <http://www.iro.umontreal.ca/~feeley/papers/FeeleyIFL07.pdf> * Fernanda Kri and Marc Feeley. *Genetic instruction scheduling and register allocation. *In *International Conference on the Quantitative Evaluation of Systems (QEST'04)*, pages 76-83, 2004. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/KriFeeleyQEST04.pdf> * Marc Feeley. *A better API for first-class continuations. *In *Scheme and Functional Programming Workshop (SFPW'01)*, pages 1-3, September 2001. [PDF] <http://www.iro.umontreal.ca/~feeley/papers/FeeleySW01.pdf> * Danny Dubé and Marc Feeley. *Demand-driven type analysis: an introduction. *In *Scheme and Functional Programming Workshop (SFPW'01)*, pages 21-32, September 2001. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/DubeFeeleySW01.pdf> * Marc Feeley. *A portable implementation of first-class continuations for unrestricted interoperability with C in a multithreaded Scheme. *In *Scheme and Functional Programming Workshop (SFPW'00)*, pages 65-66, September 2000. [PDF] <http://www.iro.umontreal.ca/~feeley/papers/FeeleySW00.pdf> * Mauricio Solar and Marc Feeley. *Scheduling algorithm considering latency time on a shared-memory machine. *In *XVI World Computer Congress, International Conference on Software: Theory and Practice*, August 2000. * Marc Feeley, James S. Miller, Guillermo J. Rozas, and Jason A. Wilson. *Compiling higher-order languages into fully tail-recursive portable C. *Technical Report 1078, département d'informatique et r.o., Université de Montréal, August 1997. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/FeeleyMillerRozasWilsonDIRO1078.…> * Dominique Boucher and Marc Feeley. *Abstract compilation: a new implementation paradigm for static analysis. *In *International Conference on Compiler Construction (CC'96)*, pages 192-207, April 1996.[PDF]<http://www.iro.umontreal.ca/~feeley/papers/BoucherFeeleyCC96.pdf> * Manuel Serrano and Marc Feeley. *Storage use analysis and its applications. *In *ACM SIGPLAN International Conference on Functional Programming (ICFP'96)*, pages 50-61, May 1996. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/SerranoFeeleyICFP96.pdf> * Marc Feeley. *Polling efficiently on stock hardware. *In *ACM Conference on Functional Programming Languages and Computer Architecture (FPCA'93)*, pages 179-187, 1993. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/FeeleyFPCA93.pdf> * Marc Feeley and Guy Lapalme. *Closure generation based on viewing LAMBDA as EPSILON plus COMPILE. **Computer Languages*, 17(4):251-267, 1992. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/FeeleyLapalmeCL92.pdf> Marc Feeley and Guy Lapalme. *Using closures for code generation. **Computer Languages*, 12(1):47-66, 1987. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/FeeleyLapalmeCL87.pdf> * Marc Feeley. *Deux approches à l'implantation du language Scheme. *Master's thesis, Université de Montréal, May 1986. [PDF]<http://www.iro.umontreal.ca/~feeley/papers/FeeleyMSc.pdf> 2011/6/9 Alex Queiroz > Hallo, > > On Wed, Jun 8, 2011 at 11:14 PM, Jason E. Aten <j.e.aten(a)gmail.com> wrote: > > > > If others on the list have pointers to papers as well, I'd enjoy reading > > about the best thoughts on how to implement continuations. > > > > "Representing Control in the Presence of First-Class Continuations" > http://www.cs.indiana.edu/~dyb/papers/stack.ps > > "A portable implementation of first-class continuations for > unrestricted interoperability with C in a multithreaded Scheme" > http://repository.readscheme.org/ftp/papers/sw2000/feeley.pdf > > "Implementation strategies for first-class continuations" > http://www.springerlink.com/content/h5808n962434j275/fulltext.pdf > > More in: > http://library.readscheme.org/page6.html > > Cheers, > -- > -alex >

4 6

Gambit on Android
by Steve Graham 10 Jui '12

10 Jui '12

I understand that Android apps are typically written in Java. How then is Gambit able to run on that platform? If it is possible to write GUI apps for the Android using Gambit, are there any pointers on how to get started? Thanks, Steve

4 23

LLVM 3.1 Release
by Bradley Lucier 24 Mai '12

24 Mai '12

Marc: LLVM 3.1 has been released; perhaps some of the problems you were seeing while compiling Gambit have been addressed. Brad http://llvm.org/releases/3.1/docs/ReleaseNotes.html

2 1

[ANN] Gambit-C v4.6.6 released
by gambit＠iro.umontreal.ca 23 Mai '12

23 Mai '12

Gambit-C v4.6.6 is now available. Changelog: https://github.com/feeley/gambit/commits 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_…

3 3

New back-ends
by Marc Feeley 23 Mai '12

23 Mai '12

Two undergraduate students, Eric Thivierge and Vincent Foley, will be working on various Gambit compiler back-ends over the summer. Vincent is working on a back-end for x86 and ARM. Eric is working on a "universal" back-end which can generate code for high-level languages (such as JavaScript, Python, and PHP). Release 4.6.6 of Gambit contains a very preliminary version of the universal back-end (file gsc/_t-univ.scm). It is currently a proof of concept and only able to compile simple programs. The JavaScript back-end is selected by passing the option "-target js" to gsc. Here is a sample use: % cat fib.scm (declare (standard-bindings) (extended-bindings) (block) (inlining-limit 0) (not safe) (not interrupts-enabled) ) (define (fib n) (if (fx< n 2) n (fx+ (fib (fx- n 1)) (fib (fx- n 2))))) (print (fib 30)) % gsc -c -target js fib.scm % d8 fib.js 832040 % gsi fib.scm 832040 If you are interested in contributing to the development of these back-ends, please inform the mailing list and get in touch with Eric and Vincent so that the efforts can be coordinated. Marc

1 0

Duplicate announcements
by Marc Feeley 23 Mai '12

23 Mai '12

Sorry for the duplicate announcements of v4.6.6, which are due to a NFS problem. Marc

1 0

[ANN] Gambit-C v4.6.6 released
by gambit＠iro.umontreal.ca 23 Mai '12

23 Mai '12

1 0

[ANN] Gambit-C v4.6.6 released
by gambit＠iro.umontreal.ca 23 Mai '12

23 Mai '12

1 0

Call for Papers: Implementation and Application of Functional Languages 2012
by Tom Harper 23 Mai '12

23 Mai '12

------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2012 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze(a)cs.ox.ac.uk. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze(a)cs.ox.ac.uk. For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea José Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US

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 Mai 2012