Denotational linear time semantics and sequential composition
نویسندگان
چکیده
منابع مشابه
Denotational Linear Time Semantics and Sequential Composition
This paper focuses on the issue of modelling sequential composition in denotational linear time semantics for (nondeterministieJ languages which admit infinite computations. This operator deserves special attention as it causes problems to meet the requirements of a standard denotational semantics based on metric or cpo. We present a general framework for the treatment of sequential composition...
متن کاملBroadening the denotational semantics of linear logic
The proof-theoretic origins and specialized models of linear logic make it primarily operational in orientation. In contrast first-order logic treats the operational and denotational aspects of general mathematics quite evenhandedly. Here we show that linear logic has models of even broader denotational scope than those of first order logic, namely Chu spaces, the category of which Barr has obs...
متن کاملDenotational Semantics and Refinement
Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may be formally justified.
متن کاملOperational and Denotational Semantics
The types are , ::= Nat ∣ → . All the terms in the language come with explicit types. In particular, we assume an infinite, countable set of variables of each type , and write x for a variable of type . The terms t of type (in short, t : ) are defined by induction on their size by : – every variable x is of type ; – if N : , then x ⋅N is a term of type → ; – if M : → and N : , then MN is a term...
متن کاملProofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less restrictive framework of proof structures, and then in adapting the results to proof nets. At the level of proof structures, we find a semantical characterization of their interpretations in relational semantics, and we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1996
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00101-9