• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Database programming languages >Constrained matchin is type safe
【24h】

Constrained matchin is type safe

机译：受约束的Matchin是类型安全的

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

摘要

Temporally ocnstrained matching in a persistent and declarative object-oriented system is introduced as a sesmantic alternative to the existing approaches to the covariance /contravariance problem.While the existing object-oriented type systems are based on subtyping,F-bounded polymorphism and matching,this language system is based entirely on inheritance,which is identified with matching.The type of matching used in htis paper relies on hte tempral constraint system.We prove that this constrained matching guranatees type safe substitutabilty even in situations whee mathcing alone would not.This is possible only because the underlyng formal system is semanticaly much richer than teh paradigms of type systems.Its temporal ocnstraint system cna capture subtleties tha tgo far beyound the level of expressiveness of object-oriented type systems.the temporal nature of the labnguage and its distrincitve orthogonal model of persistence make this language system successful in handling a variety of non-trivial applications.
机译：介绍了持久性和声明性面向对象系统中的临时约束匹配，以作为对协方差/逆方差问题的现有方法的一种语义替代。尽管现有的面向对象类型系统是基于子类型化，F界多态性和匹配性的，语言系统完全基于继承，并通过匹配进行识别。本文所使用的匹配类型依赖于时间约束系统。我们证明了这种约束匹配的古兰经类型即使在单独进行数学计算的情况下也不能替代安全替换。可能是因为底层形式系统在语义上比类型系统范式要丰富得多。它的时间约束系统可以捕捉到面向对象类型系统的表现力水平之外的细微差别。语言的时间性质及其正交持久性模型使该语言系统成功处理了各种非平凡的应用程序。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利