We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.

In recent works on program analysis, transformations of various programming languages to term rewriting are used. In this setting, constraints appear naturally. Several definitions which combine rewriting with logical constraints, or with separate rules for integer functions, have been proposed. This paper seeks to unify and generalise these proposals.

We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the Danos-Regnier one.

We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar deened by such a rewriting system (connuent and strong normalizing on the new proof nets) gives a correctness criterion that we s h o w equivalent to the Danos-Regnier one.

Database users often submit similar queries to retrieve certain information from the database. We use user access event to represent a set of similar queries. A user access event contains an SQL template and a set of parameters, where the value of a parameter can be a constant or a variable. For example, event (“select name from customer where id =%”,101) represents a single query which retriev...

This paper discusses a generalized version of #-rewriting systems with context rules. It demonstrates that this context-based generalization does not affect the generative power of #-rewriting systems of finite index. A new characterization of the infinite hierarchy of language families generated by programmed grammars of finite index is obtained.

We study infinitary term rewriting systems containing finitely many rules. For these, we show that if a weakly convergent reduction is not strongly convergent, it contains a term that reduces to itself in one step (but the step itself need not be part of the reduction). Using this result, we prove the starkly surprising result that for any orthogonal system with finitely many rules, the system ...

An approach to program design and synthesis using algebraalgorithmic specifications and rewriting rules techniques is proposed. An algebra-algorithmic toolkit based on the approach allows building syntactically correct and easy-to-understand algorithm specifications. The term rewriting system supplements the algebra-algorithmic toolkit with facilities for transformation of the sequential and pa...

This paper describes an automatic procedure, the Semgrex-Plus tool, we developed to convert dependency treebanks into different formats. It allows for the definition of formal rules for rewriting dependencies and token tags as well as an algorithm for treebank rewriting able to avoid rule interference during the conversion process. This tool is publicly available1.

Algebraic programming system APS integrates four main paradigms of computations: procedural , functional, algebraic (rewriting rules) and logical. All of them may be used in diierent combinations on diierent levels of implementation. Formal models used in the developing computational techniques for APS are presented and discussed. It includes data structures, algebraic modules, rewriting and co...