Nondeterminism with Referential Transparency in Functional Programming Languages

DOI10.1093/COMJNL/31.3.243MaRDI QIDQ3792225zbMATH OpenOpenAlexFDO

Authors F. Warren Burton

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.3.243

zbMATH Keywords

decisionsfunctional programming languagesnondeterminismoperating systemsparallel programsparallel-programming languagesProceduralpseudo- data

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3878329
• Non-determinism analyses in a parallel-functional language
• Encapsulating non-determinacy in an abstract data type with determinate semantics
• Message-based functional operating systems
• Purely functional lazy nondeterministic programming

Cited in

(13)

• Message-based functional operating systems
• Referential transparency, definiteness and unfoldability
• An optimal data structure to handle dynamic environments in non-deterministic computations
• scientific article; zbMATH DE number 1691453 (Why is no real title available?)
• scientific article; zbMATH DE number 3878326 (Why is no real title available?)
• scientific article; zbMATH DE number 3878329 (Why is no real title available?)
• Distributed random number generation
• Encapsulating non-determinacy in an abstract data type with determinate semantics
• scientific article; zbMATH DE number 7356679 (Why is no real title available?)
• Safe nondeterminism in a deterministic-by-default parallel language
• Implementation of Functional Languages
• Logic Programming
• Enhancing functional and irregular parallelism: Stateful functions and their semantics

This page was built for publication: Nondeterminism with Referential Transparency in Functional Programming Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792225)