G. Kahn and G. D. Plotkin, "Concrete domains," Theoretical Comput. Sci., vol. 121, no. 1-2, pp. 187--277, Dec. 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Coherence Spaces As Event Structures And Concrete Data.. - Sellanes, Costa (Correct)
....spaces (that were introduced by Girard [GIR 89] for modelling the system F and to give a semantic for linear logic) and event domains [WIN 81] using theory of categories. In this paper we give a characterization of the relation between coherence spaces, event domains and concrete domains [KAH 93] as well as a relation between the concrete counterparts of these domains: webs of coherence spaces, event structures and concrete data structures (cds) According to Zhang [ZHA 89, p. 156] a coherence space can be seen as a particular case of dI domains 2 and of event structures too. With ....
KAHN, G.; PLOTKIN, G. Concrete domains. In: Theoretical Computer Science, Amsterdam, Elsevier, v.121, p. 187-277, 1993.
What is a Universal Higher-Order Programming Language? - Kanneganti, Cartwright (1993) (1 citation) (Correct)
....Roughly speaking, a Scott domain (see Sect. 4) is sequential if its elements can be represented as lazy trees. The sequential domains correspond to filiform concrete data structures studied by Curien [9] which are a restriction of concrete domains originally introduced by Kahn and Plotkin [11]. We show that the new universal domain T has two important properties: 1. Every sequential domain D can be embedded by a sequential retraction as a subdomain D 0 of T such that the maximality of finite elements is preserved. 2. There is a simple metalanguage called KL that is universal for ....
....for higher order computation. Unfortunately, the model of computation underlying LAMBDA is too abstract to simulate the behavior 2 The quotation marks indicate that we are using this term informally. Our usage does not exactly match the technical meaning of the term sequential in the literature [11]. Sequential functions do not provide a satisfactory basis for defining a universal language because the sequential functions and corresponding domains do not form a cartesian closed category [1] Sequential algorithms do form a cartesian closed category but they are intensional. of real ....
G. Kahn and G. Plotkin. Concrete domains. In Fertschirift for C. Boehm, 1993.
Quasi-Prime Algebraic Domains - Zhang (1996) (Correct)
....the beginning, therefore, are all prime algebraic (which also implies that they are distributive) There are, however, other well motivated structures which do not determine prime algebraic domains, because distributivity is not enforced on them. These structures include concrete data structures [10], event structures [13,16] or even filiform structures [2] Moreover, Scott domains are not prime algebraic in general. If one ever considers those structures as possible candidates for models of linear logic, for the purpose of relating linear logic to various models of computation or just out ....
G. Kahn and G. Plotkin, Concrete domains, Theor. Comput. Sci. 121 (1993) 187-277.
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel (1997) Self-citation (Plotkin) (Correct)
.... approximations to the desired sequential structures. Event structures are partial orders of events equipped with a conflict relation and obeying an axiom of finite causes. They were introduced in [21] as a model of concurrency, and turned out to have close connections with concrete domains [14] and hence sequentiality [5] they are also a natural generalisation of Girard s webs. Winskel introduced bistructures (of events) in [25] representing a full sub cartesian closed category of bidomains. They are biorders equipped with a binary consistency relation; the two orders are obtained by ....
Kahn, G. and Plotkin, G., Concrete Domains, in A Collection of Contributions in Honour of Corrado Bohm on the Occasion of his 70th Birthday. TCS Vol. 121, Nos. 1--2, pp. 187--278, 1993.
Bistructures, Bidomains and Linear Logic - Curien, Plotkin, Winskel Self-citation (Plotkin) (Correct)
.... approximations to the desired sequential structures. Event structures are partial orders of events equipped with a conflict relation and obeying an axiom of finite causes. They were introduced in [21] as a model of concurrency, and turned out to have close connections with concrete domains [14] and hence sequentiality [5] they are also a natural generalisation of Girard s webs. Winskel introduced bistructures (of events) in [25] representing a full sub cartesian closed category of bidomains. They are biorders equipped with a binary consistency relation; the two orders are obtained by ....
Kahn, G. and Plotkin, G., Concrete Domains, in A Collection of Contributions in Honour of Corrado Bohm on the Occasion of his 70th Birthday. TCS Vol. 121, Nos. 1--2, pp. 187--278, 1993.
Multidimensional Synchronous Dataflow - Murthy, Lee (2002) (4 citations) (Correct)
No context found.
G. Kahn and G. D. Plotkin, "Concrete domains," Theoretical Comput. Sci., vol. 121, no. 1-2, pp. 187--277, Dec. 1993.
Sequential And Parallel Computation Strategies On Coherence.. - Costa, Sellanes (Correct)
No context found.
KAHN, G.; PLOTKIN, G. Concrete domains. In: Theoretical Computer Science, Amsterdam, Elsevier, v.121, p. 187-277, 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