Refinement Types as Proof Irrelevance
From MaRDI portal
Recommendations
- Refinement types for logical frameworks and their interpretation as proof irrelevance
- Principles and applications of refinement types
- A bidirectional refinement type system for LF
- Constructive data refinement in typed lambda calculus
- Some algorithmic and proof-theoretical aspects of coercive subtyping
Cites work
Cited in
(3)
This page was built for publication: Refinement Types as Proof Irrelevance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637193)