Intensional aspects of function definitions
From MaRDI portal
Recommendations
Cites work
- About primitive recursive algorithms
- 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?)
- The formal language of recursion
Cited in
(11)- System \(T\), call-by-value and the minimum problem
- Decidability results for primitive recursive algorithms
- On primitive recursive algorithms and the greatest common divisor function
- On the proof-theoretic foundation of general definition theory
- scientific article; zbMATH DE number 3853653 (Why is no real title available?)
- scientific article; zbMATH DE number 1531380 (Why is no real title available?)
- scientific article; zbMATH DE number 1778915 (Why is no real title available?)
- Intensionality, definability and computation
- On the asymptotic behaviour of primitive recursive algorithms
- Intensionality versus extensionality and primitive recursion
- 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)