1. Eliminating recursion over acyclic data structures in functional programs;Böhm,1983
2. Programs as proofs: A synopsis;Constable;Inform. Process. Lett.,1983
3. The expressiveness of simple and second-order type structures;Fortune;J. ACM,1983
4. Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur;Girard,1972
5. Computational uses of the manipulation of formal proofs;Goad,1980