852 search results - page 53 / 171 » entcs 2010 |
ENTCS
2000
14 years 10 months ago
2000
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
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 ...
107
click to vote
ENTCS
2002
14 years 10 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
60
Voted
ENTCS
2002
14 years 10 months ago
2002
Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophica...
ENTCS
2002
14 years 10 months ago
2002
In this paper we present how refactoring of object-oriented programs can be accomplished by using refinement. Our approach is based on algebraic laws of an object-oriented languag...