SFP
2001
13 years 6 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
CMSB
2006
Springer
13 years 8 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
ESOP
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
ECOOP
1998
Springer
13 years 8 months ago
1998
Springer
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
GI
1999
Springer
13 years 8 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...
EMSOFT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a framework to extend the concept of type systems in programming languages to capture the dynamic interaction in component-based design, such as the communicat...
PLDI
2010
ACM
13 years 9 months ago
2010
ACM
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
SPIN
2005
Springer
13 years 10 months ago
2005
Springer
We present ETCH, an enhanced type checking tool for the Promela language. This tool uses standard type checking in conjunction with constraint-based type inference to detect type e...
ICDT
2005
ACM
13 years 10 months ago
2005
ACM
Abstract. We survey work on statically type checking XML transformations, covering a wide range of notations and ambitions. The concept of type may vary from idealizations of DTD t...
TLDI
2005
ACM
13 years 10 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...