Comparing curried and uncurried rewriting
From MaRDI portal
Publication:1918496
DOI10.1006/jsco.1996.0002zbMath0847.68055OpenAlexW1988319950MaRDI QIDQ1918496
Ronan Sleep, Jan Willem Klop, Richard Kennaway, Fer-Jan de Vries
Publication date: 22 August 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1407
Related Items
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs, Generalized and Formalized Uncurrying, Normalization results for typeable rewrite systems, Uncurrying for termination and complexity, Layer Systems for Proving Confluence, Currying of order-sorted term rewriting systems, A Lambda-Free Higher-Order Recursive Path Order, Enhancing dependency pair method using strong computability in simply-typed term rewriting, Intersection type assignment systems with higher-order algebraic rewriting, Simplifying Algebraic Functional Systems, Remarks on Thatte's transformation of term rewriting systems, Decidable call-by-need computations in term rewriting, Unnamed Item, Argument Filterings and Usable Rules for Simply Typed Dependency Pairs
