Scheme and Functional Programming Workshop 2018

Saint Louis, MO, United States

Co-located with ICFP 2018

Important Dates

Submission deadline
July 23, 2018 (AoE)
Author notification
August 3, 2018 (AoE)
Camera-ready deadline
September 9, 2018 (AoE)
September 28, 2018

Important Links

The Scheme and Functional Programming Workshop is a yearly meeting of programming languge practitioners who share an aesthetic sense embodied by the Algorithmic Language Scheme: universality through minimalism, and flexibility through rigorous design.

Friday, September 28th, 2018, in Saint Louis, Missouri, USA
  • 09:00-10:00 Keynote: David Van Horn
  • 10:10-10:20 Break 1
  • 10:20-10:40 Paper Presentation: Arthur Gleckler, Growing Schemes: Twenty Years of Scheme Requests for Implementation [PDF]
  • 10:40-11:00 Paper Presentation: Satoshi Egi, Loop Patterns: Extension of Kleene Star Operator for More Powerful Pattern Matching against Arbitrary Data Structures [PDF]
  • 11:00-11:20 Break 2
  • 11:20-11:40 Paper Presentation: Nathaniel Rudavsky-Brody, Temporal Logic, μKanren, and a Time-Traveling RDF Database [PDF]
  • 11:40-12:00 Paper Presentation: Benjamin Boskin, Weixi Ma, David Thrane Christiansen, and Daniel Friedman, A Surprisingly Competitive Conditional Operator: miniKanrenizing the Inference Rules of Pie [PDF]
  • 12:00-13:30 Lunch
  • 13:30-13:50 Paper Presentation: Kristopher Micinski, Zhanpeng Wang, and Thomas Gilray, Racets: Faceted Execution in Racket [PDF]
  • 13:50-14:10 Paper Presentation: Andre Kuhlenschmidt, Deyaaeldeen Almahallawi, and Jeremy G. Siek, An Efficient Compiler for the Gradually Typed Lambda Calculus [PDF]
  • 14:10-14:30 Break 3
  • 14:30-14:50 Paper Presentation: Eric Holk, Schism: A Self-Hosting Scheme to WebAssembly Compiler [PDF]
  • 14:50-15:10 Paper Presentation Laurent Huberdeau and Marc Feeley, Tail Calling Between Code Generated by C and Native Backends [PDF]
  • 15:10-15:30 Break 4
  • 15:30-16:10 Invited Talk: Matthew Flatt

We invite high-quality papers about novel research results, lessons learned from practical experience in industrial or educational setting, and even new insights on old ideas. We welcome and encourage submissions that apply to any language that can be considered Scheme: from strict subsets of RnRS to other "Scheme" implementations, to Racket, to Lisp dialects including Clojure, Emacs Lisp, Common Lisp, to functional languages with continuations and/or macros (or extended to have them) such as Dylan, ECMAcript, Hop, Lua, Scala, Rust, etc. The elegance of the paper and the relevance of its topic to the interests of Schemers will matter more than the surface syntax of the examples used. Topics of interest include (but are not limited to):

  • Interaction: program-development environments, debugging, testing, refactoring
  • Implementation: interpreters, compilers, tools, garbage collectors, benchmarks
  • Extension: macros, hygiene, domain-specific languages, reflection, and how such extension affects interaction.
  • Expression: control, modularity, ad hoc and parametric polymorphism, types, aspects, ownership models, concurrency, distribution, parallelism, non-determinism, probabilism, and other programming paradigms
  • Integration: build tools, deployment, interoperation with other languages and systems
  • Formal semantics: Theory, analyses and transformations, partial evaluation
  • Human Factors: Past, present and future history, evolution and sociology of the language Scheme, its standard and its dialects
  • Education: approaches, experiences, curricula
  • Applications: industrial uses of Scheme
  • Scheme pearls: elegant, instructive uses of Scheme

Please submit full papers and experience reports to our Submission Page.

[NEW SINCE 2017!] Paper submissions must use the format acmart and its sub-format acmlarge. They must be in PDF, printable in black and white on US Letter size. Microsoft Word and LaTeX templates for this format are available at:

This change is in line with ACM conferences (such as ICFP with which we are colocated) switching from their traditional two-column formats (e.g. sigplanconf) to the above. While a two-column format with small fonts is much more practical when reading printed papers, the single-column format with large fonts is nicer to view on a computer screen, as most papers are read these days.

To encourage authors to submit their best work, we offer three tracks:
  • Full Papers, with a limit of 14 pages. Each accepted paper will be presented by its authors in a 25 minute slot including Q&A.
  • Experience Reports, with a limit of 14 pages. Each accepted report will be presented by its authors in a 25 minute slot including Q&A.
  • Lightning talks, with a limit of 192 words. Each accepted lightning talk will be presented by its authors in a 5 minute slot, followed by 5 minutes of Q&A.

The size limits above exclude references and any optional appendices. There are no size limits on appendices, but the papers should stand without the need to read them, and reviewers are not required to read them.

Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims.

Proceedings will be printed as a Technical Report at the University of Alabama at Birmingham.

Publication of a paper at this workshop is not intended to replace conference or journal publication, and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal.

  • Claire Alvis, Sparkfund, USA
  • William Byrd (Program Committee Chair), University of Alabama at Birmingham, USA
  • Maxime Chevalier-Boisvert, Université de Montréal, Canada
  • John Clements (General Chair), Cal Poly State University, USA
  • Ronald Garcia, University of British Columbia, Canada
  • Yukiyoshi Kameyama, University of Tsukuba, Japan
  • Paul Steckler, Boston, MA, USA
  • Larisse Voufo, Google, USA