传名调用演算的二值传递CPS变换-CiteSeerX.PDFVIP

  • 1
  • 0
  • 约3.48万字
  • 约 9页
  • 2017-10-02 发布于天津
  • 举报

传名调用演算的二值传递CPS变换-CiteSeerX.PDF

传名调用演算的二值传递CPS变换-CiteSeerX

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.10, October 2008, pp.2508−2516 DOI: 10.3724/SP.J.1001.2008.02508 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 传名调用演算的二值传递 CPS 变换 1,2+ 1 喻 钢 , 柳欣欣 1( 中国科学院 软件研究所 计算机科学国家重点实验室,北京 100190) 2( 中国科学院 研究生院,北京 100049) Two Values Passing CPS Transformation for Call-by-Name Calculus with Constants YU Gang 1,2+, LIU Xin-Xin1 1(State Key Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100190, China) 2(Graduate University, The Chinese Academy of Sciences, Beijing 100049, China) + Corresponding author: E-mail: yug@ Yu G, Liu XX. Two values passing CPS transformation for call-by-name calculus with constants. Journal of Software, 2008,19(10):2508−2516. /1000-9825/19/2508.htm Abstract : In this paper, a new CPS (continuation-passing-style) transformation for Plotkin’s call-by-name λ calculus with constants is proposed. It is based on evaluation contexts transformation and the features that two values, instead of one, are passed to the continuation every time. With encodings, a CPS language is introduced. Then, Plotkin’s simulation theorem is proved by establishing 1-to-1 correspondence between the source language and CPS language. Compared with Plotkin’s work, a reduction closed CPS language is defined in which all continuations are explicitly expressed as functional encodings and it is simpler to prove both the soundness and completeness directions of simulation theorem. Key words: progr

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档