基于约束的类型推断关系求解器

arXiv - CS - Programming Languages Pub Date : 2024-08-30 DOI:arxiv-2408.17138

Eridan Domoratskiy, Dmitry Boulytchev

{"title":"基于约束的类型推断关系求解器","authors":"Eridan Domoratskiy, Dmitry Boulytchev","doi":"arxiv-2408.17138","DOIUrl":null,"url":null,"abstract":"We present a miniKanren-based type inferencer for an educational programming\nlanguage with first-class functions, S-expressions, and pattern-matching. The\nlanguage itself is untyped which adds a certain specificity to the problem and\nrequires the employment of techniques conventionally used in implicit/gradual\ntyping settings. The presence of polymorphic and recursive types poses a\ncertain challenge when implementing the inferencer in miniKanren and requires a\nnumber of tricks, optimizations, and extensions to be used; we report on those\nas well.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Relational Solver for Constraint-based Type Inference\",\"authors\":\"Eridan Domoratskiy, Dmitry Boulytchev\",\"doi\":\"arxiv-2408.17138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a miniKanren-based type inferencer for an educational programming\\nlanguage with first-class functions, S-expressions, and pattern-matching. The\\nlanguage itself is untyped which adds a certain specificity to the problem and\\nrequires the employment of techniques conventionally used in implicit/gradual\\ntyping settings. The presence of polymorphic and recursive types poses a\\ncertain challenge when implementing the inferencer in miniKanren and requires a\\nnumber of tricks, optimizations, and extensions to be used; we report on those\\nas well.\",\"PeriodicalId\":501197,\"journal\":{\"name\":\"arXiv - CS - Programming Languages\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.17138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.17138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们为一种具有一流函数、S 表达式和模式匹配的教育编程语言提出了一种基于微型坎伦的类型推断器。该语言本身是无类型的，这给问题增加了一定的特殊性，并要求使用隐式/渐进式类型设置中常用的技术。多态类型和递归类型的存在给在 miniKanren 中实现推理器带来了一定的挑战，需要使用一些技巧、优化和扩展；我们也将对此进行报告。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Relational Solver for Constraint-based Type Inference

We present a miniKanren-based type inferencer for an educational programming language with first-class functions, S-expressions, and pattern-matching. The language itself is untyped which adds a certain specificity to the problem and requires the employment of techniques conventionally used in implicit/gradual typing settings. The presence of polymorphic and recursive types poses a certain challenge when implementing the inferencer in miniKanren and requires a number of tricks, optimizations, and extensions to be used; we report on those as well.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Programming Languages

自引率

0.00%

发文量