23201 search results - page 140 / 4641 » Rewriting Systems with Data |
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
161
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...
192
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
173
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
179
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...