| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-11-05 | can parse whole programs and load them | Arnaud Bailly | |
| 2025-11-03 | Can parse definitions | Arnaud Bailly | |
| 2025-11-03 | resugar evaluated term | Arnaud Bailly | |
| 2025-10-28 | Provide function to go back from a deBruijn term to an AST | Arnaud Bailly | |
| 2025-10-28 | wip: use de Bruijn indices representation | Arnaud Bailly | |
| provide sample complex terms to evaluate | |||
| 2025-10-27 | Parse multiple let expressions | Arnaud Bailly | |
| 2025-10-27 | Parse let expressions | Arnaud Bailly | |
| 2025-10-17 | feat: can desugar expressions | Arnaud Bailly | |
| 2025-10-17 | feat: pretty-print expressions | Arnaud Bailly | |
| 2025-10-17 | feat: parse an application | Arnaud Bailly | |
| 2025-10-17 | feat: parses single application | Arnaud Bailly | |
| 2025-10-17 | feat: parse λ-expr with multiple bindings | Arnaud Bailly | |
| 2025-10-17 | feat: can parse a simple λ-expression | Arnaud Bailly | |
| 2025-10-17 | feat: can parse an identifier as a variable (symbol) | Arnaud Bailly | |
| 2025-10-17 | feat: introduce parser and AST | Arnaud Bailly | |
 |
index : lambda-nantes | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |