Binding in lambda calculi is notoriously prone to error, and isn't a problem where formalization is an immediate defense because this is a question of correct definitions. Especially because we will have multiple implementations of binding, I'd like to have a set of tests that give us a bit more confidence that we've written the correct definitions. I'd like to start with the existing locally nameless STLC and port something like what exists at https://github.com/sweirich/lambda-n-ways into a suite of tests.
Help is welcome with this issue since I have somewhat limited time at the moment.
Binding in lambda calculi is notoriously prone to error, and isn't a problem where formalization is an immediate defense because this is a question of correct definitions. Especially because we will have multiple implementations of binding, I'd like to have a set of tests that give us a bit more confidence that we've written the correct definitions. I'd like to start with the existing locally nameless STLC and port something like what exists at https://github.com/sweirich/lambda-n-ways into a suite of tests.
Help is welcome with this issue since I have somewhat limited time at the moment.