Ramarao Kanneganti, Robert Cartwright  Home/Search
Context Related
| rice.edu/CS/PLT/Publ...icalp93kc.ps.gz neu.edu/scheme/pubs/...icalp93kc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rice.edu/CS/PLT/Publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Context of citations to this paper: More
...and semantic domains of the language. The domains are sub domains of some universal domain, e.g. P [29] T [24] U [28] or T [17]. The syntactic domains specify the phrases of the language; the semantic domains contain denotations for the various kinds of syntactic...
...structure of T so that the finiteness of embedded elements is preserved. The preliminary results of this chapter have been presented in [KC93] 5.1 Universal Domains An Introduction The core of Domain Theory consists of two constructions: ffl a universal domain U of data...
Cited by: More
Universal Domains For Sequential Computation - Kanneganti (1995) (Correct)
Extensible Denotational Language Specifications - Cartwright, Felleisen (1994) (Correct)
Active bibliography (related documents): More All
0.5: SPCF: Its Model, Calculus, and Computational Power.. - Kanneganti.. (1992) (Correct)
0.3: Capabilities of Finite Standardization - Tervits (Correct)
0.3: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
Similar documents based on text: More All
0.1: Maximality of Joined Markov Equivalent Ancestral Graphs - Ali, Richardson (2002) (Correct)
0.1: Static Analysis Techniques for Predicting the Behavior of Active.. - Aiken (1995) (Correct)
0.1: Static Analysis Techniques for Predicting the Behavior of.. - Alexander Aiken (1995) (Correct)
Related documents from co-citation: More All
2: as a universal domain (context) - Plotkin - 1978
2: Domains for denotational semantics (context) - Scott - 1982
2: Modeling continuations without continuations (context) - Sitaram, Felleisen - 1991
BibTeX entry: (Update)
Kanneganti, R., and R. Cartwright. What is a universal higherorder programming language? In Proc. International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science http://citeseer.ist.psu.edu/kanneganti93what.html More
@inproceedings{ kanneganti93what,
author = "Ramarao Kanneganti and Robert Cartwright",
title = "What is a Universal Higher-Order Programming Language?",
booktitle = "Automata, Languages and Programming",
pages = "682-695",
year = "1993",
url = "citeseer.ist.psu.edu/kanneganti93what.html" }
Citations (may not include all citations):162 Data types as lattices (context) - Scott - 1976
61 Sequential algorithms on concrete data structures (context) - Berry, Curien - 1982
50 An unsolvable problem of elementary number theory (context) - Church - 1936
46 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
30 Research Notes in Theoretical Computer Science (context) - Curien, Sequential et al. - 1993
25 as a universal domain (context) - Plotkin - 1978
18 Observable sequentiality and full abstraction - Cartwright, Felleisen - 1992
17 General recursive functions of natural numbers (context) - Kleene - 1936
9 Observable algorithms on concrete data structures (context) - Curien - 1992
7 Recursive programs as definitions in first order logic (context) - Cartwright - 1984
7 Concrete domains - Kahn, Plotkin - 1993
6 The topology of program termination (context) - Cartwright, Demers - 1988
6 Fully abstract models of observably sequential languages (context) - Cartwright, Curien et al.
3 and computational power (context) - Kanneganti, Cartwright et al. - 1992
3 Partial recursive functionals and effective operations (context) - Kreisel, Lacombe et al. - 1959
2 The semantics of lazy (context) - Cartwright, Donahue - 1982
2 The Jounal of Symbolic Logic (context) - Turing, -definability - 1937
1 Computable functionals of arbitrary finite type (context) - Davis - 1959
Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/): More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998) (Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993) (Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC