The following pages link to Refinement types for Haskell (Q2819690):
Displaying 17 items.
- LiquidHaskell (Q39348) (← links)
- Proving type class laws for Haskell (Q2151278) (← links)
- Learning inductive invariants by sampling from frequency distributions (Q2225478) (← links)
- A general semantic construction of dependent refinement type systems, categorically (Q2233424) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Type Class Instances for Type-Level Lambdas in Haskell (Q2814386) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- Modular Verification of Higher-Order Functional Programs (Q2988670) (← links)
- Parametricity for Haskell with Imprecise Error Semantics (Q3637203) (← links)
- Ready,<tt>Set</tt>, Verify! Applying<tt>hs-to-coq</tt>to real-world Haskell code (Q5018778) (← links)
- ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs (Q5041118) (← links)
- (Q5091145) (← links)
- Higher order symbolic execution for contract verification and refutation (Q5371996) (← links)
- Parameterized recursive refinement types for automated program verification (Q6109429) (← links)
- On algebraic array theories (Q6192058) (← links)
- Manifest contracts with intersection types (Q6536305) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
