Strong normalization in type systems: A model theoretical approach

DOI10.1016/0168-0072(94)00040-AzbMath0818.03006OpenAlexW2051134825MaRDI QIDQ1891251

Jan Terlouw

Publication date: 30 May 1995

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00040-a

zbMATH Keywords

derivabilitystrong normalizationtype systemsCalculus of Constructionsformal predicate logic

Mathematics Subject Classification ID

Model theory (03C99) Combinatory logic and lambda calculus (03B40)

Related Items (3)

A short and flexible proof of strong normalization for the calculus of constructions ⋮ An induction principle for pure type systems ⋮ Perpetual reductions in \(\lambda\)-calculus

Uses Software

• Automath

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Introduction to generalized type systems
• Unnamed Item

This page was built for publication: Strong normalization in type systems: A model theoretical approach