I'm happy to announce that our paper, "Implementing Baker’s SUBTYPEP
procedure", has been accepted to the 12th European Lisp Symposium, to be
in Genova on April 1-2 2019. The abstract is given below.
Authors: Léo Valais, Jim Newton and Didier Verna
We present here our partial implementation of Baker’s decision
procedure for SUBTYPEP. In his article “A Decision Procedure for
Common Lisp’s SUBTYPEP Predicate”, he claims to provide
implementation guidelines to obtain a SUBTYPEP more accurate and as
efficient as the average implementation. However, he did not
provide any serious implementation and his description is sometimes
obscure. In this paper we present our implementation of part of his
procedure, only supporting primitive types, CLOS classes, member,
range and logical type specifiers. We explain in our words our
understanding of his procedure, with much more detail and examples
than in Baker’s article. We therefore clarify many parts of his
description and fill in some of its gaps or omissions. We also argue
favor and against some of his choices and present our alternative
solutions. We further provide some proofs that might be missing
in his article and some early efficiency results. We have not
released any code yet but we plan to open source it as soon as it is
I'm happy to report that my article entitled "Parallelizing Quickref"
has been accepted to the 12th European Lisp Symposium, to be held in
Genova on April 1-2 2019. The abstract is given below. I will also give
a demo session of Quickref itself at the <Programming> conference.
Quickref is a global documentation project for Common Lisp software.
It builds a website containing reference manuals for Quicklisp
libraries. Each library is first compiled, loaded, and introspected.
From the collected information, a Texinfo file is generated, which is
then processed into HTML. Because of the large number of libraries in
Quicklisp, doing this sequentially may require several hours of
processing. We report on our experiments parallelizing Quickref.
Experimental data on the morphology of Quicklisp libraries has been
collected. Based on this data, we are able to propose a number of
parallelization schemes that reduce the total processing time by a
factor of 3.8 to 4.5, depending on the exact situation.
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info