1320 search results - page 94 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
230
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
121
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
144
click to vote
ECOOP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
147
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
108
click to vote
FAC
2000
15 years 3 months ago
2000
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...