Abstract. We investigate methods and tools for analyzing translations between programming languages with respect to observational seman-tics. The behavior of programs is observed in terms of may- and must-convergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental cor-rectness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This tech-nique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.4
In this paper we generalize the notion of compositional semantics to cope with transfinite reduction...
An approach to translation is described that embodies certain principles about translation, in parti...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...
We investigate methods and tools for analyzing translations between programming languages with respe...
Motivated by our experience in analyzing properties of translations between programming languages wi...
International audienceFor the issue of translations between programming languages with observational...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
In this paper we model both program behaviours and abstractions between them as lax functors, which ...
AbstractWe first introduce a general semantic scheme for logic programs which provides a uniform fra...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
In the functional programming literature, compiling is often expressed as a translation between sour...
Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer sc...
An approximate program transformation is a trans-formation that can change the semantics of a progra...
We present a semantics for animperative programming language, Lunsen, with constructs for concurrenc...
It is shown that the automated translation of programming languages suffers from its traditional dom...
In this paper we generalize the notion of compositional semantics to cope with transfinite reduction...
An approach to translation is described that embodies certain principles about translation, in parti...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...
We investigate methods and tools for analyzing translations between programming languages with respe...
Motivated by our experience in analyzing properties of translations between programming languages wi...
International audienceFor the issue of translations between programming languages with observational...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
In this paper we model both program behaviours and abstractions between them as lax functors, which ...
AbstractWe first introduce a general semantic scheme for logic programs which provides a uniform fra...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
In the functional programming literature, compiling is often expressed as a translation between sour...
Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer sc...
An approximate program transformation is a trans-formation that can change the semantics of a progra...
We present a semantics for animperative programming language, Lunsen, with constructs for concurrenc...
It is shown that the automated translation of programming languages suffers from its traditional dom...
In this paper we generalize the notion of compositional semantics to cope with transfinite reduction...
An approach to translation is described that embodies certain principles about translation, in parti...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...