{"id":30458480,"url":"https://github.com/shilangyu/foundations_of_software_projects","last_synced_at":"2026-02-11T12:04:32.993Z","repository":{"id":294707490,"uuid":"934709186","full_name":"shilangyu/foundations_of_software_projects","owner":"shilangyu","description":"Formalization projects for the Foundation of Software course at EPFL","archived":false,"fork":false,"pushed_at":"2025-05-21T16:52:22.000Z","size":51,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-23T19:39:17.070Z","etag":null,"topics":["epfl","fos","lean","lean4","theorem-proving"],"latest_commit_sha":null,"homepage":"","language":"Lean","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/shilangyu.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}},"created_at":"2025-02-18T09:28:27.000Z","updated_at":"2025-05-21T16:52:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"8b1a6434-b67b-4459-8efc-e0eff09e5434","html_url":"https://github.com/shilangyu/foundations_of_software_projects","commit_stats":null,"previous_names":["shilangyu/foundations_of_software_projects"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shilangyu/foundations_of_software_projects","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shilangyu%2Ffoundations_of_software_projects","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shilangyu%2Ffoundations_of_software_projects/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shilangyu%2Ffoundations_of_software_projects/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shilangyu%2Ffoundations_of_software_projects/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shilangyu","download_url":"https://codeload.github.com/shilangyu/foundations_of_software_projects/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shilangyu%2Ffoundations_of_software_projects/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29332713,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-11T06:13:03.264Z","status":"ssl_error","status_checked_at":"2026-02-11T06:12:55.843Z","response_time":97,"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":["epfl","fos","lean","lean4","theorem-proving"],"created_at":"2025-08-23T17:05:14.735Z","updated_at":"2026-02-11T12:04:32.988Z","avatar_url":"https://github.com/shilangyu.png","language":"Lean","funding_links":[],"categories":[],"sub_categories":[],"readme":"# foundations_of_software_projects\n\nFormalization projects for the Foundation of Software course at EPFL\n\n### arithmetic\n\nA language with natural numbers, booleans, an `if`-expression and two functions: `pred` and `iszero?`.\n\nWe define the small and big step semantics. We also define a function for evalution. We prove all the semantic definitions are equivalent.\n\n### untyped\n\nThe pure lambda calculus. We define some datatypes (lists, booleans).\n\nWe prove confluence.\n\n### typed\n\nThe simply typed lambda calculus. We define some datatype (lists, booleans).\n\nWe prove progress and correctness of inference.\n\n### CoC\n\nProofs of statements using the calculus of constructions. Namely, not in tactic mode but pure lambda terms.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshilangyu%2Ffoundations_of_software_projects","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshilangyu%2Ffoundations_of_software_projects","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshilangyu%2Ffoundations_of_software_projects/lists"}