Simple general recursion in type theory

MaRDI QIDQ2743705zbMATH OpenFDO

Authors Ana Bove

Publication date 31 January 2002

Published in Nordic Journal of Computing (Search for Journal in Brave)

zbMATH Keywords

functional programming languagesgeneral recursive algorithms

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 2003149
• Another look at function domains
• Modelling general recursion in type theory
• scientific article; zbMATH DE number 1863381
• Terminating general recursion

Cited in

(18)

• Terminating general recursion
• General recursive functions in a very simply interpretable typed -calculus
• Typing total recursive functions in Coq
• scientific article; zbMATH DE number 1670732 (Why is no real title available?)
• scientific article; zbMATH DE number 1696606 (Why is no real title available?)
• scientific article; zbMATH DE number 1722665 (Why is no real title available?)
• Inductive and coinductive components of corecursive functions in Coq
• Turing-Completeness Totally Free
• Partiality, state and dependent types
• scientific article; zbMATH DE number 445161 (Why is no real title available?)
• A type system for well-founded recursion
• Simple Types in Type Theory: Deep and Shallow Encodings
• Inductive invariants for nested recursion
• scientific article; zbMATH DE number 2003149 (Why is no real title available?)
• scientific article; zbMATH DE number 1863381 (Why is no real title available?)
• The Braga Method: Extracting Certified Algorithms from Complex Recursive Schemes in Coq
• General Recursion via Coinductive Types
• Modelling general recursion in type theory

This page was built for publication: Simple general recursion in type theory

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