https://github.com/clayrat/sequent-calc-talk
Code for the "Logic, machines and sequent calculus" talk
https://github.com/clayrat/sequent-calc-talk
abstract-machine sequent-calculus
Last synced: 5 months ago
JSON representation
Code for the "Logic, machines and sequent calculus" talk
- Host: GitHub
- URL: https://github.com/clayrat/sequent-calc-talk
- Owner: clayrat
- Created: 2018-12-20T11:03:29.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2022-09-07T17:48:23.000Z (almost 4 years ago)
- Last Synced: 2024-12-25T04:26:20.842Z (over 1 year ago)
- Topics: abstract-machine, sequent-calculus
- Language: Idris
- Size: 11.7 KB
- Stars: 31
- Watchers: 4
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Logic, Machines and Sequent Calculus
Code for the talk.
2019 Version: https://www.youtube.com/watch?v=O0TgP7GKkSY
2018 Version: https://www.youtube.com/watch?v=9l6FD9gRGxc
Modules by their appearance:
* `List` - some properties of lists
* `Lambda` - untyped lambda calculus
* `STLC` - simply-typed lambda calculus
* `SC` - one-sided sequent calculus LJ
* `LK` - two-sided core sequent calculus LK
* `LKConn` - LK with additional connectives
* `LKLamApp` - LK and deconstruction of lambdas
* `KAM` - Krivine abstract machine for untyped lambda
* `CEK` - Control+Environment+Kontinuation abstract machine for untyped lambda
* `LKT` - focused call-by-name version of LK
* `LKQ` - focused call-by-value version of LK
## References
* [Kokke, "One lambda-calculus, many times"](https://wenkokke.github.io/2016/one-lambda-calculus-many-times/)
* [Downen, Ariola, "A Tutorial on Computational Classical Logic and the Sequent Calculus"](http://ix.cs.uoregon.edu/~pdownen/publications/sequent-intro.pdf)
* [Spiwack, "A dissection of L"](http://assert-false.net/arnaud/papers/A%20dissection%20of%20L.pdf)
* [Maillard et al, "A preview of a tutorial on polarised L calculi"](http://gallium.inria.fr/~scherer/research/L/tutorial-talk.pdf)
* [Munch-Maccagnoni, "Syntax and Models of a non-Associative Composition of Programs and Proofs"](http://guillaume.munch.name/papers/#SMAC)