1. Apt, K. R. ‘Ten Years of Hoare’s Logic: A Survey - Part I’. ACM Transactions on Programming Languages and Systems 3 (4), 432–483. 1981.
2. Barendregt, H. ‘Lambda Calculi with Types’. In: S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum (eds.): Background: Computational Structures, Vol. 2 of Handbook of Logic in Computer Science. pp. 118–310. 1992.
3. Barendregt, H. and E. Barendsen, ‘Autarkic Computations in Formal Proofs’. Journal of Automated Reasoning, 28: 3, 321–336. 2002.
4. Filliâtre, J.-C. ‘Proof of Imperative Programs in Type Theory’. In: T. Altenkirch, W. Naraschewski, and B. Reus (eds.): Types for proofs and programs1998, Vol. 1657. 1999.
5. Franssen, M. ‘AP-: A Pure Type System for First Order Logic with Automated Theorem Proving’. Computing Science Report 97–15, Eindhoven University of Technology. 1997.