The following pages link to (Q3900995):
Displaying 35 items.
- Fixing Zeno gaps (Q549197) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Fixed point equations with parameters in the projective model (Q580971) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- On the greatest fixed point of a set functor (Q672316) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
- A first order logic for partial functions (Q918965) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Algebraic and fixed point equations over inverse limits of algebras (Q1177146) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- On final coalgebras of continuous functors (Q1398459) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- De Bakker-Zucker processes revisited (Q1887161) (← links)
- Whither semantics? (Q2286732) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- (Q3121528) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- On Normalisation of Infinitary Combinatory Reduction Systems (Q3522017) (← links)
- The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (Q3636833) (← links)
- (Q3665882) (← links)
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes (Q3774922) (← links)
- Algèbres effectives dans la programmation logique avec contraintes (Q4012670) (← links)
- Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
- The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
- (Q4993334) (← links)
- (Q5015272) (← links)
- Transfinite reductions in orthogonal term rewriting systems (Q5055744) (← links)
- Infinitary affine proofs (Q5268998) (← links)
- The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) (← links)
- An introduction to metric semantics: Operational and denotational models for programming and specification languages (Q5941193) (← links)
