New completeness results for lazy conditional narrowing

Marin, Mircea; Middeldorp, Aart

doi:10.1145/1013963.1013979

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Local bindings let X=e in ... resemble oriented conditions e → X of the deterministic conditional rewrite systems of [19]. But they consider 3-CTRS systems and, most importantly, a different semantics for equality, according to which call-time choice is not respected.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

A simple rewrite notion for call-time choice semantics

López-Fraguas

Rodríguez-Hortalá

Sánchez-Hernández

2007

Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is not a trivial issue that has been addressed from a semantic point of view in the Constructor-based Rewriting Logic (CRWL) framework. We investigate here how to express call-time choice and non-strict semantics from a point of view closer to classical rewriting. The proposed notion of rewriting uses an explicit representation for sharing with let-constructions and is proved to be equivalent to the CRWL approach. Moreover, we relate this let-rewriting relation (and hence CRWL) with ordinary rewriting, providing in particular soundness and completeness of let-rewriting with respect to rewriting for a class of programs which are confluent in a certain semantic sense.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

A simple rewrite notion for call-time choice semantics

López-Fraguas

Rodríguez-Hortalá

Sánchez-Hernández

2007

Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

“…Typical examples of narrowing calculi are LNC [15], LNC d [14], LCNC [8], LCNC [16], and LCNC d [13]. Higher-order versions of narrowing calculi are also known, e,g., LN [17], HOLN [11], and LN ff [12].…”

Section: Introductionmentioning

confidence: 99%

A rewrite-based computational model for functional logic programming

Marin¹,

Kutsia

Dundua³

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

Functional logic programming is an extension of the functional programming style with two important capabilities: to define nondeterministic operations with overlapping rules, and to use logic variables in both defining rules and expressions to evaluate. A suitable model for functional logic programs are conditional constructor-based term rewrite systems (CB-CTRSs), which can be transformed into an equivalent program in a simpler class of rewrite systems (the core language) where computations can be performed more efficiently.Recently, Antoy and Hanus proposed a translation of CB-CTRSs into an equivalent class of programs where computation can be performed efficiently by mere rewriting. Their computational model has the limitation of computing only ground answer substitutions for equations with strict semantics interpreted as joinability to a value. We propose two adjustments of their computational models, which are capable to compute non-ground answers.

show abstract

New completeness results for lazy conditional narrowing

Cited by 2 publications

References 19 publications

A simple rewrite notion for call-time choice semantics

A simple rewrite notion for call-time choice semantics

A rewrite-based computational model for functional logic programming

Contact Info

Product

Resources

About