3481 search results - page 267 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
137
click to vote
KSEM
2010
Springer
15 years 2 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
141
click to vote
JFP
2000
15 years 3 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
235
click to vote
ECOOP
2009
Springer
16 years 4 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
161
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
125
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...