Proving operational termination of membership equational programs (Q2271899): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tsukuba / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CiME / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019496318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ELAN from a rewriting logic point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and proof in membership equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maude: specification and programming in rewriting logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving operational termination of membership equational programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Erlang processes by dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination proofs for rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation techniques for context-sensitive rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive rewriting strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination of context-sensitive rewriting by transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational termination of conditional term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular and incremental proofs of AC-termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unravelings and ultra-properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical termination revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular and incremental automated termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language Prototyping: An Algebraic Specification Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational rules for rewriting logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of context-sensitive rewriting / rank
 
Normal rank

Latest revision as of 21:08, 1 July 2024

scientific article
Language Label Description Also known as
English
Proving operational termination of membership equational programs
scientific article

    Statements

    Proving operational termination of membership equational programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    conditional term rewriting
    0 references
    operational termination
    0 references
    program transformation
    0 references
    declarative rule-based languages
    0 references
    membership equational logic
    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
    0 references
    0 references
    0 references