The first thing discovered equivalent to funcoids was a function (generalizing a topological space) which I defined to get a set as argument and return a filter, subject to several equalities, after the removal of superfluous equalities it has become:
(Here and may mean the join and meet on the lattice of filters ordered reverse to set-theoretic inclusion of filters, also denotes the improper filter.)
Then somehow (I don’t remember how exactly) I managed that this can be reverted (like modern notion of reverse funcoid).
Somehow I have managed to define composition of funcoids.
Afterward I defined funcoids in the following cumbersome way:
Funcoids is a set of objects such that it is unambiguously defined by the values and of functions from filters to filters such that .
Later I have come to the simple idea that instead of this cumbersome definition can be replaced with simply defining a funcoid as a pair of functions from filters to filters.
An other anachronism: Initially I considered funcoids as a special case of reloids conforming to the above formula. (I don’t remember whether I had an exact definition for a reloid to be a funcoid.) Later funcoids have become an independent kind of objects, rather than a special case of reloids.
Finally, I’ve replaced the funcoid on a single “universal” set with funcoids between two sets and , so forming a category of funcoids.
I have not told the history of filter objects (where principal filters were equated with corresponding sets, such as was also the improper filter) and then removing this notion in regard of simple reverse-ordered lattice of filters with order, meets, and joins denoted differently than set-theoretic subset, intersection, and union, not to make mess between these.
Finally: If I would know the notion of proximity spaces at the time when I wrote the function would it prevent me to discover funcoids (counting that proximity spaces is what I need and thus not continuing the research further)?