two types t1 and t2, are there instances σ(t1) and σ(t2) denoting a common element? By answering this question we solve a main problem towards a type checking algorithm for non-disjoint types that raises an error just for function calls that cannot be executed successfully. For dynamically typed functional languages such a type checker can extend actual soft typing systems in order to reject provably ill-typed programs. 1.
Although type systems do detect type errors in programs, they often produce uninformative error mes...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
A first-order type system has two things to commend it. Firstly, it is quite simple to implement a t...
We describe an algorithm approximating the following ques-tion: Given two types t1 and t2, are there...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
Dependently typed programming languages provide a powerful tool for proving code correct. However, t...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
This thesis presents a type system which supports the strong static type checking of programs develo...
We discuss the properties of strictly typed languages on the one hand and soft typing of the other a...
use of program operations. They can be classified as either static or dynamic depending on when they...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
Most statically typed functional programming languages allow programmers to write partial functions:...
We study the type inference problem for a system with type classes as in the functional programming ...
to find the "best" or "most general" type (called the principal type in the case...
Although type systems do detect type errors in programs, they often produce uninformative error mes...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
A first-order type system has two things to commend it. Firstly, it is quite simple to implement a t...
We describe an algorithm approximating the following ques-tion: Given two types t1 and t2, are there...
We present a simple type-checker for a language with dependent types and let expressions, with a sim...
Dependently typed programming languages provide a powerful tool for proving code correct. However, t...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
This thesis presents a type system which supports the strong static type checking of programs develo...
We discuss the properties of strictly typed languages on the one hand and soft typing of the other a...
use of program operations. They can be classified as either static or dynamic depending on when they...
Haskell has a rich type system with various complementary, interacting and overlapping features. In ...
AbstractWe present a simple type-checker for a language with dependent types and let expressions, wi...
Most statically typed functional programming languages allow programmers to write partial functions:...
We study the type inference problem for a system with type classes as in the functional programming ...
to find the "best" or "most general" type (called the principal type in the case...
Although type systems do detect type errors in programs, they often produce uninformative error mes...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
A first-order type system has two things to commend it. Firstly, it is quite simple to implement a t...