Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 22 results in range #1 to #22.

Untyped lambda-calculus with input-output: Label: en
Full abstraction for lambda calculus with resources and convergence testing: Label: en
Effective longest and infinite reduction paths in untyped λ-calculi: Label: en
Denotational, causal, and operational determinism in event structures: Label: en
Open maps, behavioural equivalences, and congruences: Label: en
Behavioural satisfaction and equivalence in concrete model categories: Label: en
An ordinal calculus for proving termination in term rewriting: Label: en
Confluence without termination via parallel critical pairs: Label: en
Termination by absence of infinite chains of dependency pairs: Label: en
Relative normalization in Deterministic Residual Structures: Label: en
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations: Label: en
Interaction nets and term rewriting systems (extended abstract): Label: en
Subsumption algorithms based on search trees: Label: en
The practice of logical frameworks: Label: en
Final semantics for a higher order concurrent language: Label: en
Axiomatising extended computation tree logic: Label: en
Extraction of concurrent processes from higher dimensional automata: Label: en
The area determined by underdiagonal lattice paths: Label: en
A pumping lemma for output languages of macro tree transducers: Label: en
Diophantine equations, Presburger arithmetic and finite automata: Label: en
Iterative pairs and multitape automata: Label: en
The Kronecker product and local computations in graphs: Label: en