170 search results - page 1 / 34 » Parsing with Non-Deterministic Functions |
AGP
1998
IEEE
15 years 2 months ago
1998
IEEE
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
73
Voted
ENTCS
2007
14 years 10 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
ENTCS
2002
14 years 10 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
121
click to vote
COCO
2000
Springer
15 years 2 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
139
Voted
CPP
2011
13 years 10 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...