package coq-tait
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
A normalization proof a la Tait for simply-typed lambda-calculus
Install
Dune Dependency
Authors
Maintainers
Sources
v8.5.0.tar.gz
md5=97982c8d943a7f4559eebc5181d3d535
Description
This is a formalization of Berger's TLCA'93 paper, with complete proofs of the axioms and an extraction of a normalization program close to N.B.E.
Tags
keyword:normalization keyword:lambda calculus keyword:extraction keyword:Tait proof keyword:normalization by evalution keyword:type theory category:Mathematics/Logic/Type theory category:Computer Science/Lambda Calculi category:Miscellaneous/Extracted Programs/Type checking unification and normalization date:2004Published: 07 Jun 2016
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page