Giuseppe Castagna, Programming with Union, Intersection, and Negation Types, https://arxiv.org/pdf/2111.03354 p. 7 Also chapter 12 in "The French School of Programming", Springer 2024, ISBN 978-3-031-34517-3
Kfoury, A.J.; Wells, J.B. (January 2004). "Principality and type inference for intersection types using expansion variables". Theoretical Computer Science. 311 (1–3): 1–70. doi:10.1016/j.tcs.2003.10.032.
Kopylov, Alexei (2003). "Dependent intersection: A new way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX10.1.1.89.4223. doi:10.1109/LICS.2003.1210048.
Pollack, Robert (2000). "Dependently typed records for representing mathematical structure". Theorem Proving in Higher Order Logics, 13th International Conference. TPHOLs 2000. Springer. pp. 462–479. doi:10.1007/3-540-44659-1_29.
Kopylov, Alexei (2003). "Dependent intersection: A new way of defining records in type theory". 18th IEEE Symposium on Logic in Computer Science. LICS 2003. IEEE Computer Society. pp. 86–95. CiteSeerX10.1.1.89.4223. doi:10.1109/LICS.2003.1210048.