Non-determinism, Non-termination and the Strong Normalization of System T

DOI10.1007/978-3-642-38946-7_5zbMath1381.03020OpenAlexW48265284MaRDI QIDQ5300892

Margherita Zorzi, Federico Aschieri

Publication date: 28 June 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-38946-7_5

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (7)

On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem ⋮ Unnamed Item ⋮ On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC ⋮ Unnamed Item ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ Unnamed Item ⋮ QPCF: higher-order languages and quantum circuits

This page was built for publication: Non-determinism, Non-termination and the Strong Normalization of System T