Strictly orthogonal left linear rewrite systems and primitive recursion

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.

Download Full-text

A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems

Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs ◽

10.1145/3437992.3439918 ◽

2021 ◽

Author(s):

Alexander Lochmann ◽

Aart Middeldorp ◽

Fabian Mitterwallner ◽

Bertram Felgenhauer

Keyword(s):

Decision Procedure ◽

Order Theory ◽

Rewrite Systems ◽

First Order ◽

First Order Theory

Download Full-text

Predictive type universes and primitive recursion

[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1991.151642 ◽

2002 ◽

Cited By ~ 1

Author(s):

N.P. Mendler

Keyword(s):

Primitive Recursion

Download Full-text

TERMINATION OF ABSTRACT REDUCTION SYSTEMS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054109006450 ◽

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.

Download Full-text

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

10.26456/mfcsics-21-4 ◽

2021 ◽

Author(s):

Ирина Александровна Ломазова

Keyword(s):

Rewrite Systems

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

Download Full-text