Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
-
Updated
May 22, 2024 - Prolog
Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
Here is a simple interpreter for beta-reduction of terms, which has been implemented using de Bruijn (de Braun) notation.
Representations of lambda terms in a form you can work with
A Lambda Calculus interpreter implemented in C.
construction of de Bruijn graphs using btreemaps
Add a description, image, and links to the de-bruijn-notation topic page so that developers can more easily learn about it.
To associate your repository with the de-bruijn-notation topic, visit your repo's landing page and select "manage topics."