Uncurrying for termination and complexity
type: Item
instance of: scholarly article
title: Uncurrying for termination and complexity
zbMATH Open document ID: 1286.68262
author: Nao Hirokawa
author: Aart Middeldorp
author: Harald Zankl
published in: Journal of Automated Reasoning
publication date: 2013-07-05T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6184683
zbMATH Keywords: term rewriting
zbMATH Keywords: termination
zbMATH Keywords: uncurrying
describes a project that uses: Tyrolean
MaRDI profile type: Publication
full work available at URL: s10817-012-9248-3
OpenAlex ID: W1983193642
cites work: Q4447246
cites work: Term Rewriting and Applications
cites work: Termination of term rewriting using dependency pairs
cites work: Term Rewriting and All That
cites work: Normalization results for typeable rewrite systems
cites work: HORPO with Computability Closure: A Reconstruction
cites work: The simply typed rewriting calculus
cites work: Matrix interpretations for proving termination of term rewriting
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Frontiers of Combining Systems
cites work: Mechanizing and improving dependency pairs
cites work: Q4255514
cites work: Automating the dependency pair method
cites work: Tyrolean termination tool: techniques and features
cites work: Uncurrying for Termination
cites work: Automated Complexity Analysis Based on the Dependency Pair Method
cites work: Polymorphic higher-order recursive path orderings
cites work: Comparing curried and uncurried rewriting
cites work: Higher Order Dependency Pairs for Algebraic Functional Systems
cites work: Some characteristics of strong innermost normalization
cites work: Enhancing dependency pair method using strong computability in simply-typed term rewriting
cites work: Modular properties of conditional term rewriting systems
cites work: Q4705617
cites work: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
cites work: The Derivational Complexity Induced by the Dependency Pair Method
cites work: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
cites work: Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
cites work: Q4431349
cites work: Random Descent
cites work: Signature Extensions Preserve Termination
cites work: Generalized and Formalized Uncurrying
cites work: Rewriting Techniques and Applications
cites work: POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS
cites work: Modular Complexity Analysis via Relative Complexity
cites work: Satisfiability of Non-linear (Ir)rational Arithmetic
DOI: 10.1007/S10817-012-9248-3
description: scientific article; zbMATH DE number 6184683