scientific article; zbMATH DE number 6792338

DOI10.4230/LIPICS.FSCD.2016.5MaRDI QIDQ5369470zbMATH OpenFDO

Authors Ryota Akiyoshi, Kazushige Terui

Publication date 17 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSCD.2016.5

zbMATH Keywords

computability predicateinfinitary proof theorypolymorphic lambda calculusstrong normalization

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• scientific article; zbMATH DE number 1499092
• Strong normalisation for applied lambda calculi
• scientific article; zbMATH DE number 6287623
• A formalization of strong normalization for simply-typed lambda-calculus and System F
• Computer Science Logic
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Strong normalization from weak normalization by translation into the lambda-I-calculus
• Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
• Strong normalizability of typed lambda-calculi for substructural logics
• Strong normalisation in -calculi with references

Cited in

(4)

• scientific article; zbMATH DE number 1722646 (Why is no real title available?)
• An elementary proof of strong normalization for atomic F
• MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics
• Schwichtenberg's style analysis of parameter-free fragments of Girard's system F

This page was built for publication:

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