22 papers:
CADE-2015-SakaiOO #confluence- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (MS, MO, MO), pp. 111–126.
ICGT-2014-AnjorinLST #graph grammar #model transformation #performance #static analysis- A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation (AA, EL, AS, GT), pp. 130–145.
PPDP-2013-PinoBV #concurrent #confluence #constraints #equivalence #performance #programming- Efficient computation of program equivalence for confluent concurrent constraint programming (LFP, FB, FDV), pp. 263–274.
RTA-2007-EchahedP #confluence #pointer #strict #term rewriting- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
- RTA-2006-OhtaH #confluence #linear #λ-calculus
- A Terminating and Confluent Linear λ Calculus (YO, MH), pp. 166–180.
- RTA-2005-Toyama #confluence #term rewriting
- Confluent Term Rewriting Systems (YT), p. 1.
STOC-2004-ChenKLRSV #bound #confluence #theorem- (Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
- RTA-2004-MitsuhashiOOY #confluence #problem #unification
- The Joinability and Unification Problems for Confluent Semi-constructor TRSs (IM, MO, YO, TY), pp. 285–300.
- STOC-2003-ChenRS #algorithm #approximate #confluence
- Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
- RTA-2002-Tahhan-Bittar #bound #confluence #recursion #term rewriting
- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
- RTA-2001-OyamaguchiO #confluence #problem #term rewriting #unification
- The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.
- STOC-2000-OlshevskyS #confluence #matrix
- Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation (VO, MAS), pp. 573–581.
- CADE-1999-BaumgartnerEF #calculus #confluence
- A Confluent Connection Calculus (PB, NE, UF), pp. 329–343.
ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting #word- The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
- PLILP-1996-Lucas #confluence #source code
- Context-Sensitive Computations in Confluent Programs (SL), pp. 408–422.
- ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus
- A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
TLCA-1993-Nipkow #confluence #higher-order #orthogonal #term rewriting- Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
LFP-1992-BoveA #calculus #confluence #evaluation #metaprogramming- A Confluent Calculus of Macro Expansion and Evaluation (AB, LA), pp. 278–287.
- ICALP-1991-DiekertOR #complexity #confluence #decidability #on the
- On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
- RTA-1991-Brandenburg #bound #confluence #equivalence #graph grammar
- The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.
- ICALP-1987-Holldobler #algorithm #confluence #unification
- A Unification Algorithms for Confluent Theories (SH), pp. 31–41.
- ICALP-1986-YouS #algorithm #confluence #term rewriting
- E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.
