Efficient inference of partial types

Journal of Computer and System Sciences

Volumn 49, Issue 2, 1994, Pages 306-324

  Kozen, Dexter ^a   Palsberg, Jens ^b   Schwartzbach, Michael I ^b  

^a Computer Science Department Cornell University ^*  (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; FINITE AUTOMATA; INFERENCE ENGINES; RECURSIVE FUNCTIONS; SET THEORY;

CANONICAL SOLUTION; EXPONENTIAL TIME ALGORITHM; LAMBDA CALCULUS; PARTIAL TYPES; TYPE INFERENCE;

ALGORITHMS;

EID: 0028517946     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(05)80051-0     Document Type: Article

References (9)

1. Subtyping recursive types
2. Efficient inference of partial types
3. Efficient recursive subtyping
4. Type inference for partial types is decidable
5. Normal forms have partial types
6. Safety analysis versus type inference for partial types
7. Type inference with partial types