User loginNavigation 
Automatic type inference via partial evaluation
Automatic type inference via partial evaluation. Aaron Tomb, Cormac Flanagan. PPDPâ€™05.
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significantly. The type checker is typically a straightforward encoding of the original type rules. For many systems, type inference is performed using a twophase, constraintbased algorithm.We present an approach that, given the original type rules written as clauses in a logic programming language, automatically generates an efficient, twophase, constraintbased type inference algorithm. Our approach works by partially evaluating the type checking rules with respect to the target program to yield a set of constraints suitable for input to an external constraint solver. This approach avoids the need to manually develop and verify a separate type inference algorithm, and is ideal for experimentation with and rapid prototyping of novel type systems. Also somewhat relevant to the discussions here about type checking as abstract interpretation. By Ehud Lamm at 20050717 10:55  Logic/Declarative  MetaProgramming  Type Theory  other blogs  6856 reads

Browse archives
Active forum topicsNew forum topics 
Recent comments
1 week 1 day ago
1 week 1 day ago
1 week 2 days ago
1 week 4 days ago
2 weeks 2 days ago
2 weeks 3 days ago
2 weeks 4 days ago
2 weeks 5 days ago
3 weeks 1 day ago
3 weeks 4 days ago