This thesis proposes a novel way of performing type checking, whose results are incremental, depending on the provided local information. This new way of type checking is called co-contextual, where all context information of expressions, methods, classes, etc., is removed. Instead, we introduce corresponding structures using requirements. Standard type systems are translated to the co-contextual ones systematically using dualism as technique. Type systems play an important role to prevent execution errors from occurring during runtime. They are used to check programs statically for potential errors. Programs are type checked against a given set of rules. Depending on these rules programs are well-typed or not. The set of these rules is ca...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
This paper introduces the Checker Framework, which supports adding pluggable type systems to the Jav...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
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...
Type rules associate types to expressions given a typing context. As the type checker traverses the ...
Type rules associate types to expressions given a typing con-text. As the type checker traverses the...
Modern languages are equipped with static type checking/inference that helps programmers to keep a c...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
Formal deductive systems are very common in computer science. They are used to represent logics, pro...
The contribution of the paper is twofold. First, we provide a general notion of type system supporti...
This thesis explores a novel design of context-sensitive optional type systems which supports gener...
Contextual type theories are largely explored in their applications to programming languages, but le...
Context-Oriented Programming (COP) is a programming paradigm to encourage modularization of context-...
The contribution of the paper is twofold. First, we define a general notion of type system equipped ...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
This paper introduces the Checker Framework, which supports adding pluggable type systems to the Jav...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...
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...
Type rules associate types to expressions given a typing context. As the type checker traverses the ...
Type rules associate types to expressions given a typing con-text. As the type checker traverses the...
Modern languages are equipped with static type checking/inference that helps programmers to keep a c...
A type checking method for the functional language LFC is presented. A distinct feature of LFC is th...
Formal deductive systems are very common in computer science. They are used to represent logics, pro...
The contribution of the paper is twofold. First, we provide a general notion of type system supporti...
This thesis explores a novel design of context-sensitive optional type systems which supports gener...
Contextual type theories are largely explored in their applications to programming languages, but le...
Context-Oriented Programming (COP) is a programming paradigm to encourage modularization of context-...
The contribution of the paper is twofold. First, we define a general notion of type system equipped ...
Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type er...
This paper introduces the Checker Framework, which supports adding pluggable type systems to the Jav...
AbstractThis paper presents a new approach to the problem of guaranteeing that definite logic progra...