scholarly journals The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors

2018 ◽  
Vol 96 ◽  
pp. 74-106 ◽  
Author(s):  
Salvador Lucas ◽  
José Meseguer ◽  
Raúl Gutiérrez
Keyword(s):  
Rewrite Systems ◽  
Dependency Pair

scholarly journals Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems

2009 ◽  
Vol E92-D (10) ◽  
pp. 2007-2015 ◽  
Author(s):  
Keiichirou KUSAKARI ◽  
Yasuo ISOGAI ◽  
Masahiko SAKAI ◽  
Frédéric BLANQUI
Keyword(s):  
Higher Order ◽  
Rewrite Systems ◽  
Pair Method ◽  
Dependency Pair

scholarly journals CoCo 2019: report on the eighth confluence competition

2021 ◽  
Author(s):  
Aart Middeldorp ◽  
Julian Nagele ◽  
Kiraku Shintani
Keyword(s):  
Software Tools ◽  
Rewrite Systems

AbstractWe report on the 2019 edition of the Confluence Competition, a competition of software tools that aim to prove or disprove confluence and related (undecidable) properties of rewrite systems automatically.

TERMINATION OF ABSTRACT REDUCTION SYSTEMS

2009 ◽  
Vol 20 (01) ◽  
pp. 57-82
Author(s):  
JEREMY E. DAWSON ◽  
RAJEEV GORÉ
Keyword(s):  
General Theorem ◽  
Combinatory Logic ◽  
Rewrite Systems ◽  
Path Ordering

We present a general theorem capturing conditions required for the termination of abstract reduction systems. We show that our theorem generalises another similar general theorem about termination of such systems. We apply our theorem to give interesting proofs of termination for typed combinatory logic. Thus, our method can handle most path-orderings in the literature as well as the reducibility method typically used for typed combinators. Finally we show how our theorem can be used to prove termination for incrementally defined rewrite systems, including an incremental general path ordering. All proofs have been formally machine-checked in Isabelle/HOL.

О системах переписывания процессов высокого уровня

2021 ◽  
Author(s):  
Ирина Александровна Ломазова
Keyword(s):  
Rewrite Systems

Системы переписывания процессов (Process Rewrite Systems - PRS) Ричарда Майра представляют собой систему переписывания термов специального вида и задают унифицированное представление для конечных и магазинных автоматов, сетей Петри и некоторых классов алгебр процессов. В докладе рассматривается (P,P)-подкласс систем переписывания процессов, соответствующий классическим сетям Петри, и его расширение HPRS для моделирования систем с динамической структурой. Обсуждаются вопросы выразительности и разрешимости.

Sign in / Sign up

Export Citation Format

Share Document