Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dependent Types for Program Termination Verification
Higher-Order and Symbolic Computation
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Combining programming with theorem proving
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Dependent ML An approach to practical programming with dependent types
Journal of Functional Programming
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A linear type system for multicore programming in ATS
Science of Computer Programming
| Hi-index | 0.00 |
Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute to determine whether expressions assigned such types are eligible for erasure before run-time. We formalize a type system to support this form of attributive types and then establish its soundness. In addition, we outline an extension of the developed type system with dependent types and present some examples to illustrate its use in practice.