On infinite computations in denotational semantics
نویسندگان
چکیده
منابع مشابه
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.
متن کاملRevisiting Elementary Denotational Semantics
We present a semantics for an applied call-by-value λ-calculus that is compositional, extensional, and elementary. We present four dierent views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersection t...
متن کامل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...
متن کاملCPP Denotational Semantics
This paper shows that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques. This paper describes the semantics of CPP in a denotational style. B...
متن کاملOn the Approximation of Denotational Mu-Semantics
A signature gives rise to a language L (Var) by extending with variables x 2 Var and binding constructs x and x, corresponding to least and greatest xed points respectively. The natural denotational models for such languages are bicomplete dcpos as monotone-algebras. We prove that several approximating denotational semantics have the usual compositional semantics as their limit. These results p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90019-7