331 search results - page 23 / 67 » HOLCF: Higher Order Logic of Computable Functions |
97
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
128
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
101
Voted
DOCENG
2007
ACM
15 years 4 months ago
2007
ACM
We present in this paper a method for document layout analysis based on identifying the function of document elements (what they do). This approach is orthogonal and complementary...
ENTCS
2007
15 years 10 days ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
JSW
2006
15 years 10 days ago
2006
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...