{"id":19730523,"url":"https://github.com/begriffs/master_forest","last_synced_at":"2026-04-17T06:01:56.484Z","repository":{"id":56882929,"uuid":"5925509","full_name":"begriffs/master_forest","owner":"begriffs","description":"Combinatory logic parsing and reduction gem","archived":false,"fork":false,"pushed_at":"2012-09-26T16:49:36.000Z","size":144,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-21T18:54:47.737Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Ruby","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/begriffs.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.txt","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-09-23T19:45:32.000Z","updated_at":"2014-06-07T02:35:04.000Z","dependencies_parsed_at":"2022-08-20T22:31:08.894Z","dependency_job_id":null,"html_url":"https://github.com/begriffs/master_forest","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/begriffs/master_forest","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begriffs%2Fmaster_forest","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begriffs%2Fmaster_forest/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begriffs%2Fmaster_forest/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begriffs%2Fmaster_forest/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/begriffs","download_url":"https://codeload.github.com/begriffs/master_forest/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begriffs%2Fmaster_forest/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31917372,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"online","status_checked_at":"2026-04-17T02:00:06.879Z","response_time":62,"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":[],"created_at":"2024-11-12T00:16:38.983Z","updated_at":"2026-04-17T06:01:56.358Z","avatar_url":"https://github.com/begriffs.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Master Forest\n\nThis gem parses and reduces combinatory logic written in Lazy K syntax.\n\n## Usage\n\n\u003ctable\u003e\n  \u003ccaption\u003eMasterForest::Term methods\u003c/caption\u003e\n  \u003ctbody\u003e\n  \u003ctr\u003e\u003ctd\u003einitialize(string)\u003c/td\u003e  \u003ctd\u003eargument is a Lazy K string\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003eleaf?\u003c/td\u003e               \u003ctd\u003eIs it a single letter like `s`, `k`, or `i`?\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003evalid?\u003c/td\u003e              \u003ctd\u003eIs it syntactically valid?\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003enormal?\u003c/td\u003e             \u003ctd\u003eIs it in normal form? (i.e. not further reducible)\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003eto_s\u003c/td\u003e                \u003ctd\u003eSerialize back to Lazy K\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003el\u003c/td\u003e                   \u003ctd\u003eLeft applicand; nil if leaf\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003er\u003c/td\u003e                   \u003ctd\u003eRight applicand; nil if leaf\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003ereduce\u003c/td\u003e              \u003ctd\u003eReturn single β reduction of term or term itself\u003c/td\u003e\u003c/tr\u003e\n  \u003ctr\u003e\u003ctd\u003efully_reduce(depth)\u003c/td\u003e \u003ctd\u003eReduce depth times or until normal, default depth is ∞\u003c/td\u003e\u003c/tr\u003e\n  \u003c/tbody\u003e\n\u003c/table\u003e\n\n## Performance\n\nThis gem includes two implementations of the same functionality,\n`MasterForest::Term` and `MasterForest::MemcacheTerm`. If you\nrun memcache then the latter will use it to memoize previous\nreductions. This goes much faster. You can test the speed by running\n`benchmark/run.rb`.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegriffs%2Fmaster_forest","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbegriffs%2Fmaster_forest","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegriffs%2Fmaster_forest/lists"}