Massimiliano Ghilardi

You mean to allow replacing a generated function with a different one, and updating all calls to it? That certainly is a useful feature when needed. But is there also...

I am actually starting to use MIR as (one of) the backend for a small JIT project. Would you be willing to accept a PR for an additional optimizazion flag...

Hi @vnmakarov, the function `_MIR_get_thunk_addr` in branch **bbv** contains: ```C void *_MIR_get_thunk_addr (MIR_context_t ctx, void *thunk) { void *addr; memcpy ((char *) &addr, (char *) thunk + 2, sizeof (addr));...

Exactly, pure lisp. It started as an exercise to demonstrate that c++-style templates can be implemented using macros, including partial specialization and compile-time Turing completeness. My interest decreased when I...

Definitely interesting :-)

I had a look, and it really tries to _replicate_ C++ up to the last detail, including compile-time conditionals to decide between C++98 and some other version of the C++...

I am currently implementing the following template structs: - BIVECTOR - a resizeable vector that can efficiently grow and shrink at both ends - BINARY-TREE - a sorted binary tree,...

At the moment, BIVECTOR is both C++ std::vector and std::deque. Good point, I will rename it to DEQUE. More generally, this is the right time to start deciding names, and...

Hello guicho, my intention is to go beyond beta :) This project was surprisingly quick to move from ALPHA to BETA to "almost ready", and on-demand instantiation of template structs,...

Before I forget... another missing feature is that I don't know yet how to perform compile-time automatic resolution of overloaded functions. At the moment I have implemented _manual_ resolution...