1. A representable approach to finite nondeterminism;Anderson;Theoretical Computer Science,1997
2. Two-dimensional monad theory;Blackwell;J. Pure Appl. Algebra,1989
3. An axiomatisation of computationally adequate domain-theoretic models of FPC;Fiore,1994
4. Hermida, C.A., “Fibrations, Logical Predicates and Indeterminates,” Ph.D. thesis, The University of Edinburgh, 1993, available as CST–103–93, also as ECS–LFCS–93–277
5. Proof of correctness of data representations;Hoare;Acta Informatica,1972