Hybrid type checking
From MaRDI portal
Publication:5348927
DOI10.1145/1111037.1111059zbMath1370.68202OpenAlexW2141210774MaRDI QIDQ5348927
Publication date: 21 August 2017
Published in: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1111037.1111059
Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (14)
ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ⋮ A Debugger-Cooperative Higher-Order Contract System in Python ⋮ An extended account of contract monitoring strategies as patterns of communication ⋮ Incremental Analysis of Logic Programs with Assertions and Open Predicates ⋮ An Integrated Approach to Assertion-Based Random Testing in Prolog ⋮ VeriFly: On-the-fly Assertion Checking via Incrementality ⋮ Fifty Years of Prolog and Beyond ⋮ Space-efficient gradual typing ⋮ Polymorphic Contracts ⋮ A general semantic construction of dependent refinement type systems, categorically ⋮ A verified framework for higher-order uncurrying optimizations ⋮ Reconciling method overloading and dynamically typed scripting languages ⋮ Blame and coercion: Together again for the first time ⋮ Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
This page was built for publication: Hybrid type checking
