What is a Universal Higher-Order Programming Language? (1993)
| Venue: | In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Kanneganti93whatis,
author = {Ramarao Kanneganti and Robert Cartwright},
title = {What is a Universal Higher-Order Programming Language?},
booktitle = {In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science},
year = {1993},
pages = {682--695}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. In this paper, we develop a theory of higher-order computability suitable for comparing the expressiveness of sequential, deterministic programming languages. The theory is based on the construction of a new universal domain T and corresponding universal language KL. The domain T is universal for observably sequential domains; KL can define all the computable elements of T, including the elements corresponding to computable observably sequential functions. In addition, domain embeddings in T preserve the maximality of finite elements---preserving the termination behavior of programs over the embedded domains. 1 Background and Motivation Classic recursion theory [7, 13, 18] asserts that all conventional programming languages are equally expressive because they can define all partial recursive functions over the natural numbers. This statement, however, is misleading because real programming languages support and enforce a more abstract view of data than bitstrings. In particular, mo...
