Pages that link to "Item:Q624386"
From MaRDI portal
The following pages link to Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386):
Displaying 5 items.
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- Weak equivalence in a class of structured program schemes (Q797988) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas (Q997992) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)