Search results for "left-linear"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
46	Michio Oyamaguchi, Yoshikatsu Ohta	A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems.	RTA	1997	DBLP DOI BibTeX RDF
44	Yoshihito Toyama	Reduction Strategies for Left-Linear Term Rewriting Systems.	Processes, Terms and Cycles	2005	DBLP DOI BibTeX RDF
43	Fritz Henglein	Fast Left-Linear Semi-Unification.	ICCI	1990	DBLP DOI BibTeX RDF	semi-unification, left-linear, P-completeness
33	Takashi Nagaya, Yoshihito Toyama	Decidability for Left-Linaer Growing Term Rewriting Systems.	RTA	1999	DBLP DOI BibTeX RDF
29	Yoshihito Toyama	Confluent Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
27	Steffen van Bakel, Sjaak Smetsers, Simon Brock	Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems.	CAAP	1992	DBLP DOI BibTeX RDF
25	Massimo Marchiori	On the Expressive Power of Rewriting.	FSTTCS	1997	DBLP DOI BibTeX RDF
25	Max Dauchet	Simulation of Turning Machines by a Left-Linear Rewrite Rule.	RTA	1989	DBLP DOI BibTeX RDF
24	Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema	On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
22	Sergio Greco, Carlo Zaniolo	Optimization of Linear Logic Programs Using Counting Methods.	EDBT	1992	DBLP DOI BibTeX RDF
20	Germán Vidal	Termination of Narrowing in Left-Linear Constructor Systems.	FLOPS	2008	DBLP DOI BibTeX RDF
20	Bernhard Gramlich, Salvador Lucas	Generalizing Newman's Lemma for Left-Linear Rewrite Systems.	RTA	2006	DBLP DOI BibTeX RDF
20	Yi Wang, Masahiko Sakai	Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.	RTA	2006	DBLP DOI BibTeX RDF
20	Wan J. Fokkink, Jasper Kamperman, Pum Walters	Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	specificity ordering, automata, term rewriting, abstract machine
20	César Muñoz	A Left-Linear Variant of Lambda-Sigma.	ALP/HOA	1997	DBLP DOI BibTeX RDF
20	Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt	Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.	RTA	1989	DBLP DOI BibTeX RDF
19	Hongwei Xi	Towards Automated Termination Proofs through "Freezing".	RTA	1998	DBLP DOI BibTeX RDF
19	Kai Salomaa	Decidability of Confluence and Termination of Monadic Term Rewriting Systems.	RTA	1991	DBLP DOI BibTeX RDF
16	Sergio Greco, Domenico Saccà, Carlo Zaniolo	The PushDown Method to Optimize Chain Logic Programs (Extended Abstract).	ICALP	1995	DBLP DOI BibTeX RDF
14	Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp	Left-Linear Completion with AC Axioms.	CADE	2023	DBLP DOI BibTeX RDF
14	Christina Kohl, Aart Middeldorp	A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems.	CPP	2023	DBLP DOI BibTeX RDF
14	Gilles Dowek, Gaspard Férey, Jean-Pierre Jouannaud, Jiaxiang Liu 0001	Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs.	Math. Struct. Comput. Sci.	2022	DBLP DOI BibTeX RDF
14	Gaspard Férey, Jean-Pierre Jouannaud	Confluence in Non-Left-Linear Untyped Higher-Order Rewrite Theories.	PPDP	2021	DBLP DOI BibTeX RDF
14	Kentaro Kikuchi, Takahito Aoto 0001, Yoshihito Toyama	Parallel Closure Theorem for Left-Linear Nominal Rewriting Systems.	FroCoS	2017	DBLP DOI BibTeX RDF
14	Ryota Nakayama, Naoki Nishida 0001, Masahiko Sakai	Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems.	WPTE@FSCD	2016	DBLP DOI BibTeX RDF
14	Julian Nagele, Aart Middeldorp	Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems.	ITP	2016	DBLP DOI BibTeX RDF
14	Franziska Rapp, Aart Middeldorp	Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems.	FSCD	2016	DBLP DOI BibTeX RDF
14	Kiraku Shintani, Nao Hirokawa	CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems.	CADE	2015	DBLP DOI BibTeX RDF
14	Marco Comini, Luca Torella	TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems.	PEPM	2013	DBLP DOI BibTeX RDF
14	Dominik Klein 0001, Nao Hirokawa	Confluence of Non-Left-Linear TRSs via Relative Termination.	LPAR	2012	DBLP DOI BibTeX RDF
14	Irène Durand, Marc Sylvestre	Left-linear Bounded TRSs are Inverse Recognizability Preserving.	RTA	2011	DBLP DOI BibTeX RDF
14	Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko	Handling Non Left-Linear Rules when Completing Tree Automata.	Int. J. Found. Comput. Sci.	2009	DBLP DOI BibTeX RDF
14	Yves Guiraud	Polygraphs for termination of left-linear term rewriting systems	CoRR	2007	DBLP BibTeX RDF
14	Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema	On tree automata that certify termination of left-linear term rewriting systems.	Inf. Comput.	2007	DBLP DOI BibTeX RDF
14	Michio Oyamaguchi, Yoshikatsu Ohta	On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems.	IEICE Trans. Inf. Syst.	2004	DBLP BibTeX RDF
14	Sándor Vágvölgyi	Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems.	Bull. EATCS	2004	DBLP BibTeX RDF
14	Takashi Nagaya, Yoshihito Toyama	Decidability for Left-Linear Growing Term Rewriting Systems.	Inf. Comput.	2002	DBLP DOI BibTeX RDF
14	E. A. Cichon, Elias Tahhan-Bittar	Strictly orthogonal left linear rewrite systems and primitive recursion.	Ann. Pure Appl. Log.	2001	DBLP DOI BibTeX RDF
14	Pál Gyenizse, Sándor Vágvölgyi	A property of left-linear rewrite systems preserving recognizability.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
14	Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing	Semantic Matching for Left-Linear Convergent Rewrite Systems	J. Funct. Log. Program.	1999	DBLP BibTeX RDF
14	Guozhu Dong, Seymour Ginsburg	On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components.	J. Log. Program.	1995	DBLP DOI BibTeX RDF
14	Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz	Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
14	Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt	Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.	J. ACM	1995	DBLP DOI BibTeX RDF	left-linearity, term-rewriting systems, confluence
14	Bodo Pareigis, Helmut Röhrl	Left linear theories - A generalization of module theory.	Appl. Categorical Struct.	1994	DBLP DOI BibTeX RDF
14	Jean-Pierre Jouannaud, Walid Sadfi	Strong Sequentiality of Left-Linear Overlapping Rewrite Systems.	CTRS	1994	DBLP DOI BibTeX RDF
14	Fritz Müller 0001	Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
14	Yoshihito Toyama	Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems	LICS	1992	DBLP DOI BibTeX RDF
14	Zoltán Fülöp 0001, Sándor Vágvölgyi	A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata.	ALP	1988	DBLP DOI BibTeX RDF
13	Martin Korp, Aart Middeldorp	Proving Termination of Rewrite Systems Using Bounds.	RTA	2007	DBLP DOI BibTeX RDF
13	Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati	Natural Rewriting for General Term Rewriting Systems.	LOPSTR	2004	DBLP DOI BibTeX RDF
13	Satoshi Okui	Simultaneous Critical Pairs and Church-Rosser Property.	RTA	1998	DBLP DOI BibTeX RDF
13	Massimo Marchiori	Modularity of Completeness Revisited.	RTA	1995	DBLP DOI BibTeX RDF
13	Roberto Di Cosmo, Delia Kesner	Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi.	ICALP	1994	DBLP DOI BibTeX RDF
13	Reinhard Bündgen, Hasko Eckhardt	A Fast Algorithm for Ground Normal Form Analysis.	ALP	1992	DBLP DOI BibTeX RDF
13	Abraham Ginzburg	A Procedure for Checking Equality of Regular Expressions.	J. ACM	1967	DBLP DOI BibTeX RDF
13	Toshinori Takai, Yuichi Kaji, Hiroyuki Seki	Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability.	RTA	2000	DBLP DOI BibTeX RDF
13	Seymour Ginsburg, Nancy A. Lynch	Size complexity in context-free grammars forms.	J. ACM	1976	DBLP DOI BibTeX RDF
11	Nachum Dershowitz, Subrata Mitra	Jeopardy.	RTA	1999	DBLP DOI BibTeX RDF
8	Nachum Dershowitz	Open. Closed. Open.	RTA	2005	DBLP DOI BibTeX RDF
8	Florent Jacquemard	Decidable Approximations of Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
6	Jörg Endrullis, Dimitri Hendriks	From Outermost to Context-Sensitive Rewriting.	RTA	2009	DBLP DOI BibTeX RDF
6	Aleksy Schubert	The Existential Fragment of the One-Step Parallel Rewriting Theory.	RTA	2009	DBLP DOI BibTeX RDF
6	Karl Gmeiner, Bernhard Gramlich	Transformations of Conditional Rewrite Systems Revisited.	WADT	2008	DBLP DOI BibTeX RDF
6	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics.	INAP/WLP	2007	DBLP DOI BibTeX RDF
6	Rachid Echahed, Nicolas Peltier	Non Strict Confluent Rewrite Systems for Data-Structures with Pointers.	RTA	2007	DBLP DOI BibTeX RDF
6	Joe Hendrix, José Meseguer 0001, Hitoshi Ohsaki	A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms.	IJCAR	2006	DBLP DOI BibTeX RDF
6	Su Feng	Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	automated formal proving, cover-set induction, dynamic term rewriting calculus, weakly ground termination, term rewriting system
6	Jeroen Ketema, Jakob Grue Simonsen	Infinitary Combinatory Reduction Systems.	RTA	2005	DBLP DOI BibTeX RDF
6	Santiago Escobar 0001, José Meseguer 0001, Prasanna Thati	Natural Narrowing for General Term Rewriting Systems.	RTA	2005	DBLP DOI BibTeX RDF
6	Santiago Escobar 0001	Refining weakly outermost-needed rewriting and narrowing.	PPDP	2003	DBLP DOI BibTeX RDF	neededness, term rewriting, lazy evaluation, demandness, parallel evaluation
6	Pascual Julián Iranzo	On the Correctness of the Factoring Transformation.	FLOPS	2002	DBLP DOI BibTeX RDF
6	David M. Goldschlag, Stuart G. Stubblebine	Publicly Verifiable Lotteries: Applications of Delaying Functions.	Financial Cryptography	1998	DBLP DOI BibTeX RDF
6	Zhiqing Shao, Yongqiang Sun, Guoxin Song, Huiqun Yu	Proving Inductive Theorems Using Witnessed Test Sets.	ICFEM	1998	DBLP DOI BibTeX RDF
6	Peter Sewell	From Rewrite to Bisimulation Congruences.	CONCUR	1998	DBLP DOI BibTeX RDF
6	Nachum Dershowitz	Innocuous Constructor-Sharing Combinations.	RTA	1997	DBLP DOI BibTeX RDF
6	Taro Suzuki	Standardization Theorem Revisited.	ALP	1996	DBLP DOI BibTeX RDF
6	Bruce W. Watson	A New Regular Grammar Pattern Matching Algorithm.	ESA	1996	DBLP DOI BibTeX RDF
6	Bernhard Gramlich	Confluence without Termination via Parallel Critical Pairs.	CAAP	1996	DBLP DOI BibTeX RDF
6	Bernhard Gramlich, Claus-Peter Wirth	Confluence of Terminating Conditional Rewrite Systems Revisited.	RTA	1996	DBLP DOI BibTeX RDF
6	J. F. Th. Kamperman, H. R. Walters	Lazy Rewriting and Eager Machinery.	RTA	1995	DBLP DOI BibTeX RDF
6	Zena M. Ariola	Relating Graph and Term Rewriting via Böhm Models.	RTA	1993	DBLP DOI BibTeX RDF
6	Femke van Raamsdonk	Confluence and Superdevelopments.	RTA	1993	DBLP DOI BibTeX RDF
6	John Field	A Graph Reduction Approach to Incremental Term Rewriting (Preliminary Report).	RTA	1993	DBLP DOI BibTeX RDF
6	Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi	Bottom-Up Tree Pushdown Automata and Rewrite Systems.	RTA	1991	DBLP DOI BibTeX RDF	Rewrite systems (=term rewrite systems), Church-Rosser (=confluent) systems, Noetherian systems, Convergent (=noetherian+confluent) systems, (Deterministic) tree automaton with pushdown store, (Recognizable, Context-free) tree languages
6	Aart Middeldorp, Yoshihito Toyama	Completeness of Combinations of Constructor Systems.	RTA	1991	DBLP DOI BibTeX RDF
6	William M. Farmer, Ronald J. Watro	Redex Capturing in Term Graph Rewriting (Concise Version).	RTA	1991	DBLP DOI BibTeX RDF
6	Ke Li	Optimization of Rewriting and Complexity of Rewriting.	ALP	1990	DBLP DOI BibTeX RDF
6	Emmanuel Kounalis	Testing for Inductive (Co)-Reducibility.	CAAP	1990	DBLP DOI BibTeX RDF	Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations
6	Nigel P. Chapman	Regular attribute grammars and finite state machines.	ACM SIGPLAN Notices	1989	DBLP DOI BibTeX RDF