Defining data structures via Böhm-out-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Defining data structures via Böhm-out

Published:1995-01 Issue:1 Volume:5 Page:51-64
ISSN:0956-7968
Container-title:Journal of Functional Programming
language:en
Short-container-title:J. Funct. Prog.

Author:

Tronci Enrico

Abstract

AbstractWe show that any recursively enumerable subset of a data structure can be regarded as the solution set to a Böhm-out problem.

Publisher

Cambridge University Press (CUP)

Subject

Software

Reference7 articles.

1. Tronci E. (1991a) Equational programming in λ-calculus. Proc. LICS 91, Amsterdam July 15–18,IEEE Computer Society, pp. 191–202.

2. Tronci E. (1991b) Equational programming in λ-calculus via SL-systems. PhD thesis, Department of Mathematics, Carnegie Mellon University.

3. Leivant D. (1981) Reasoning about functional programs and complexity classes associated with type disciplines. 24th Ann. Symp. on Foundation of Computer Science, pp. 460–469.

4. On sets of solutions to combinator equations

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP