@INPROCEEDINGS{AntoyHanusLibby17EPTCS,
author = "Antoy, S. and Hanus, M. and Libby, S.",
title = "Proving Non-Deterministic Computations in Agda",
year = "2017",
booktitle = "Proc.\ of the 24th International Workshop on Functional and
(Constraint) Logic Programming (WFLP 2016)",
pages = {180-195},
publisher = {Open Publishing Association},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {234},
abstract = {
We investigate proving properties of Curry programs using Agda.
First, we address the functional correctness of Curry functions that,
apart from some syntactic and semantic differences, are in the
intersection of the two languages. Second, we use Agda to model
non-deterministic functions with two distinct and competitive
approaches incorporating the non-determinism. The first approach
eliminates non-determinism by considering the set of all
non-deterministic values produced by an application. The second
approach encodes every non-deterministic choice that the application
could perform. We consider our initial experiment a success.
Although proving properties of programs is a notoriously difficult
task, the functional logic paradigm does not seem to add any
significant layer of difficulty or complexity to the task.
}
}