Intensional aspects of function definitions

DOI10.1016/0304-3975(94)00268-9MaRDI QIDQ673180zbMATH OpenOpenAlexFDO

Authors Daniel Fredholm

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00268-9

zbMATH Keywords

\(\mu\)-recursive definitionsextensional propertygeneralization of equational definitions of functions[https://duckduckgo.com/?q=zbmath%20keyword%20Herbrand-G%EF%BF%BD%EF%BF%BDdel-Kleene+systems Herbrand-G��del-Kleene systems]intensional propertyprimitive recursive definitions

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 1778915
• Intensionality, definability and computation
• scientific article; zbMATH DE number 1531380
• Partial functions in type theory
• A complete characterization of primitive recursive intensional behaviours

Cites work

• scientific article; zbMATH DE number 3966062 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 3910 (Why is no real title available?)
• scientific article; zbMATH DE number 3273184 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• About primitive recursive algorithms
• The formal language of recursion

Cited in

(11)

• On the asymptotic behaviour of primitive recursive algorithms
• scientific article; zbMATH DE number 3853653 (Why is no real title available?)
• Intensionality versus extensionality and primitive recursion
• On primitive recursive algorithms and the greatest common divisor function
• Decidability results for primitive recursive algorithms
• On the proof-theoretic foundation of general definition theory
• System \(T\), call-by-value and the minimum problem
• Intensionality, definability and computation
• scientific article; zbMATH DE number 1778915 (Why is no real title available?)
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• Computing minimum with primitive recursion over lists

This page was built for publication: Intensional aspects of function definitions

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