Compositional and Lightweight Dependent Type Inference for ML

DOI10.1007/978-3-642-35873-9_19zbMath1426.68036OpenAlexW67718509MaRDI QIDQ2926649

Suresh Jagannathan, He Zhu

Publication date: 3 November 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35873-9_19

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ Higher order symbolic execution for contract verification and refutation ⋮ Modular Verification of Higher-Order Functional Programs ⋮ Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking ⋮ ICE-based refinement type discovery for higher-order functional programs

This page was built for publication: Compositional and Lightweight Dependent Type Inference for ML