durin VS pika

So I think I may be one of the few people in the world who has actually implemented a GC using LLVM's statepoint infrastructure. It's poorly documented and there are some gotchas, but I'd say it's definitely usable, and it works with basically any collector design, including moving collectors (I'm using Immix) and has no runtime bookkeeping overhead and allows LLVM to optimize the code without worrying about GC, which is nice. It's actually gotten a bit better with LLVM 13, too. If you're curious what a LLVM-based GC looks like, mine is in this folder. Of course, if you just want some sort of GC, you can also just link it with Boehm which is quite easy and has pretty good performance - this is what e.g. Crystal does, although they're talking about switching.

I also fixed lots of bugs in the GC and backend, so it should be a lot more stable now.

Recently, I've been working on adding garbage collection to Pika. I've successfully written an Immix-based garbage collector that works with the LLVM GC support infrastructure, and I'm currently working on integrating the GC with Pika, or really Durin, the dependently-typed intermediate representation that Pika compiles to. Because types are passed around at runtime, objects of unknown type and size can be stored unboxed in polymorphic data structures; but that makes keeping track of type information for heap allocations somewhat harder, because type information needs to be allocated and constructed at runtime in some cases. It's an interesting design problem, because you want constructing type information to be fast; but the GC will run much more often, so maximizing tracing speed by avoiding e.g. indirection in type information is important; and you also want to construct as much type information as possible at compile time and embed it as constants.

I just switched Pika to using significant indentation. This is mostly because of how annoying line continuation is in a ML-style language (so f a b syntax) without significant indentation or required semicolons, but you can read more about the reasons for that decision in this section of the README.

Recently, I've been working on adding garbage collection to Pika. I've successfully written an Immix-based garbage collector that works with the LLVM GC support infrastructure, and I'm currently working on integrating the GC with Pika, or really Durin, the dependently-typed intermediate representation that Pika compiles to. Because types are passed around at runtime, objects of unknown type and size can be stored unboxed in polymorphic data structures; but that makes keeping track of type information for heap allocations somewhat harder, because type information needs to be allocated and constructed at runtime in some cases. It's an interesting design problem, because you want constructing type information to be fast; but the GC will run much more often, so maximizing tracing speed by avoiding e.g. indirection in type information is important; and you also want to construct as much type information as possible at compile time and embed it as constants.

I've been working on adding algebraic effects to Pika during the past month. It's turned out to be harder than I thought it would, but I'm almost done - performing and catching one effect at a time works, and the compilation strategy I'm using now (I reimplemented the whole thing after realizing the strategy I was using wouldn't actually work) should be enough to handle multiple effects at once and also effect polymorphism, I just have to get those working in the elaborator.

After taking a break from Pika, my dependently-typed ML for systems programming, during the month of January, I've started working on it again by getting recursion to work properly. I'm planning on starting to implement algebraic effects next, and an Immix-based garbage collector for boxed values after that. Here's what my current plan for algebraic effects looks like: