History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 | next | last

Result 1 to 20 of 42 total

Proving equality of streams automatically. (English)
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 ‒ June 1, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPICS ‒ Leibniz International Proceedings in Informatics 10, 393-408, electronic only (2011).
WorldCat.org
1
Lazy productivity via termination. (English)
Theor. Comput. Sci. 412, No. 28, 3203-3225 (2011).
WorldCat.org
2
On equal $μ$-terms. (English)
Theor. Comput. Sci. 412, No. 28, 3175-3202 (2011).
WorldCat.org
3
Levels of undecidability in rewriting. (English)
Inf. Comput. 209, No. 2, 227-245 (2011).
WorldCat.org
4
Proving equality of streams automatically (English)
RTA, 393-408 (2011).
WorldCat.org
5
Unique normal forms in infinitary weakly orthogonal rewriting. (English)
Lynch, Christopher (ed.), Proceedings of the 21st international conference on rewriting techniques and applications (RTA 2010), July 11‒13, 2010, Edinburgh, Scottland, UK. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-18-7). LIPICS ‒ Leibniz International Proceedings in Informatics 6, 85-102, electronic only (2010).
WorldCat.org
6
Local termination: theory and practice. (English)
Log. Methods Comput. Sci. 6, No. 3, Paper No. 20, 37 p., electronic only (2010).
WorldCat.org
7
Local termination: theory and practice. (English)
Comput. Res. Repos. 2010, Article No. 1006.4955 (2010).
WorldCat.org
8
Transforming outermost into context-sensitive rewriting. (English)
Log. Methods Comput. Sci. 6, No. 2, Paper No. 6, 39 p., electronic only (2010).
WorldCat.org
9
Transforming outermost into context-sensitive rewriting. (English)
Comput. Res. Repos. 2010, Article No. 1005.5648 (2010).
WorldCat.org
10
Asynchronous bounded expected delay networks. (English)
Comput. Res. Repos. 2010, Article No. 1003.2084 (2010).
WorldCat.org
11
Levels of undecidability in infinitary rewriting: normalization and reachability. (English)
Comput. Res. Repos. 2010, Article No. 1003.1057 (2010).
WorldCat.org
12
Modular construction of fixed point combinators and clocked boehm trees. (English)
Comput. Res. Repos. 2010, Article No. 1002.2578 (2010).
WorldCat.org
13
Productivity of stream definitions. (English)
Theor. Comput. Sci. 411, No. 4-5, 765-782 (2010).
WorldCat.org
14
Unique normal forms in infinitary weakly orthogonal rewriting (English)
RTA, 85-102 (2010).
WorldCat.org
15
Brief announcement: asynchronous bounded expected delay networks (English)
PODC, 392-393 (2010).
WorldCat.org
16
Automating the mean-field method for large dynamic gossip networks (English)
QEST, 241-250 (2010).
WorldCat.org
17
Modular construction of fixed point combinators and clocked Bohm trees (English)
LICS, 111-119 (2010).
WorldCat.org
18
Unique normal forms in infinitary weakly orthogonal term rewriting. (English)
Comput. Res. Repos. 2009, Article No. 0911.1009 (2009).
WorldCat.org
19
Let’s make a difference! (English)
Comput. Res. Repos. 2009, Article No. 0911.1004 (2009).
WorldCat.org
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 42 total

Valid XHTML 1.0 Transitional Valid CSS!