Files in this item
Proof-relevant Horn clauses for dependent type inference and term synthesis
Item metadata
dc.contributor.author | Farka, František | |
dc.contributor.author | Komendantskya, Ekaterina | |
dc.contributor.author | Hammond, Kevin | |
dc.date.accessioned | 2019-02-10T00:35:28Z | |
dc.date.available | 2019-02-10T00:35:28Z | |
dc.date.issued | 2018 | |
dc.identifier | 255429602 | |
dc.identifier | 2bfc140c-b071-4cd7-89bf-3fb9b89bc1ce | |
dc.identifier | 85051361152 | |
dc.identifier | 000441294400013 | |
dc.identifier.citation | Farka , F , Komendantskya , E & Hammond , K 2018 , ' Proof-relevant Horn clauses for dependent type inference and term synthesis ' , Theory and Practice of Logic Programming , vol. 18 , no. 3-4 , pp. 484-501 . https://doi.org/10.1017/S1471068418000212 | en |
dc.identifier.issn | 1471-0684 | |
dc.identifier.other | crossref: 10.1017/S1471068418000212 | |
dc.identifier.other | ORCID: /0000-0002-4326-4562/work/47531682 | |
dc.identifier.uri | https://hdl.handle.net/10023/17030 | |
dc.description | This work has been supported by the EPSRC grant “Coalgebraic Logic Programming for Type Inference” EP/K031864/1-2, EU Horizon 2020 grant “RePhrase: Refactoring Parallel Heterogeneous Resource Aware Applications - a Software Engineering Approach” (ICT-644235), and by COST Action IC1202 (TACLe), supported by COST (European Cooperation in Science and Technology). | en |
dc.description.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. | |
dc.format.extent | 606306 | |
dc.language.iso | eng | |
dc.relation.ispartof | Theory and Practice of Logic Programming | en |
dc.subject | Proof-relevant logic | en |
dc.subject | Horn clauses | en |
dc.subject | Dependent types | en |
dc.subject | Type Inference | en |
dc.subject | Proof-relevant resolution | en |
dc.subject | BC Logic | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | DAS | en |
dc.subject.lcc | BC | en |
dc.subject.lcc | QA75 | en |
dc.title | Proof-relevant Horn clauses for dependent type inference and term synthesis | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1017/S1471068418000212 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2019-02-10 | |
dc.identifier.url | https://arxiv.org/abs/1804.11250 | en |
dc.identifier.grantnumber | EP/P020631/1 | en |
dc.identifier.grantnumber | 644235 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.