The following pages link to (Q3815296):
Displayed 20 items.
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Constructing inverse semigroups from category actions (Q1295727) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- Categorical shape theory as a formal language for pattern recognition? (Q1924765) (← links)
- Finite limits and anti-unification in substitution categories (Q2185886) (← links)
- Relative full completeness for bicategorical Cartesian closed structure (Q2200828) (← links)
- Computing over K-modules (Q2841256) (← links)
- (Q3986546) (← links)
- (Q3994022) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- A semantics for type checking (Q5096209) (← links)
- An abstract formulation for rewrite systems (Q5096266) (← links)
- CPO models for infinite term rewriting (Q5096397) (← links)
- (Q5137919) (← links)
- Context rewriting (Q5881173) (← links)
- Conditional rewriting logic: Deduction, models and concurrency (Q5881267) (← links)
- Unique-sort order-sorted theories : A description as monad morphisms (Q5881299) (← links)
- Using categorical methods in computer science (Q5951279) (← links)