675 search results - page 9 / 135 » Programming Constraint Inference Engines |
OOPSLA
1991
Springer
13 years 11 months ago
1991
Springer
We present a new approach to inferring types in untyped object-oriented programs with inheritance, assignments, and late binding. It guarantees that all messages are understood, a...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
SAS
1994
Springer
14 years 1 days ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
ICSE
1997
IEEE-ACM
14 years 3 days ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...