Christian Schafmeister

We had to make some changes to how jupyter widgets are packaged to ease keeping up with the rapidly changing Python jupyter widgets. https://github.com/clasp-developers/cl-ipykernel.git https://github.com/clasp-developers/cl-ipywidgets.git https://github.com/clasp-developers/cl-nglview.git https://github.com/clasp-developers/cl-bqplot.git

It looks like we have some competing implementations for Shift-Tab completion. Whatever ends up in cl-jupyter - it should display lambda lists for functions.

The clasp project (https://github.com/clasp-developers/clasp.git) is a Boehm client that needs this functionality. I'm looking into what would be required to implement it.

I found a way around it. I don't use the GC to allocate large blocks to put JITted code into them. Instead I use `mmap` with `MAP_JIT` and the bdwgc...

Is there much of a cost to using `GC_add_roots(...)` - once we build our entire system there will be about 12,000 blocks of roots. I figure it can't be worse...

I found out - there is a hard limit of 8192 root sets (using `#define LARGE_CONFIG`). I will investigate turning that into a dynamic array. I'll need more root sets...

I am also trying to implement an incremental mark procedure. I wonder if the 'env' argument is supposed to be used to carry the mark state, the amount of marking...

Hi there - I'm interested in this project as well. We are developing a jupyterlab kernel in Common Lisp for data science and molecular design. jupyterlab appears to be moving...

Hello, I've been traveling and forgot to get back to you. My programmer, Shiho Nagai is Japanese and she can communicate between us. I have included her in this email....

Hey - thanks for getting back to me. So you do not use an implementation of the VF2 algorithm to assign parameters? Huh - I thought that the VF2 algorithm...