首页> 外文会议>Algebraic informatics >The Graph Programming Language GP
【24h】

The Graph Programming Language GP

机译:图编程语言GP

获取原文
获取原文并翻译 | 示例

摘要

GP (for Graph Programs) is a rule-based, nondeterminis-tic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration. This paper gives an overview on the GP project. We introduce the language by discussing a sequence of small programming case studies, formally explain conditional rule schemata which are the building blocks of programs, and present a semantics for GP in the style of structural operational semantics. A special feature of the semantics is how it uses the notion of finitely failing programs to define powerful branching and iteration commands. We also describe GP's prototype implementation.
机译:GP(用于Graph程序)是一种基于规则的非确定性编程语言,用于以较高的抽象水平解决图形问题,从而使程序员无需处理低级数据结构。 GP的核心由四个构造组成:一组条件图变换规则的单步应用,顺序组成,分支和迭代。本文概述了GP项目。我们通过讨论一系列小型编程案例研究来介绍该语言,正式解释条件规则图式,这些条件式图式是程序的构建块,并以结构化操作语义的形式提供GP的语义。语义的一个特殊功能是它如何使用有限失败程序的概念来定义强大的分支和迭代命令。我们还将描述GP的原型实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号