Counting successes: Effects and transformations for non-deterministic programs

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a simple effect system for non-deterministic programs, tracking static approximations to the number of results that may be produced by each computation. A relational semantics for the effect system establishes the soundness of both the analysis and its use in effect-based program transformations.

Cite

CITATION STYLE

APA

Benton, N., Kennedy, A., Hofmann, M., & Nigam, V. (2016). Counting successes: Effects and transformations for non-deterministic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9600, pp. 56–72). Springer Verlag. https://doi.org/10.1007/978-3-319-30936-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free