A short proof of the decidability of normalization in recursive program schemes

MaRDI QIDQ5015097zbMATH OpenFDO

Authors Zurab Khasidashvili

Publication date 8 December 2021

Full work available at URL http://www.viam.science.tsu.ge/Ami/2020_2/5_zura.pdf

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• On higher order recursive program schemes
• Decidable subcases of the equivalence problem for recursive program schemes
• A simple proof of the undecidability of strong normalisation
• Normalization of S-terms is decidable
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs

Cited in

(3)

• Normalization of S-terms is decidable
• On higher order recursive program schemes
• scientific article; zbMATH DE number 7324347 (Why is no real title available?)

This page was built for publication: A short proof of the decidability of normalization in recursive program schemes

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