Août 2013 - Gambit-list - mailman.iro.umontreal.ca

Gambit versus Python+GMP: Timing for Chudnovskys' algorithm for pi
by Bradley Lucier 08 Avr '22

08 Avr '22

Bakul Shah wrote a particularly elegant Scheme program for Chudnovskys' algorithm for pi based on the Common Lisp program here: https://bitbucket.org/tarballs_are_good/numericl/src/5fe8fe7089f48ab1c8a388… Nick Craig-Wood wrote a Python program using the GMP multiprecision library that appears to use exactly the same algorithm here: http://www.craig-wood.com/nick/articles/pi-chudnovsky/ I modified both programs a bit and include them here. They time the calculation of $10^n$ digits of pi for $n=1,2,3,4,5,6,7$. The results are heine:~/programs/gambiteer/gambit> !py python pi_chudnovsky_bs_gmpy.py 31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 ('chudnovsky_gmpy_mpz_bs: digits', 10, 'time', 1.0967254638671875e-05) ('chudnovsky_gmpy_mpz_bs: digits', 100, 'time', 3.0040740966796875e-05) Last 5 digits 70679 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000, 'time', 0.00025582313537597656) Last 5 digits 01989 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000, 'time', 0.00386810302734375) Last 5 digits 75678 OK ('chudnovsky_gmpy_mpz_bs: digits', 100000, 'time', 0.0834801197052002) Last 5 digits 24646 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000000, 'time', 1.655979871749878) Last 5 digits 58151 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000000, 'time', 30.67442488670349) Last 5 digits 55897 OK heine:~/programs/gambiteer/gambit> gsi chud1.scm Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10, CPU time: 0.. Last 5 digits 26535. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100, CPU time: 0.. Last 5 digits 70679. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000, CPU time: .004. Last 5 digits 1989. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000, CPU time: .028. Last 5 digits 75678. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100000, CPU time: .472. Last 5 digits 24646. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000000, CPU time: 6.448. Last 5 digits 58151. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000000, CPU time: 98.612. Last 5 digits 55897. So it appears that for this algorithm applied to large integers, GMP's bignum routines are about 3-4 times as fast as Gambit's bignum routines. Not so bad. For smaller bignums, GMP has a bigger advantage. The C program gmp-chudnovsky.c includes certain optimizations to this basic algorithm: http://gmplib.org/pi-with-gmp.html ftp://ftp.gmplib.org/pub/misc/gmp-chudnovsky.c On my machine, compiled with gcc -O3 -march=native -o gmp-chudnovsky gmp-chudnovsky.c -lgmp -lm the CPU times for 1,000,000 and 10,000,000 digits are 1.064 and 18.200 seconds, respectively. This is with a somewhat older machine model name : Intel(R) Core(TM)2 Quad CPU Q8200 @ 2.33GHz running Ubuntu 13.04 with heine:~/programs/gambiteer/gambit> gcc -v Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-linux-gnu/4.7/lto-wrapper Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Ubuntu/Linaro 4.7.3-1ubuntu1' --with-bugurl=file:///usr/share/doc/gcc-4.7/README.Bugs --enable-languages=c,c++,go,fortran,objc,obj-c++ --prefix=/usr --program-suffix=-4.7 --enable-shared --enable-linker-build-id --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.7 --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-gnu-unique-object --enable-plugin --with-system-zlib --enable-objc-gc --with-cloog --enable-cloog-backend=ppl --disable-cloog-version-check --disable-ppl-version-check --enable-multiarch --disable-werror --with-arch-32=i686 --with-abi=m64 --with-multilib-list=m32,m64,mx32 --with-tune=generic --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix gcc version 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) heine:~/programs/gambiteer/gambit> gsi -v v4.6.9 20130607151908 x86_64-unknown-linux-gnu "./configure '--enable-single-host' '--enable-multiple-versions' '--enable-shared'" and the Ubuntu-provided GMP 5.0.5. (I'm sure the GMP folks have a better way to build GMP on my machine than the "generic" 64-bit version provided by Ubuntu.) Brad

7 18

Efficient Compilation of Tail Calls and Continuations to JavaScript
by Marc Feeley 18 Sep '13

18 Sep '13

Eric Thivierge is in Copenhagen today, at the Scheme Workshop, presenting our latest paper: "Efficient Compilation of Tail Calls and Continuations to JavaScript" You can get the paper on the Scheme Worshop web page: http://users-cs.au.dk/danvy/sfp12/programme-sfp12.html It describes the implementation of tail calls and continuations in Gambit-JS and evaluates its performance. Even if you are not specifically interested in the JavaScript back-end the paper may be interesting to read as it provides a brief explanation of the Gambit Virtual Machine (GVM) and compiler front-end, and a complete example of compilation from Scheme, to GVM, to JavaScript. The performance evaluation (see attached tables) shows that the approach used by Gambit-JS is consistently faster than Scheme2JS and Spock. Marc Execution times using V8 (Chrome 21.0.1180.89): Gambit-JS Scheme2JS Spock fib35 .80 1.54 1.9x 2.40 3.0x nqueens12 .72 .76 1.1x 2.33 3.3x oddeven .83 1.92 2.3x 5.62 6.8x ctak .18 17.64 95.9x .59 3.2x contfib30 1.17 106.01 90.9x 3.38 2.9x btsearch2000 1.35 25.40 18.8x 7.93 5.9x threads10 1.34 24.68 18.5x 4.40 3.3x Execution times using JagerMonkey (Firefox 15.0.1): Gambit-JS Scheme2JS Spock fib35 1.07 7.66 7.2x 20.73 19.4x nqueens12 1.49 2.62 1.8x 12.97 8.7x oddeven 1.09 1.93 1.8x 33.91 31.1x ctak 1.25 30.38 24.3x 1.86 1.5x contfib30 5.88 156.79 26.7x 10.61 1.8x btsearch2000 11.19 27.16 2.4x 16.54 1.5x threads10 6.97 34.36 4.9x 22.11 3.2x Execution times using Nitro (Safari 6.0): Gambit-JS Scheme2JS Spock fib35 1.32 6.53 4.9x 84.69 64.2x nqueens12 1.31 1.89 1.4x 45.15 34.4x oddeven 2.52 1.55 .6x 143.97 57.1x ctak .30 52.88 177.4x 4.18 14.0x contfib30 1.60 2311.69 1443.0x 25.98 16.2x btsearch2000 3.46 102.98 29.7x 92.02 26.6x threads10 3.03 74.21 24.5x 74.88 24.7x

4 10

gambit package management
by jasox lispy 29 Aoû '13

29 Aoû '13

Hi guys, does gambit have something like raco in racket, for easily installing packages and it works on windows too.

3 2

The DysVunctional programming language
by Bradley Lucier 27 Aoû '13

27 Aoû '13

https://github.com/axch/dysvunctional-language The compiler optimizations look interesting, especially the scalar replacement of aggregates pass (see fol/sra.scm). Brad

1 0

Proper usage of ffi structs
by Chris Mueller 23 Aoû '13

23 Aoû '13

I'm opening a new subject for the ffi struct issue to sum up the current discussion: In 19.1 "The Mapping of types between C and Scheme" of the gambit documentation is mentioned: "In the case of the struct, union and type types, the default function reclaims the copy on the C heap referenced by the internal pointer (when using a C++ compiler this is done using ‘delete (type*)internal-pointer’, which calls the destructor of type if it is a class) and returns ‘___FIX(___NO_ERR)’. In many situations the default release-function will perform the appropriate cleanup for the foreign type." If i interpret this correctly, a declared struct type in a ffi provides a default release function that automatically calls a destructor (used with g++) and frees the corresponding memory. Unfortanetly, i'm little lost to use it correctly and experiment currently heavily to find the right way. Assume a type: (c-declare "struct point { int x; int y; };") (c-define-type struct-point (struct "point")) Assume a test programm that allocates a point 1_000_000_000 times. (define (alloc-point times) (let loop ((i 0)) (if (< i times) (let ((a (make-point 0 0))) (loop (+ i 1))))))) (alloc-point 1000000000) How do we implement (make-point x y) to use a ffi struct type with a default release function in Gambit? 1) With a manually allocated pointer it will leak memory. (define make-point (c-lambda (int int) struct-point "point* a = new Point; a->x = ___arg1; a->y = ___arg2; ___result_voidstar = a;")) 2) With a stack-allocated value it will segfault immediately. (define make-point (c-lambda (int int) struct-point "point a; a.x = ___arg1; a.y = ___arg2; ___result = a;")) 3) If we give the address of a stack-allocated value to ___result_voidstar the allocation loop is running with constant memory space but the programm will segfault after quiting with CTRL + X. (define make-point (c-lambda (int int) struct-point "point a; a.x = ___arg1; a.y = ___arg2; ___result_voidstar = &a;")) For more details, see discussion: https://mercure.iro.umontreal.ca/pipermail/gambit-list/2013-August/006950.h… Chris

3 5

ICFP 2013 Call for Participation
by David Van Horn 23 Aoû '13

23 Aoû '13

[ Today is the last day of early registration. ] ============================== ================================== CALL FOR PARTICIPATION 18th ACM SIGPLAN International Conference on Functional Programming ICFP 2013 Boston, MA, USA, 25-27 September 2013 Affiliated events 22-24 September, 28 September 2013 http://www.icfpconference.org/icfp2013 ================================================================ ICFP is a forum for researchers and practitioners to hear about the latest developments in the art and science of functional programming. The conference cover the entire spectrum of work, from theory to practice. The keynote speakers of ICFP 2013 are Ulf Norell on dependently typed programming and Simon Peyton Jones on computer science as a school subject. The 40 contributed papers on all aspects of functional programming were selected by the program committee from 133 submissions. Affiliated to ICFP 2013 are: ACM SIGPLAN Commercial Users of Functional Programming Workshop ACM SIGPLAN Workshop on Dependently Typed Programming ACM SIGPLAN Workshop on Functional Art, Music, Modeling and Design ACM SIGPLAN Workshop on Functional High-Performance Computing ACM SIGPLAN Erlang Workshop ACM SIGPLAN Functional Programming in Domain-Specific Languages Workshop ACM SIGPLAN Workshop on Generic Programming ACM SIGPLAN Haskell Symposium ACM SIGPLAN Haskell Implementors Workshop ACM SIGPLAN Workshop on Higher-Order Programming with Effects ACM SIGPLAN International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice ACM SIGPLAN Workshop on ML ACM SIGPLAN OCaml Workshop VENUE The conference will take place at Hilton Boston Logan Airport Hotel. REGISTRATION Registration is available at https://regmaster3.com/2013conf/ICFP13/register.php *Note that early registration ends 22 August 2013.* SUPPORT FROM SIGPLAN PAC The SIGPLAN Professional Activities Committee can potentially provide supplemental financial support for attending ICFP in the form of student grants, child-care support, companion travel grants, and long-distance internation travel support. To apply, follow the instructions found here: http://www.sigplan.org/PAC.htm ICFP 2013 PROGRAMME Wednesday, 25 September 9-10 Keynote 1 Interactive Programming with Dependent Types Ulf Norell (Chalmers University of Technology) 10-1020 Break 1020-1100 Session 1: Verification with Grammars and Automata Verified Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions [Functional Pearl] Dmitriy Traytel and Tobias Nipkow C-SHORe Christopher Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre 1100-1130 Break 1130-1230 Session 2: Data Parallelism Automatic SIMD Vectorization for Haskell Leaf Petersen, Dominic Orchard and Neal Glew Exploiting Vector Instructions with Generalized Stream Fusion Geoffrey Mainland, Roman Leshchinskiy and Simon Peyton Jones Optimising Purely Functional GPU Programs Trevor L. McDonell, Manuel Chakravarty, Gabriele Keller and Ben Lippmeier 1230-14 Lunch 14-15 Session 3: Dependent Types Type-Theory In Color Jean-Philippe Bernardy and Guilhem Moulin Typed Syntactic Meta-programming Dominique Devriese and Frank Piessens Mtac: A Monad for Typed Tactic Programming in Coq Beta Ziliani, Derek Dreyer, Neelakantan Krishnaswami, Aleksandar Nanevski and Viktor Vafeiadis 15-1530 Break 1530-1630 Session 4: Fun in the Afternoon Fun with Semirings [Functional Pearl] Stephen Dolan Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages Jean-Philippe Bernardy and Koen Claessen Functional Geometry and the "Traité de Lutherie" [Functional Pearl] Harry Mairson 1630-17 Break 17-1740 Session 5: Handling Effects Programming and Reasoning with Algebraic Effects and Dependent Types Edwin Brady Handlers in Action Ohad Kammar, Sam Lindley and Nicolas Oury 1740-18 Program Chair's Report Thursday, 26 September 9-10 Keynote 2 Computer Science as a School Subject Simon Peyton Jones (Microsoft Research, Cambridge, UK) 10-1020 Break 1020-11 Session 6: Concurrency Correctness of an STM Haskell Implementation Manfred Schmidt-Schauss and David Sabel Programming with Permissions in Mezzo Francois Pottier and Jonathan Protzenko 11-1130 Break 1130-1230 Session 7: (Co-)Recursion Wellfounded Recursion with Copatterns Andreas Abel and Brigitte Pientka Productive Coprogramming with Guarded Recursion Robert Atkey and Conor McBride Unifying Structured Recursion Schemes Ralf Hinze, Nicolas Wu and Jeremy Gibbons 1230-14 Lunch 14-15 Session 8: Functional Reactive Programming (and More) Higher-Order Functional Reactive Programming without Spacetime Leaks Neelakantan Krishnaswami Functional Reactive Programming with Liveness Guarantees Alan Jeffrey A Short Cut to Parallelization Theorems Akimasa Morihata 15-1530 Break 1530-1630 Session 9: Lambda-Calculus Using Circular Programs for Higher-Order Syntax [Functional Pearl] Emil Axelsson and Koen Claessen Weak Optimality, and the Meaning of Sharing Thibaut Balabonski System FC with Explicit Kind Equality Stephanie Weirich, Justin Hsu and Richard A. Eisenberg 1630-17 Break 17-1740 Programming Contest Co-Chairs' Report and Awards 1740-18 ICFP 2003 Most Influential Paper Award Friday, 27 September 9-10 Session 10: Monads The Constrained-Monad Problem Neil Sculthorpe, Jan Bracker, George Giorgidze and Andy Gill Simple and Compositional Reification of Monadic Embedded Languages [Functional Pearl] Josef Svenningsson and Bo Joel Svensson Structural Recursion for Querying Ordered Graphs Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato and Keisuke Nakano 10-1020 Break 1020-11 Session 11: Modular Meta-Theory Modular Monadic Meta-Theory Benjamin Delaware, Steven Keuchel, Tom Schrijvers and Bruno Oliveira Modular and Automated Type-Soundness Verification for Language Extensions Florian Lorenzen and Sebastian Erdweg 11-1130 Break 1130-1230 Session 12: Experience Reports (Chair: John Launchbury) A Nanopass Framework for Commercial Compiler Development [Experience Report] Andrew Keep and R Kent Dybvig Applying Random Testing to a Base Type Environment [Experience Report] Vincent St-Amour and Neil Toronto Functional Programming of mHealth Applications [Experience Report] Christian Petersen, Matthias Gorges, Dustin Dunsmuir, Mark Ansermino and Guy Dumont 1230-14 Lunch 14-15 Session 13: Program Logics Hoare-Style Reasoning with (Algebraic) Continuations Germán Andrés Delbianco and Aleksandar Nanevski Unifying Refinement and Hoare-Style Reasoning in a Logic for Higher-Order Concurrency Aaron Turon, Derek Dreyer and Lars Birkedal The Bedrock Structured Programming System Adam Chlipala 15-1530 Break 1530-1630 Session 14: Language Design A Practical Theory of Language-Integrated Query James Cheney, Sam Lindley and Philip Wadler Calculating Threesomes, with Blame Ronald Garcia Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism Joshua Dunfield and Neelakantan R. Krishnaswami 1630-17 Break 17-1740 Session 15: Analysis and Optimization Optimizing Abstract Abstract Machines J. Ian Johnson, Nicholas Labich, Matthew Might and David Van Horn Testing Noninterference, Quickly Catalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim and Leonidas Lampropoulos 1740-18 ICFP 2014 Advert & Closing GENERAL CHAIR Greg Morrisett, Harvard University PROGRAM CHAIR Tarmo Uustalu, Institute of Cybernetics, Tallinn PROGRAM COMMITTEE Thorsten Altenkirch, University of Nottingham Olaf Chitil, University of Kent Silvia Ghilezan, University of Novi Sad Michael Hanus, Christian-Albrechts-Universität zu Kiel Fritz Henglein, University of Copenhagen Mauro Jaskelioff, Universidad Nacional de Rosario Alan Jeffrey, Alcatel-Lucent Bell Labs Shin-ya Katsumata, Kyoto University Shriram Krishnamurthi Brown University John Launchbury, Galois Ryan Newton, Indiana University Sungwoo Park, Pohang University of Science and Technology Sam Staton, University of Cambridge Nikhil Swamy, Microsoft Research, Redmond, WA Dimitrios Vytiniotis, Microsoft Research, Cambridge

1 0

FFI Converting std::vector to scheme-vector (best practice)
by Chris Mueller 21 Aoû '13

21 Aoû '13

Hi, i'm currently coding a gambit binding for sfml and could need some adivces for a specific ffi problem from you. Assume we have a class VideoMode with the following constructor: class VideoMode { public: VideoMode(int width, int height, int bbp); # ... } I have defined an interface to scheme with: ;; Release hook is ignored for this example (c-define-type VideoMode* (pointer "VideoMode")) ;; Scheme's construction wrapper for VideoMode (define video-mode (c-lambda (int int int) VideoMode* "___result_voidstar = new VideoMode(___arg1, ___arg2, ___arg3);")) Now assume a function that retrieves all supporting video-modes in C++: std::vector<VideoMode> getFullscreenModes(); I would like to write now a scheme-function (with c-lambda) that iterators through all elements from this std::vector and constructs/returns a scheme-vector with foreign-objects of type (pointer "VideoMode"). How does the c-lambda code look like for this small issue? (Or how would you cope this problem alternatively?) Chris

2 13

Macro name can't be used as a variable: string-append
by Dirk Theisen 19 Aoû '13

19 Aoû '13

Hi! I'm trying to run the profiler from http://www.iro.umontreal.ca/~germaing/statprof.html with Gambit 4.6.6 and run into multiple problems. Some, I was able to fix (I'm a scheme beginner), but this... (define (as-rgb col) (apply string-append (map (lambda (x) (pad-left (number->string x 16) 2 #\0)) col))) gives me *** ERROR IN "statprof.scm"@94.20 -- Macro name can't be used as a variable: string-append I am unable to figure out. I string-append a macro? > (procedure? string-append) #t Is this a Gambit bug or something I do overlook? Keep hacking! Dirk

3 2

Call for participation IFL 2013
by publicityifl＠gmail.com 17 Aoû '13

17 Aoû '13

CALL FOR PARTICIPATION 25th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES - IFL 2013 RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS ACM In-Cooperation / ACM SIGPLAN AUGUST 28 - 30 2013 "Landgoed Holthurnsche Hof" http://ifl2013.cs.ru.nl [program available - late registration still open] We are proud to announce that the 25th edition of the IFL series returns to its roots at the Radboud University Nijmegen in the Netherlands. The symposium is held from 28th to 30th of August 2013. 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 2013 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 2013 will use a post-symposium review process to produce the formal proceedings which will be published in the ACM Digital Library. All participants of IFL 2013 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/Resources/Policies/Republication 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. Hence, publications that appear only in the draft proceedings do not count as publication for the ACM SIGPLAN republication policy. 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. Invited Speaker --------------- Lennart Augustsson, currently employed by the Standard Chartered Bank, well-known for his work on Haskell, parallel Haskell, Cayenne, and Bluespec, is the invited speaker of IFL 2013. The title and abstract of his talk is: "Implementation and Application of Functional Languages - A personal perspective" It is now over 30 years ago since I implemented my first functional language, and over 15 years ago since I wrote my first commercial application. In this talk I will look back to those bygone days and remind you of things that you might have forgotten or never known. The talk will be absolutely free of anything new. 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 ------------------- Thomas Arts, Quviq, Gothenburg, Sweden Andrew Butterfield, Trinity College, Dublin, Ireland Edwin Brady, University of St. Andrews, UK Clemens Grelck, University of Amsterdam, Netherlands Adam Granicz, IntelliFactory, Budapest, Hungary Jeremy Gibbons, University of Oxford, UK Fritz Henglein, University of Copenhagen, Denmark Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (co-chair), University of Oxford, UK Zoltán Horváth, Eötvös Loránd University, Budapest, Hungary Zhenjiang Hu, University of Tokyo, Japan Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Johan Jeuring, University of Utrecht, Netherlands Rita Loogen, University of Marburg, Germany Marco T. Morazán, Seton Hall University, New Jersey, US Dominic Orchard, University of Cambridge, UK Rinus Plasmeijer (chair), Radboud University Nijmegen, Netherlands Tim Sheard, Portland State University, US Sam Tobin-Hochstadt, Northeastern University / Indiana University, US Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Venue ----- The 25th IFL is organized by the Radboud University Nijmegen, Model Based Software Development Department at the Nijmegen Institute for Computing and Information Sciences. The event is held in the Landgoed Holthurnsche Hof, a rural estate in the woodlands surrounding Nijmegen. It can be reached quickly and easily by public transport. Program ------- Wednesday August 28 ------------------- 8:15 registration 8:50 opening 9:00 Marcos Viera First Class Syntax, Semantics, and Their Composition Doaitse Swierstra 9:25 Olivier Danvy Circularity and Lambda Abstraction Peter Thiemann Ian Zerny 9:50 break 10:20 Loic Denuziere Piglets to the rescue Ernesto Rodriguez Adam Granicz 10:45 Simon Fowler Correct and Secure Web Programming using Dependent Types Edwin Brady and Embedded Domain-Specific Languages 11:10 break 11:40 Jennifer Hackett The Under-Performing Unfold: A new approach to optimising Graham Hutton corecursive programs Mauro Jaskelioff 12:05 Laurence Edward Day Compilation á la Carte Graham Hutton 12:30 Artjoms Sinkarovs Functionally Redundant Declarations for Improved Sven-Bodo Scholz Performance Portability 12:55 lunch 14:00 Xavier Clerc OCaml-Java: Typing Java Accesses from OCaml Programs 14:25 Jonathan Protzenko The implementation of the Mezzo type-checker 14:50 break 15:20 Ralf Lämmel The 101haskell chrestomathy Thomas Schmorleiz Andrei Varanovich 15:45 Chide Groenouwe Instant playful access to serious programming for non-programmers with a visual functional programming language 16:10 break 16:40 Arjan Boeijink Supercompiling Haskell to Hardware Philip Hölzenspies Christiaan Baaij Jan Kuper 17:05 Bas van Gijzel Towards a framework for the implementation and verification Henrik Nilson of translations between argumentation models 17:30 end of talks 18:00 dinner 20:00 25th IFL reunion 23:00 Thursday August 29 ------------------ 9:00 Bas Lijnse Supporting Semi-Structured Work using Higher Order Tasks Jan Martin Jansen 9:25 Viktória Zsók A Prototype of CPS Systems 9:50 break 10:20 Majed Al Saeed A Critical Analysis of Parallel Functional Profilers Patrick Maier Phil Trinder Lilia Georgieva 10:45 Vladimir Janjic Using Erlang Skeletons to Parallelise Realistic Christopher Brown Medium-Scale Parallel Programs Kevin Hammond 11:10 break 11:40 Lennart Augustsson Invited talk: Implementation and Application of Functional Languages A personal perspective 12:40 lunch 13:45 - 23:00 Social event: excursion, symposium dinner, Peter Landin award Friday August 30 ---------------- 9:00 Malak Aljabri The Design and Implementation of GUMSMP: Hans-Wolfgang Loidl a Multilevel Parallel Haskell Implementation Phil Trinder 9:25 Henrique Ferreiro Kindergarten Cop: Laura Castro Dynamic Nursery Resizing for Increasing Parallelism in GHC Vladimir Janjic David Castro Kevin Hammond 9:50 break 10:20 Fangyong Tang User-Defined Shape Constraints in SAC Clemens Grelck 10:45 Leaf Petersen Measuring the Haskell Gap Todd Anderson Hai Liu Neal Glew 11:10 break 11:40 Marco T. Morazán Immediate Dominators in Linear Time 12:05 Merijn Verstraaten On Predicting the Impact of Resource Redistribution Sven-Bodo Scholz in Streaming Applications 12:30 IFL 2014 12:40 lunch 14:00 Melinda Tóth Reduction of regression tests for Erlang based on impact analysis István Bozó Zoltán Horváth 14:25 Macías López A DSL for Web Services Automatic Test Data Generation Henrique Ferreiro Laura M. Castro Thomas Arts 14:50 break 15:20 Kanae Tsushima A Weighted Type Error Slicer Kenichi Asai 15:45 Ben Thorner A Type Inference Debugger for ML in Education Kathryn Gray 16:10 break 16:40 Nicolas Wu Structured Sharing for Dynamic Programming 17:05 Clemens Grelck Towards Persistent and Parallel Asynchronous Adaptive Specialisation Heinz Wiesinger for Data-Parallel Array Processing in SAC 17:30 closing

1 0

include'ing libraries
by Dirk Theisen 15 Aoû '13

15 Aoû '13

Hi! I am experiencing problems including digest.scm in client code. Could someone please enlighten me? If I do (include "~~lib/digest#.scm") I cannot access the exported functions. If I do (include "~~lib/digest.scm") I am getting errors of string-append being a macro etc. and all symbols created in my code is now in the digest# namespace. Yes, I tried to goggle this. I found http://dynamo.iro.umontreal.ca/wiki/index.php/Namespaces but it does not mention how to import files that use namespaces. Greetings, Dirk

2 1