Pages that link to "Item:Q4136511"
From MaRDI portal
The following pages link to Lucid—A Formal System for Writing and Proving Programs (Q4136511):
Displaying 12 items.
- Semantics of algorithmic languages (Q760200) (← links)
- Recursion equation sets computing logic programs (Q920624) (← links)
- An operator net model for distributed systems (Q1123601) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Design and correctness of a compiler for a non-procedural language (Q1240546) (← links)
- Semantic properties of Lucid's compute clause and its compilation (Q1255778) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
- Correctness of a lucid interpreter based on linked forest manipulation systems (Q3863037) (← links)
- (Q4130960) (← links)
- Multidimensional infinite data in the language Lucid (Q5740669) (← links)
- A graphic language based on timing diagrams (Q5955785) (← links)
