Making Functionality More General

The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the functional relations are precisely those satisfying the simple equation f = f ◦ f∪ ◦ f, where “∪” is the relation converse operator. This article forms part of “A calculational theory of pers as types” [1].

• Type: Conference
• Year: 1991
• Where: FP
• Authors: Graham Hutton, Ed Voermans
• Keywords: FP 1991, Functional Relations, Partial Equivalence Relations, Programming Languages, Relation Converse Operator