1179 search results - page 46 / 236 » Programming in Hybrid Constraint Languages |
POPL
1998
ACM
14 years 2 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
ESOP
1992
Springer
14 years 2 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
POPL
1999
ACM
14 years 2 months ago
1999
ACM
Superfluous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational o...
CP
2009
Springer
14 years 10 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
PPDP
2004
Springer
14 years 3 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...