• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>8th International Workshop on Computer Aided Systems Theory, 8th, Feb 19-23, 2001, Las Palmas de Gran Canaria, Spain >Persistent Haskell
【24h】

Persistent Haskell

机译：持久性Haskell

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Persistent programming offers the prospect of seamless integration of programs with long-lived data, offering the prospect of constructing systems that allow more rapid program development, and also simplifying the process of writing applications whose purpose is to handle long-lived data. While there have been some previous attempts to produce persistent functional languages, the majority of these have been interpreted, and performance has generally been seriously compromised. It has therefore become something of a shibboleth that persistence cannot be implemented efficiently in a purely functional language. This paper offers the first systematic study of this claim. This paper describes the first-ever implementation of orthogonal persistence for a compiled purely functional language, based on an existing St Andrews persistent object store. Preliminary performance results show that it is possible to implement orthogonal persistence efficiently and there is hope that the result is more efficient than more straightforward approaches such as binary I/O.
机译：持久编程为程序与长期数据的无缝集成提供了前景，为构建允许更快速的程序开发的系统提供了前景，也简化了编写旨在处理长期数据的应用程序的过程。尽管以前曾尝试过产生持久性功能语言，但其中大多数已被解释，并且性能通常受到严重损害。因此，在纯功能性语言中不能有效地实现持久性已成为一件无聊的事。本文提供了对此要求的首次系统研究。本文基于现有的St Andrews持久性对象存储，描述了针对已编译的纯功能语言的正交持久性的首个实现。初步的性能结果表明，可以有效地实现正交持久性，并且希望该结果比诸如二进制I / O之类的更直接的方法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号