| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-09-25 | Evaluate terms recursively on application | Arnaud Bailly | |
| 2024-09-25 | Evaluate both side of application | Arnaud Bailly | |
| 2024-09-24 | alpha-conversion when substituting variables under lambda | Arnaud Bailly | |
| 2024-09-24 | Substitution occurs under application | Arnaud Bailly | |
| 2024-09-24 | Fix (naive) substitution under lambda | Arnaud Bailly | |
| 2024-09-24 | Basic substitution for a single variable | Arnaud Bailly | |
| 2024-09-24 | Push down tests at parser level | Arnaud Bailly | |
| Interpret now is a Value-transforming function | |||
| 2024-09-24 | Split module into ast and parser | Arnaud Bailly | |
| 2024-09-24 | Ignore whitespaces in input | Arnaud Bailly | |
| 2024-09-23 | Introduce symbols | Arnaud Bailly | |
| 2024-09-23 | Can parse and evaluate boolean atoms | Arnaud Bailly | |
| 2024-09-23 | Add property for evaluating numbers | Arnaud Bailly | |
| 2024-09-23 | Scaffolding of main, library, and tests | Arnaud Bailly | |
 |
index : lambda-nantes | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |