Non-determinism, non-termination and the strong normalization of System T

DOI10.1007/978-3-642-38946-7_5zbMATH Open1381.03020OpenAlexW48265284MaRDI QIDQ5300892FDOQ5300892

Authors: Federico Aschieri, Margherita Zorzi 

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

Recommendations

• scientific article; zbMATH DE number 1499092
• New Computational Paradigms
• Strong normalisation for applied lambda calculi
• Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
• Proving strong normalisation via non-deterministic translations into Klop's extended lambda-calculus

Mathematics Subject Classification ID

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

Cited In (11)

• Strong normalisation for applied lambda calculi
• Title not available (Why is that?)
• On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
• QPCF: higher-order languages and quantum circuits
• $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations
• Non-determinism in Gödel's system \(T\)
• Title not available (Why is that?)
• Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
• On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC
• Title not available (Why is that?)
• Continuous normalization for the lambda-calculus and Gödel's T

This page was built for publication: Non-determinism, non-termination and the strong normalization of System T

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300892)