94 search results - page 12 / 19 » Confluence of Conditional Rewrite Systems |
107
Voted
ICFP
2010
ACM
15 years 20 days ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
101
Voted
RTA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
111
Voted
ENTCS
2008
15 years 15 days ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
105
Voted
AAECC
2007
Springer
15 years 17 days ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
117
Voted
UPP
2004
Springer
15 years 5 months ago
2004
Springer
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...