AbstractWe give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the underlying datatype
Unfold/fold transformations have been studied for various declarative programming languages such as ...
Fold and unfold are general purpose functionals for process-ing and constructing lists. By using the...
Abstract. Structural recursion over sets is meaningful only if the result is independent of the orde...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
In this paper we formally state and prove theorems characterizing when a function can be constructi...
Abstract. In this paper we formally state and prove theorems characterizing when a function can be c...
In functional programming, fold is a standard operator that encapsulates a simple pattern of recursi...
In this paper we explain how recursion operators can be used to structure and reason about program s...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
Sorting algorithms are one of the key pedagogical foundations of computer science, and their propert...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Fold and unfold are general purpose functionals for processing and constructing lists. By using the ...
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not ...
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not ...
Unfold/fold transformations have been studied for various declarative programming languages such as ...
Fold and unfold are general purpose functionals for process-ing and constructing lists. By using the...
Abstract. Structural recursion over sets is meaningful only if the result is independent of the orde...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
We give a necessary and sufficient condition for when a set-theoretic function can be written using ...
In this paper we formally state and prove theorems characterizing when a function can be constructi...
Abstract. In this paper we formally state and prove theorems characterizing when a function can be c...
In functional programming, fold is a standard operator that encapsulates a simple pattern of recursi...
In this paper we explain how recursion operators can be used to structure and reason about program s...
One style of functional programming is based purely on recursive equations. Such equations are easy ...
Sorting algorithms are one of the key pedagogical foundations of computer science, and their propert...
In this paper we explain how recursion operators can be used to structure and reason about program s...
Fold and unfold are general purpose functionals for processing and constructing lists. By using the ...
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not ...
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not ...
Unfold/fold transformations have been studied for various declarative programming languages such as ...
Fold and unfold are general purpose functionals for process-ing and constructing lists. By using the...
Abstract. Structural recursion over sets is meaningful only if the result is independent of the orde...
DOI
Add to ORKG