default search action
10th ELS 2017: Brussels, Belgium
- Alberto Riva:
Proceedings of the 10th European Lisp Symposium (ELS 2017), Brussels, Belgium, April 3-4, 2017. ELSAA 2017, ISBN 978-2-9557474-1-4
Tools
- Michal Herda:
Common Lisp UltraSpec - A Project For Modern Common Lisp Documentation. 4-9 - Vsevolod Domkin:
Loading Multiple Versions of an ASDF System in the Same Lisp Image. 10-18
Types
- Frédéric Peschanski:
A Lisp Way to Type Theory and Formal Proofs. 20-27 - Jim E. Newton, Didier Verna, Maximilien Colange:
Programmatic Manipulation of Common Lisp Type Specifiers. 28-35 - Alexander Wood:
Type Inference in Cleavir. 36-39
Demonstrations
- Robert Goldman, Elias Pipping, François-René Rideau:
Delivering Common Lisp Applications with ASDF 3.3. 42-43 - Nicolas Hafner:
Radiance - a Web Application Environment. 44-48 - Daniel Brunner, Stephan Brunner:
Teaching Students of Engineering some Insights of the Internet of Things using Racket and the RaspberryPi. 49-50 - Benjamin Seppke, Leonie S. Dreschler-Fischer:
Interactive Functional Medical Image Analysis. 51-52
Applications
- Marco Heisig, Nicolas Neuss:
Parallelizing Femlisp. 54-55
Tutorials
- Steve Losh:
General Game Playing in Common Lisp. 58-61
Languages and Meta-Languages
- Irène Durand, Robert Strandh:
Fast, Maintainable, and Portable Sequence Functions. 64-71 - Alexander Lier, Kai Selgrad, Marc Stamminger:
DIY Meta Languages with Common Lisp. 72-79 - Jonas De Bleser, Quentin Stiévenart, Jens Nicolay, Coen De Roover:
Static Taint Analysis of Event-driven Scheme Programs. 80-87 - Alain Marty:
On the Lambda Way. 90-97 - Michael A. Raskin:
Writing a Portable Code Walker in Common Lisp. 98-105 - Irène Durand, Robert Strandh:
Removing Redundant Tests by Replicating Control Paths. 106-112
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.