article

Nondeterministic algebraic specifications and nonconfluent term rewriting

Author:

Heinrich HussmannAuthors Info & Claims

Journal of Logic Programming, Volume 12, Issue 3

Pages 237 - 255

https://doi.org/10.1016/0743-1066(92)90026-Y

Published: 01 February 1992 Publication History

Abstract

No abstract available.

Cited By

View all

Bunkenburg NWu NVazou NMorris J(2024)Making a Curry Interpreter using Effects and HandlersProceedings of the 17th ACM SIGPLAN International Haskell Symposium10.1145/3677999.3678279(68-82)Online publication date: 29-Aug-2024
https://dl.acm.org/doi/10.1145/3677999.3678279
Prott KTeegen FChristiansen J(2023)Embedding Functional Logic Programming in Haskell via a Compiler PluginPractical Aspects of Declarative Languages10.1007/978-3-031-24841-2_3(37-55)Online publication date: 16-Jan-2023
https://dl.acm.org/doi/10.1007/978-3-031-24841-2_3
Hanus MPrott KTeegen F(2022)A Monadic Implementation of Functional Logic ProgramsProceedings of the 24th International Symposium on Principles and Practice of Declarative Programming10.1145/3551357.3551370(1-15)Online publication date: 20-Sep-2022
https://dl.acm.org/doi/10.1145/3551357.3551370
Show More Cited By

Index Terms

Nondeterministic algebraic specifications and nonconfluent term rewriting
1. Theory of computation

Recommendations

Confluent term rewriting systems
RTA'05: Proceedings of the 16th international conference on Term Rewriting and Applications

The confluence property is one of the most important properties of term rewriting systems, and various sufficient criteria for proving this property have been widely investigated. A necessary and sufficient criterion for confluence of terminating term ...
Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
Proceedings of the International Workshop on Algebraic and Logic Programming
Conditions for confluence of innermost terminating term rewriting systems

This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 01 February 1992

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 01 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bunkenburg NWu NVazou NMorris J(2024)Making a Curry Interpreter using Effects and HandlersProceedings of the 17th ACM SIGPLAN International Haskell Symposium10.1145/3677999.3678279(68-82)Online publication date: 29-Aug-2024
https://dl.acm.org/doi/10.1145/3677999.3678279
Prott KTeegen FChristiansen J(2023)Embedding Functional Logic Programming in Haskell via a Compiler PluginPractical Aspects of Declarative Languages10.1007/978-3-031-24841-2_3(37-55)Online publication date: 16-Jan-2023
https://dl.acm.org/doi/10.1007/978-3-031-24841-2_3
Hanus MPrott KTeegen F(2022)A Monadic Implementation of Functional Logic ProgramsProceedings of the 24th International Symposium on Principles and Practice of Declarative Programming10.1145/3551357.3551370(1-15)Online publication date: 20-Sep-2022
https://dl.acm.org/doi/10.1145/3551357.3551370
Böhm JHanus MTeegen F(2021)From Non-determinism to Goroutines: A Fair Implementation of Curry in GoProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479411(1-15)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1145/3479394.3479411
Mehner SSeidel DStraßburger LVoigtländer JChitil OKing ADanvy O(2014)Parametricity and Proving Free Theorems for Functional-Logic LanguagesProceedings of the 16th International Symposium on Principles and Practice of Declarative Programming10.1145/2643135.2643147(19-30)Online publication date: 8-Sep-2014
https://dl.acm.org/doi/10.1145/2643135.2643147
Christiansen JHanus MReck FSeidel DPeña RSchrijvers T(2013)A semantics for weakly encapsulated search in functional logic programsProceedings of the 15th Symposium on Principles and Practice of Declarative Programming10.1145/2505879.2505896(49-60)Online publication date: 16-Sep-2013
https://dl.acm.org/doi/10.1145/2505879.2505896
Braβel BHanus MPeemöller BReck F(2013)Implementing Equational Constraints in a Functional LanguageProceedings of the 15th International Symposium on Practical Aspects of Declarative Languages - Volume 775210.1007/978-3-642-45284-0_9(125-140)Online publication date: 21-Jan-2013
https://dl.acm.org/doi/10.1007/978-3-642-45284-0_9
Antoy SHanus M(2012)Contracts and specifications for functional logic programmingProceedings of the 14th international conference on Practical Aspects of Declarative Languages10.1007/978-3-642-27694-1_4(33-47)Online publication date: 23-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27694-1_4
Braßel BHanus MPeemöller BReck F(2011)KiCS2Proceedings of the 20th international conference on Functional and constraint logic programming10.5555/2032603.2032605(1-18)Online publication date: 19-Jul-2011
https://dl.acm.org/doi/10.5555/2032603.2032605
Braßel BFischer SHanus MReck F(2010)Transforming functional logic programs into monadic functional programsProceedings of the 19th international conference on Functional and constraint logic programming10.5555/2008270.2008274(30-47)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/2008270.2008274
Show More Cited By

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

Confluent term rewriting systems

Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting

Conditions for confluence of innermost terminating term rewriting 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