{"id":16169072,"url":"https://github.com/omentic/mechanicals","last_synced_at":"2026-02-03T10:02:05.497Z","repository":{"id":239979516,"uuid":"800779798","full_name":"omentic/mechanicals","owner":"omentic","description":"Various implementations of the lambda calculus and friends","archived":false,"fork":false,"pushed_at":"2024-10-24T01:10:09.000Z","size":165,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-20T02:44:53.940Z","etag":null,"topics":["bidirectional-typechecking","lambda-calculus"],"latest_commit_sha":null,"homepage":"","language":"Racket","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"0bsd","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/omentic.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-15T01:33:05.000Z","updated_at":"2024-10-24T01:10:13.000Z","dependencies_parsed_at":"2024-05-16T06:16:51.739Z","dependency_job_id":"6cf2b703-d6b2-4d60-bda7-906a0ad80051","html_url":"https://github.com/omentic/mechanicals","commit_stats":null,"previous_names":["omentic/mechanicals"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/omentic/mechanicals","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/omentic%2Fmechanicals","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/omentic%2Fmechanicals/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/omentic%2Fmechanicals/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/omentic%2Fmechanicals/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/omentic","download_url":"https://codeload.github.com/omentic/mechanicals/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/omentic%2Fmechanicals/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29040741,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-03T09:57:37.951Z","status":"ssl_error","status_checked_at":"2026-02-03T09:55:14.920Z","response_time":96,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["bidirectional-typechecking","lambda-calculus"],"created_at":"2024-10-10T03:14:03.291Z","updated_at":"2026-02-03T10:02:05.480Z","avatar_url":"https://github.com/omentic.png","language":"Racket","funding_links":[],"categories":[],"sub_categories":[],"readme":"# the mechanicals\n\nVarious implementations of the lambda calculus (and friends).\n\nThe code here is hopefully pretty readable: but makes heavy use of quasiquoting, and contracts. \\\nFor an introduction to quasiquoting, see [*Explaining Lisp's quoting without getting tangled*](quasiquoting). For an introduction to contracts, see [*Simple contracts on functions*](https://docs.racket-lang.org/guide/contract-func.html).\n\n* untyped\n  * [ ] lc.rkt: The untyped lambda calculus.\n  * [ ] ski.rkt: The SKI combinator calculus.\n  * [ ] iota.rkt, jot.rkt, zot.rkt: Implementations of Chris Barker's combinator languages.\n  * [ ] aviary.rkt: Various combinators and constructions of equivalence.\n* simple\n  * [x] stlc.rkt: The simply-typed lambda calculus.\n  * [x] ext.rkt: Simple extensions. Sums, products, lists, ascryptions.\n  * [x] fix.rkt: General recursion.\n  * [x] rec.rkt: Iso-recursive types.\n  * [x] ref.rkt: References. No garbage collection. Nonterminating.\n* research\n  * [x] hor.rkt: Higher-order im/predicative references. Terminating.\n  * [x] dll.rkt: Doubly-linked lists via sums, products, ascryption, recursive types, and impredicative references. Terminating?\n  * [x] levels.rkt: Higher-order im/predicative references with an algebraic level system. Terminating?\n\n\n[quasiquoting]: https://cadence.moe/blog/2022-10-17-explaining-lisp-quoting-without-getting-tangled\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fomentic%2Fmechanicals","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fomentic%2Fmechanicals","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fomentic%2Fmechanicals/lists"}