Results 261 to 270 of about 432,853 (282)
Some of the next articles are maybe not open access.
Full Abstraction in Structural Operational Semantics (extended abstract)
1994This paper explores the connection between semantic equivalences for concrete sequential processes, represented by means of transition systems, and formats of transition system specifications using Plotkin’s structural approach. For several equivalences in the linear time — branching time spectrum a format is given, as general as possible, such that ...
openaire +1 more source
General conditions for full abstraction
Mathematical Structures in Computer Science, 2014Full abstraction, i.e. that a function preserves equivalence from a source to a target, has been used extensively as a correctness criterion for mappings between models of computation. I here show that with fixed equivalences, fully abstract functions almost always exist.
openaire +2 more sources
Full abstraction and unnested recursion
1993We begin with the assumption that we are given a basic programming language L without identifiers (i.e., variables), which is, nonetheless, fairly expressive. We also assume L has been provided with both an operational semantics and a denotational semantics.
Michael W. Mislove, Frank J. Oles
openaire +1 more source
Purity of an ST monad: full abstraction by semantically typed back-translation
2022Koen Jacobs +2 more
exaly
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases
Journal of Logical and Algebraic Methods in Programming, 2015Jean Goubault-Larrecq
exaly
Full abstraction for Idealized Algol with passive expressions
Theoretical Computer Science, 1999Samson Abramsky
exaly