| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-01-25 | Move λ-calcul workshop code to subdirectory | Arnaud Bailly | |
| 2024-10-09 | Fix tests and app spines representations | Arnaud Bailly | |
| 2024-10-09 | [wip] generate nested terms through pairing function | Arnaud Bailly | |
| 2024-10-09 | [wip] client generates applications with more than 2 terms | Arnaud Bailly | |
| 2024-10-08 | Generate simple applications | Arnaud Bailly | |
| 2024-10-06 | Use proptest's Strategy to generate expressions | Arnaud Bailly | |
| 2024-10-05 | Basic loop to send requests to registered clients | Arnaud Bailly | |
| 2024-09-25 | Introduce let-expressions | Arnaud Bailly | |
| 2024-09-25 | Parse definitions of symbols | Arnaud Bailly | |
| 2024-09-24 | Parse abstractions | Arnaud Bailly | |
| Got tricked with or()'s function eagerness: Even when the left hand side succeeds, the argument was evaluated which consumed a token in the parser which prevented proper parsing. | |||
| 2024-09-24 | Parse binary application with parens | Arnaud Bailly | |
| 2024-09-24 | Split module into ast and parser | Arnaud Bailly | |
 |
index : lambda-nantes | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |