Proving strong normalization of CC by modifying realizability semantics

DOI10.1007/3-540-58085-9_70zbMath1527.03011OpenAlexW1607215431MaRDI QIDQ6083688

Thorsten Altenkirch

Publication date: 8 December 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-58085-9_70

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40) Type theory (03B38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The calculus of constructions
• (In)consistency of Extensions of Higher Order Logic and Type Theory
• Dictoses

This page was built for publication: Proving strong normalization of CC by modifying realizability semantics