Proving strong normalization of CC by modifying realizability semantics-Reference-Cited by-同舟云学术

Proving strong normalization of CC by modifying realizability semantics

Published:1994 Issue: Volume: Page:3-18
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Altenkirch Thorsten

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58085-9_70.pdf

Reference14 articles.

1. Thorsten Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, November 1993.

2. number 73 in Programming Methodology Group Reports;T. Altenkirch,1993

3. H.P. Barendregt. The Lambda Calculus — Its Syntax and Semantics (Revised Edition). Studies in Logic and the Foundations of Mathematics. North Holland, 1984.

4. H.P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol. 2, pages 118–310. Oxford University Press, 1992.

5. Thierry Coquand and Jean Gallier. A proof of strong normalization for the theory of constructions using a Kripke-like interpretation. Informal Proceedings of the First Annual Workshop on Logical Frameworks, Antibes, 1990.

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

1. Safety and conservativity of definitions in HOL and Isabelle/HOL;Proceedings of the ACM on Programming Languages;2018-01

2. A Formalization of the Knuth–Bendix(–Huet) Critical Pair Theorem;Journal of Automated Reasoning;2010-01-21

3. Coq formalization of the higher-order recursive path ordering;Applicable Algebra in Engineering, Communication and Computing;2009-10-09

4. Program Extraction from Normalization Proofs;Studia Logica;2006-02

5. A λ-to-CL translation for strong normalization;Lecture Notes in Computer Science;1997