Another look at nested recursion

DOI10.1007/3-540-44659-1_31MaRDI QIDQ2754066zbMATH OpenFDO

Authors Konrad Slind

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-44659-1_31

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Inductive invariants for nested recursion
• Partial and nested recursive function definitions in higher-order logic
• Termination of nested and mutually recursive algorithms
• Proving termination of normalization functions for conditional expressions
• Nested general recursion and partiality in type theory

Cited in

(6)

• Termination of nested and mutually recursive algorithms
• scientific article; zbMATH DE number 2185679 (Why is no real title available?)
• Inductive invariants for nested recursion
• Nested arrays and recursion
• On nested simple recursion
• Partial and nested recursive function definitions in higher-order logic

This page was built for publication: Another look at nested recursion

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