3738 search results - page 171 / 748 » Parametrized Logic Programming |
SAS
2005
Springer
14 years 1 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
ICLP
2007
Springer
14 years 3 days ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
JUCS
2006
13 years 8 months ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
ICLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...