package coq-pts
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
A formalisation of Pure Type Systems
Install
Dune Dependency
Authors
Maintainers
Sources
v8.7.0.tar.gz
md5=ca1af1e28c05f1cc931b3c371a3d1c5a
Description
This contrib is a formalization of Pure Type Systems. It includes most of the basic metatheoretical properties: weakening, substitution, subject-reduction, decidability of type-checking (for strongly normalizing PTSs). Strengtheningis not proven here.
The kernel of a very simple proof checker is automatically generated from the proofs. A small interface allows interacting with this kernel, making up a standalone proof system.
The Makefile has a special target "html" that produces html files from the sources and main.html that gives a short overview.
Tags
keyword: pure type systems keyword: metatheory category: Computer Science/Lambda Calculi date: 2007-03Published: 11 Jan 2019
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page