About: Call-with-current-continuation is a research topic. Over the lifetime, 5 publications have been published within this topic receiving 69 citations. The topic is also known as: call/cc & call with current continuation.
TL;DR: Research interests • Combinatorics and Exact Circuit Synthesis Algorithms • Design and Implementation of Declarative and Object Oriented Programming Languages • Interoperation between various programming language paradigms • Java and Prolog based Agent Infrastructures.
Abstract: Research interests • Combinatorics and Exact Circuit Synthesis Algorithms • Design and Implementation of Declarative and Object Oriented Programming Languages • Interoperation between various programming language paradigms • Java and Prolog based Agent Infrastructures • Logic Programming and Logic Grammars • Natural Language Processing, Conversational Agents • Graph and Hypergraph Representations for Logic and Knowledge Processing • Compilers, Run-time Systems and Automatic Memory Management • Visualisation of Semantic Networks, Shared 3D-Virtual Worlds
TL;DR: In this article, a brief overview of continuations is given, followed by several patterns leading up to using continuations to implement coroutines, explicit backtracking, and multitasking.
Abstract: This paper outlines the recurring use of continuations. A brief overview of continuations is given. This is followed by several patterns that outline the use of continuations leading up to using continuations to implement coroutines, explicit backtracking, and multitasking. Scheme is used for the examples as it supports first class continuations.
TL;DR: The implemented model is an extension of the backtracking scheme developed by Hermenegildo and Nasr (1986) and relies on a novel memory organization scheme and on the use of various optimizations to reduce communication and overhead and has been implemented in the ACE Parallel Prolog system.
Abstract: In this paper, we present an implementation model which efficiently supports backtracking in an independent and-parallel nondeterministic system. The problem is tackled in the context of logic programming, although the solution proposed is sufficiently general to be easily extended to different nondeterministic systems, such as constraint programming systems. The complexity of the problem is demonstrated by the fact that most existing and-parallel systems either do not support backtracking over and-parallel calls or simply avoid analyzing the performance of their systems in the presence of nondeterministic benchmarks. The implementation model we present is an extension of the backtracking scheme developed by Hermenegildo and Nasr (1986) and relies on a novel memory organization scheme and on the use of various optimizations to reduce communication and overhead. The solution developed has been implemented in the ACE Parallel Prolog system. The performance of the system is analyzed on a variety of benchmarks. The results obtained are remarkable: speedups achieved during forward execution are not lost in heavy backtracking activities and, frequently, super-linear speedups are obtained thanks to a semi-intelligent backtracking scheme.
TL;DR: A complete deductive system for tests is given and it is shown that it is good to deal with “continuations” and in the proposed system it is possible to work with Call by Value and Call by Name translations in a uniform way.
Abstract: Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuation is still open. Starting from the notion of “test” proposed by Girard, we develop a notion of test for intuitionistic logic. We give a complete deductive system for tests and we show that it is good to deal with “continuations”. In particular, in the proposed system it is possible to work with Call by Value and Call by Name translations in a uniform way.
TL;DR: It is shown that breadth-first traversal exploits the difference between the static delimited-control operator shift (ailias S) and the dynamic delimited -control operator control (alias F) which has been repeatedly mentioned in the literature but only illustrated with one-line toy examples.