Abstract | ||
---|---|---|
We present a new analysis that infers polymorphic type dependencies in logic programs. The analysis infers more precise information than previous type dependency inference analyses. The improvement in precision is achieved by making use of set union as a type constructor and non-deterministic type definitions. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1145/1389449.1389467 | PPDP |
Keywords | Field | DocType |
type constructor,previous type dependency inference,polymorphic type dependency,analysis infers,precise polymorphic type dependency,set union,precise information,non-deterministic type definition,new analysis,logic program,dependent types,polymorphism,type inference | Programming language,Inference,Abstract interpretation,Computer science,Theoretical computer science,Type inference,Type constructor | Conference |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
1 |