Polymorphic rewriting conserves algebraic strong normalization and confluence | Zendy

Val Breazu-Tannen | Zendy; Jean Gallier | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Polymorphic rewriting conserves algebraic strong normalization and confluence

Author(s) -

Val Breazu-Tannen,

Jean Gallier

Publication year - 1989

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-51371-X

DOI - 10.1007/bfb0035757

Subject(s) - rewriting , confluence , typed lambda calculus , lambda calculus , algebraic number , mathematics , simply typed lambda calculus , decidability , normalization (sociology) , noetherian , lambda , type (biology) , system f , algebra over a field , discrete mathematics , pure mathematics , computer science , physics , programming language , sociology , mathematical analysis , ecology , anthropology , optics , biology

We study combinations of many-sorted algebraic term rewriting systems and polymorphic lambda term rewriting. Algebraic and lambda terms are mixed by adding the symbols of the algebraic signature to the polymorphic lambda calculus, as higher-order constants.

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