首页> 外文会议>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_ω~μ which supports recursive functions and datatypes, and describe how to compile it to System F_ω~μ. 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通常被用作编制者的中间陈述。但是,它们需要扩展以处理编程语言的更高级别功能。在本文中,我们展示了如何基于系统f_ω〜μ构造IR,它支持递归函数和数据类型,并描述如何将其编译为系统f_ω〜μ。我们的IR是在IOHK公司的商业用途开发的,其中它被用作汇编管道的一部分,用于在区块链上运行的智能合同。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号