In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
d Abstract) Jos´e Bacelar Almeida, Jorge Sousa Pinto, and Miguel Vila¸ca 1,2,3 Departamento de Inform´atica Universidade do Minho 4710-057 Braga, Portugal
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...
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Even with todays hardware improvements, performance problems are still common in many software systems. An approach to tackle this problem for component-based software architectur...
Most large-scaled software systems are structured in distributed components to manage complexity and have to cope with concurrent executed threads. System decomposition and concur...
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...