Pages that link to "Item:Q3716320"
From MaRDI portal
The following pages link to On the sequential nature of unification (Q3716320):
Displayed 28 items.
- Exploiting parallelism in coalgebraic logic programming (Q280198) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- Another variation on the common subexpression problem (Q685700) (← links)
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- A parallel algorithm for the monadic unification problem (Q1083189) (← links)
- Associative-commutative unification (Q1099648) (← links)
- A practically efficient and almost linear unification algorithm (Q1105360) (← links)
- On the relationship of congruence closure and unification (Q1124338) (← links)
- Optimal parallel algorithms for forest and term matching (Q1186605) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Some complexity bounds for subtype inequalities (Q1275620) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- On the logic of unification (Q1823935) (← links)
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem (Q1960430) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- (Q4580325) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- The complexity of type inference for higher-order typed lambda calculi (Q4764610) (← links)
- Type inference with simple subtypes (Q4939703) (← links)
- Fine-grained concurrent completion (Q5055848) (← links)
- Unique normal forms for nonlinear term rewriting systems: Root overlaps (Q5055958) (← links)
- A theory of strict P-completeness (Q5096767) (← links)