18429 search results - page 111 / 3686 » Typing dynamic typing |
150
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
121
Voted
SAS
2005
Springer
15 years 10 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
129
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
123
click to vote
TPHOL
1999
IEEE
15 years 8 months ago
1999
IEEE
The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinit...
184
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...