Failures, Finiteness and Full Abstraction
نویسندگان
چکیده
منابع مشابه
Universit a Di Pisa Failures, Finiteness, and Full Abstraction Failures, Finiteness, and Full Abstraction
For a simple CCS-like language a trace semantics and a failure semantics are presented. The failure semantics is shown to be fully abstract with respect to the trace semantics if and only if the set of internal actions is innnite.
متن کاملObservable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...
متن کاملDefinability and Full Abstraction
Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, several full completeness results have been shown since the early nineties. In this note, we review the relation between definability and full abstrac...
متن کاملA Note on Induction, Abstraction, and Dedekind-Finiteness
The purpose of this note is to present a simplification of the system of arithmetical axioms given in previous work; specifically, it is shown how the induction principle can in fact be obtained from the remaining axioms, without the need of explicit postulation. The argument might be of more general interest, beyond the specifics of the proposed axiomatization, as it highlights the interaction...
متن کاملLogical Full Abstraction and PCF
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1997
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80147-1