https://github.com/yiyunliu/system-t-per
https://github.com/yiyunliu/system-t-per
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/yiyunliu/system-t-per
- Owner: yiyunliu
- Created: 2023-11-23T00:39:51.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2023-11-23T16:52:29.000Z (over 1 year ago)
- Last Synced: 2025-02-15T22:28:34.573Z (4 months ago)
- Language: Coq
- Size: 15.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# PER model for System T
This repository contains a mechanized PER model for Gödel's System T
(call-by-name variant) in Coq. The relational model is more powerful
than the predicate model since it allows one to prove that $\lambda
x. x$ and $\lambda x . x + 0$ are logically equivalent functions from
`Nat` to `Nat`.
I find it slightly trickier to mechanize call-by-name version than the
call-by-value version since the base case for the `Nat` type becomes
slightly more complicated.