539 search results - page 93 / 108 » Symmetric Argumentation Frameworks |
ICFP
2006
ACM
15 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...
106
click to vote
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
91
Voted
ALT
2008
Springer
15 years 6 months ago
2008
Springer
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
103
click to vote
PLPV
2010
ACM
15 years 6 months ago
2010
ACM
Some programs are doubly-generic. For example, map is datatypegeneric in that many different data structures support a mapping operation. A generic programming language like Gener...
87
Voted
PPDP
2009
Springer
15 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...