When are two rewrite systems more than none? | Zendy

Nachum Dershowitz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

When are two rewrite systems more than none?

Author(s) -

Nachum Dershowitz

Publication year - 1997

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-63437-1

DOI - 10.1007/bfb0029947

Subject(s) - confluence , rewriting , correctness , computer science , uniqueness , modular design , term (time) , computation , theoretical computer science , programming language , algebra over a field , algorithm , mathematics , pure mathematics , mathematical analysis , physics , quantum mechanics

. It is important for programs to have modular correctnessproperties. We look at non-deterministic programs expressed as termrewritingsystems (which compute normal forms of input terms) andconsider the case where individual systems share constructors, but notdefined symbols. We present some old and new sufficient conditions underwhich termination (existence of normal forms, regardless of computationstrategy) and confluence (uniqueness) are preserved by such combinations.1 Introduction...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research