6554 search results - page 236 / 1311 » Constraint Logic Programming |
163
click to vote
PLPV
2010
ACM
16 years 3 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
178
click to vote
FOSSACS
2001
Springer
15 years 11 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
148
click to vote
WLP
2005
Springer
15 years 12 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...
179
click to vote
NMELP
1994
15 years 10 months ago
1994
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
174
click to vote
ICLP
2005
Springer
16 years 9 hour ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...