Add to ORKG33 pagesIn this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : lambda-abstractions are transformed into a composition of combinators. We provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Dependent types and multi-stage programming have both been used, separately, in programming language...
Abstract. This paper reports on results concerning the combination of non-standard semantics via int...
33 pagesIn this paper, we build an interpreter by reusing host language functions instead of recodin...
We present a program interpretation technique relying on an higher order abstract syntax which allow...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
AbstractThis paper presents a tentative theory of programming language expressiveness based on reduc...
For domain specific languages, “scripting languages”, dynamic languages, and for virtual machine-bas...
Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Abstract: This paper describes an efficient interpreter for lazy functional languages like Haskell a...
The paper reports on extensions to the MAX system enabling the generation and refinement of interpr...
This paper describes a completely automated method for generating efficient and competitive interpre...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Dependent types and multi-stage programming have both been used, separately, in programming language...
Abstract. This paper reports on results concerning the combination of non-standard semantics via int...
33 pagesIn this paper, we build an interpreter by reusing host language functions instead of recodin...
We present a program interpretation technique relying on an higher order abstract syntax which allow...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
It has been argued elsewhere that a logic programming language with function variables and A-abstrac...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
AbstractThis paper presents a tentative theory of programming language expressiveness based on reduc...
For domain specific languages, “scripting languages”, dynamic languages, and for virtual machine-bas...
Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Abstract: This paper describes an efficient interpreter for lazy functional languages like Haskell a...
The paper reports on extensions to the MAX system enabling the generation and refinement of interpr...
This paper describes a completely automated method for generating efficient and competitive interpre...
We examine the problem of finding fully abstract translations between programming languages, i.e., t...
Dependent types and multi-stage programming have both been used, separately, in programming language...
Abstract. This paper reports on results concerning the combination of non-standard semantics via int...