Strong normalization for applied lambda calculi-Reference-Cited by-同舟云学术

Strong normalization for applied lambda calculi

Published:2005-10-05 Issue:2 Volume:1 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Berger Ulrich

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors,Handbook of Logic in Computer Science, volume 3, pages 1-168. Clarendon Press, 1994.

2. T. Altenkirch.Constructions, Inductive Types and Strong Normalization. PhD thesis, The University of Edinburgh, Department of Computer Science, Edinburgh, 1993.

3. H. Barendregt. Lambda calculi with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors,Handbook of Logic in Computer Science, volume 2, pages 117-309. Clarendon Press, Oxford, 1992.

4. On the computational content of the axiom of choice

5. U. Berger. A computational interpretation of open induction. In F. Titsworth, editor,Proceedings of the Ninetenth Annual IEEE Symposium on Logic in Computer Science, pages 326-334. IEEE Computer Society, 2004.

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

1. Gamma-ray bursts: not so much deadlier than we thought;Monthly Notices of the Royal Astronomical Society;2020-10-30

2. Investigation of mass attenuation coefficients of copper–silver thin films at 14.93–48.82 keV energy range;X-Ray Spectrometry;2020-09-28

3. Constructive forcing, CPS translations and witness extraction in Interactive realizability;Mathematical Structures in Computer Science;2015-10-29

4. The equivalence of bar recursion and open recursion;Annals of Pure and Applied Logic;2014-11

5. Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1;Mathematical Structures in Computer Science;2013-10-25