منابع مشابه
Continuations of logic programs
0. Background In the realm of functional programming a wealth of techniques have been explored to transform a program into another equivalent program with the transformed program exhibiting certain computational advantages over the original. Often the transformation involves a " generalization " of the original task, where this generalization requires the addition of further parameters, called ...
متن کاملLogic Programming and Logic Grammars with Binarization and First-order Continuations
Continuation passing binarization and specialization of the WAM to binary logic programs have been proven practical implementation techniques in the BinProlog system. In this paper we investigate the additional beneets of having rst order continuations at source level. We devise a convenient way to manipulate them by introducing multiple-headed clauses which give direct access to continuations ...
متن کاملYield Continuations
Just as a traditional continuation represents the rest of a computation from a given point in the computation, a subcontinuation represents the rest of a subcomputation from a given point in the subcomputation. Subcontinuations are more expressive than traditional continuations and have been shown to be useful for controlling tree-structured concurrency, yet they have previously been implemente...
متن کاملContinuations and Functional Equations
The first part of this writeup gives Riemann’s argument that the completion of zeta, Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Instead, it is defined by a wellbehaved integ...
متن کاملCompiling ATL with Continuations
This paper presents a proposal to use continuations as an implementation mechanism for ATL. We introduce the notion of continuation, showing its applicability to model-to-model transformations, and develop a simple mechanism to enable continuations in model transformations. Then, the declarative part of ATL is mapped to this mechanism.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1987
ISSN: 0743-1066
DOI: 10.1016/0743-1066(87)90016-1