We describe an interactive tool for program development and transformation, a
The semantic editor does not depend on the existence of normal forms for FP programs. Instead, a history of all program transformations is retained in the system in the form of a congruence relation. The user is free to step through the congruence classes to see different but equivalent versions of his programs. A program equivalence is applied to a program schema by unifying one side of the equivalence with a sub-program, then labeling it congruent to the other side if the unification is successful. A congruence closure algorithm is applied to find any new congruence relations in expressions containing these program schemas.
rnThe program schemas are represented internally by a directed, acyclic graph (
我们描述了一种用于程序开发和转换的交互式工具,即 语义编辑器不依赖于FP程序的正常形式。取而代之的是,所有程序转换的历史记录都以全等关系的形式保留在系统中。用户可以自由浏览同等类,以查看其程序的不同但等效的版本。通过将等效项的一侧与子程序统一,然后将等效项标记为与另一方一致,则将程序等效项应用于程序模式。应用全等闭合算法在包含这些程序模式的表达式中查找任何新的全等关系。 P> rn 程序模式在内部由有向无环图(
The University oy North Carolina at Chapel Hill;
The University of North Carolina at Chapel Hill, Microelectronics Center of North Carolina;
机译:建立程序编辑的语义基础
机译:来宾编辑说明:有关智能音频处理,语义和交互的特殊问题
机译:使用本体编辑器和语义搜索模式进行本体设计和开发,以实现对网络信息的智能检索:案例研究
机译:Sem-SPARQL编辑器:用于网页语义查询的编辑器
机译:消费者,工作中的编辑,权力编辑:在线对等生产社区中用户的多样性。
机译:编辑选择:轻度认知障碍的风险与句子处理和记忆中的语义整合不足有关
机译:通过语义技术支持springer Nature编辑器