ChatsYapsForumsTopicsWatchFeedsDecksChartsChatsYapsForumsTopicsWatchFeedsDecksCharts
Log inRegister

Log in to follow channels.

Log in to follow topics.

Log in to see your friends.

rustlang

Forum post

CIRT: Calculus of Inductive Refinement Types

·5d

arXiv.org

CIRT: Calculus of Inductive Refinement Types

Refinement types are a powerful mechanism for statically verifying properties of programs. They have been successfully integrated into practical languages such as Haskell, Scala, and Rust. However, their metatheory is not yet fully understood. In this paper we present the first semantic model for a refinement type system that supports the full feature combination of subtyping, SMT-style equality, impredicative polymorphism, and (stratified) inductive types. Interactions between these features have led to inconsistencies in the past, and existing formalizations of refinement type systems omit at least one of them. We present a realizability model based on partial equivalence relations (PERs) over a Scott domain, which overcomes these obstacles. We use our model to prove the consistency of a core refinement type system and to give a semantic account of the annotation-independence property of refinement types. Our semantics uses two interpretations: a refined one, which interprets types a

1

0 comments