找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Logic, Language and Computation; Festschrift in Honor Neil D. Jones,Masami Hagiya,Masahiko Sato Book 1994 Springer-Verlag Berlin Heidelberg

[复制链接]
楼主: JAR
发表于 2025-3-25 07:24:39 | 显示全部楼层
发表于 2025-3-25 10:12:17 | 显示全部楼层
On implicit arguments,ents is always preserved during reduction. Consequently, when it compares two terms by reduction, it can reduce them without inferring implicit arguments. Before describing the typechecker, we analyze various situations where the uniqueness of implicit arguments is not preserved by naïvely defined reduction.
发表于 2025-3-25 15:30:03 | 显示全部楼层
,Well-ordering of algebras and Kruskal’s theorem,ere is one and only one (up to isomorphism) algebra giving the ordinal as order type. As a corollary, we show Kruskal-type theorems for various structures are equivalent to well-orderedness of certain ordinals.
发表于 2025-3-25 17:44:45 | 显示全部楼层
发表于 2025-3-25 20:46:30 | 显示全部楼层
发表于 2025-3-26 02:08:30 | 显示全部楼层
发表于 2025-3-26 08:08:34 | 显示全部楼层
The essence of program transformation by partial evaluation and driving,erful, since it includes program optimizations not achievable by simple partial evaluation. Moreover, for the first time it puts Turchin‘s driving methodology on a solid semantic foundation which is not tied to any particular programming language or data structure.
发表于 2025-3-26 12:09:53 | 显示全部楼层
Book 1994ealization and applications to computer science; others concern synthesis, transformation and implementation of programming languages, and complexity and coding theory. Not coincidentally, all the authors are either former students or close colleagues of Satoru Takasu, professor and director at the
发表于 2025-3-26 15:52:07 | 显示全部楼层
Conservativeness of , over ,-calculus, slightly modified version of .-calculus which adopts de Bruijn‘s index notation. We then define an injective map from .-calculus to ., and show that the . and the .-reductions in .-calculus correspond to the .-reduction and let-reductions in .-calculus, respectively. Finally, we prove that, as equality theories, . is . over the .-calculus.
发表于 2025-3-26 18:52:58 | 显示全部楼层
On locomorphism in analytical equivalence theory,alence, is introduced. A necessary and sufficient condition for whether or not there exists a morphism between two acts, one parallel and the other sequential, is presented, and some examples are studied.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-4 02:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表