Pages that link to "Item:Q801666"

The following pages link to Necessary and sufficient conditions for the universality of programming formalisms (Q801666):

Displaying 4 items.

• On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
• Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
• The verification of modules (Q1329200) (← links)
• Composition aspects of programmology. I (Q3790610) (← links)