1950 search results - page 159 / 390 » Lambda-Free Logical Frameworks |
186
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
150
Voted
ITC
2002
IEEE
15 years 11 months ago
2002
IEEE
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
194
click to vote
AADEBUG
2000
Springer
15 years 11 months ago
2000
Springer
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
142
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
179
click to vote
ENTCS
2002
15 years 6 months ago
2002
In this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing ...