1. Basold, H., Geuvers, H.: Type theory based on dependent inductive and coinductive types. In: Shankar, N. (ed.) IEEE Symposium on Logic in Computer Science (LICS) (2016)
2. Bezem, M., Coquand, T., Huber, S.: A model of type theory in cubical sets. In: Matthes, R., Schubert, A. (eds.) 19th International Conference on Types for Proofs and Programs, TYPES 2013 of LIPIcs, vol. 26, pp. 107–128. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)
3. Böhm, C., Berarducci, A.: Automatic synthesis of typed lambda-programs on term algebras. Theor. Comput. Sci. 39, 135–154 (1985)
4. Church, A.: The Calculi of Lambda Conversion. Princeton University Press, Princeton (1941). Ann. Math. Stud. (6)
5. Coquand, T., Huet, G.: The calculus of constructions. Inf. Comput. 76(2–3), 95–120 (1988)