{"id":30430520,"url":"https://github.com/carnagion/lamb","last_synced_at":"2025-08-22T18:22:58.093Z","repository":{"id":65438149,"uuid":"585544742","full_name":"Carnagion/lamb","owner":"Carnagion","description":"Pure untyped lambda calculus in safe Rust.","archived":false,"fork":false,"pushed_at":"2023-01-23T16:01:51.000Z","size":62,"stargazers_count":7,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"stable","last_synced_at":"2025-08-20T22:38:07.136Z","etag":null,"topics":["functional-programming","interpreter","lambda-calculus","lambda-calculus-evaluator","lambda-calculus-interpreter","mathematics","parser","programming-language-development","programming-language-theory","repl"],"latest_commit_sha":null,"homepage":"https://crates.io/crates/lamb","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Carnagion.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2023-01-05T12:52:11.000Z","updated_at":"2024-06-16T11:57:28.000Z","dependencies_parsed_at":"2023-02-13T00:46:23.917Z","dependency_job_id":null,"html_url":"https://github.com/Carnagion/lamb","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Carnagion/lamb","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Carnagion%2Flamb","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Carnagion%2Flamb/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Carnagion%2Flamb/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Carnagion%2Flamb/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Carnagion","download_url":"https://codeload.github.com/Carnagion/lamb/tar.gz/refs/heads/stable","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Carnagion%2Flamb/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271680870,"owners_count":24802077,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-22T02:00:08.480Z","response_time":65,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["functional-programming","interpreter","lambda-calculus","lambda-calculus-evaluator","lambda-calculus-interpreter","mathematics","parser","programming-language-development","programming-language-theory","repl"],"created_at":"2025-08-22T18:22:57.052Z","updated_at":"2025-08-22T18:22:58.081Z","avatar_url":"https://github.com/Carnagion.png","language":"Rust","readme":"# Lamb\n\n`lamb` is an implementation of the pure untyped lambda calculus in modern, safe Rust.\n\n# Installation\n\n- ## Library\n\n  Add `lamb` as a dependency in `Cargo.toml`:\n  ```toml\n  [dependencies]\n  lamb = \"0.1.0\"\n  ```\n\n  The Cargo features `repl` and `prelude` can also be enabled to interface with the REPL and prelude:\n  ```toml\n  [dependencies]\n  lamb = { version = \"0.1.0\", features = [\"repl\", \"prelude\"] }\n  ```\n\n- ## Binary\n\n  Install `lamb` through Cargo:\n  ```\n  cargo install lamb\n  ```\n\n# Features\n\n- ## Library\n\n  Default:\n  - Construct terms programmatically\n  - β-reduce terms using different reduction strategies\n  - Implement custom β-reduction strategies\n\n  With `prelude` enabled:\n  - Use pre-defined terms from the prelude\n\n  With `repl` enabled:\n  - Parse terms from strings\n  - Construct REPLs programmatically and execute commands\n\n- ## Binary\n\n  - β-reduce terms using any pre-defined β-reduction strategy:\n    ```\n    λ\u003e (λx. x) (w z)\n    Info: Reduced 1 times\n    w z\n    λ\u003e\n    ```\n  - Bind terms to names to automatically substitute in future free variables:\n    ```\n    λ\u003e id = λx. x; const = λx y. y;\n    Info: Binding id added\n    Info: Binding const added\n    λ\u003e\n    ```\n  - Display or change the β-reduction limit:\n    ```\n    λ\u003e :limit 1024\n    Info: Reduction limit set to 1024\n    λ\u003e :limit\n    Info: Current reduction limit is 1024\n    λ\u003e\n    ```\n  - Exit gracefully:\n    ```\n    λ\u003e :exit\n    ```","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcarnagion%2Flamb","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcarnagion%2Flamb","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcarnagion%2Flamb/lists"}