89 search results - page 17 / 18 » A Program Inverter for a Functional Language with Equality a... |
FOIKS
2006
Springer
13 years 11 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...