{"id":15168702,"url":"https://github.com/branebb/simply-typed-lambda-calculus","last_synced_at":"2026-02-09T01:04:02.501Z","repository":{"id":247288737,"uuid":"825459292","full_name":"branebb/simply-typed-lambda-calculus","owner":"branebb","description":"Final project for the Master’s degree course Semantics of Programming Languages.","archived":false,"fork":false,"pushed_at":"2026-01-18T16:16:05.000Z","size":12,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-19T00:39:37.396Z","etag":null,"topics":["coq","coq-formalization","haskell","lambda"],"latest_commit_sha":null,"homepage":"https://www.mathos.unios.hr/en/kolegiji/semantika-programskih-jezika/","language":"Haskell","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/branebb.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-07-07T20:42:53.000Z","updated_at":"2026-01-18T16:16:09.000Z","dependencies_parsed_at":"2024-07-07T22:03:21.190Z","dependency_job_id":null,"html_url":"https://github.com/branebb/simply-typed-lambda-calculus","commit_stats":null,"previous_names":["branebb/simply-typed-lambda-calculus"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/branebb/simply-typed-lambda-calculus","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/branebb%2Fsimply-typed-lambda-calculus","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/branebb%2Fsimply-typed-lambda-calculus/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/branebb%2Fsimply-typed-lambda-calculus/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/branebb%2Fsimply-typed-lambda-calculus/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/branebb","download_url":"https://codeload.github.com/branebb/simply-typed-lambda-calculus/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/branebb%2Fsimply-typed-lambda-calculus/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29252660,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-08T22:49:53.206Z","status":"ssl_error","status_checked_at":"2026-02-08T22:49:51.384Z","response_time":57,"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":["coq","coq-formalization","haskell","lambda"],"created_at":"2024-09-27T06:40:48.333Z","updated_at":"2026-02-09T01:04:02.495Z","avatar_url":"https://github.com/branebb.png","language":"Haskell","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Simply Typed Lambda Calculus in Haskell and Coq\n\n\u003cdiv align=\"justify\"\u003e\nThis project involves the implementation of an interpreter for a simply typed lambda calculus in \u003cstrong\u003eHaskell\u003c/strong\u003e. The interpreter supports various features, including basic types, pairs, lists, and numerical operations, providing a foundational tool for understanding typed functional programming and type systems.\n\u003c/div\u003e\n\n\u003cbr/\u003e\n\n\u003cdiv align=\"justify\"\u003e\nThe project also includes an implementation of a simply typed lambda calculus interpreter in \u003cstrong\u003eCoq\u003c/strong\u003e. This part focuses on defining types, terms, and contexts, as well as implementing type checking and evaluation. Additionally, the Coq development includes formal proofs of key language properties, such as type preservation and determinism of evaluation.\n\u003c/div\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbranebb%2Fsimply-typed-lambda-calculus","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbranebb%2Fsimply-typed-lambda-calculus","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbranebb%2Fsimply-typed-lambda-calculus/lists"}