Program extraction from normalization proofs-Reference-Cited by-同舟云学术

Program extraction from normalization proofs

Published: Issue: Volume: Page:91-106
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Berger Ulrich

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0037100.pdf

Reference9 articles.

1. U. Berger, H. Schwichtenberg, An Inverse of the Evaluation Functional for Typed λ-calculus, Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, (1991) 203–211.

2. C. Coquand, A proof of normalization for simply typed lambda calculus written in ALF, Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden (1992) 80–87.

3. S. Hayashi, PX: a system extracting programs from proofs, Kyoto University, Japan (1987).

4. V. Gaspes, J. S. Smith, Machine Checked Normalization Proofs for Typed Combinator Calculi, Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden (1992) 168–192.

5. G. Kreisel, Interpretation of analysis by means of functionals of finite type, in Constructivity in Mathematics (1959) 101–128.

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

1. Semantic analysis of normalisation by evaluation for typed lambda calculus;Mathematical Structures in Computer Science;2022-09

2. Modal Functional (Dialectica) Interpretation;Logical Methods in Computer Science;2021-10-25

3. LOGIC FOR EXACT REAL ARITHMETIC;LOG METH COMPUT SCI;2021

4. CONSTRUCTIVE DOMAINS WITH CLASSICAL WITNESSES;LOG METH COMPUT SCI;2021

5. A type- and scope-safe universe of syntaxes with binding: their semantics and proofs;Journal of Functional Programming;2021