https://github.com/runmingl/istari-stc
Mechanization of Synthetic Tait Computability in Istari
https://github.com/runmingl/istari-stc
Last synced: 4 months ago
JSON representation
Mechanization of Synthetic Tait Computability in Istari
- Host: GitHub
- URL: https://github.com/runmingl/istari-stc
- Owner: runmingl
- Created: 2025-08-02T23:17:49.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2025-09-12T18:55:25.000Z (9 months ago)
- Last Synced: 2025-09-12T21:10:44.325Z (9 months ago)
- Size: 78.1 KB
- Stars: 5
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Mechanizing Synthetic Tait Computability in Istari
This repository contains the formalization of Sterling's Synthetic Tait Computability in Istari proof assistant.
Synthetic Tait Computability (STC) is a synthetic approach to categorical gluing, a technique to prove meta-theory of type theories. STC is also known as an instance of proof-relevant logical relations, or logical relations as types. The canonical reference on STC is Sterling's thesis.
Istari is a modern implementation of Martin-L\"{o}f-style extensional type theory with equality reflection and extensionality principles, in the tradition of Nuprl. This gives tremendous advantage in formalizing STC because on-paper STC relies on an extensional type theory. As a result, our formalization is essentially verbatim compared to on-paper proofs.
## Our Formalization
We formalized two case studies of STC:
- [`DTT`](./src/DTT) Canonicity for a core dependent type theory with dependent products and booleans with large elimination.
- [`Calf`](./src/Calf) Canonicity for cost-aware logical framework (Calf), a call-by-push-value language with a writer monad effect and a phase distinction.
There are two reasonable ways to read the formalization:
- The heart of STC proof obligations is to check the given terms have the indicated types. For that it is sufficient to look at `DTT/Demo` and `Calf/Demo` directories, where we write down the terms and their types, and Istari type-checks them. In there, we include, in comment, the on-paper proof of each definition as show up in various paper. It should be immediate to see (hopefully) that the formalized terms and types are in one-to-one correspondence to the on-paper proofs, without anything like transports.
- On the other hand, the technical development of proving those terms indeed have the correct types happen in `DTT/Semantics` and `Calf/Semantics` directories, where we use a chain of tactics to establish well-typedness.
In DTT we highlight the semantics of booleans and dependent products. In Calf we highlight the semantics of free-forgetful adjunction in call-by-push-value and the behavioral phase distinction.
Each directory also contains a `Makefile`, and running `make` will type-check all definitions. In particular, we set it up modularly in a way that type-checking each file will only invoke its necessary dependencies. This way, for example, the semantics of dependent products is not dependent on the semantics of booleans and vice versa. This highlights the modular aspects of those gluing proofs, where extending them to a new type former is straightforward.
## Istari
Istari's official documentation is at https://istarilogic.org.
### Installation
Follows from https://istarilogic.org/install.html
### Text editor
Instructions on how to use Istari's Emacs extension can be found at https://istarilogic.org/ui.html.