Skip to main content Accessibility help

Atomic polymorphism

  • Fernando Ferreira (a1) and Gilda Ferreira (a2)


It has been known for six years that the restriction of Girard's polymorphic system F to atomic universal instantiations interprets the full fragment of the intuitionistic propositional calculus. We firstly observe that Tait's method of “convertibility” applies quite naturally to the proof of strong normalization of the restricted Girard system. We then show that each β-reduction step of the full intuitionistic propositional calculus translates into one or more βη-reduction steps in the restricted Girard system. As a consequence, we obtain a novel and perspicuous proof of the strong normalization property for the full intuitionistic propositional calculus. It is noticed that this novel proof bestows a crucial role to η-conversions.



Hide All
[1]Aehlig, K., Parameter-free polymorphic types, Annals of Pure and Applied Logic, vol. 156 (2008), pp. 312.
[2]Altenkirch, T. and Coquand, T., A finitary subsystem of the polymorphic lambda-calculus. Typed Lambda Calculi and Applications (TLCA 2001) (Abramsky, S., editor), Lecture Notes in Computer Science, vol. 2044, Springer, 2001, pp. 2228.
[3]Ferreira, F., Comments on predicative logic, Journal of Philosophical Logic, vol. 35 (2006), pp. 18.
[4]Ferreira, F. and Ferreira, G., Commuting conversions vs. the standard conversions of the “good” connectives, Studia Logica, vol. 92 (2009), pp. 6384.
[5]Girard, J.-Y., Une extension de l'interprétation de Gödel à l'analyse, et son application à lélimination des coupures dans l'analyse et la théorie des types, Proceedings ofthe second Scandinavian logic symposium (Fenstad, J. E., editor), North Holland, Amsterdam, 1971, pp. 6392.
[6]Girard, J.-Y., Lafont, Y., and Taylor, P., Proofs and types, Cambridge University Press, 1989.
[7]Joachimski, F. and Matthes, R., Short proofs of normalization for the simply-typed lambda-calculus, permutative conversions and Gödel's T, Archive for Mathematical Logic, vol. 42 (2003), pp. 5987.
[8]Kretz, M., On the treatment of predicative polymorphism in theories of explicit mathematics, Ph.D. thesis, Universität Bern, 2002.
[9]Mitchell, J. C., Type systems for programming languages, Handbook of theoretical computer science (van Leeuwen, J., editor), vol. B, Elsevier, 1990, pp. 365458.
[10]Mitchell, J. C. and Harper, R., The essence of ML, Proceedings of 15th ACM symposium on principles of programming languages, 1988, pp. 2846.
[11]Prawitz, D., Natural deduction, Almkvist & Wiksell, Stockholm, 1965, reprinted, with a new preface, Dover Publications, 2006.
[12]Prawitz, D., Ideas and results in proof theory, Proceedings of the second Scandinavian logic symposium (Fenstad, J. E., editor), North-Holland, 1971, pp. 235307.
[13]Reynolds, J. C., Towards a theory of type structure, Collogue sur la programmation (Robinet, B., editor), Lecture Notes in Computer Science, vol. 19, Springer, 1974.
[14]Russell, B. and Whitehead, A. N., Principia mathematica, 2nd ed., Cambridge University Press, 1927.
[15]Sandqvist, T., A note on definability of logical operators in second-order logic, unpublished manuscript, 2008.
[16]Tait, W., Intentional interpretations of functionals offinite type I, this Journal, vol. 32 (1967), pp. 198212.
[17]Troelstra, A. S. and Schwichtenberg, H., Basic proof theory, Cambridge University Press, Cambridge, 1996.


Related content

Powered by UNSILO

Atomic polymorphism

  • Fernando Ferreira (a1) and Gilda Ferreira (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.