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
Let-floating: moving bindings to give faster programs
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A transformation-based optimiser for Haskell
Science of Computer Programming - Special issue on the 6th European symposium on programming
Principles of Program Analysis
Principles of Program Analysis
Optimising Eden by transformation
Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00)
A Usage Analysis with Bounded Usage Polymorphism and Subtyping
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Expressing and Reasoning About Non-Deterministic Functional Programs
Proceedings of the 1989 Glasgow Workshop on Functional Programming
Constructed product result analysis for Haskell
Journal of Functional Programming
A Usage Analysis with Bounded Usage Polymorphism and Subtyping
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
Correctness of non-determinism analyses in a parallel-functional language
IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
Eden --- parallel functional programming with haskell
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
Hi-index | 0.00 |
The paper presents several analyses to detect nondeterministic expressions in the parallel-functional language Eden. First, the need for the analysis is motivated, and then each one is presented. The first one is type-based, while the other two are based on abstract interpretation. Their power and efficiency is discussed, and an example is used to illustrate the differences. Two interesting functions to adapt abstract values to types appear, and they happen to be a Galois insertion.