329 search results - page 57 / 66 » Resolution-based argumentation semantics |
ICFP
2006
ACM
14 years 9 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ESWS
2009
Springer
14 years 4 months ago
2009
Springer
Reliable methods to assess the costs and benefits of ontologies are an important instrument to demonstrate the tangible business value of semantic technologies within enterprises,...
IWMM
2009
Springer
14 years 4 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...