Type rules associate types to expressions given a typing con-text. As the type checker traverses the expression tree top-down, it extends the typing context with additional context information that becomes available. This way, the typing context coordinates type checking in otherwise independent subexpressions, which inhibits parallelization and incremen-talization of type checking. We propose a co-contextual formulation of type rules that only take an expression as input and produce a type and a set of context requirements. Co-contextual type checkers tra-verse an expression tree bottom-up and merge context require-ments of independently checked subexpressions. We describe a method for systematically constructing a co-contextual for-mulati...
AbstractThis article presents a type system for context-dependent overloading, based on the notion o...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
International audienceWe present a second-order λ-calculus with coercion constraints that generalize...
Type rules associate types to expressions given a typing context. As the type checker traverses the ...
This thesis proposes a novel way of performing type checking, whose results are incremental, dependi...
This paper addresses compositional and incremental type checking for object-oriented programming lan...
Modern languages are equipped with static type checking/inference that helps programmers to keep a c...
Covariant types are a powerful language feature for improving type-safety. However, covariant types ...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-ch...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Abstract: "In prior work we introduced a pure type assignment system that encompasses a rich set of ...
Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-ch...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
We consider the problems of first-order unification and type inference from a general perspective on...
AbstractThis article presents a type system for context-dependent overloading, based on the notion o...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
International audienceWe present a second-order λ-calculus with coercion constraints that generalize...
Type rules associate types to expressions given a typing context. As the type checker traverses the ...
This thesis proposes a novel way of performing type checking, whose results are incremental, dependi...
This paper addresses compositional and incremental type checking for object-oriented programming lan...
Modern languages are equipped with static type checking/inference that helps programmers to keep a c...
Covariant types are a powerful language feature for improving type-safety. However, covariant types ...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-ch...
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known t...
Abstract: "In prior work we introduced a pure type assignment system that encompasses a rich set of ...
Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-ch...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
We consider the problems of first-order unification and type inference from a general perspective on...
AbstractThis article presents a type system for context-dependent overloading, based on the notion o...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
International audienceWe present a second-order λ-calculus with coercion constraints that generalize...