Gradual refinement types

DOI10.1145/3009837.3009856MaRDI QIDQ5370912zbMATH OpenOpenAlexFDO

Authors Nico Lehmann, Éric Tanter

Publication date 20 October 2017

Published in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3009837.3009856

zbMATH Keywords

abstract interpretationrefinement typesgradual typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Sums of uncertainty: refinements go gradual
• Gradual type theory
• Abstracting gradual typing
• Refinement types for Haskell
• Gradual program verification

Cited in

(18)

• Abstract refinement types
• Nested refinements: a logic for duck typing
• Refinement types for Haskell
• A general semantic construction of dependent refinement type systems, categorically
• Exception tracking in an open world
• Reconciling noninterference and gradual typing
• Gradual typing using union typing with records
• Fissile type analysis, modular checking of almost everywhere invariants
• Principles and applications of refinement types
• Bounded refinement types
• Migrating gradual types
• Type Reconstruction for General Refinement Types
• Foundations of dependent interoperability
• Call-by-name gradual type theory
• Gradual tensor shape checking
• Gradual program verification
• Refinement types for Ruby
• Sums of uncertainty: refinements go gradual

This page was built for publication: Gradual refinement types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370912)