Sciweavers

1003 search results - page 90 / 201
» Type Inference with Inequalities
Sort
View
ICTAI
2007
IEEE
15 years 10 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
POPL
2004
ACM
16 years 4 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
FPCA
1989
15 years 8 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
ENTCS
2006
125views more  ENTCS 2006»
15 years 4 months ago
Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
Stephen T. Gilmore, Olha Shkaravska
CPAIOR
2006
Springer
15 years 7 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker