summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2024-10-09Use 32 bits seed for generating termsArnaud Bailly
2024-10-09[wip] generate nested terms through pairing functionArnaud Bailly
2024-10-09[wip] client generates applications with more than 2 termsArnaud Bailly
2024-10-09Derive seed for Rng from client idArnaud Bailly
2024-10-09Generate simple lambda formsArnaud Bailly
2024-10-08Generate nested binary applicationsArnaud Bailly
Also factor out common strategies into functions
2024-10-08Generate simple applicationsArnaud Bailly
2024-10-07Change delay on test success/failureArnaud Bailly
2024-10-06Use proptest's Strategy to generate expressionsArnaud Bailly
2024-10-06Restructure Client to contain all test execution logicArnaud Bailly
2024-10-06Spawn one thread per registered clientArnaud Bailly
2024-10-05Server can also evaluate expressionsArnaud Bailly
2024-10-05Basic loop to send requests to registered clientsArnaud Bailly
2024-10-04Spawn thread to start sending requests to clientsArnaud Bailly
2024-10-04Client can only register once with same URLArnaud Bailly
Actually, logic is now mocked so tests should be refactored to test the logic one level down
2024-10-04[wip] client can only register once with same URLArnaud Bailly
2024-10-04Generate new id upon receiving registration requestArnaud Bailly
2024-10-03Test post with registration echoed backArnaud Bailly
2024-10-03Introduce web app using actix-webArnaud Bailly
2024-10-01Rename eval() to be more specificArnaud Bailly
2024-10-01Simplify eval() to match WHNF definitionArnaud Bailly
2024-10-01Output tester's result in JSONArnaud Bailly
2024-10-01Add test for natural numbers additionArnaud Bailly
2024-09-30Add some documentation and a sample for pairsArnaud Bailly
2024-09-29Implement sub-process based testerArnaud Bailly
2024-09-29More sample basic lambda termsArnaud Bailly
2024-09-29[wip] Draft tester programArnaud Bailly
The goal is to have a simple CLI that will repeatedly run sequence of tests against a known (Rest-ish) API, until all tests are "green".
2024-09-25Extract IO operations to own moduleArnaud Bailly
2024-09-25Ensure application has at least two valuesArnaud Bailly
2024-09-25Desugar application of more than 2 valuesArnaud Bailly
2024-09-25Allow multiple variables in single lambdaArnaud Bailly
2024-09-25Check variables are resolved across scopesArnaud Bailly
2024-09-25Introduce basic REPLArnaud Bailly
2024-09-25Let creates a new environmentArnaud Bailly
2024-09-25Introduce let-expressionsArnaud Bailly
2024-09-25Parse definitions of symbolsArnaud Bailly
2024-09-25Can parse and evaluate multiple expressions from a single inputArnaud Bailly
2024-09-25Prepare parser to return multiple valuesArnaud Bailly
2024-09-25Add integration test for normal formArnaud Bailly
2024-09-25Evaluate in normal order until normal form is reachedArnaud Bailly
2024-09-25Evaluate terms recursively on applicationArnaud Bailly
2024-09-25Evaluate both side of applicationArnaud Bailly
2024-09-24alpha-conversion when substituting variables under lambdaArnaud Bailly
2024-09-24Substitution occurs under applicationArnaud Bailly
2024-09-24Fix (naive) substitution under lambdaArnaud Bailly
2024-09-24Add integration test for applicationArnaud Bailly
2024-09-24Basic substitution for a single variableArnaud Bailly
2024-09-24Inline next token advanceArnaud Bailly
2024-09-24Parse abstractionsArnaud 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-24Introduce recursive descent parserArnaud Bailly
generated by cgit v1.2.3 (git 2.39.1) at 2026-02-06 06:36:13 +0000