A Lambda Term Representation Inspired by Linear Ordered Logic — mentioned by chriswarbo

Mon, 19 Oct 2020 16:03:08 GMT

There are tricky aspects, and I've tripped up a few times over the years. Most annoying is trying to make a 'step' function from lambda terms to lambda terms; we either need to produce a separate closure type instead, or encode those closures to lambda terms (which may defeat the point of "reducing"), or perform explicit substitution a la call-by-name (duplicating work). I don't think I've ever got all the details of capture-avoiding substitution right (I get part way there, then just copy/paste someone else's code ;) ). Of course, de Bruijn indices can help with this, and I'm a big fan. They…

Paper and discussion history. A mention is not an endorsement.

A Lambda Term Representation Inspired by Linear Ordered Logic · HackerPapers discussions

A Lambda Term Representation Inspired by Linear Ordered Logic — mentioned by chriswarbo