Add to ORKGA downwards accumulation is a higher-order operation that distributes information downwards through a data structure, from the root towards the leaves. The concept was originally introduced in an ad hoc way for just a couple of kinds of tree. We generalize the concept to an arbitrary polynomial datatype; our generalization proceeds via the notion of a path in such a datatype
This article proposes a new framework for a polytypic extension of functional programming languages....
Type hierarchies abound in Artificial Intelligence, Data Bases and Programming Languages. Although t...
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this...
A downwards accumulation is a higher-order operation that distributes information downwards through ...
AbstractA downwards accumulation is a higher-order operation that distributes information downwards ...
An accumulation\\/ is a higher-order operation over structured objects of some type; it leaves the ...
Downwards passes on binary trees are essentially functions which pass information down a tree, from ...
AbstractDownwards passes on binary trees are essentially functions which pass information down a tre...
Downwards accumulations on binary trees are essentially functions which pass information down a tree...
In this paper we analyze systematically the downward property ow and the upward individual ow ...
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
Placing degree constraints on the vertices of a path yields the definitions of uphill and downhill p...
The Boom hierarchy is a hierarchy of types that begins at the level of trees and includes lists, b...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→N. A (simple) path for which f incre...
Abstract"Downward separation" results show that when small classes collapse, larger ones also collap...
This article proposes a new framework for a polytypic extension of functional programming languages....
Type hierarchies abound in Artificial Intelligence, Data Bases and Programming Languages. Although t...
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this...
A downwards accumulation is a higher-order operation that distributes information downwards through ...
AbstractA downwards accumulation is a higher-order operation that distributes information downwards ...
An accumulation\\/ is a higher-order operation over structured objects of some type; it leaves the ...
Downwards passes on binary trees are essentially functions which pass information down a tree, from ...
AbstractDownwards passes on binary trees are essentially functions which pass information down a tre...
Downwards accumulations on binary trees are essentially functions which pass information down a tree...
In this paper we analyze systematically the downward property ow and the upward individual ow ...
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
Placing degree constraints on the vertices of a path yields the definitions of uphill and downhill p...
The Boom hierarchy is a hierarchy of types that begins at the level of trees and includes lists, b...
AbstractAn edge ordering of a graph G=(V,E) is an injection f:E→N. A (simple) path for which f incre...
Abstract"Downward separation" results show that when small classes collapse, larger ones also collap...
This article proposes a new framework for a polytypic extension of functional programming languages....
Type hierarchies abound in Artificial Intelligence, Data Bases and Programming Languages. Although t...
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this...