2026-07-22T07:15:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14061 2024-03-06T10:53:12Z ddc:004 open_access

Refinements of Futures Past: Higher-Order Specification with Implicit Refinement Types Tondwalkar, Anish Kolosick, Matthew Jhala, Ranjit Refinement Types Implicit Parameters Verification Dependent Pairs Refinement types decorate types with assertions that enable automatic verification. Like assertions, refinements are limited to binders that are in scope, and hence, cannot express higher-order specifications. Ghost variables circumvent this limitation but are prohibitively tedious to use as the programmer must divine and explicate their values at all call-sites. We introduce Implicit Refinement Types which turn ghost variables into implicit pair and function types, in a way that lets the refinement typechecker automatically synthesize their values at compile time. Implicit Refinement Types further take advantage of refinement type information, allowing them to be used as a lightweight verification tool, rather than merely as a technique to automate programming tasks. We evaluate the utility of Implicit Refinement Types by showing how they enable the modular specification and automatic verification of various higher-order examples including stateful protocols, access control, and resource usage. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anish Tondwalkar and Matthew Kolosick and Ranjit Jhala 2021 Is Part Of LIPIcs, Volume 194, 35th European Conference on Object-Oriented Programming (ECOOP 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECOOP.2021.18 urn:nbn:de:0030-drops-140615 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2021.18 eng https://creativecommons.org/licenses/by/4.0/legalcode