54 search results - page 3 / 11 » Non-termination Inference for Constraint Logic Programs |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
FLUX is a programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledge. The core of FLUX is...
KRDB
2003
13 years 8 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...