Result 1 to 20 of 97 total
Correctness of program transformations as a termination problem. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 462-476 (2012).
1
Parameter reduction and automata evaluation for grammar-compressed trees. (English)
J. Comput. Syst. Sci. 78, No. 5, 1651-1669 (2012).
2
Fast equality test for straight-line compressed strings. (English)
Inf. Process. Lett. 112, No. 8-9, 341-345 (2012).
3
On the complexity of bounded second-order unification and stratified context unification. (English)
Log. J. IGPL 19, No. 6, 763-789 (2011).
4
Congruence closure of compressed terms in polynomial time. (English)
Tinelli, Cesare (ed.) et al., Frontiers of combining systems. 8th international symposium, FroCoS 2011, Saarbrücken, Germany, October 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24363-9/pbk). Lecture Notes in Computer Science 6989. Lecture Notes in Artificial Intelligence, 227-242 (2011).
5
Unification and matching on compressed terms (English)
ACM Trans. Comput. Log. 12, No. 4, 26 (2011).
6
Frontmatter, table of contents, preface, conference organization (English)
RTA, i-xvi (2011).
7
Congruence closure of compressed terms in polynomial time (English)
FroCos, 227-242 (2011).
8
A contextual semantics for concurrent haskell with futures (English)
PPDP, 101-112 (2011).
9
Proceedings of the 22nd international conference on rewriting techniques and applications, RTA 2011, May 30 - June 1, 2011, novi sad, serbia (English)
LIPIcs: RTA 10 (2011).
10
Simulation in the call-by-need lambda-calculus with letrec. (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, 295-310, electronic only (2010).
11
Closures of may-, should- and must-convergences for contextual equivalence. (English)
Inf. Process. Lett. 110, No. 6, 232-235 (2010).
12
Unification and matching on compressed terms. (English)
Comput. Res. Repos. 2010, Article No. 1003.1632 (2010).
13
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. (English)
Inf. Comput. 208, No. 3, 276-291 (2010).
14
On generic context lemmas for higher-order calculi with sharing. (English)
Theor. Comput. Sci. 411, No. 11-13, 1521-1541 (2010).
15
Context unification with one context variable. (English)
J. Symb. Comput. 45, No. 2, 173-193 (2010).
16
Towards correctness of program transformations through unification and critical pair computation (English)
UNIF, 39-53 (2010).
17
Simulation in the call-by-need lambda-calculus with letrec (English)
RTA, 295-310 (2010).
18
Unification with singleton tree grammars. (English)
Treinen, Ralf (ed.), Rewriting techniques and applications. 20th international conference, RTA 2009, Brasília, Brazil, June 29‒July 1, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02347-7/pbk). Lecture Notes in Computer Science 5595, 365-379 (2009).
19
Parameter reduction in grammar-compressed trees. (English)
de Alfaro, Luca (ed.), Foundations of software science and computational structures. 12th international conference, FOSSACS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22‒29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00595-4/pbk). Lecture Notes in Computer Science 5504, 212-226 (2009).
20
Result 1 to 20 of 97 total
Start
Contact
Print
General Help
