1385 search results - page 101 / 277 » Natural Rewriting for General Term Rewriting Systems |
165
click to vote
PASTE
2010
ACM
15 years 8 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
188
click to vote
INAP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
158
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
165
click to vote
CADE
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
166
click to vote
COSIT
2003
Springer
15 years 11 months ago
2003
Springer
The scope of this paper is a qualitative description of terrain features that can be characterized using the silhouette of a terrain. The silhouette is a profile of a landform seen...