Anti-patterns for rule-based languages
type: Item
instance of: scholarly article
title: Anti-patterns for rule-based languages
zbMATH Open document ID: 1192.68563
author: Horatiu Cirstea
author: Claude Kirchner
author: Radu Kopetz
author: Pierre-Etienne Moreau
published in: Journal of Symbolic Computation
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5704031
zbMATH Keywords: pattern matching
zbMATH Keywords: list matching
zbMATH Keywords: complement problem
zbMATH Keywords: equational problem
zbMATH Keywords: anti-pattern
zbMATH Keywords: disunification
zbMATH Keywords: associativity
zbMATH Keywords: equational theory
zbMATH Keywords: rule-based language
zbMATH Keywords: pattern-based language
describes a project that uses: Stratego
describes a project that uses: Scala
describes a project that uses: OCaml
describes a project that uses: Mathematica
describes a project that uses: Tom
describes a project that uses: ASF+SDF
MaRDI profile type: Publication
full work available at URL: j.jsc.2010.01.007
OpenAlex ID: W2075433022
cites work: Decidability of systems of set constraints with negative constraints
cites work: A feature constraint system for logic programming with entailment
cites work: On the expressivity of feature logics with negation, functional uncertainty, and sort equations
cites work: A complete and recursive feature theory
cites work: Complexity of matching problems
cites work: Q2764099
cites work: TQL: a query language for semistructured data based on the ambient logic
cites work: Q4297316
cites work: Q2762629
cites work: Equational problems and disunification
cites work: Q4447218
cites work: The complexity of counting problems in equational matching
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Anti-pattern Matching
cites work: Anti-pattern Matching Modulo
cites work: Solving equations with sequence variables and sequence functions
cites work: Flat matching
cites work: Explicit representation of terms defined by counter examples
cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
cites work: Normalized rewriting: An alternative to rewriting modulo a set of equations
cites work: Q2753689
cites work: Q4417783
cites work: Combining matching algorithms: The regular case
cites work: Q5678447
cites work: Combining decision algorithms for matching in the union of disjoint equational theories
cites work: A new method for undecidability proofs of first order theories
DOI: 10.1016/J.JSC.2010.01.007
description: scientific article; zbMATH DE number 5704031