{"id":16313370,"url":"https://github.com/clayrat/sequent-calc-talk","last_synced_at":"2026-02-27T17:04:03.037Z","repository":{"id":146317104,"uuid":"162567674","full_name":"clayrat/sequent-calc-talk","owner":"clayrat","description":"Code for the \"Logic, machines and sequent calculus\" talk ","archived":false,"fork":false,"pushed_at":"2022-09-07T17:48:23.000Z","size":12,"stargazers_count":31,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-12-25T04:26:20.842Z","etag":null,"topics":["abstract-machine","sequent-calculus"],"latest_commit_sha":null,"homepage":null,"language":"Idris","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/clayrat.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}},"created_at":"2018-12-20T11:03:29.000Z","updated_at":"2024-09-07T09:37:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"ebadebbe-efab-4279-a4fa-687c4aee8eeb","html_url":"https://github.com/clayrat/sequent-calc-talk","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/clayrat%2Fsequent-calc-talk","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/clayrat%2Fsequent-calc-talk/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/clayrat%2Fsequent-calc-talk/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/clayrat%2Fsequent-calc-talk/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/clayrat","download_url":"https://codeload.github.com/clayrat/sequent-calc-talk/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250254664,"owners_count":21400408,"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":["abstract-machine","sequent-calculus"],"created_at":"2024-10-10T21:50:48.502Z","updated_at":"2026-02-27T17:03:57.994Z","avatar_url":"https://github.com/clayrat.png","language":"Idris","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Logic, Machines and Sequent Calculus\n\nCode for the talk.\n\n2019 Version: https://www.youtube.com/watch?v=O0TgP7GKkSY\n\n2018 Version: https://www.youtube.com/watch?v=9l6FD9gRGxc\n\nModules by their appearance:\n\n* `List` - some properties of lists\n* `Lambda` - untyped lambda calculus\n* `STLC` - simply-typed lambda calculus\n* `SC` - one-sided sequent calculus LJ\n* `LK` - two-sided core sequent calculus LK\n* `LKConn` - LK with additional connectives\n* `LKLamApp` - LK and deconstruction of lambdas\n* `KAM` - Krivine abstract machine for untyped lambda\n* `CEK` - Control+Environment+Kontinuation abstract machine for untyped lambda\n* `LKT` - focused call-by-name version of LK\n* `LKQ` - focused call-by-value version of LK\n\n## References\n\n* [Kokke, \"One lambda-calculus, many times\"](https://wenkokke.github.io/2016/one-lambda-calculus-many-times/)\n* [Downen, Ariola, \"A Tutorial on Computational Classical Logic and the Sequent Calculus\"](http://ix.cs.uoregon.edu/~pdownen/publications/sequent-intro.pdf)\n* [Spiwack, \"A dissection of L\"](http://assert-false.net/arnaud/papers/A%20dissection%20of%20L.pdf)\n* [Maillard et al, \"A preview of a tutorial on polarised L calculi\"](http://gallium.inria.fr/~scherer/research/L/tutorial-talk.pdf)\n* [Munch-Maccagnoni, \"Syntax and Models of a non-Associative Composition of Programs and Proofs\"](http://guillaume.munch.name/papers/#SMAC)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclayrat%2Fsequent-calc-talk","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fclayrat%2Fsequent-calc-talk","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fclayrat%2Fsequent-calc-talk/lists"}