ABEL is a wide spectrum language developed at the University of Oslo. The applicative core of ABEL is a typed first order language with subtypes and partial functions. The paper presents a constructive fragment of the core, based on terminating generator induction. We show how subtypes can be used to augment expressiveness and strengthen syntactic controls
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
We study the notion of extensibility in functional data types, as a new approach to the problem of d...
We present an experiment in formally describing a programming language and its properties in constru...
We discuss how the 1st order specification and programming language ABEL could be extended with high...
Several problems arise when parametric subtypes are used in ABEL. This paper deals with subtype para...
We discuss how the 1'st order specification and programming language ABEL could be extended with hig...
This thesis describes techniques for efficiently performing polymorphic type inference for function...
National audienceGrammatical inference, or grammar induction, studies how to learn automatically imp...
Cardelli and Wegner developed a simple theory of object subtyping which was later to form the basis ...
Abstract. This paper introduces a coalgebraic foundation for coinduc-tive types, interpreted as sets...
International audienceBased on Harris’s substitutability criterion, the recent definitions of classe...
Consider a first order typed language, with semantics $S$ for expressions and types. Adding subtypin...
Developing and maintaining software commonly requires (1) adding new data type constructors to exist...
We propose a full-spectrum dependently typed programming language, Zombie, which supports general re...
AbstractThe need for subtyping in type systems with dependent types has been realized for some years...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
We study the notion of extensibility in functional data types, as a new approach to the problem of d...
We present an experiment in formally describing a programming language and its properties in constru...
We discuss how the 1st order specification and programming language ABEL could be extended with high...
Several problems arise when parametric subtypes are used in ABEL. This paper deals with subtype para...
We discuss how the 1'st order specification and programming language ABEL could be extended with hig...
This thesis describes techniques for efficiently performing polymorphic type inference for function...
National audienceGrammatical inference, or grammar induction, studies how to learn automatically imp...
Cardelli and Wegner developed a simple theory of object subtyping which was later to form the basis ...
Abstract. This paper introduces a coalgebraic foundation for coinduc-tive types, interpreted as sets...
International audienceBased on Harris’s substitutability criterion, the recent definitions of classe...
Consider a first order typed language, with semantics $S$ for expressions and types. Adding subtypin...
Developing and maintaining software commonly requires (1) adding new data type constructors to exist...
We propose a full-spectrum dependently typed programming language, Zombie, which supports general re...
AbstractThe need for subtyping in type systems with dependent types has been realized for some years...
Most dependently-typed programming languages either require that all expressions terminate (e.g. Coq...
We study the notion of extensibility in functional data types, as a new approach to the problem of d...
We present an experiment in formally describing a programming language and its properties in constru...