首页> 外文会议>International conference on mathematics of program construction >Unraveling Recursion: Compiling an IR with Recursion to System F
【24h】

Unraveling Recursion: Compiling an IR with Recursion to System F

机译:分解递归:将递归的IR编译到系统F

获取原文

摘要

Lambda calculi are often used as intermediate representations for compilers. However, they require extensions to handle higher-level features of programming languages. In this paper we show how to construct an IR based on System F_μ~w which supports recursive functions and datatypes, and describe how to compile it to System F_μ~w. Our IR was developed for commercial use at the IOHK company, where it is used as part of a compilation pipeline for smart contracts running on a blockchain.
机译:Lambda calculi通常用作编译器的中间表示。但是,它们需要扩展以处理编程语言的高级功能。在本文中,我们展示了如何基于支持递归函数和数据类型的SystemF_μ〜w构造IR,并描述了如何将其编译为SystemF_μ〜w。我们的投资者关系是在IOHK公司开发的,用于商业用途,它被用作区块链上运行的智能合约的编制管道的一部分。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号