On-Demand Refinement of Dependent Types

DOI10.1007/978-3-540-78969-7_8MaRDI QIDQ5458429zbMATH OpenOpenAlexFDO

Authors Hiroshi Unno, Naoki Kobayashi

Publication date 11 April 2008

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.8731

Mathematics Subject Classification ID

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

Recommendations

• Dependent types from counterexamples
• scientific article; zbMATH DE number 2163037
• Dependent Types for Low-Level Programming
• Refinement types for program analysis
• Dependent array type inference from tests

Cited in

(8)

• On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
• Tools and Algorithms for the Construction and Analysis of Systems
• Dependent array type inference from tests
• Dependent types from counterexamples
• scientific article; zbMATH DE number 2163037 (Why is no real title available?)
• Compositional and lightweight dependent type inference for ML
• Parameterized recursive refinement types for automated program verification
• Dependent ML An approach to practical programming with dependent types

This page was built for publication: On-Demand Refinement of Dependent Types

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