Recursive functions — Scriptorium Liberum

Recursive Functionals

✍ L.E. Sanchis 📂 Library 📅 1992 🏛 North Holland 🌐 English

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical fun

Recursive Functionals

📁 Recursive Functionals

✍ Luis E. Sanchis 📂 Library 📅 1992 🏛 Elsevier, Academic Press 🌐 English

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical fun

Recursive Functionals

📁 Recursive Functionals

✍ Luis E. Sanchis 📂 Library 📅 1992 🏛 Elsevier, Academic Press 🌐 English

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical fun

Recursive Functionals

📁 Recursive Functionals

✍ L.E. Sanchis 📂 Library 📅 1992 🏛 North Holland 🌐 English

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical fun

Recursive functionals

📁 Recursive functionals

✍ L.E. Sanchis 📂 Library 📅 1992 🏛 North-Holland 🌐 English

Recursive functionals

📁 Recursive functionals

✍ L.E. Sanchis 📂 Library 📅 1992 🏛 North-Holland 🌐 English

This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical fun