首页> 外文期刊>ACM SIGPLAN Notices: A Monthly Publication of the Special Interest Group on Programming Languages >A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
【24h】

A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

机译:使用高阶抽象语法和一流替换进行编程的类型理论基础

获取原文
获取原文并翻译 | 示例
           

摘要

Higher-order abstract syntax (HOAS) is a simple, powerful technique for implementing object languages, since it directly supports common and tricky routines dealing with variables, such as capture-avoiding substitution and renaming. This is achieved by representing binders in the object-language via binders in the meta-language. However, enriching functional programming languages with direct support for HOAS has been a major challenge, because recursion over HOAS encodings requires one to traverse lambda-abstractions and necessitates programming with open objects.
机译:高阶抽象语法(HOAS)是一种用于实现目标语言的简单,强大的技术,因为它直接支持处理变量的常见且棘手的例程,例如避免捕获的替换和重命名。这是通过以元语言中的活页夹表示对象语言中的活页夹来实现的。但是,通过直接支持HOAS来丰富功能编程语言一直是一项重大挑战,因为对HOAS编码的递归需要一个遍历lambda抽象的内容,并且需要使用开放对象进行编程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号