Nested refinements: a logic for duck typing

DOI10.1145/2103656.2103686MaRDI QIDQ2942876zbMATH OpenOpenAlexFDO

Authors Ravi Chugh, Patrick Maxim Rondon, Ranjit Jhala

Publication date 11 September 2015

Published in Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

refinement typesdynamic languages

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Semantic subtyping with an SMT solver
• Dynamic typing: Syntax and proof theory
• Abstracting gradual typing
• Semantic subtyping with an SMT solver
• Gradual refinement types

Cited in

(11)

• scientific article; zbMATH DE number 177653 (Why is no real title available?)
• A reflection on types
• Logical types for untyped languages
• Migrating gradual types
• A Debugger-Cooperative Higher-Order Contract System in Python
• Hybrid type checking
• Higher order symbolic execution for contract verification and refutation
• Semantic subtyping with an SMT solver
• Semantic subtyping with an SMT solver
• Dynamic typing: Syntax and proof theory
• Dynamic inference of static types for Ruby

This page was built for publication: Nested refinements: a logic for duck typing

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