找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Central European Functional Programming School; First Central Europe Zoltán Horváth Conference proceedings 2006 Springer-Verlag Berlin Heid

[复制链接]
楼主: 门牙
发表于 2025-3-25 07:22:26 | 显示全部楼层
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach,se of the Hume language design is to explore the expressibility/costability spectrum in resource-constrained systems, such as real-time embedded or control systems. It is unusual in being based on a combination of .-calculus and finite state machine notions, rather than the more usual propositional
发表于 2025-3-25 10:57:54 | 显示全部楼层
The Essence of Dataflow Programming,nctions can be characterized as coKleisli arrows of comonads and on the intuition that comonads in general must be a good means to structure context-dependent computation. In particular, we develop a generic comonadic interpreter of languages for context-dependent computation and instantiate it for
发表于 2025-3-25 12:26:27 | 显示全部楼层
Temporal Properties of Clean Programs Proven in Sparkle-T,is abstract object temporal properties (e.g. invariants) can be formulated and proved. This paper explains how to define and prove certain kinds of temporal properties of programs written in the pure functional language Clean. Sparkle, a theorem prover designed for Clean, is applied as a tool. Since
发表于 2025-3-25 15:49:32 | 显示全部楼层
Tutorial on Subtype Marks, a programming language of industrial strength can be fairly useful in this respect, like in the case of, for instance, the B method [1], the Java Modelling Language [5] or the functional programming languages Erlang [3,7,9,24] and Clean [11,23,25]. This paper presents the concept of subtype marks,
发表于 2025-3-25 22:27:25 | 显示全部楼层
发表于 2025-3-26 03:07:38 | 显示全部楼层
发表于 2025-3-26 06:07:22 | 显示全部楼层
https://doi.org/10.1007/978-3-642-66339-0l properties and a new form of theorems which includes hypotheses. The resulting system is called Sparkle-T. The examples presented in this paper illustrate how object abstraction and the definition and proof of temporal properties can be carried out in Sparkle-T. Furthermore, some novel features of the Sparkle-T system are demonstrated as well.
发表于 2025-3-26 08:29:15 | 显示全部楼层
Functional Array Programming in , ,can be defined within the first-order functional array language .. It does not only discuss the language design issues involved but it also tackles implementation issues that are crucial for achieving acceptable runtimes from such genericly specified array operations.
发表于 2025-3-26 14:12:17 | 显示全部楼层
发表于 2025-3-26 18:04:39 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 16:27
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表