The following pages link to Hybrid type checking (Q5348927):
Displayed 14 items.
- Space-efficient gradual typing (Q656856) (← links)
- A verified framework for higher-order uncurrying optimizations (Q968367) (← links)
- A general semantic construction of dependent refinement type systems, categorically (Q2233424) (← links)
- Reconciling method overloading and dynamically typed scripting languages (Q2275534) (← links)
- Polymorphic Contracts (Q3000571) (← links)
- A Debugger-Cooperative Higher-Order Contract System in Python (Q3179289) (← links)
- An extended account of contract monitoring strategies as patterns of communication (Q4577815) (← links)
- Blame and coercion: Together again for the first time (Q5019015) (← links)
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi (Q5020907) (← links)
- ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs (Q5041118) (← links)
- Incremental Analysis of Logic Programs with Assertions and Open Predicates (Q5097624) (← links)
- An Integrated Approach to Assertion-Based Random Testing in Prolog (Q5097633) (← links)
- VeriFly: <i>On-the-fly Assertion Checking via Incrementality</i> (Q6063866) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)