ELAN from a rewriting logic point of view (Q1608914): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LCF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The B-Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving innermost normalisation automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative-commutative discrimination nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic paramodulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autarkic computations in formal proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technical note on AC-unification. The number of minimal unifiers of the equation \(\alpha x_ 1+ \cdots + \alpha x_ p \doteq _{AC} \beta y_ 1+ \cdots + \beta y_ q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving modulo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction for termination with local strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving termination by innermost termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata help one to solve equational formulae in AC-theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewriting logic as a unified model of concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prototyping combination of unification algorithms with the ELAN rule-based programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated deduction with associative-commutative operators / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00358-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147892488 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
ELAN from a rewriting logic point of view
scientific article

    Statements

    ELAN from a rewriting logic point of view (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2002
    0 references
    computational system
    0 references
    conditional rewriting logic
    0 references
    strategy theory
    0 references
    rule-based programming
    0 references
    rewriting calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers