Dependent type inference with interpolants

Authors:
Hiroshi Unno;Naoki Kobayashi
Affiliations:
Tohoku University, Sendai, Japan;Tohoku University, Sendai, Japan
Venue:
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Year:
2009

Citing 23
Cited 7

Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Cayenne—a language with dependent types

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Dependent types in practical programming

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving Theorems about LISP Functions

Journal of the ACM (JACM)
Calculating sized types

PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Model checking

Model checking
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Extending sized type with collection analysis

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Hybrid type checking

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Interpolation for data structures

Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Liquid types

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Type reconstruction for general refinement types

ESOP'07 Proceedings of the 16th European conference on Programming
Type error slicing in implicitly typed higher-order languages

ESOP'03 Proceedings of the 12th European conference on Programming
On-demand refinement of dependent types

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Dependent types from counterexamples

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predicate abstraction and CEGAR for higher-order model checking

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
HMC: verifying functional programs using abstract interpreters

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Solving recursion-free horn clauses over LI+UIF

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Synthesizing software verifiers from proof rules

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Towards a scalable software model checker for higher-order programs

PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Automating relatively complete verification of higher-order functional programs

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel type inference algorithm for a dependently-typed functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types with interpolants until the type inference succeeds or the program is found to be ill-typed, and (ii) in the latter case, it can generate a kind of counter-example as an explanation of why the program is ill-typed. We have implemented a prototype type inference system and tested it for several programs.