Compilation of narrowing

Mück, Andy

doi:10.1007/bfb0024173

Cited by 3 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In comparison with pure logic languages, functional logic languages have a more efficient operational behavior since functions allow deterministic evaluations if arguments are sufficiently instantiated [13]. Recently, functional logic languages became relevant for practical applications because efficient implementations have been developed [1,4,12,19,20,21,28]. Therefore there is a need for debugging tools for such kind of languages.…”

Section: Introductionmentioning

confidence: 99%

A debugging model for functional logic programs

Hanus

Josephs

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper presents a box-oriented debugging model for the functional logic language ALF. Due to the sophisticated operational semantics of ALF which is based on innermost basic narrowing with simplification, the debugger must reflect the application of the different computation rules during program execution. Hence our debugging model includes not only one box type as in Byrd's debugging model for logic programs but several different kinds of boxes corresponding to the various computation rules of the functional logic language (narrowing, simplification etc.). Moreover, additional box types are introduced in order to allow skips over (sometimes) uninteresting program parts like proofs of the condition in a conditional equation. Since ALF is a genuine amalgamation of functional and logic languages, our debugging model subsumes operational aspects of both kinds of languages. As a consequence, it can be also used for pure logic languages, pure functional languages with eager evaluation, or functional logic languages with a less sophisticated operational semantics like SLOG or eager BABEL.

show abstract

Section: Introductionmentioning

confidence: 99%

A debugging model for functional logic programs

Hanus

Josephs

1993

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Improving control of logic programs by using functional logic languages

Hanus

Programming Language Implementation and Logic Programming

View full text Add to dashboard Cite

A tiny constraint functional logic language and its continuation semantics

Mück

Streicher

Lock³

1994

Programming Languages and Systems — ESOP '94

Self Cite

View full text Add to dashboard Cite

We present an extension of k-calculus by logical features and constraints, which yields a minimal core language for constraint functional logic programming. We define a denotational semantics based on continuation passing style. The operational semantics of our language is given as a set of reduction rules. We prove soundness of the operational semantics w.r.t, the continuation semantics. Finally, we show how pure functional logic programs can be translated to this core language in a sound way.

show abstract

Compilation of narrowing

Cited by 3 publications

References 5 publications

A debugging model for functional logic programs

A debugging model for functional logic programs

Improving control of logic programs by using functional logic languages

A tiny constraint functional logic language and its continuation semantics

Contact Info

Product

Resources

About