Encapsulating non-determinacy in an abstract data type with determinate semantics

DOI10.1017/S0956796800000046zbMath1155.68451MaRDI QIDQ4939692

F. Warren Burton

Publication date: 9 February 2000

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsfunctional programming languageprocedural programsindeterminate behaviordeterminate semanticsimproving valuespolymorphic abstract data type

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Related Items (1)

Pruning with improving sequences in lazy functional programs

Cites Work

• Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System
• Unnamed Item

This page was built for publication: Encapsulating non-determinacy in an abstract data type with determinate semantics