Typing streams in the Λμ-calculus

Author:

Saurin Alexis1

Affiliation:

1. INRIA Saclay and École Polytechnique, Cedex, France

Abstract

Λμ-calculus is a Böhm-complete extension of Parigot's Λμ-calculus closely related with delimited control in functional programming. In this article, we investigate the meta-theory of untyped Λμ-calculus by proving confluence of the calculus and characterizing the basic observables for the Separation theorem,canonical normal forms. Then, we define Λs, a new type system for Λμ-calculus that contains a special type construction for streams, and prove that strong normalization and type preservation hold. Thanks to the new typing discipline of Λs, new computational behaviors can be observed, which were forbidden in previous type systems for λμ-calculi. Those new typed computational behaviors witness the stream interpretation of Λμ-calculus.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference28 articles.

1. Ariola Z. M. Herbelin H. and Sabry A. 2007. A type-theoretic foundation of delimited continuations. Higher-Order Symb. Comput. 10.1007/s10990-007-9006-0 Ariola Z. M. Herbelin H. and Sabry A. 2007. A type-theoretic foundation of delimited continuations. Higher-Order Symb. Comput. 10.1007/s10990-007-9006-0

2. Baba K. Hirokawa S. and Fujita K.-E. 2001. Parallel reduction in type free lambda/mu-calculus. Electron. Notes Theoret. Comput. Sci. 42. Baba K. Hirokawa S. and Fujita K.-E. 2001. Parallel reduction in type free lambda/mu-calculus. Electron. Notes Theoret. Comput. Sci. 42.

3. Böhm C. 1968. Alcune proprietà delle forme β η-normali nel λK-calcolo. Publicazioni dell'Istituto per le Applicazioni del Calcolo 696. Böhm C. 1968. Alcune proprietà delle forme β η-normali nel λK-calcolo. Publicazioni dell'Istituto per le Applicazioni del Calcolo 696.

4. David R. and Py W. 2001. λμ-calculus and Böhm's theorem. J. Symb. Logic. David R. and Py W. 2001. λμ-calculus and Böhm's theorem. J. Symb. Logic.

5. Lecture Notes in Articifial Intelligence;de Groote P.

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Confluence Proofs of Lambda-Mu-Calculi by Z Theorem;Studia Logica;2021-01-21

2. Call-by-name extensionality and confluence;Journal of Functional Programming;2017

3. The first-order hypothetical logic of proofs;Journal of Logic and Computation;2016-01-30

4. The approximation theorem for the Λμ-calculus;Mathematical Structures in Computer Science;2015-07-28

5. Parsimonious Types and Non-uniform Computation;Automata, Languages, and Programming;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3