Pages that link to "Item:Q5878896"
From MaRDI portal
The following pages link to Trees in Algebra and Programming — CAAP '96 (Q5878896):
Displayed 22 items.
- The Kronecker product and local computations in graphs (Q5878897) (← links)
- Iterative pairs and multitape automata (Q5878898) (← links)
- Diophantine equations, Presburger arithmetic and finite automata (Q5878899) (← links)
- A pumping lemma for output languages of macro tree transducers (Q5878900) (← links)
- The area determined by underdiagonal lattice paths (Q5878901) (← links)
- Extraction of concurrent processes from higher dimensional automata (Q5878902) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
- Final semantics for a higher order concurrent language (Q5878904) (← links)
- The practice of logical frameworks (Q5878905) (← links)
- Subsumption algorithms based on search trees (Q5878906) (← links)
- Interaction nets and term rewriting systems (extended abstract) (Q5878907) (← links)
- Computing in unpredictable environments: Semantics, reduction strategies, and program transformations (Q5878908) (← links)
- Relative normalization in Deterministic Residual Structures (Q5878909) (← links)
- Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
- Confluence without termination via parallel critical pairs (Q5878911) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
- Behavioural satisfaction and equivalence in concrete model categories (Q5878913) (← links)
- Open maps, behavioural equivalences, and congruences (Q5878914) (← links)
- Denotational, causal, and operational determinism in event structures (Q5878915) (← links)
- Effective longest and infinite reduction paths in untyped λ-calculi (Q5878916) (← links)
- Full abstraction for lambda calculus with resources and convergence testing (Q5878917) (← links)
- Untyped lambda-calculus with input-output (Q5878918) (← links)