How to assign ordinal numbers to combinatory terms with polymorphic types-Reference-Cited by-同舟云学术

How to assign ordinal numbers to combinatory terms with polymorphic types

Published:2012-04-15 Issue:5-6 Volume:51 Page:475-501
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch. Math. Logic

Author:

Stirton William R.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/s00153-012-0277-8.pdf

Reference20 articles.

1. Altenkirch, T., T. Coquand: A finitary subsystem of the polymorphic lambda calculus. In: S. Abramsky (ed.), Typed Lambda Calculi and Applications (Lecture Notes in Computer Science 2044) Springer, pp. 22–28 (2001)

2. Arai T.: An introduction to finitary analyses of proof figures. In: Cooper, S.B., Truss, J.K. (eds) Sets and Proofs, pp. 1–26. Cambridge University Press, Cambridge (1999)

3. Barendregt H.P. et al.: Lambda calculi with types. In: Abramsky, S. (ed) Handbook of Logic in Computer Science, vol 2, pp. 117–309. Oxford University Press, Oxford (1992)

4. Beckmann A., Weiermann A.: Analysing Gödel’s T by means of expanded head reduction trees. Math. Logic Q. 46, 517–536 (2000)

5. Coquand T.: Completeness theorems and λ-Calculus. In: P. Urzyczyn (ed.) Typed Lambda Calculi and Applications (Lecture Notes in Computer Science 3461) Springer, pp. 1–9 (2005)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combinatory logic with polymorphic types;Archive for Mathematical Logic;2021-08-27

2. A decidable theory of type assignment;Archive for Mathematical Logic;2013-05-07