850 search results - page 32 / 170 » A Logic Programming Language Based on Binding Algebras |
101
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
120
Voted
TLDI
2010
ACM
15 years 10 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
139
click to vote
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
100
click to vote
CLIMA
2007
15 years 2 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
110
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...