Article contents
Proof-relevant Horn Clauses for Dependent Type Inference and Term Synthesis
Published online by Cambridge University Press: 10 August 2018
Abstract
First-order resolution has been used for type inference for many years, including in Hindley-Milner type inference, type-classes, and constrained data types. Dependent types are a new trend in functional languages. In this paper, we show that proof-relevant first-order resolution can play an important role in automating type inference and term synthesis for dependently typed languages. We propose a calculus that translates type inference and term synthesis problems in a dependently typed language to a logic program and a goal in the proof-relevant first-order Horn clause logic. The computed answer substitution and proof term then provide a solution to the given type inference and term synthesis problem. We prove the decidability and soundness of our method.
- Type
- Original Article
- Information
- Theory and Practice of Logic Programming , Volume 18 , Special Issue 3-4: 34th International Conference on Logic Programming , July 2018 , pp. 484 - 501
- Copyright
- Copyright © Cambridge University Press 2018
References
- 2
- Cited by