James Eversole dbb5227fbc Somewhat working lambdas
Architectural changes to lambda evaluation and parsing to allow
for correct expression evaluation. Contains several failing AI-generated
tests and we're still failing tests for erroring incomplete definitions
2024-12-27 13:21:30 -06:00
2024-12-27 13:21:30 -06:00
2024-12-27 13:21:30 -06:00
2024-12-27 08:17:06 -06:00
2024-12-18 18:59:07 -06:00
2024-12-18 19:41:12 -06:00
2024-12-18 19:15:56 -06:00
2024-12-18 19:41:12 -06:00
2024-12-18 18:59:07 -06:00

sapling

sapling is a "micro-language" that I'm working on to investigate Tree Calculus .

It offers a minimal amount of syntax sugar:

  • t operator behaving by the rules of Tree Calculus
  • Variable definitions
  • Lambda abstractions
  • List, Integer, and String literals

This is an active experimentation project by someone who has no idea what they're doing.

Acknowledgements

Tree Calculus was discovered by Barry Jay.

treecalcul.us is an excellent website with an intuitive playground created by Johannes Bader that introduced me to Tree Calculus. If sapling sounds interesting but compiling this repo sounds like a hassle, you should check out his site.

Description
A micro-language for exploring Tree Calculus
Readme
Languages
Haskell 97%
Nix 3%