AbstractThis paper is devoted to the proof, applications, and generalisation of a theorem, due to Bird and de Moor, that gave conditions under which a total function can be expressed as a relational fold. The theorem is illustrated with three problems, all dealing with constructing trees with various properties. It is then generalised to give conditions under which the inverse of a partial function can be expressed as a relational hylomorphism. Its proof makes use of Doornbos and Backhouse's theory on well-foundedness and reductivity. Possible applications of the generalised theorem is discussed
Fold functions are a general mechanism for computing over recursive data structures. First-order fol...
Abstract. In this paper we formally state and prove theorems characterizing when a function can be c...
AbstractWe investigate a particular symmetry in labeled trees first discovered by Gessel, which can ...
AbstractThis paper is devoted to the proof, applications, and generalisation of a theorem, due to Bi...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
Abstract. Given the inorder and preorder traversal of a binary tree whose labels are all distinct, o...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Consider the set of minimal factorizations of the canonical full cycle in the symmetric group on n +...
AbstractIn this paper we demonstrate that the basic rules and calculational techniques used in two e...
AbstractA depth first search algorithm is used to establish the connection between labeled connected...
AbstractA classical result in algebraic specification states that a total function defined on an ini...
In this paper we formally state and prove theorems characterizing when a function can be constructi...
AbstractWe study the class of tree transductions induced by bimorphisms (ϕ, R, ϕ′) with ϕ,ϕ′ alphabe...
AbstractLet R and F be two species, and let AR be the species of R-enriched trees. G. Labelle obtain...
Fold functions are a general mechanism for computing over recursive data structures. First-order fol...
Abstract. In this paper we formally state and prove theorems characterizing when a function can be c...
AbstractWe investigate a particular symmetry in labeled trees first discovered by Gessel, which can ...
AbstractThis paper is devoted to the proof, applications, and generalisation of a theorem, due to Bi...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
Many problems in computation can be specified in terms of computing the inverse of an easily constru...
Abstract. Given the inorder and preorder traversal of a binary tree whose labels are all distinct, o...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
Consider the set of minimal factorizations of the canonical full cycle in the symmetric group on n +...
AbstractIn this paper we demonstrate that the basic rules and calculational techniques used in two e...
AbstractA depth first search algorithm is used to establish the connection between labeled connected...
AbstractA classical result in algebraic specification states that a total function defined on an ini...
In this paper we formally state and prove theorems characterizing when a function can be constructi...
AbstractWe study the class of tree transductions induced by bimorphisms (ϕ, R, ϕ′) with ϕ,ϕ′ alphabe...
AbstractLet R and F be two species, and let AR be the species of R-enriched trees. G. Labelle obtain...
Fold functions are a general mechanism for computing over recursive data structures. First-order fol...
Abstract. In this paper we formally state and prove theorems characterizing when a function can be c...
AbstractWe investigate a particular symmetry in labeled trees first discovered by Gessel, which can ...