Add to ORKGWe examine the problem of finding fully abstract translations between programming languages, i.e., translations: one from call-by-value to lazy PCF, one from call-by name to call-by-value PCF, and one from lazy to call-by-value PCF. The translations yield upper and lower bounds on decision procedures for proving equivalences of code. We finally define a notion of "functional translation " that captures the essence of the proofs of full abstraction, and show that some languages cannot be translated into others
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
The functional and logic programming research communities are to a signif-icant extent solving the s...
AbstractThis paper presents computational adequacy results for the FIX logical system introduced by ...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractThis paper presents a tentative theory of programming language expressiveness based on reduc...
Abstract. We present a study of some properties of program translations in the context of logic prog...
Functional programmers often reason about programs as if they were written in a total language, expe...
Functional programmers often reason about programs as if they were written in a total language, expe...
We present a unified framework to describe and compare functional language implementations. We expre...
We present a unified framework to describe and compare functional language implementations. We expre...
We express implementations of functional languages as a succession of program transformations in a c...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
Motivated by our experience in analyzing properties of translations between programming languages wi...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
The functional and logic programming research communities are to a signif-icant extent solving the s...
AbstractThis paper presents computational adequacy results for the FIX logical system introduced by ...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
AbstractThis paper presents a tentative theory of programming language expressiveness based on reduc...
Abstract. We present a study of some properties of program translations in the context of logic prog...
Functional programmers often reason about programs as if they were written in a total language, expe...
Functional programmers often reason about programs as if they were written in a total language, expe...
We present a unified framework to describe and compare functional language implementations. We expre...
We present a unified framework to describe and compare functional language implementations. We expre...
We express implementations of functional languages as a succession of program transformations in a c...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
Motivated by our experience in analyzing properties of translations between programming languages wi...
Programmers don't just have to write programs, they are have to reason about them. Programming langu...
The functional and logic programming research communities are to a signif-icant extent solving the s...
AbstractThis paper presents computational adequacy results for the FIX logical system introduced by ...