The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase term rewriting (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1977-1984 (24) 1985 (17) 1986 (18) 1987 (48) 1988 (28) 1989 (26) 1990 (30) 1991 (33) 1992 (80) 1993 (60) 1994 (47) 1995 (61) 1996 (34) 1997 (33) 1998 (39) 1999 (19) 2000 (25) 2001 (27) 2002 (37) 2003 (34) 2004 (31) 2005 (73) 2006 (70) 2007 (68) 2008 (45) 2009 (42) 2010 (19) 2011-2012 (16)
Publication types (Num. hits)
article(226) book(2) inproceedings(846) phdthesis(2) proceedings(8)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 487 occurrences of 244 keywords

Results
Found 1084 publication records. Showing 1084 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
4Su Feng Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF automated formal proving, cover-set induction, dynamic term rewriting calculus, weakly ground termination, term rewriting system
4Makoto Hamana Term rewriting with variable binding: an initial algebra approach. Search on Bibsonomy PPDP The full citation details ... 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
4Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). Search on Bibsonomy RTA The full citation details ... 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
3Giorgio Delzanno, Roberto Montagna Reachability analysis of fragments of mobile ambients in AC term rewriting. Search on Bibsonomy Formal Asp. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Petri nets, Term rewriting, Reachability, Mobile ambients
3Jörg Endrullis, Johannes Waldmann, Hans Zantema Matrix Interpretations for Proving Termination of Term Rewriting. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Matrix interpretations, Satisfiability, Termination, Term rewriting
3Shilong Ma, Yuefei Sui, Ke Xu Well limit behaviors of term rewriting systems. Search on Bibsonomy Frontiers of Computer Science in China The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gröbner bases, well-foundedness, term rewriting systems, limits
3Keiichirou Kusakari, Masahiko Sakai Enhancing dependency pair method using strong computability in simply-typed term rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair
3Jacques Chabin, Pierre Réty Visibly Pushdown Languages and Term Rewriting. Search on Bibsonomy FroCos The full citation details ... 2007 DBLP  DOI  BibTeX  RDF term rewriting, tree languages
3Makoto Hamana An initial algebra approach to term rewriting systems with variable binders. Search on Bibsonomy Higher-Order and Symbolic Computation The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Abstract syntax with variable binding, Term rewriting systems, Higher-order abstract syntax, Initial algebra semantics
3Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
3Yuki Chiba, Takahito Aoto RAPT: A Program Transformation System Based on Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
3M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer Prototyping 3APL in the Maude term rewriting language. Search on Bibsonomy AAMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF prototyping, term rewriting, agent programming languages
3Salvador Lucas, José Meseguer Termination of Fair Computations in Term Rewriting. Search on Bibsonomy LPAR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF fairness, program analysis, Concurrent programming, termination, term rewriting
3Naoki Nishida, Masahiko Sakai, Toshiki Sakabe Partial Inversion of Constructor Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
3Takahito Aoto, Toshiyuki Yamada Dependency Pairs for Simply Typed Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
3Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
3Santiago Escobar, José Meseguer, Prasanna Thati Natural Narrowing for General Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
3Yoshihito Toyama Confluent Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
3Yuki Chiba, Takahito Aoto, Yoshihito Toyama Program transformation by templates based on term rewriting. Search on Bibsonomy PPDP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF inductive theorem proving, tree homomorphism, program transformation, term rewriting
3Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong Reachability Analysis over Term Rewriting Systems. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2004 DBLP  DOI  BibTeX  RDF completion algorithm, Timbuk, tree automaton, term rewriting, reachability analysis
3Mark van den Brand, Paul Klint, Jurgen J. Vinju Term rewriting with traversal functions. Search on Bibsonomy ACM Trans. Softw. Eng. Methodol. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Automated tree traversal, types, term rewriting
3Hans Zantema The Termination Hierarchy for Term Rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Monotone algebras, Termination, Term rewriting, String rewriting
3Zena M. Ariola Relating graph and term rewriting via Böhm models. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Term model, Compiler optimizations, Correctness, Term rewriting, Graph rewriting
3Andrea Corradini, Fabio Gadducci, Ugo Montanari Relating Two Categorial Models of Term Rewriting. Search on Bibsonomy RTA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF concurrency, term rewriting, rewriting logic, categorical models
3Sergio Antoy, John D. Gannon Using Term Rewriting to Verify Software. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 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
3Philippe Balbiani, Luis Fariñas del Cerro Affine Geometry of Collinearity and Conditional Term Rewriting. Search on Bibsonomy Term Rewriting The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
3Rolf Socher-Ambrosius Boolean Algebra Admits No Convergent Term Rewriting System. Search on Bibsonomy RTA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Term Rewriting, Boolean Algebra, Automated Theorem Proving
3Richard C. Potter, David A. Plaisted Term Rewriting: Some Experimental Results. Search on Bibsonomy CADE The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Theorem proving, set theory, term rewriting
3Pierre Lescanne Computer Experiments with the Reve Term Rewriting System Generator. Search on Bibsonomy POPL The full citation details ... 1983 DBLP  DOI  BibTeX  RDF program verifier, termination, abstract data types, induction, term rewriting systems, theorem prover, equational theories, word problem
2Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest A3PAT, an approach for certified automated termination proofs. Search on Bibsonomy PEPM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF termination, term rewriting, automated reasoning, formal proof
2Stephan Falke, Deepak Kapur A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. Search on Bibsonomy CADE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Leslie De Koninck, Gregory J. Duck, Peter J. Stuckey Demand-Driven Normalisation for ACD Term Rewriting. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke Proving Termination of Integer Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Takahito Aoto, Junichi Yoshida, Yoshihito Toyama Proving Confluence of Term Rewriting Systems Automatically. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Jörg Endrullis, Herman Geuvers, Hans Zantema Degrees of Undecidability in Term Rewriting. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Rishiyur S. Nikhil Using GPCE principles for hardware systems and accelerators: (bridging the gap to HW design). Search on Bibsonomy GPCE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bluespec systemverilog, bsv, energy efficient computing, fpga, high level synthesis, high performance computing, haskell, hardware accelerators, hardware/software codesign, term rewriting systems, hybrid computing
2Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández A flexible framework for programming with non-deterministicfunctions. Search on Bibsonomy PEPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF call-time choice, local bindings, non-deterministic functions, run-time-choice, term rewriting systems
2Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp Tyrolean Termination Tool 2. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF automation, termination, term rewriting
2Klaus-Dieter Schewe, Bernhard Thalheim, Qing Wang Customising Web Information Systems According to User Preferences. Search on Bibsonomy World Wide Web The full citation details ... 2009 DBLP  DOI  BibTeX  RDF critical pair completion, media type, deontic constraint, preference rule, termination, term rewriting, personalisation, web information system, Church-Rosser property, Kleene algebra with tests
2Andrew Walenstein, Rachit Mathur, Mohamed R. Chouchane, Arun Lakhotia Constructing malware normalizers using term rewriting. Search on Bibsonomy Journal in Computer Virology The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Nishant Sinha Symbolic Program Analysis Using Term Rewriting and Generalization. Search on Bibsonomy FMCAD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2John P. Gallagher, Mads Rosendahl Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Gregory J. Duck, Leslie De Koninck, Peter J. Stuckey Cadmium: An Implementation of ACD Term Rewriting. Search on Bibsonomy ICLP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Yoshiharu Kojima, Masahiko Sakai Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Adam Koprowski, Hans Zantema Certification of Proving Termination of Term Rewriting by Matrix Interpretations. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Clara Bertolissi, Maribel Fernández A rewriting framework for the composition of access control policies. Search on Bibsonomy PPDP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF distributed systems, access control, security policies, term rewriting
2Salvador Lucas, José Meseguer Order-sorted dependency pairs. Search on Bibsonomy PPDP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF program analysis, termination, term rewriting
2René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp Adding constants to string rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Termination, Term rewriting, Confluence, String rewriting
2Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain Proving operational termination of membership equational programs. Search on Bibsonomy Higher-Order and Symbolic Computation The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Conditional term rewriting, Operational termination, Declarative rule-based languages, Program transformation, Membership equational logic
2Shobha Vasudevan, Vinod Viswanath, Robert W. Sumners, Jacob A. Abraham Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Register Transfer Level implementation, Verification, Hardware Description Languages, arithmetic logic unit
2Klaus-Dieter Schewe, Bernhard Thalheim Term Rewriting for Web Information Systems - Termination and Church-Rosser Property. Search on Bibsonomy WISE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Eugene Asarin, Thierry Cachat, Alexander Seliverstov, Tayssir Touili, Vassily A. Lyubetsky Attenuation Regulation as a Term Rewriting System. Search on Bibsonomy AB The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Rémy Haemmerlé, François Fages Abstract Critical Pairs and Confluence of Arbitrary Binary Relations. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Irène Durand, Géraud Sénizergues Bottom-Up Rewriting Is Inverse Recognizability Preserving. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Hans Zantema, Johannes Waldmann Termination by Quasi-periodic Interpretations. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Mark Hills, Grigore Rosu KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF object-oriented languages, term rewriting, formal analysis, rewriting logic, programming language semantics
2Guillem Godoy, Eduard Huntingford Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux Rewriting Approximations for Fast Prototyping of Static Analyzers. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Anderson Santana de Oliveira, Eric Ke Wang, Claude Kirchner, Hélène Kirchner Weaving rewrite-based access control policies. Search on Bibsonomy FMSE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF strategic rewriting, access control, aspect-oriented programming, term rewriting, execution monitoring
2Andrew Walenstein, Rachit Mathur, Mohamed R. Chouchane, Arun Lakhotia Normalizing Metamorphic Malware Using Term Rewriting. Search on Bibsonomy SCAM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2M. Birna van Riemsdijk, Frank S. de Boer, Mehdi Dastani, John-Jules Ch. Meyer Prototyping 3APL in the Maude Term Rewriting Language. Search on Bibsonomy CLIMA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Jörg Endrullis, Johannes Waldmann, Hans Zantema Matrix Interpretations for Proving Termination of Term Rewriting. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Giorgio Delzanno, Roberto Montagna Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting. Search on Bibsonomy ICTAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Gregory J. Duck, Peter J. Stuckey, Sebastian Brand ACD Term Rewriting. Search on Bibsonomy ICLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Steve Barker, Maribel Fernández Term Rewriting for Access Control. Search on Bibsonomy DBSec The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Étienne Payet Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. Search on Bibsonomy LOPSTR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Yi Wang, Masahiko Sakai Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Yohan Boichut, Thomas Genet Feasible Trace Reconstruction for Rewriting Approximations. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Jean-Pierre Jouannaud Modular Church-Rosser Modulo. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Bernhard Gramlich, Salvador Lucas Generalizing Newman's Lemma for Left-Linear Rewrite Systems. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Takahito Aoto Dealing with Non-orientable Equations in Rewriting Induction. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Pramod G. Joisha, Prithviraj Banerjee An algebraic array shape inference system for MATLAB. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Typeless array languages, shape algebras, term rewriting
2Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard The Confluence Problem for Flat TRSs. Search on Bibsonomy AISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Flat, Term rewriting system, Confluence, Decision problem
2Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas Context-Sensitive Dependency Pairs. Search on Bibsonomy FSTTCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF program analysis, termination, term rewriting, Dependency pairs
2René Thiemann, Jürgen Giesl The size-change principle and dependency pairs for termination of term rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Size-change principle, Termination, Term rewriting, Dependency pairs
2Xuezheng Fu, Hao Wang, William L. Harrison, Robert W. Harrison RNA Pseudoknot Prediction Using Term Rewriting. Search on Bibsonomy BIBE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Tiago L. Alves, Paulo F. Silva, Joost Visser, José Nuno Oliveira Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion. Search on Bibsonomy FM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Yoshihito Toyama Reduction Strategies for Left-Linear Term Rewriting Systems. Search on Bibsonomy Processes, Terms and Cycles The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Paul Klint, Tijs van der Storm, Jurgen J. Vinju Term Rewriting Meets Aspect-Oriented Programming. Search on Bibsonomy Processes, Terms and Cycles The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Lukasz Kaiser Confluence of Right Ground Term Rewriting Systems Is Decidable. Search on Bibsonomy FoSSaCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Makoto Hamana Universal Algebra for Termination of Higher-Order Rewriting. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen Quasi-interpretations and Small Space Bounds. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Jeroen Ketema, Jakob Grue Simonsen Infinitary Combinatory Reduction Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2James Cheney Equivariant Unification. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Toshinori Takai A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Jeroen Ketema Böhm-Like Trees for Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Jakob Grue Simonsen On the Modularity of Confluence in Infinitary Term Rewriting. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2M. R. K. Krishna Rao Inductive Inference of Term Rewriting Systems from Positive Data. Search on Bibsonomy ALT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Santiago Escobar, José Meseguer, Prasanna Thati Natural Rewriting for General Term Rewriting Systems. Search on Bibsonomy LOPSTR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Antoine Meyer On Term Rewriting Systems Having a Rational Derivation. Search on Bibsonomy FoSSaCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Sergio Antoy, Stephen Johnson Formalization and abstract implementation of rewriting with nested rules. Search on Bibsonomy PPDP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF term rewriting systems, non-determinism, narrowing, functional logic programming, block structured
2Serge Mechveliani From a Computer Algebra Library to a System with an Equational Prover. Search on Bibsonomy AISC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF equational prover, term rewriting, computer algebra
2Takahito Aoto, Toshiyuki Yamada Termination of Simply Typed Term Rewriting by Translation and Labelling. Search on Bibsonomy RTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
2Mark van den Brand, Pierre-Etienne Moreau, Jurgen J. Vinju Environments for Term Rewriting Engines for Free! Search on Bibsonomy RTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
2Roberto M. Amadio Max-Plus Quasi-interpretations. Search on Bibsonomy TLCA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Functional languages and term rewriting, Function algebras and implicit computational complexity, Polynomial interpretations and max-plus algebras, Static analysis
2Isabel Oitavem A term rewriting characterization of the functions computable in polynomial space. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
2Irène Durand Autowrite: A Tool for Checking Properties of Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
2Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. Search on Bibsonomy RTA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
2Yi Feng, Eduard Cerny Term ordering problem on MDG. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF first-order terms, function renaming, function symbols, standard term ordering, term rewriting, variable ordering, multiway decision graphs
Displaying result #1 - #100 of 1084 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.