Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorFarka, František
dc.contributor.authorKomendantskya, Ekaterina
dc.contributor.authorHammond, Kevin
dc.date.accessioned2019-02-10T00:35:28Z
dc.date.available2019-02-10T00:35:28Z
dc.date.issued2018
dc.identifier.citationFarka , 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/S1471068418000212en
dc.identifier.issn1471-0684
dc.identifier.otherPURE: 255429602
dc.identifier.otherPURE UUID: 2bfc140c-b071-4cd7-89bf-3fb9b89bc1ce
dc.identifier.othercrossref: 10.1017/S1471068418000212
dc.identifier.otherScopus: 85051361152
dc.identifier.otherORCID: /0000-0002-4326-4562/work/47531682
dc.identifier.urihttp://hdl.handle.net/10023/17030
dc.identifier.urihttps://arxiv.org/abs/1804.11250en
dc.descriptionThis 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.abstractFirst-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.en
dc.language.isoeng
dc.relation.ispartofTheory and Practice of Logic Programmingen
dc.rights© 2018, Cambridge University Press. This work has been made available online in accordance with the publisher’s policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1017/S1471068418000212en
dc.subjectProof-relevant logicen
dc.subjectHorn clausesen
dc.subjectDependent typesen
dc.subjectType Inferenceen
dc.subjectProof-relevant resolutionen
dc.subjectBC Logicen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectDASen
dc.subject.lccBCen
dc.subject.lccQA75en
dc.titleProof-relevant Horn clauses for dependent type inference and term synthesisen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1017/S1471068418000212
dc.description.statusPeer revieweden
dc.date.embargoedUntil10-02-20


This item appears in the following Collection(s)

Show simple item record