scientific article; zbMATH DE number 1301857

From MaRDI portal

Revision as of 16:19, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4247081

Jump to:navigation, search

zbMath0927.03054MaRDI QIDQ4247081

Maxim Lifantsev, Leo Bachmair

Publication date: 16 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

higher-order rewrite systems higher-order terms without \(\lambda\)-abstraction precedence-based termination ordering

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations ⋮ A Lambda-Free Higher-Order Recursive Path Order

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4247081&oldid=18138851"