MFCS
1989
Springer
13 years 11 months ago
1989
Springer
RTA
1987
Springer
13 years 11 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
CTRS
1987
13 years 11 months ago
1987
CTRS
1987
13 years 11 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
CAAP
1990
13 years 11 months ago
1990
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
ACM
1987
13 years 11 months ago
1987
Balanced codes have the property that no codeword is "contained" in another.This property makes balanced codes attractive for certain applications, such as the encoding ...
STACS
1991
Springer
13 years 11 months ago
1991
Springer
STACS
1991
Springer
13 years 11 months ago
1991
Springer
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...
STACS
1991
Springer
13 years 11 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
STACS
1991
Springer
13 years 11 months ago
1991
Springer
