Scheme and Functional Programming Workshop 2016

Nara, Japan

Co-located with ICFP 2016

Photo by inefekt69, CC 2.0

Important Dates

Submission deadline
June 24th, 2016
Author notification
July 22th, 2016
Camera-ready deadline
August 18th, 2016
Workshop
September 18th, 2016

Important Links

Celebrating 80 years of Lambda Calculus!

This year marks the 80th anniversary of Church's lambda calculus, from which Scheme was inspired.

9:15-9:25
Opening Remarks
Alex Shinn
9:25-10:15
Invited Talk: A verified Lisp implementation for a verified theorem prover (slides)
Magnus Myreen
10:15-10:45
Coffee Break
10:45-11:15
A Scheme concurrency library (slides)
Authors: Takashi Kato
11:15-11:45
Nash: a tracing JIT for Extension Language (slides)
Authors: Atsuro Hoshino
11:45-12:15
Ghosts in the machine (slides)
Authors: Daniel Szmulewicz
12:15-14:00
Lunch
14:00-14:20
R7RS update
14:20-15:00
Invited Talk: GNU Guix: The Functional GNU/Linux Distro That’s a Scheme Library (slides)
Ludovic Courtès
15:00-15:30
Break
15:30-16:00
Function compose, Type cut, And the Algebra of logic
Authors: XIE Yuheng
16:00-16:30
Multi-purpose web framework design based on websocket over HTTP Gateway
Authors: Mu Lei
15:00-15:30
Break
17:00-17:30
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme (slides)
Authors: Dakota Fisher, Matthew Hammer, William Byrd, Matthew Might
17:30-18:00
Deriving Pure, Functional One-Pass Operations for Processing Tail-Aligned Lists
Authors: Jason Hemann, Daniel P. Friedman
After Hours Event
Dinner at Japanese Restaurant Happou
Ghosts in the machine
Daniel Szmulewicz
A Scheme concurrency library
Takashi Kato
Nash: a tracing JIT for extension language
Atsuro Hoshino
Function compose, Type cut, And the Algebra of logic
XIE Yuheng
Multi-purpose web framework design based on websocket over HTTP Gateway
Mu Lei
Deriving Pure, Functional One-Pass Operations for Processing Tail-Aligned Lists
Jason Hemann, Daniel P. Friedman
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme
Dakota Fisher, Matthew Hammer, William Byrd, Matthew Might

Submissions related to Scheme, Racket, Clojure, and functional programming are welcome and encouraged. This year we are accepting general presentation proposals in addition to papers. Topics of interest include but are not limited to:

  • Program-development environments, debugging, testing
  • Implementation (interpreters, compilers, tools, benchmarks, etc.)
  • Syntax, macros, hygiene
  • Distributed computing, concurrency, parallelism
  • Probabilistic computing
  • Interoperability with other languages, FFIs
  • Continuations, modules, object systems, types
  • Theory, formal semantics, correctness
  • History, evolution and standardization of Scheme
  • Applications, experience and industrial uses of Scheme
  • Education
  • Scheme pearls (elegant, instructive uses of Scheme)

We also welcome submissions related to dynamic or multiparadigmatic languages and programming techniques.

Paper submissions must be in ACM proceedings format, no smaller than 9-point type (10-point type preferred). Microsoft Word and LaTeX templates for this format are available at:

http://www.acm.org/sigs/sigplan/authorInformation.htm

Paper submissions should be in PDF and printable on US Letter, and generally in the range of 6 to 12 pages.

Presentation submissions should include an outline of the material. Talks are 40 minutes, including questions and answers.

  • Kathy Gray (program chair)
  • Matthew Might
  • Shiro Kawai
  • Alex Shinn (general chair)
  • Ramana Kumar
  • Claire Alvis
  • Steve Shogren
  • Alexey Radul