The following pages link to (Q4127981):
Displaying 4 items.
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Effective proper procedures and universal classes of program schemata (Q1236424) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Translatability of schemas over restricted interpretations (Q1844072) (← links)