Sciweavers

947 search results - page 52 / 190
» Declarative Programming in Prolog
Sort
View
LICS
1994
IEEE
15 years 1 months ago
A Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Dale Miller
CORR
2007
Springer
172views Education» more  CORR 2007»
14 years 9 months ago
A Data-Parallel Version of Aleph
This is to present work on modifying the Aleph ILP system so that it evaluates the hypothesised clauses in parallel by distributing the data-set among the nodes of a parallel or di...
Stasinos Konstantopoulos
CP
2006
Springer
15 years 1 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
87
Voted
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 9 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
JSC
2010
105views more  JSC 2010»
14 years 8 months ago
Programming with narrowing: A tutorial
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
Sergio Antoy