Provably recursive programs and program extraction

DOI10.1007/3-540-54233-7_143MaRDI QIDQ4036572zbMATH OpenFDO

Authors Tim Fernando

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54233-7_143

zbMATH Keywords

provably recursive functionsprovably recursive program

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Gödel numberings and issues of incompleteness (03F40) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 432701
• scientific article; zbMATH DE number 785053
• Provable computable functions on abstract data types
• Extraction and verification of programs by analysis of formal proofs
• Towards the theory of programming in constructive logic

Cited in

(11)

• White-box path generation in recursive programs
• scientific article; zbMATH DE number 432701 (Why is no real title available?)
• scientific article; zbMATH DE number 432708 (Why is no real title available?)
• scientific article; zbMATH DE number 3845026 (Why is no real title available?)
• Extraction of a program from deduction and its regularity. I
• Extracting Algorithms from Intuitionistic Proofs
• scientific article; zbMATH DE number 2090125 (Why is no real title available?)
• scientific article; zbMATH DE number 785053 (Why is no real title available?)
• Program extraction applied to monadic parsing
• scientific article; zbMATH DE number 2222029 (Why is no real title available?)
• Program extraction in exact real arithmetic

This page was built for publication: Provably recursive programs and program extraction

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