Towards a clean amalgamation of logic programs with external procedures

Bonnier, Staffan; Maluszynski, Jan

doi:10.1007/3-540-50820-1_38

Cited by 9 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One might have the impression that the deterministic evaluation of functions in the case of residuation is more efficient, but there are examples where residuation has an infinite computation space whereas narrowing has a finite one (see [39] for more details). On the other hand, residuation offers a concurrent evaluation principle with synchronization on logic variables (sometimes also called declarative concurrency [84]) and a conceptually clean method to connect external functions to declarative programs [21] (note that narrowing requires functions to be explicitly defined by rewrite rules). Therefore, it is desirable to integrate both principles in a single framework.…”

Section: Residuationmentioning

confidence: 99%

“…Therefore, residuation is an appropriate model to connect external operations in a conceptually clean way (see also [21]): their semantics can be considered as defined by a possibly infinite set of rules (e.g., see the definition of "+" in Section 2.1) whose behavior is implemented in some other programming language. Usually, external operations can not deal with unevaluated arguments possibly containing logic variables.…”

Section: External Operationsmentioning

confidence: 99%

See 1 more Smart Citation

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

Abstract. Declarative programming languages advocate a programming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the underlying formalism to express such properties, one can distinguish different classes of declarative languages, like functional, logic, or constraint programming languages. This paper surveys approaches to combine these different classes into a single programming language.

show abstract

Section: Residuationmentioning

confidence: 99%

Section: External Operationsmentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

show abstract

“…Real world programs contain various calls to primitive operations that are not explicitly defined by rewrite rules, e.g., arithmetic operations on integers or floats, I/O operations etc. Although some of these operations can be conceptually explained with infinite sets of rewrite rules [10], we need a constructive method to deal with such operations at analysis time. Since we only need to approximate the meaning of such operations, we can approximate an n-ary primitive operation f by the following rewrite rule:…”

Section: Primitive Operationsmentioning

confidence: 99%

Call pattern analysis for functional logic programs

Hanus¹

2008

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

View full text Add to dashboard Cite

This paper presents a new program analysis framework to approximate call patterns and their results in functional logic computations. We consider programs containing non-strict, nondeterministic operations in order to make the analysis applicable to modern functional logic languages like Curry or TOY. For this purpose, we present a new fixpoint characterization of functional logic computations w.r.t. a set of initial calls. We show how programs can be analyzed by approximating this fixpoint. The results of such an approximation have various applications, e.g., program optimization as well as verifying safety properties of programs.

show abstract

“…Thus, they can act as passive constraints [2] providing for better constraint solvers than in pure logic programming [22] (e.g., by transforming "generate-and-test" into "test-and-generate"). Conceptually, primitive functions can be considered as defined by an infinite set of rules which provides a declarative reading for such functions [6]. In a similar way, any other external (side-effect free!)…”

Section: A Unified Model For Declarative Programmingmentioning

confidence: 99%

Teaching functional and logic programming with a single computation model

Hanus

1997

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Functional and logic programming are often taught in different courses so that students often do not understand the relationships between these declarative programming paradigms. This is mainly due to the different underlying computation models-deterministic reduction and lazy evaluation in functional languages, and non-deterministic search in logic languages. We show in this paper that this need not be the case. Taking into account recent developments in the integration of functional and logic programming, it is possible to teach the ideas of modern functional languages like Haskell and logic programming on the basis of a single computation model. From this point of view, logic programming is considered as an extension of functional programming where ground expressions are extended to contain also free variables. We describe this computation model, the structure of a course based on it, and draw some conclusions from the experiences with such a course.

show abstract

Towards a clean amalgamation of logic programs with external procedures

Cited by 9 publications

References 7 publications

Multi-paradigm Declarative Languages

Multi-paradigm Declarative Languages

Call pattern analysis for functional logic programs

Teaching functional and logic programming with a single computation model

Contact Info

Product

Resources

About