ENTCS
2006
13 years 4 months ago
2006
In object-oriented languages, the Visitor pattern can be used to traverse tree-like data structures: a visitor object contains some operations, and the data structure objects allo...
HOA
1995
13 years 8 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
ICFP
2004
ACM
14 years 4 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...