{"id":13993002,"url":"https://github.com/rami3l/plfl","last_synced_at":"2025-03-30T20:25:27.956Z","repository":{"id":157920733,"uuid":"629765394","full_name":"rami3l/plfl","owner":"rami3l","description":"Learn Lean 4 with PLFA proofs.","archived":false,"fork":false,"pushed_at":"2024-05-02T03:25:17.000Z","size":260,"stargazers_count":54,"open_issues_count":0,"forks_count":4,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-05T23:25:30.932Z","etag":null,"topics":["lean","lean4","plfa","programming-language-foundations","software-foundations"],"latest_commit_sha":null,"homepage":"","language":"Lean","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/rami3l.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":"2023-04-19T01:34:33.000Z","updated_at":"2025-02-05T16:12:15.000Z","dependencies_parsed_at":"2024-10-24T13:05:37.636Z","dependency_job_id":"26f5a1f0-f23e-4b1c-92f3-6ae4df440b47","html_url":"https://github.com/rami3l/plfl","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rami3l%2Fplfl","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rami3l%2Fplfl/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rami3l%2Fplfl/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rami3l%2Fplfl/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rami3l","download_url":"https://codeload.github.com/rami3l/plfl/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246375410,"owners_count":20767105,"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","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":["lean","lean4","plfa","programming-language-foundations","software-foundations"],"created_at":"2024-08-09T14:02:12.027Z","updated_at":"2025-03-30T20:25:27.932Z","avatar_url":"https://github.com/rami3l.png","language":"Lean","funding_links":[],"categories":["Lean"],"sub_categories":[],"readme":"# plfl\n\nMy journey of learning Lean 4 by implementing proofs from the wonderful book [_Programming Language Foundations in Agda_](https://plfa.github.io).\n\n## Table of Contents\n\n### Volume 2\n\n- [x] 1. [Lambda](Plfl/Lambda.lean): Introduction to Lambda Calculus\n- [x] 2. [Properties](Plfl/Lambda/Properties.lean): Progress and Preservation\n- [x] 3. [DeBruijn](Plfl/DeBruijn.lean): Intrinsically-typed de Bruijn representation\n- [x] 4. [More](Plfl/More.lean): Additional constructs of simply-typed lambda calculus\n- [x] 5. [Bisimulation](Plfl/More/Bisimulation.lean): Relating reduction systems\n- [x] 6. [Inference](Plfl/More/Inference.lean): Bidirectional type inference\n- [x] 7. [Untyped](Plfl/Untyped.lean): Untyped lambda calculus with full normalisation\n- [x] 8. [Confluence](Plfl/Untyped/Confluence.lean): Confluence of untyped lambda calculus\n- [x] 9. [BigStep](Plfl/Untyped/BigStep.lean): Big-step semantics of untyped lambda calculus\n\n### Volume 3\n\n- [x] 1. [Denotational](Plfl/Untyped/Denotational.lean): Denotational semantics of untyped lambda calculus\n- [x] 2. [Compositional](Plfl/Untyped/Denotational/Compositional.lean): The denotational semantics is compositional\n- [x] 3. [Soundness](Plfl/Untyped/Denotational/Soundness.lean): Soundness of reduction with respect to denotational semantics\n- [x] 4. [Adequacy](Plfl/Untyped/Denotational/Adequacy.lean): Adequacy of denotational semantics with respect to operational semantics\n- [x] 5. [ContextualEquivalence](Plfl/Untyped/Denotational/ContextualEquivalence.lean): Denotational equality implies contextual equivalence\n\n### Appendix\n\n- [x] 1. [Substitution](Plfl/Untyped/Substitution.lean): Substitution in the untyped lambda calculus\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frami3l%2Fplfl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frami3l%2Fplfl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frami3l%2Fplfl/lists"}