| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-10-27 | Parse let expressions | Arnaud Bailly | |
| 2025-10-27 | Fix evaluation with environment by introducing Value | Arnaud Bailly | |
| 2025-10-27 | Add more tests and references | Arnaud Bailly | |
| 2025-10-17 | feat: main program evaluates s-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 | |
| 2025-10-17 | feat: add basic application to evaluate "programs" | Arnaud Bailly | |
| The main simply reads from its stdin, evaluates its input, and dump the result of the evaluation. | |||
| 2025-10-13 | add minimal evaluator and type inference | Arnaud Bailly | |
 |
index : lambda-nantes | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |