|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 486 occurrences of 244 keywords
|
|
|
Results
Found 1270 publication records. Showing 1270 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
114 | Yoshihito Toyama |
Confluent Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 1, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
99 | Zena M. Ariola |
Relating graph and term rewriting via Böhm models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(5), pp. 401-426, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Term model, Compiler optimizations, Correctness, Term rewriting, Graph rewriting |
94 | Su Feng |
Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(4), pp. 496-513, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
automated formal proving, cover-set induction, dynamic term rewriting calculus, weakly ground termination, term rewriting system |
94 | Takahito Aoto 0001, Toshiyuki Yamada |
Dependency Pairs for Simply Typed Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 120-134, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
92 | Makoto Hamana |
Term rewriting with variable binding: an initial algebra approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 27-29 August 2003, Uppsala, Sweden, pp. 148-159, 2003, ACM, 1-58113-705-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
abstract syntax with variable binding, monadic semantics of term rewriting systems, term rewriting systems, higher-order abstract syntax, initial algebra semantics |
83 | Philippe Balbiani, Luis Fariñas del Cerro |
Affine Geometry of Collinearity and Conditional Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 196-213, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
83 | Aart Middeldorp |
Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings, pp. 577, 1999, Springer, 3-540-66536-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
82 | Makoto Hamana |
An initial algebra approach to term rewriting systems with variable binders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
High. Order Symb. Comput. ![In: High. Order Symb. Comput. 19(2-3), pp. 231-262, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Abstract syntax with variable binding, Term rewriting systems, Higher-order abstract syntax, Initial algebra semantics |
80 | Xuezheng Fu, Hao Wang, William L. Harrison, Robert W. Harrison |
RNA Pseudoknot Prediction Using Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 19-21 October 2005, Minneapolis, MN, USA, pp. 169-176, 2005, IEEE Computer Society, 0-7695-2476-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
80 | Gregory J. Duck, Peter J. Stuckey, Sebastian Brand |
ACD Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, pp. 117-131, 2006, Springer, 3-540-36635-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
80 | Yoshihito Toyama |
How to Prove Equivalence of Term Rewriting Systems without Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 118-127, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
79 | Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati |
Natural Rewriting for General Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Based Program Synthesis and Transformation, 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers, pp. 101-116, 2004, Springer, 3-540-26655-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
75 | Takashi Nagaya, Yoshihito Toyama |
Decidability for Left-Linaer Growing Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 256-270, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
73 | Andrea Corradini 0001, Fabio Gadducci, Ugo Montanari |
Relating Two Categorial Models of Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 225-240, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
concurrency, term rewriting, rewriting logic, categorical models |
70 | Detlef Plump |
Simplification Orders for Term Graph Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings, pp. 458-467, 1997, Springer, 3-540-63437-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
69 | Massimo Marchiori |
On the Expressive Power of Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings, pp. 88-102, 1997, Springer, 3-540-63876-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
69 | Yohan Boichut, Thomas Genet |
Feasible Trace Reconstruction for Rewriting Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 123-135, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | John Field |
A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 259-273, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
68 | Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries |
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 1-12, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
orthogonal term rewriting systems, infinitary rewriting, strong converging reductions, infinite Church-Rosser Properties, Böhm Trees, head normal forms, non-unifiable term rewriting systems, normal forms |
67 | Mark van den Brand, Paul Klint, Jurgen J. Vinju |
Term rewriting with traversal functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 12(2), pp. 152-190, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Automated tree traversal, types, term rewriting |
67 | Hubert Comon, Jean-Pierre Jouannaud (eds.) |
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![Springer, 3-540-59340-3 The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
67 | Hélène Kirchner |
Some Extensions of Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 54-73, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Yves Lafont |
Equational Reasoning with Two-Dimensional Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 170-195, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Yuri V. Matiyasevich |
Word Problem for Thue Systems with a Few Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 39-53, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Claude Marché |
Normalized Rewriting - Application to Ground Completion and Standard Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 154-169, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Jean-François Rey |
Burnside Monoids, Word Problem and the Conjecture of Brzozowski. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 214-221, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Philippe le Chenadec |
A Survey of Symmetrized and Complete Group Presentations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 135-153, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Michael Bertol, Volker Diekert |
On Efficient Reduction Algorithms for Some Trace Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 114-126, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Gerard Lallement |
The Word Problem for Thue Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 27-38, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Max Dauchet |
Rewriting and Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 95-113, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Nachum Dershowitz |
Examples of Termination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 16-26, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Géraud Sénizergues |
Formal Languages and Word-Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 75-94, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Jean-Pierre Jouannaud |
Introduction to Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 1-15, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Robert H. Gilman 0001 |
Automatic Groups and String Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 127-134, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
67 | Bruno Courcelle |
Graph Rewriting: A Bibliographical Guide. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Term Rewriting ![In: Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course, pp. 74, 1993, Springer, 3-540-59340-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
65 | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann |
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 297-312, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
64 | Shilong Ma, Yuefei Sui, Ke Xu 0001 |
Well limit behaviors of term rewriting systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Comput. Sci. China ![In: Frontiers Comput. Sci. China 1(3), pp. 283-296, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gröbner bases, well-foundedness, term rewriting systems, limits |
64 | Richard C. Potter, David A. Plaisted |
Term Rewriting: Some Experimental Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings, pp. 435-453, 1988, Springer, 3-540-19343-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Theorem proving, set theory, term rewriting |
63 | Sara Porat, Nissim Francez |
Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings, pp. 21-41, 1986, Springer, 3-540-16780-3. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
62 | Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema |
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 353-367, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
61 | Detlef Plump |
On Termination of Graph Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 88-100, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
60 | Grigore Rosu, Klaus Havelund |
Rewriting-Based Techniques for Runtime Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Softw. Eng. ![In: Autom. Softw. Eng. 12(2), pp. 151-197, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
verification, rewriting, runtime analysis |
60 | Takahito Aoto 0001, Toshiyuki Yamada |
Termination of Simply Typed Term Rewriting by Translation and Labelling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 380-394, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
60 | Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki |
Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '93, Gmunden, Austria, September 15-17, 1993, Proceedings, pp. 256-271, 1993, Springer, 3-540-57235-X. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
60 | Bernhard Gramlich |
Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning,International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings, pp. 285-296, 1992, Springer, 3-540-55727-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
60 | Jia-Huai You, P. A. Subrahmanyam |
E-Unification Algorithms for a Class of Confluent Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 454-463, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
59 | Grigore Rosu |
On implementing behavioral rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Workshop on Rule-Based Programming ![In: Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, Pittsburgh, Pennsylvania, USA, 2002, pp. 43-52, 2002, ACM, 1-58113-606-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
behavioral rewriting, hidden equational logic, term rewriting, meta-programming |
58 | Yuki Chiba, Takahito Aoto 0001, Yoshihito Toyama |
Program transformation by templates based on term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 11-13 2005, Lisbon, Portugal, pp. 59-69, 2005, ACM, 1-59593-090-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
inductive theorem proving, tree homomorphism, program transformation, term rewriting |
58 | Salvador Lucas, José Meseguer 0001 |
Termination of Fair Computations in Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings, pp. 184-198, 2005, Springer, 3-540-30553-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
fairness, program analysis, Concurrent programming, termination, term rewriting |
57 | Takahito Aoto 0001 |
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP/ALP ![In: Principles of Declarative Programming, 10th International Symposium, PLILP'98 Held Jointly with the 7th International Conference, ALP'98, Pisa, Italy, September 16-18, 1998, Proceedings, pp. 250-265, 1998, Springer, 3-540-65012-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
57 | M. R. K. Krishna Rao |
Graph Reducibility of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 371-381, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
56 | René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp |
Adding constants to string rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 19(1), pp. 27-38, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Termination, Term rewriting, Confluence, String rewriting |
56 | Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong |
Reachability Analysis over Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 33(3-4), pp. 341-383, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis |
56 | Pierre Lescanne |
Computer Experiments with the Reve Term Rewriting System Generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983, pp. 99-108, 1983, ACM Press, 0-89791-090-7. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
program verifier, termination, abstract data types, induction, term rewriting systems, theorem prover, equational theories, word problem |
54 | Amy P. Felty |
A Logic Programming Approach to Implementing Higher-Order Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ELP ![In: Extensions of Logic Programming, Second International Workshop, ELP'91, Stockholm, Sweden, January 27-29, 1991, Proceedings, pp. 135-161, 1991, Springer, 3-540-55498-X. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
54 | Takahito Aoto 0001 |
Dealing with Non-orientable Equations in Rewriting Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 242-256, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
53 | Sergio Antoy, Stephen Johnson |
Formalization and abstract implementation of rewriting with nested rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 24-26 August 2004, Verona, Italy, pp. 144-154, 2004, ACM, 1-58113-819-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
term rewriting systems, non-determinism, narrowing, functional logic programming, block structured |
53 | Salvador Lucas |
Termination of Context-Sensitive Rewriting by Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 122-133, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
functional programming, termination, term rewriting |
53 | Giorgio Delzanno, Roberto Montagna |
Reachability analysis of fragments of mobile ambients in AC term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 20(4-5), pp. 407-428, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Petri nets, Term rewriting, Reachability, Mobile ambients |
53 | Hans Zantema |
The Termination Hierarchy for Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(1/2), pp. 3-19, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Monotone algebras, Termination, Term rewriting, String rewriting |
51 | Yoshihito Toyama |
Reduction Strategies for Left-Linear Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Processes, Terms and Cycles ![In: Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, pp. 198-223, 2005, Springer, 3-540-30911-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Christoph Lüth |
Compositional Term Rewriting: An Algebraic Proof of Toyama's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 261-275, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
51 | Matthias Mutz |
Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 3rd International Workshop, CAV '91, Aalborg, Denmark, July, 1-4, 1991, Proceedings, pp. 277-287, 1991, Springer, 3-540-55179-4. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
51 | Reinhard Bündgen |
Applying Term Rewriting Methods to Finite Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings, pp. 332-346, 1990, Springer, 3-540-53162-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
51 | Andrea Corradini 0001, Fabio Gadducci |
Rational Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structure, First International Conference, FoSSaCS'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, pp. 156-171, 1998, Springer, 3-540-64300-1. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
51 | Emmanuel Kounalis |
Testing for Inductive (Co)-Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '90, 15th Colloquium on Trees in Algebra and Programming, Copenhagen, Denmark, May 15-18, 1990, Proceedings, pp. 221-238, 1990, Springer, 3-540-52590-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations |
51 | Naoki Nishida 0001, Masahiko Sakai, Toshiki Sakabe |
Partial Inversion of Constructor Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 264-278, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Jacques Chabin, Pierre Réty |
Visibly Pushdown Languages and Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007, Proceedings, pp. 252-266, 2007, Springer, 978-3-540-74620-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
term rewriting, tree languages |
49 | Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko |
Finer Is Better: Abstraction Refinement for Rewriting Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 48-62, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Detlef Plump |
Critical Pairs in Term Graph Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings, pp. 556-566, 1994, Springer, 3-540-58338-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
49 | Friedrich Otto |
On the Connections between Rewriting and Formal Language Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 332-355, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Gianni Aguzzi, U. Modigliani |
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pp. 114-124, 1993, Springer, 3-540-57529-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
49 | Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries |
On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 16(3), pp. 493-523, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
orthogonal term rewriting, functional programming, graph rewriting |
48 | Yoshiharu Kojima, Masahiko Sakai |
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 19th International Conference, RTA 2008, Hagenberg, Austria, July 15-17, 2008, Proceedings, pp. 187-201, 2008, Springer, 978-3-540-70588-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
48 | Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju |
Environments for Term Rewriting Engines for Free! ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings, pp. 424-435, 2003, Springer, 3-540-40254-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Reinhard Bündgen, Wolfgang Küchlin, Werner Lauterbach |
Verification of the Sparrow Processor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: IEEE Symposium and Workshop on Engineering of Computer Based Systems (ECBS'96), March 11-15, 1996, Friedrichshafen, Germany., pp. 86-, 1996, IEEE Computer Society, 0-8186-7355-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
symbolic hardware simulation, equational specifications, term rewriting, Hardware verification |
48 | Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 |
Complexity of Sufficient-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 426-442, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
normal forms, term rewriting systems, PSPACE, Sufficient-completeness |
48 | Yuki Chiba, Takahito Aoto 0001 |
RAPT: A Program Transformation System Based on Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 17th International Conference, RTA 2006, Seattle, WA, USA, August 12-14, 2006, Proceedings, pp. 267-276, 2006, Springer, 3-540-36834-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest |
A3PAT, an approach for certified automated termination proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2010, Madrid, Spain, January 18-19, 2010, pp. 63-72, 2010, ACM, 978-1-60558-727-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
termination, term rewriting, automated reasoning, formal proof |
47 | Salvador Lucas |
Context-Sensitive Computations in Confluent Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLILP ![In: Programming Languages: Implementations, Logics, and Programs, 8th International Symposium, PLILP'96, Aachen, Germany, September 24-27, 1996, Proceedings, pp. 408-422, 1996, Springer, 3-540-61756-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
functional programming, term rewriting systems, confluence |
47 | Satoru Tomura |
TDProlog: An Extended Prolog with Term Description. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LP ![In: Logic Programming '85, Proceedings of the 4th Conference, Tokyo, Japan, July 1-3, 1985, pp. 180-191, 1985, Springer, 3-540-16479-0. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
47 | Jörg Endrullis, Johannes Waldmann, Hans Zantema |
Matrix Interpretations for Proving Termination of Term Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 40(2-3), pp. 195-220, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Matrix interpretations, Satisfiability, Termination, Term rewriting |
47 | Keiichirou Kusakari, Masahiko Sakai |
Enhancing dependency pair method using strong computability in simply-typed term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(5), pp. 407-431, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair |
47 | M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer |
Prototyping 3APL in the Maude term rewriting language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 1279-1281, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
prototyping, term rewriting, agent programming languages |
47 | Sergio Antoy, John D. Gannon |
Using Term Rewriting to Verify Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(4), pp. 259-274, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
verification tasks, while statements, representation functions, generic program units, abstract base classes, algebraic axioms, Boyer-Moore prover, mechanical assistance, software tools, theorem proving, convergence, program verification, abstract data types, abstract data types, term rewriting, rewriting systems, sufficient completeness, structural induction |
47 | Rolf Socher-Ambrosius |
Boolean Algebra Admits No Convergent Term Rewriting System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 264-274, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Term Rewriting, Boolean Algebra, Automated Theorem Proving |
46 | Ke Li |
Optimization of Rewriting and Complexity of Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings, pp. 359-371, 1990, Springer, 3-540-53162-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
46 | Guillem Godoy, Eduard Huntingford |
Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 184-199, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Isabel Oitavem |
A term rewriting characterization of the functions computable in polynomial space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 41(1), pp. 35-47, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
45 | Jan Willem Klop |
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings, pp. 350-369, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
44 | J. F. Th. Kamperman, H. R. Walters |
Lazy Rewriting and Eager Machinery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings, pp. 147-162, 1995, Springer, 3-540-59200-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
43 | Youngchoon Park, Pan-Koo Kim, Forouzan Golshani, Sethuraman Panchanathan |
Technique for eliminating irrelevant terms in term rewriting for annotated media retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 9th ACM International Conference on Multimedia 2001, Ottawa, Ontario, Canada, September 30 - October 5, 2001, pp. 582-584, 2001, ACM, 1-58113-394-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Femke van Raamsdonk |
Higher-Order Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 220-239, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Rémy Haemmerlé, François Fages |
Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 214-228, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Paul Klint, Tijs van der Storm, Jurgen J. Vinju |
Term Rewriting Meets Aspect-Oriented Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Processes, Terms and Cycles ![In: Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday, pp. 88-105, 2005, Springer, 3-540-30911-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | M. R. K. Krishna Rao |
Inductive Inference of Term Rewriting Systems from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings, pp. 69-82, 2004, Springer, 978-3-540-23356-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Andrea Corradini 0001 |
Term Rewriting in CT-Sigma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'93: Theory and Practice of Software Development, International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993, Proceedings, pp. 468-484, 1993, Springer, 3-540-56610-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
43 | Berthold Hoffmann |
Term Rewriting with Sharing and Memoïzation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings, pp. 128-142, 1992, Springer, 3-540-55873-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
43 | Yves Bertot |
Origin Functions in Lambda-Calculus and Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings, pp. 49-65, 1992, Springer, 3-540-55251-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
43 | Uday S. Reddy |
Term Rewriting Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings, pp. 162-177, 1990, Springer, 3-540-52885-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1270 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|