Article

The specificity rule for lazy pattern-matching in ambiguous term rewrite systems

Author:

R. KennawayAuthors Info & Claims

Proceedings of the third European symposium on programming on ESOP '90

May 1990

Pages 256 - 270

Published: 01 May 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Cockx JPiessens FDevriese D(2014)Overlapping and Order-Independent PatternsProceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 841010.1007/978-3-642-54833-8_6(87-106)Online publication date: 5-Apr-2014
https://dl.acm.org/doi/10.1007/978-3-642-54833-8_6
While LField T(2005)Optimising parallel pattern-matching by source-level program transformationProceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 3810.5555/1082161.1082188(239-248)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.5555/1082161.1082188
Neubauer MThiemann PGasbichler MSperber M(2002)Functional logic overloadingACM SIGPLAN Notices10.1145/565816.50329437:1(233-244)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/565816.503294
Show More Cited By

Index Terms

The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching
  2. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

On Term-Graph Rewrite Strategies

We tackle the problem of cyclic term-graph rewriting. We first revisit the classical algorithmic approach to term-graph rewriting by providing a definition of rewrite rules of the form lhs->rhs where the left-hand sides are term-graphs and the right-...
Read More
Termination of non-simple rewrite systems
Read More
Inductively Sequential Term-Graph Rewrite Systems
ICGT '08: Proceedings of the 4th international conference on Graph Transformations

Definitional trees have been introduced by Sergio Antoy in order to design an efficient term rewrite strategy which computes needed outermost redexes. In this paper, we consider the use of definitional trees in the context of term-graph rewriting. We ...
Read More

Comments

Information & Contributors

Information

Published In

Proceedings of the third European symposium on programming on ESOP '90

May 1990

435 pages

ISBN:0387525920

Editor:
Neil Jones
Univ. of Copenhagen, Copenhagen, Denmark

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cockx JPiessens FDevriese D(2014)Overlapping and Order-Independent PatternsProceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 841010.1007/978-3-642-54833-8_6(87-106)Online publication date: 5-Apr-2014
https://dl.acm.org/doi/10.1007/978-3-642-54833-8_6
While LField T(2005)Optimising parallel pattern-matching by source-level program transformationProceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 3810.5555/1082161.1082188(239-248)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.5555/1082161.1082188
Neubauer MThiemann PGasbichler MSperber M(2002)Functional logic overloadingACM SIGPLAN Notices10.1145/565816.50329437:1(233-244)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.1145/565816.503294
Neubauer MThiemann PGasbichler MSperber MLaunchbury JMitchell J(2002)Functional logic overloadingProceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/503272.503294(233-244)Online publication date: 16-Jan-2002
https://dl.acm.org/doi/10.1145/503272.503294
Sekar RRamakrishnan IVoronkov A(2001)Term indexingHandbook of automated reasoning10.5555/778522.778535(1853-1964)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778535
Antoy SEchahed RHanus MBoehm HLang BYellin D(1994)A needed narrowing strategyProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/174675.177899(268-279)Online publication date: 1-Feb-1994
https://dl.acm.org/doi/10.1145/174675.177899
Maranget L(1992)Compiling lazy pattern matchingACM SIGPLAN Lisp Pointers10.1145/141478.141499V:1(21-31)Online publication date: 1-Jan-1992
https://dl.acm.org/doi/10.1145/141478.141499
Maranget LWhite J(1992)Compiling lazy pattern matchingProceedings of the 1992 ACM conference on LISP and functional programming10.1145/141471.141499(21-31)Online publication date: 3-Jan-1992
https://dl.acm.org/doi/10.1145/141471.141499

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

On Term-Graph Rewrite Strategies

Termination of non-simple rewrite systems

Inductively Sequential Term-Graph Rewrite Systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations