The theory of strictness analysis for higher order functions
on Programs as data objects
Referential transparency, definiteness and unfoldability
Acta Informatica
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
A transformation-based optimiser for Haskell
Science of Computer Programming - Special issue on the 6th European symposium on programming
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Non-determinism Analysis in a Parallel-Functional Language
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
A Polynomial-Cost Non-determinism Analysis
IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
Non-determinism analyses in a parallel-functional language
Journal of Functional Programming
| Hi-index | 0.00 |
The presence of non-determinism in the parallel-functional language Eden creates some problems. Several non-determinism analyses have been developed to determine when an Eden expression is sure to be deterministic, and when it may be non-deterministic. The correctness of these analyses had not been proved yet. In this paper we define a “maximal” denotational semantics for Eden in the sense that the set of possible values produced by an expression is bigger than the actual one. This semantics is enough to prove the correctness of the analyses. We provide the abstraction and concretisation functions relating the concrete and abstract values so that the determinism property is adequately captured. Finally we prove the correctness of the analyses with respect to the previously defined semantics.