Stability, sequentiality and demand driven evaluation in dataflow
From MaRDI portal
Publication:1346605
DOI10.1007/BF03259389zbMath0829.68075MaRDI QIDQ1346605
Publication date: 6 April 1995
Published in: Formal Aspects of Computing (Search for Journal in Brave)
68Q45: Formal languages and automata
Cites Work
- A systematic approach to language constructs for concurrent programs
- Fully abstract models of typed \(\lambda\)-calculi
- A proof of the Kahn principle for input/output automata
- Efficient demand-driven evaluation. Part 1
- A new implementation technique for applicative languages
- Efficient demand-driven evaluation. Part 2
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item