Sciweavers

198 search results - page 16 / 40
» Time Equations for Lazy Functional (Logic) Languages
Sort
View
POPL
2010
ACM
14 years 6 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
CSCLP
2007
Springer
14 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
ICLP
2005
Springer
14 years 2 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
HASKELL
2008
ACM
13 years 10 months ago
Language and program design for functional dependencies
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
Mark P. Jones, Iavor S. Diatchki
IJCAI
2003
13 years 10 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...