A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Free theorems for functional logic programs
2010
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification - PLPV '10
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be derived without consulting function definitions. Is the same possible in a strongly, and polymorphically, typed functional logic language? This is the question we study in this paper. Logical features like nondeterminism and free variables cause interesting effects, which we examine based on examples and address by
doi:10.1145/1707790.1707797
dblp:conf/plpv/ChristiansenSV10
fatcat:c57wryativdjdlqgscyz6ykj4e