https://github.com/yiyunliu/tposr

Autosubst 2 reimplementation of the paper "Pure Type System conversion is always typable"
https://github.com/yiyunliu/tposr

Last synced: about 2 months ago
JSON representation

Autosubst 2 reimplementation of the paper "Pure Type System conversion is always typable"

• Host: GitHub
• URL: https://github.com/yiyunliu/tposr
• Owner: yiyunliu
• Created: 2024-03-01T21:12:16.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2025-04-05T22:49:15.000Z (about 2 months ago)
• Last Synced: 2025-04-05T23:24:06.928Z (about 2 months ago)
• Language: Coq
• Size: 219 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Mechanized syntactic soundness proof for $PTR_{atr}$

A reimplementation of the type system by [Siles and Herbelin](https://www.cambridge.org/core/journals/journal-of-functional-programming/article/pure-type-system-conversion-is-always-typable/0BFD4C10E4EBB7884E906982CD1B017F) with Autosubst 2.

The system in this repository has a fixed predicative universe hierarchy, though the confluence theorem is derived from the type exchange property, which holds for general pure type systems. The repository

is still a WIP, but I have already proven the diamond property for the typed parallel reduction relation.