Deriving structural induction in LCF.

Authors:
Lawrence Paulson
Affiliations:
Univ. of Cambridge, Cambridge, UK
Venue:
Proc. of the international symposium on Semantics of data types
Year:
1984

Citing 0
Cited 3

Proofs as programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computable values can be classical

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Type" is not a type

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract