A definitional interpreter is an interpreter which uses the semantics of its own host language to define those of its object language. Traditionally, a seperate type safety proof is used for such an interpreter. Using a "typesafe-by-construction" approach, where the typesafety is proven by expressing the type system of the object language in the type system of the host language is a new approach recently used for imperative languages. In this paper a proof-of-concept is made to show that the technique of "typesafe-byconstruction" can be also applied to interpreters for languages with explicit deallocation. This is done by making such an interpreter for a language called ML-dealloc, which is a basic version of ML extended with explicit alloc...
Programming language implementations bridge the gap between what the program developer sees and unde...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
A definitional interpreter defines the semantics of an object language in terms of the (well-known) ...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
This paper concerns techniques for providing a convenient syntax for object languages implemented vi...
We show how programming language semantics and definitions of their corresponding type systems can b...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
Abstract. We develop a system of type assignment with intersection types, union types, indexed types...
Our objective is to understand the notion of type in programming languages, present a model of typed...
This paper describes a scheme for the abstract interpretation of logic programs based on type inform...
We develop a system of type assignment with intersection types, union types, indexed types, and univ...
The programming language Polya maintains a clear separation between a type and its implementation t...
A Simple Semantics for ML Polymorphism We give a framework for denotational semantics for the polymo...
There exists an identifiable programming style based on the widespread use of type information handl...
Programming language implementations bridge the gap between what the program developer sees and unde...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
A definitional interpreter defines the semantics of an object language in terms of the (well-known) ...
A functional language is introduced, whose type system is defined by its meta-circular interpreter. ...
This paper concerns techniques for providing a convenient syntax for object languages implemented vi...
We show how programming language semantics and definitions of their corresponding type systems can b...
This paper is concerned with the type analysis of logic programs where, by type, we mean a property ...
Abstract. We develop a system of type assignment with intersection types, union types, indexed types...
Our objective is to understand the notion of type in programming languages, present a model of typed...
This paper describes a scheme for the abstract interpretation of logic programs based on type inform...
We develop a system of type assignment with intersection types, union types, indexed types, and univ...
The programming language Polya maintains a clear separation between a type and its implementation t...
A Simple Semantics for ML Polymorphism We give a framework for denotational semantics for the polymo...
There exists an identifiable programming style based on the widespread use of type information handl...
Programming language implementations bridge the gap between what the program developer sees and unde...
Our objective is to understand the notion of type in programming languages, present a model of typed...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...