Search results for "Church-Rosser"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
170	Gundula Niemann, Johannes Waldmann	Some Regular Languages That Are Church-Rosser Congruential.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
164	Georg Struth	Calculating Church-Rosser Proofs in Kleene Algebra.	RelMiCS	2001	DBLP DOI BibTeX RDF	$lambda$-calculus, Church-Rosser theorem, rewriting, Kleene algebra, formal mathematics
157	Dallas Lankford, Gregory Butler II, A. M. Ballantyne	A Progress Report on New Decision Algorithms for Finitely Prsented Abelian Groups.	CADE	1984	DBLP DOI BibTeX RDF
144	Ravi Sethi	Testing for the Church-Rosser Property.	J. ACM	1974	DBLP DOI BibTeX RDF
131	Mitsuhiro Okada	Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System.	ISSAC	1989	DBLP DOI BibTeX RDF
125	Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).	RTA	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
99	Klaus-Dieter Schewe, Bernhard Thalheim, Qing Wang 0002	Customising Web Information Systems According to User Preferences.	World Wide Web	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
99	Hartmut Ehrig, Barry K. Rosen	Concurrency of Manipulations in Multidimensional Information Structures.	MFCS	1978	DBLP DOI BibTeX RDF	Multidimensional Information Structures, Applications of Category Theory, Parallelism, Concurrency, Graph Grammars, Church-Rosser-Properties
91	Jens R. Woinowski	A Normal Form for Church-Rosser Language Systems.	RTA	2001	DBLP DOI BibTeX RDF
91	Jens R. Woinowski	Prefix Languages of Church-Rosser Languages.	FSTTCS	2000	DBLP DOI BibTeX RDF
91	Gundula Niemann, Friedrich Otto	The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages.	FoSSaCS	1998	DBLP DOI BibTeX RDF
91	Enno Ohlebusch	Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation.	RTA	1998	DBLP DOI BibTeX RDF
91	Gerhard Buntrock, Friedrich Otto	Growing Context-Sensitive Languages and Church-Rosser Languages.	STACS	1995	DBLP DOI BibTeX RDF
91	Natarajan Shankar	A mechanical proof of the Church-Rosser theorem.	J. ACM	1988	DBLP DOI BibTeX RDF
91	Volker Diekert	Some Remarks on Presentations by Finite Church-Rosser Thue Systems.	STACS	1987	DBLP DOI BibTeX RDF
91	Mariangiola Dezani-Ciancaglini, Maddalena Zacchi	Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms.	ICALP	1974	DBLP DOI BibTeX RDF
91	Barry K. Rosen	Tree-Manipulating Systems and Church-Rosser Theorems.	J. ACM	1973	DBLP DOI BibTeX RDF
85	H. Perdrix	Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible.	STACS	1984	DBLP DOI BibTeX RDF	Fr Système de réécriture, Théorie équationnelle, Paire critique, Cohérence, Terminaison uniforme, Forme normale, Church-Rosser, Preuve automatique, Unification, Confluence
79	Hartmut Ehrig, Barry K. Rosen	The Mathematics of Record Handling.	ICALP	1977	DBLP DOI BibTeX RDF
78	Benedetto Intrigila, Ivano Salvo, Stefano Sorgi	A Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser.	Inf. Comput.	2001	DBLP DOI BibTeX RDF
73	Heiko Stamer	Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem.	INDOCRYPT	2005	DBLP DOI BibTeX RDF	completion attack, Knuth-Bendix completion, Cryptanalysis, weak keys, Church-Rosser property, string-rewriting systems
73	S. C. Samuel, D. Gnanaraj Thomas, P. J. Abisha, K. G. Subramanian 0001	Tree Replacement and Public Key Cryptosystem.	INDOCRYPT	2002	DBLP DOI BibTeX RDF	tree replacement system, Church-Rosser tree replacement system, public key cryptosystem (PKC), word problem
73	Max I. Kanovich	Bijections between Partitions by Two-Directional Rewriting Techniques.	CSL	2002	DBLP DOI BibTeX RDF	multiset rewriting, partition identities, termination, combinatorics, confluence, strong normalization, Church-Rosser property, integer partitions
65	Klaus-Dieter Schewe, Bernhard Thalheim	Term Rewriting for Web Information Systems - Termination and Church-Rosser Property.	WISE	2007	DBLP DOI BibTeX RDF
65	Tobias Nipkow	More Church-Rosser Proofs (in Isabelle/HOL).	CADE	1996	DBLP DOI BibTeX RDF
65	Robert McNaughton, Paliath Narendran, Friedrich Otto	Church-Rosser Thue systems and formal languages.	J. ACM	1988	DBLP DOI BibTeX RDF
52	Paul-André Melliès	Axiomatic Rewriting Theory VI Residual Theory Revisited.	RTA	2002	DBLP DOI BibTeX RDF
52	Stephen Weeks, Matthias Felleisen	On the Orthogonality of Assignments and Procedures in Algol.	POPL	1993	DBLP DOI BibTeX RDF	ALGOL-60, ALGOL
46	Max I. Kanovich	A Note on Rewriting Proofs and Fibonacci Numbers.	LFCS	2007	DBLP DOI BibTeX RDF	multiset rewriting, partition identities, termination, combinatorics, confluence, Fibonacci numbers, strong normalization, Church-Rosser property, integer partitions
46	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
46	Franz Winkler 0001, Bruno Buchberger, Franz Lichtenberger, Heinrich Rolletschek	Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	Gro¨bner bases, computer algebra, simplification, polynomial ideals, Church-Rosser property
46	Hartmut Ehrig, Hans-Jörg Kreowski	Parallelism of Manipulations in Multidimensional Information Structures.	MFCS	1976	DBLP DOI BibTeX RDF	Multidimensional Information Structures, Canonical Derivation Sequences, Applications of Category Theory, Parallelism, Graph Grammars, Church-Rosser-Properties
39	Robert Söldner, Detlef Plump	Mechanised DPO Theory: Uniqueness of Derivations and Church-Rosser Theorem.	ICGT	2023	DBLP DOI BibTeX RDF
39	Lorenzo Gheri, Andrei Popescu 0001	Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS.	CoRR	2021	DBLP BibTeX RDF
39	Milos Kosterec	Substitution contradiction, its resolution and the Church-Rosser Theorem in TIL.	J. Philos. Log.	2020	DBLP DOI BibTeX RDF
39	Ken-etsu Fujita	The Church-Rosser theorem and quantitative analysis of witnesses.	Inf. Comput.	2018	DBLP DOI BibTeX RDF
39	Ernesto Copello, Nora Szasz, Álvaro Tasistro	Machine-checked Proof of the Church-Rosser Theorem for the Lambda Calculus Using the Barendregt Variable Convention in Constructive Type Theory.	LSFA	2017	DBLP DOI BibTeX RDF
39	Tobias Walter	Parikh-reducing Church-Rosser representations for some classes of regular languages.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
39	Volker Diekert, Lukas Fleischer	Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.	CoRR	2017	DBLP BibTeX RDF
39	Tobias Walter	Parikh-reducing Church-Rosser representations for some classes of regular languages.	CoRR	2017	DBLP BibTeX RDF
39	Volker Diekert, Lukas Fleischer	Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.	WORDS	2017	DBLP DOI BibTeX RDF
39	Julian Nagele, Vincent van Oostrom, Christian Sternagel	A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle.	CoRR	2016	DBLP BibTeX RDF
39	Ken-etsu Fujita	On Upper Bounds on the Church-Rosser Theorem.	WPTE@FSCD	2016	DBLP DOI BibTeX RDF
39	Ivaylo Hristakiev, Detlef Plump	Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem.	STAF Workshops	2016	DBLP DOI BibTeX RDF
39	Colm Ó Dúnlaing	An almost-confluent congruential language which is not Church-Rosser congruential.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
39	Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter	Regular Languages Are Church-Rosser Congruential.	J. ACM	2015	DBLP DOI BibTeX RDF
39	Yuichi Komori, Naosuke Matsuda, Fumika Yamakawa	A Simplified Proof of the Church-Rosser Theorem.	Stud Logica	2014	DBLP DOI BibTeX RDF
39	Jeroen Ketema, Jakob Grue Simonsen	Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus.	ACM Trans. Comput. Log.	2013	DBLP DOI BibTeX RDF
39	Francisco Durán 0001, José Meseguer 0001	On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories.	J. Log. Algebraic Methods Program.	2012	DBLP DOI BibTeX RDF
39	Volker Diekert, Manfred Kufleitner, Pascal Weil	Star-free languages are Church-Rosser congruential.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
39	Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter	Regular Languages are Church-Rosser Congruential	CoRR	2012	DBLP BibTeX RDF
39	Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter	Regular Languages Are Church-Rosser Congruential.	ICALP (2)	2012	DBLP DOI BibTeX RDF
39	Jean-Pierre Jouannaud, Jianqi Li	Church-Rosser Properties of Normal Rewriting.	CSL	2012	DBLP DOI BibTeX RDF
39	Hartmut Messerschmidt, Martin Stommel	Church-Rosser Picture Languages and Their Applications in Picture Recognition.	J. Autom. Lang. Comb.	2011	DBLP DOI BibTeX RDF
39	Volker Diekert, Manfred Kufleitner, Pascal Weil	Star-Free Languages are Church-Rosser Congruential	CoRR	2011	DBLP BibTeX RDF
39	Paolo Baldan, Fabio Gadducci, Pawel Sobocinski 0001	Adhesivity Is Not Enough: Local Church-Rosser Revisited.	MFCS	2011	DBLP DOI BibTeX RDF
39	Dexter Kozen	Church-Rosser Made Easy.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
39	Colm Ó'Dúnlaing, Natalie Schluter	A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
39	M. Jayasrirani, D. Gnanaraj Thomas, Atulya K. Nagar, T. Robinson 0001	Learning of Church-Rosser Tree Rewriting Systems.	ICGI	2010	DBLP DOI BibTeX RDF
39	Jeroen Ketema, Jakob Grue Simonsen	Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and lambda-Calculus.	FLOPS	2010	DBLP DOI BibTeX RDF
39	Francisco Durán 0001, José Meseguer 0001	A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications.	WRLA	2010	DBLP DOI BibTeX RDF
39	Fairouz Kamareddine, Vincent Rahli	Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction.	LSFA	2008	DBLP DOI BibTeX RDF
39	Mark Kambites, Friedrich Otto	Church-Rosser Groups and Growing Context-Sensitive Groups.	J. Autom. Lang. Comb.	2008	DBLP DOI BibTeX RDF
39	Jean-Pierre Jouannaud, Yoshihito Toyama	Modular Church-Rosser Modulo: The Complete Picture.	Int. J. Softw. Informatics	2008	DBLP BibTeX RDF
39	Colm Ó'Dúnlaing, Natalie Schluter	Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language	CoRR	2007	DBLP BibTeX RDF
39	Martin Kutrib, Andreas Malcher	When Church-Rosser Becomes Context Free.	Int. J. Found. Comput. Sci.	2007	DBLP DOI BibTeX RDF
39	Jean-Pierre Jouannaud	Modular Church-Rosser Modulo.	RTA	2006	DBLP DOI BibTeX RDF
39	Katalin Bimbó	The Church-Rosser property in symmetric combinatory logic.	J. Symb. Log.	2005	DBLP DOI BibTeX RDF
39	Gundula Niemann, Friedrich Otto	The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages.	Inf. Comput.	2005	DBLP DOI BibTeX RDF
39	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
39	Rafael Dueire Lins	Partial Categorical Multi-Combinators and Church-Rosser Theorems.	J. Univers. Comput. Sci.	2004	DBLP DOI BibTeX RDF
39	Katalin Bimbó	The Church-Rosser property in dual combinatory logic.	J. Symb. Log.	2003	DBLP DOI BibTeX RDF
39	Lorenzo Tortora de Falco	Additives of linear logic and normalization - Part I: a (restricted) Church-Rosser property.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
39	Y. Andou	Church-Rosser property of a simple reduction for full first-order classical natural deduction.	Ann. Pure Appl. Log.	2003	DBLP DOI BibTeX RDF
39	Jens R. Woinowski	The context-splittable normal form for Church-Rosser language systems.	Inf. Comput.	2003	DBLP DOI BibTeX RDF
39	Gundula Niemann, Friedrich Otto	Church-Rosser Languages and Their Relationship to Other Language Classes.	Grammars and Automata for String Processing	2003	DBLP BibTeX RDF
39	Gundula Niemann	Church-Rosser languages and related classes.		2003	RDF
39	Tomasz Jurdzinski, Krzysztof Lorys	Church-Rosser Languages vs. UCFL.	ICALP	2002	DBLP DOI BibTeX RDF
39	Tobias Nipkow	More Church-Rosser Proofs.	J. Autom. Reason.	2001	DBLP DOI BibTeX RDF
39	Jens R. Woinowski	Church-Rosser languages and their application to parsing problems. (PDF / PS)		2001	RDF
39	Gundula Niemann, Friedrich Otto	Restarting automata, Church-Rosser languages, and representations of r.e. languages.	Developments in Language Theory	1999	DBLP DOI BibTeX RDF
39	Gerhard Buntrock, Friedrich Otto	Growing Context-Sensitive Languages and Church-Rosser Languages.	Inf. Comput.	1998	DBLP DOI BibTeX RDF
39	Satoshi Okui	Simultaneous Critical Pairs and Church-Rosser Property.	RTA	1998	DBLP DOI BibTeX RDF
39	Mauricio Ayala-Rincón	Church-Rosser Property for Conditional Rewriting Systems with Built-in Predicates as Premises.	FroCoS	1998	DBLP BibTeX RDF
39	Richard Banach	MONSTR V - Transitive Coercing Semantics and the Church-Rosser Property.	J. Univers. Comput. Sci.	1997	DBLP DOI BibTeX RDF
39	Vladimir A. Oleshchuk	Church-Rosser Codes.	IMACC	1995	DBLP DOI BibTeX RDF
39	Vladimir A. Oleshchuk	On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract).	COCOON	1995	DBLP DOI BibTeX RDF
39	Herman Geuvers, Benjamin Werner	On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study	LICS	1994	DBLP DOI BibTeX RDF
39	Yoshihito Toyama, Michio Oyamaguchi	Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems.	CTRS	1994	DBLP DOI BibTeX RDF
39	C. Barry Jay	Coherence in category theory and the Church-Rosser property.	Notre Dame J. Formal Log.	1992	DBLP DOI BibTeX RDF
39	György E. Révész	A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
39	Herman Geuvers	The Church-Rosser Property for beta-eta-reduction in Typed lambda-Calculi	LICS	1992	DBLP DOI BibTeX RDF
39	Yves Lafont, Alain Prouté	Church-Rosser Property and Homology of Monoids.	Math. Struct. Comput. Sci.	1991	DBLP DOI BibTeX RDF
39	Andrei A. Kuzichev	Church-Rosser Property for Some Extensions of λβ-Reducibility Relation.	Math. Log. Q.	1991	DBLP DOI BibTeX RDF
39	H. Luckhardt	Complexity Versus the Church-Rosser Property and Confluence.	Math. Log. Q.	1991	DBLP DOI BibTeX RDF
39	George Koletsos	Polymorphic Lambda Calculus: The Church-Rosser Property.	Theor. Comput. Sci.	1991	DBLP DOI BibTeX RDF
39	E. G. K. López-Escobar	Remarks on the Church-Rosser Property.	J. Symb. Log.	1990	DBLP DOI BibTeX RDF
39	Jan Willem Klop	Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond.	ICALP	1990	DBLP DOI BibTeX RDF
39	Zhang Luo Xin	A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
39	Hirofumi Yokouchi	Church-Rosser Theorem for a Rewriting System on Categorical Combinators.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF