Classical proofs as programs: How, what and why-Reference-Cited by-同舟云学术

Classical proofs as programs: How, what and why

Published:1992 Issue: Volume: Page:71-88
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Murthy Chetan R.

Publisher

Springer Berlin Heidelberg

Link

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

Reference14 articles.

1. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, revised edition, 1984.

2. W. Clinger and J. Rees. The revised3 report on the algorithmic language scheme. SIGPLAN Notices, 21(12):37–79, 1986.

3. R. Constable. The semantics of evidence. Technical Report TR 85-684, Cornell University, Department of Computer Science, Ithaca, New York, May 1985.

4. D. A. V. Dalen and A. S. Troelstra. Constructivism in Mathematics. North-Holland, 1989.

5. O. Danvy and A. Filinski. Abstracting control. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 151–160, 1990.

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

1. Reifying dynamical algebra: Maximal ideals in countable rings, constructively;Computability;2024-04-26

2. Maximal Ideals in Countable Rings, Constructively;Revolutions and Revelations in Computability;2022

3. Around Classical and Intuitionistic Linear Logics;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

4. Categorical proof theory of classical propositional calculus;Theoretical Computer Science;2006-11

5. Strong Normalization of the Dual Classical Sequent Calculus;Logic for Programming, Artificial Intelligence, and Reasoning;2005