Strong normalisation in -calculi with references

DOI10.1007/978-3-642-29320-7_9MaRDI QIDQ2894559zbMATH OpenOpenAlexFDO

Authors Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi

Publication date 29 June 2012

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 1342288
• scientific article; zbMATH DE number 1301734
• Rewriting Techniques and Applications
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Strong normalization of substitutions

Cited in

(5)

• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Strong normalization from weak normalization by translation into the lambda-I-calculus
• Termination in impure concurrent languages
• An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
• scientific article; zbMATH DE number 6792338 (Why is no real title available?)

This page was built for publication: Strong normalisation in \(\lambda \)-calculi with references

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