Infinite trees in normal form and recursive equations having a unique solution (Q3851585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bruno Courcelle / rank
Normal rank
 
Property / author
 
Property / author: Bruno Courcelle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of ordered algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Transformation System for Developing Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some classes of interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for the equivalence of recursive schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system which automatically improves programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving and applying program transformations expressed with second-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint approach to the theory of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and reasoning in program synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases for Chain-complete Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowgraphs and Flow Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational and semantic equivalence between recursive programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Manipulating Systems and Church-Rosser Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program equivalence and context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to inductive posets and inductive closure / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:28, 13 June 2024

scientific article
Language Label Description Also known as
English
Infinite trees in normal form and recursive equations having a unique solution
scientific article

    Statements

    Infinite trees in normal form and recursive equations having a unique solution (English)
    0 references
    0 references
    1979
    0 references
    0 references
    equivalence of recursive program schemes
    0 references
    correctness criteria
    0 references
    program transformations
    0 references
    equational classes of interpretations
    0 references
    tree rewriting system
    0 references
    0 references