Pages that link to "Item:Q1051416"
From MaRDI portal
The following pages link to Justification of the structural synthesis of programs (Q1051416):
Displaying 11 items.
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- Higher order dataflow schemas (Q808244) (← links)
- Computational and attribute models of formal languages (Q912638) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- Semantics of a declarative language (Q1085599) (← links)
- The programming system PRIZ (Q1104778) (← links)
- A bridge between constructive logic and computer programming (Q1179711) (← links)
- The programming system PRIZ (Q4560348) (← links)
- Type-theoretical semantics of some declarative languages (Q4560349) (← links)
- Toward knowledge-based specifications of languages (Q4560351) (← links)
- Merging relational database technology with constraint technology (Q6570939) (← links)