scientific article; zbMATH DE number 3980461

MaRDI QIDQ3745258zbMATH OpenFDO

Authors Andreas Goerdt

Publication date 1985

zbMATH Keywords

finitely typed lambda terms with fixed pointsfirst order oraclehigher type recursionHoare Logicpartial correctnessprogramming language with functions

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• General recursive functions in a very simply interpretable typed -calculus
• Typed λ-calculus with recursive definitions
• scientific article; zbMATH DE number 3928338
• Logical Approaches to Computational Barriers
• A calculus with recursive types, record concatenation and subtyping
• On the Hoare theory of monadic recursion schemes
• Recursion in Higher Types and Resource Bounded Turing Machines
• scientific article; zbMATH DE number 2003149
• scientific article; zbMATH DE number 3310899
• scientific article; zbMATH DE number 1424015

Cited in

(6)

• Semantics and reasoning with free procedures
• General recursive functions in a very simply interpretable typed -calculus
• scientific article; zbMATH DE number 4060685 (Why is no real title available?)
• Complexity of proving program correctness
• scientific article; zbMATH DE number 3310899 (Why is no real title available?)
• Reasoning about procedures as parameters in the language L4

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 Q3745258)