What is a universal higher-order programming language?
From MaRDI portal
Recommendations
- Publication:3489498
- What is a purely functional language?
- scientific article; zbMATH DE number 1696447
- scientific article; zbMATH DE number 1173731
- Higher-order functional languages and intensional logic
- scientific article; zbMATH DE number 4104365
- Universal properties of impure programming languages
Cites work
- scientific article; zbMATH DE number 3139754 (Why is no real title available?)
- scientific article; zbMATH DE number 4005580 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 3285221 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- An Unsolvable Problem of Elementary Number Theory
- Data Types as Lattices
- General recursive functions of natural numbers
- Recursive Programs as Definitions in First-Order Logic
- Sequential algorithms on concrete data structures
- \(\mathbb{T}^\omega\) as a universal domain
Cited in
(3)
This page was built for publication: What is a universal higher-order programming language?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630303)