3793 search results - page 651 / 759 » Expressive Description Logics |
ICFP
2003
ACM
15 years 10 months ago
2003
ACM
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
PLDI
2009
ACM
15 years 5 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
102
click to vote
LFCS
2007
Springer
15 years 4 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
TLDI
2005
ACM
15 years 3 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...