Strong Normalization with Singleton Types

DOI10.1016/S1571-0661(04)80490-0zbMath1270.03030MaRDI QIDQ2842835

J. Courant

Publication date: 16 August 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

System ST toward a type system for extraction and proofs of programs

Uses Software

• Automath

Cites Work

• Typed operational semantics for higher-order subtyping.
• Geometric Methods and Applications
• (In)consistency of Extensions of Higher Order Logic and Type Theory
• Deciding type equivalence in a language with singleton kinds
• Parallel reductions in \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong Normalization with Singleton Types