Beldiceanu, N., Katriel, I. & Lorca, X. (2006).
Undirected Forest Constraints. In
Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006) (Vol. LNCS 3990, pp. 29-43). Springer.
David, B. M., Dowsley, R., van der Graaf, J., Marques, D., Nascimento, A. C. A. & Pinto, A. (2015).
Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra.
I E E E Transactions on Information Forensics and Security,
11(1), 59 - 73 .
https://doi.org/10.1109/TIFS.2015.2476783
Damgård, I. B., Nielsen, J. B., Toft, T., Kiltz, E. & Fitzi, M. (2006).
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In S. Halevi & T. Rabin (Eds.),
Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006. Proceedings (pp. 285-304). Springer.
https://doi.org/10.1007/11681878_15
Schwartzbach, M. I. & Meineche Smidt, E. (1990).
Types and Automata. Aarhus Universitetsforlag.
Schwartzbach, M. I., Askari, H. & Hougaard, O. I. (1995).
Type Inference of Turbo Pascal.
International Journal on Software Tools for Technology Transfer,
16(4), 160-169.
Hansen, K. M. & Yndigegn, C. (1999).
Typed links in Webvise. Computer programme
Danvy, O. (1996).
Type-Directed Partial Evaluation. In
Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium (pp. 242-257). Association for Computing Machinery.