We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
We have identified in previous work two translations for parametrically typed extensions of Java. The homogeneous translation maps type variables to a uniform representation, while...
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...