Hi Frogs,

as an exercise, I've started implementing a interpreter for a little programming language based on deep inference (in the Curry-Howard sense). The implementation is in Scala and is shared here on GitHub. Take a look if you're interested. It can already do amazing things: you could execute a program that takes an ordered pair and returns its first component!

Comments and contributions are welcome, of course! I've just barely started, so it should be easy to get into. I'm currently in the process of implementing a parser (yes, right now programs are given as abstract syntax trees), and then I'd like to add lots of example programs to test the interpreter and the type inference and to experiment with the language.

Oh yes, the paper it is based on is "An Algorithmic Interpretation of a Deep Inference System" by Richard and myself, available from here, if you'd like some background.

Best wishes and maybe happy hacking!

-Kai