8766 search results - page 524 / 1754 » Functional logic programming |
137
click to vote
LFCS
1992
Springer
15 years 8 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
135
click to vote
ICSM
1998
IEEE
15 years 9 months ago
1998
IEEE
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
167
click to vote
AAAI
2007
15 years 7 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
137
click to vote
ESOP
2010
Springer
15 years 11 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
136
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...