700 search results - page 33 / 140 » On Termination of Constraint Logic Programs |
154
Voted
COMPSAC
2011
IEEE
14 years 12 days ago
2011
IEEE
108
Voted
PPDP
2004
Springer
15 years 6 months ago
2004
Springer
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
133
Voted
EUSFLAT
2009
14 years 10 months ago
2009
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
86
Voted
LOPSTR
1998
Springer
15 years 4 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
121
Voted
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...