What is a universal higher-order programming language?

DOI10.1007/3-540-56939-1_112zbMath1422.68021OpenAlexW1526097408MaRDI QIDQ4630303

Ramarao Kanneganti, Robert Cartwright

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_112

zbMATH Keywords

recursive functionprime elementsequential computationcomputable elementprime basis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathbb{T}^\omega\) as a universal domain
• Sequential algorithms on concrete data structures
• General recursive functions of natural numbers
• Data Types as Lattices
• Recursive Programs as Definitions in First-Order Logic
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: What is a universal higher-order programming language?