Structural recursion over sets is meaningful only if the result is independent of the order in which the set's elements are enumerated. This paper outlines a theory of function definition for finite sets, based on the fold functional often used with lists. The fold functional is introduced as a relation, which is then shown to denote a function under certain conditions. Applications include summation and maximum. The theory has been formalized using Isabelle/HOL. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Nipkow, T., & Paulson, L. C. (2005). Proof pearl: Defining functions over finite sets. In Lecture Notes in Computer Science (Vol. 3603, pp. 385–396). Springer Verlag. https://doi.org/10.1007/11541868_25
Mendeley helps you to discover research relevant for your work.