1. J.G.F. Belinfante, Gödel’s algorithm for class formation, inProc. of CADE’00, edited by D. McAllester.Lect. Notes Comput. Sci.1831(2000) 132–147.
2. C. Brown and G. Hutton, Categories, allegories and circuit design, inProc. of 9th IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press (1994) 372–381.
3. C. Brown and A. Jeffrey, Allegories of circuits, inProc. of Logic for Computer Science(1994) 56–68.
4. D. Cantone, A. Cavarra and E.G. Omodeo, On existentially quantified conjunctions of atomic formulae of ℒ+, inProc. of International Workshop on First-Order Theorem Proving (FTP97), edited by M.P. Bonacina and U. Furbach (1997).
5. Cantone D., Formisano A., Omodeo E.G. and Zarba C.G., Compiling dyadic first-order specifications into map algebra.Theoret. Comput. Sci.293(2003) 447–475.