Ramarao Kanneganti and Robert Cartwright. What is a universal higherorder programming language? In Proceedings of ICALP 92, volume 700. Springer Verlag Lecture Notes in Computer Science, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Extensible Denotational Language Specifications - Cartwright, Felleisen (1994) (13 citations) (Correct)
....3 Extensible Denotational Specifications The denotational specification of a programming language consists of two parts. The first part defines the syntactic 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 phrases. The second part is a functional interpreter that maps elements of the syntactic domains to elements in semantic domains. It is defined in a universal ....
....the language; the semantic domains contain denotations for the various kinds of syntactic phrases. The second part is a functional interpreter that maps elements of the syntactic domains to elements in semantic domains. It is defined in a universal 5 programming language like Lambda [29] or KL [17] and satisfies the law of compositionality, i.e. the interpretation of a phrase is a function of the interpretations of its sub phrases. To keep track of the denotations of free variables, interpreters are also parameterized over an environment argument. Algebraically speaking, the interpreter ....
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
Universal Domains For Sequential Computation - Kanneganti (1995) Self-citation (Kanneganti) (Correct)
....preserving the finiteness of embedded elements. In the third section, we prove that T has the claimed properties. Finally, in the last section, we refine the 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 objects in which any data domain can be embedded as subdomain, ffl a universal language LU that can express any computable element of D. A universal domain U ....
Ramarao Kanneganti and Robert Cartwright. What is a universal higherorder programming language? In Proceedings of ICALP 92, volume 700. Springer Verlag Lecture Notes in Computer Science, 1993.
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