Narrowing Strategies for Arbitrary Canonical Rewrite Systems

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-1995-24126
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Normalization Results for Typeable Rewrite Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Graph Rewrite Systems for Program Optimization

ACM Transactions on Programming Languages and Systems
Software
2000English

Rewriting Strategies and Strategic Rewrite Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Recognizability of Redexes for Higher-Order Rewrite Systems

IPSJ Online Transactions
2009English

On Narrowing Strategies for Partial Non-Strict Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Transformations of Conditional Rewrite Systems Revisited

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Gain Narrowing in Few-Atom Systems

Physical Review Letters
AstronomyPhysics
2007English

When Are Two Rewrite Systems More Than None?

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy