Pages that link to "Item:Q1055184"

The following pages link to Fundamental properties of infinite trees (Q1055184):

Displaying 50 items.

• Unification for infinite sets of equations between finite terms (Q287056) (← links)
• Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
• Infinitary combinatory reduction systems (Q550248) (← links)
• On the existence of nonterminating queries for a restricted class of PROLOG-clauses (Q582150) (← links)
• Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
• On second-order iterative monads (Q639639) (← links)
• \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
• Interpretations of recursively defined types (Q685350) (← links)
• Average-case analysis of unification algorithms (Q685442) (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) (← links)
• The solutions of two star-height problems for regular trees (Q760212) (← links)
• Regular sets over extended tree structures (Q764339) (← links)
• Iterative factor algebras and induced metrics (Q790606) (← links)
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
• Deciding implication for functional dependencies in complex-value databases (Q860838) (← links)
• The category-theoretic solution of recursive program schemes (Q860876) (← links)
• Non-well-founded trees in categories (Q876383) (← links)
• A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
• Semantics for logic programs without occur check (Q913532) (← links)
• Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
• Semantics of types for database objects (Q915443) (← links)
• Sturmian trees (Q968266) (← links)
• Contract-based discovery of Web services modulo simple orchestrators (Q987977) (← links)
• Bases for parametrized iterativity (Q1004388) (← links)
• A Mezei-Wright theorem for categorical algebras (Q1044831) (← links)
• Variétés d'automates descendants d'arbres infinis (Q1079382) (← links)
• Semantics of infinite tree logic programming (Q1090469) (← links)
• An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
• On flowchart theories. I. The deterministic case (Q1093364) (← links)
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
• Algebraic solutions to recursion schemes (Q1098617) (← links)
• C-tree systolic automata (Q1102750) (← links)
• Contributions to the semantics of logic perpetual processes (Q1113661) (← links)
• Recursion over realizability structures (Q1173956) (← links)
• A semantics for complex objects and approximate answers (Q1176289) (← links)
• Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
• Contraction algebras and unification of (infinite) terms (Q1185240) (← links)
• Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
• A new method for undecidability proofs of first order theories (Q1209623) (← links)
• How to win a game with features (Q1271569) (← links)
• Weighted systems of equations (Q1311966) (← links)
• The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
• Static correctness of hierarchical procedures (Q1351792) (← links)
• Unification of kinded infinite trees (Q1352126) (← links)
• The equational logic of fixed points (Q1391734) (← links)
• Situated simplification (Q1391936) (← links)
• Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
• Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)