• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), Sep 5-7, 2001, Florence, Italy >Ideal models for pointwise relational and state-free imperative programming
【24h】

Ideal models for pointwise relational and state-free imperative programming

机译：点状关系和无状态命令式编程的理想模型

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

摘要

Point-free relation calculus and its categorical generalizations have been fruitful in development of calculi of functional programming, especially for general principles, e.g., polytypic patterns of recursion on inductive data. But in specific applications, pointwise formulations can be more convenient and comprehensible than point-free combinators. A typed lambda calculus including non-injective pattern-matching was given by de Moor and Gibbons, but their relational semantics has shortcomings. We give an alternative based on a categorical axiomatization of ideal relations. We give a second semantics based on predicate transformers, and show how the pattern construct offers a new integration of imperative and functional programming. Simulation results justify the semantics.
机译：无点关系演算及其分类概括在函数式程序计算的发展中取得了丰硕的成果，特别是对于一般性原则，例如归纳数据的递归多型模式。但是在特定应用中，逐点配方比无点组合器更方便和易于理解。 de Moor和Gibbons给出了包括非内射模式匹配的类型化Lambda演算，但它们的关系语义存在不足。我们根据理想关系的绝对公理化给出了另一种选择。我们基于谓词转换器给出第二种语义，并说明模式构造如何提供命令式和函数式编程的新集成。仿真结果证明了语义的合理性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号