An iterative lisp solution to the samefringe problem

Greussay, Patrick

doi:10.1145/1045270.1045273

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the first occurrence of the same-fringe problem in the litterature seems indeed to be an illustration of a coroutine mechanism [47], researchers did not agree on whether coroutines were really required to solve this problem. In fact, several "iterative" solutions were then proposed for instance by Greussay [26], Anderson [1] and McCarthy [39]. In fact, a variety of inter-derivable solutions of this problem exist that do not solely rely on coroutines [6].…”

Section: Coroutinesmentioning

confidence: 99%

A verified abstract machine for functional coroutines

Crolard¹

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Functional coroutines are a restricted form of control mechanism, where each coroutine is represented with both a continuation and an environment. This restriction was originally obtained by considering a constructive version of Parigot's classical natural deduction which is sound and complete for the Constant Domain logic. In this article, we present a refinement of de Groote's abstract machine for functional coroutines and we prove its correctness. Therefore, this abstract machine also provides a direct computational interpretation of the Constant Domain logic.

show abstract

Section: Coroutinesmentioning

confidence: 99%

A verified abstract machine for functional coroutines

Crolard¹

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Although there is some disagreement over what kinds of solutions are admissable [1,19], it is clear that the most popular approach is to make a left to right scan of the leaves of the trees terminating with failure on the first pair of leaves which disagree [1, 8,11,19].…”

Section: F~manaznnamentioning

confidence: 99%

MULTI - a LISP based multiprocessing system

McKay¹,

Shapiro²

1980

Proceedings of the 1980 ACM Conference on LISP and Functional Programming - LFP '80

View full text Add to dashboard Cite

A package of LISP functions, collectively called MULTI, which extends LISP 1.5 to multiprogremming is presented.MULTI defines the notion of a process within a LISP implementation using function invocation as the only control primitive.A process is an executable entity consisting of a process template and a set of register values.The process template defines the operations the process carries out. Process environments are saved in what can be viewed as function call instances, i.e. LISP forms which have the name of a process template in functional position and the register values following it. The flexibility of this simple conceptualization of processes is demonstrated by several examples which use MULTI to implement recursion, backtracking, generators, agendas and AND/OR graph searching. The implementation of MULTI does not assume that the host LISP system provides any data or control environment saving mechanisms such as FUNARG or INTERLISP's spaghetti stack. Thus, MULTI is portable to other LISP systems.is OR, could be proved by trying to show each of the P.'s in "parallel" and terminating the proofs of al~ the other disJuncts as soon as any one is proved.This "chronological" approach to disjunction is similar to the OR of Friedman and Wise[9] and the EITHER of Baker and Hewitt[2] which returns true as soon as any disJunct evaluates to true. This paper presents a general overview of MULTI and gives several examples.The examples are intended to show the flexibility of the system and to demonstrate the utility of the notion of a process in programming.We are not proposing MULTI as a progr~mmlng language but rather explaining in detail a system that we have been using for several years.Our current implementation of MULTI has been influenced by practicality, i.e. how to interface with ALISP [16] and how to write, debug and maintain programs which use MULTI.Debugging facilities available to a MULTI user in ALISP are detailed in a separate report [21]. General DescriDtion of MULTI

show abstract

An iterative lisp solution to the samefringe problem

Abstract: The "samefringe" problem of testing trees for equality of tips (even if the trees have a different internal structure) seems to be the main example used to illustrate the usefulness of coroutines in AI languages.

Cited by 2 publications

References 3 publications

A verified abstract machine for functional coroutines

A verified abstract machine for functional coroutines

MULTI - a LISP based multiprocessing system

Contact Info

Product

Resources

About