Scheme 2019
2019-08-18
Berlin, Germany
Scheme ·
[Scheme 2019, Scheme 2020, Scheme 2021, Scheme 2022, Scheme 2023, Scheme 2024, Scheme 2025, Scheme 2026]
who it's for
programming language researchers, language implementers, compiler engineers, scheme programmers, functional programmers, Coq users, tool and editor integrators
topics
Lua 5.2 to Scheme transpilation; delimited continuations for coroutines; online partial evaluation with specialization cache; nanopass optimizations for Chez Scheme; visualization of abstract abstract machines; stack-precise abstract garbage collection; non-linear Egison-style pattern matching macros; template splicing and template metafunctions; Idris 2 Scheme backend and quantitative type theory; ordered key-value range store with versioned branches
| title | author | length |
|---|---|---|
| gLua: A modern Lua transpiler in Scheme | Lei Mu | 32m |
gLua implements a Lua 5.2 front end that transpiles Lua into Scheme-based IR and runs on the Gaia/Guile platform, reusing Scheme modules and calling back into… | ||
| Reigniting Fuse, an Online Partial Evaluator for Scheme | Paulette Koronkevich | 19m |
Reignites Fuse, an online partial evaluator for Scheme that actually terminates by combining a specialization cache (indexing by symbolic value attributes)… | ||
| Lightning talk: Commanding Emacs from Coq | Joomy Korkut | 15m |
Defines a monadic eDSL in Coq that models atomic editor actions (get-char, remove-char, insert-char) and builds an Emacs Lisp interpreter that talks to Coq… | ||
| Keynote – Andy Keep | Andy Keep | 01h 07m |
Chez Scheme uses a nanopass framework to add tiny, targeted optimizations that measurably shrink and speed code: a predicate-in-value-context pass collapses… | ||
| Visualizing Abstract Abstract Machines | Kyle Headly, Clark Ren | 28m |
An interactive web visualizer called analysis vis Gilray dotnet renders AAM-derived static analyses as nested graphs, implements a segmentation algorithm that… | ||
| Stack-Liberated Abstract Garbage Collection | Kimball Germane, Michael Adams | 25m |
Paper claims abstract garbage collection can keep context irrelevance by scoping the store to a single local environment and passing effects explicitly. It… | ||
| Scheme Macros for Non-linear Pattern Matching with Backtracking for Non-free Data Types | Satoshi Egi | 30m |
Claims an efficient embedding of Egison-style patterns on top of the Scheme macro system, implementing non-linear pattern matching with backtracking for… | ||
| Syntax Templates | Ryan Culpepper | 29m |
Adds three concrete extensions to Racket’s template language: template splicing (tilde-at) for producing non‑parenthesized sequences under ellipses, a… | ||
| Keynote – Edwin Brady | Edwin Brady | 01h 06m |
A tour of Idris 2 shows concrete changes: a Scheme backend that compiles in an afternoon and runs faster than Idris 1, an internal “generate definition”… | ||
| SRFI-167, SRFI-168 and the functional store | Amirouche Boubekki | 23m |
Describes an implementation of SRFI-167/168 as an ordered key-value ranges store supporting range scans, prefix matching and lexicographic packing; shows a… | ||
| nothing matches | ||