|
Volumn , Issue , 1989, Pages 293-298
|
On the complexity of type inference with coercion
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ABSTRACT DATA TYPES;
CALCULATIONS;
COMPUTER ARCHITECTURE;
COMPUTER PROGRAMMING LANGUAGES;
DIFFERENTIATION (CALCULUS);
FORESTRY;
POLYNOMIAL APPROXIMATION;
SET THEORY;
FOLLOWING PROBLEM;
LAMBDA CALCULUS;
PARTIALLY ORDERED SET;
POLYNOMIAL-TIME;
PRACTICAL IMPORTANCE;
SATISFIABILITY PROBLEMS;
SINGLE INHERITANCE;
TYPE INFERENCES;
FUNCTIONAL PROGRAMMING;
|
EID: 85030718602
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/99370.99394 Document Type: Conference Paper |
Times cited : (16)
|
References (8)
|