Ait{Kuci, H.: The WAM: A (Real) Tutorial, Technical Report, Digital Equipment Corporation, Paris Research Labs, 1990 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Reversible SE(M)CD Machine - Kluge (Correct)
....does not support stepwise execution, presumably because the emphasis of this work was on the energy conservation aspect rather than on its merits in the computational domain. On a rst glance some similarities seem to also exist between the semcd machine and Warren s abstract prolog machine [War83,Ait90]. This machine creates on its runtime stack so called choice points which contain the information necessary to try, in the process of resolving Horn clause systems, alternative clauses with the same head predicate in case of uni cation failures. The choice points actually held in the stack specify ....
Ait{Kuci, H.: The WAM: A (Real) Tutorial, Technical Report, Digital Equipment Corporation, Paris Research Labs, 1990
Implementation of the imperative/rule based language PROGRES - Albert Zündorf (1992) (1 citation) (Correct)
....control flow backtracking demands that one is able to go back to a previous instruction which may be encapsulated in (maybe nested) control structures or resides (directly or indirectly) in a previously called subroutine which already has terminated. The WAM (Warren Abstract Machine [Warren 83, A t Kaci 90] the most famous abstract machine for backtracking languages, addresses this problem by using a technique named environment protection. Disregarding the technical details of this strategy, the current call frame on the machine s internal procedure call stack is not released on procedure ....
Aït-Kaci H.: The WAM: A (Real) Tutorial; Technical Report, 90/5, Digital Equipment Corporation (1990)
An Overview of Temporal and Modal Logic Programming - Orgun, Ma (1994) (30 citations) (Correct)
....it can produce languages such as Gabbay s Temporal Prolog in which P and F are allowed in the head of a clause. In [14, 15] it is reported that a prototype implementation of TIM was written in LISP, and a compiled version in C, following the same principles as WAM (Warren s Abstract Machine [102, 5]) The underlying abstract machine of TIM implementations is called TARSKI (Toulouse Abstract Reasoning System for Knowledge Inference) These implementations of TIM led to a distributed implementation on a network of workstations linked by Internet sockets. In the distributed implementation, ....
Hassan Ait-Kaci. The WAM: A (Real) Tutorial. Paris Research Laboratory, Digital Equipment Corporation, Paris, France, 1990.
Operational Semantics of Constraint Logic Programs with.. - Podelski, Smolka (1995) (20 citations) Self-citation (Podelski) (Correct)
.... contrast, imperative languages do have elegant formal semantics (both operational and denotational style) The work in [2] gives the operational semantics of freeze, but 1 For example: freeze, suspension, residuation (negated constraints also introduce an implicit form of coroutining) cf. [4, 9, 10, 3, 1] on a very low level; for example, it formalizes the stepwise search through the list of frozen goals. Such a low level approach seems suitable for specifying and comparing language implementations, but not so much for designing and specifying the languages themselves. On a very high level, ....
H. Ait-Kaci, B. Dumant, R. Meyer, A. Podelski and P. Van Roy. Wild LIFE: A User Manual. Digital Equipment Corporation, Paris Research Laboratory. Rueil-Malmaison, France, April 1993.
A Computational Model of Complex Concept Composition - Andersen (1996) (1 citation) (Correct)
No context found.
Ait-Kaci, H. The Wild LIFE Handbook (prepublication edition). 1994, Digital Equipment Corporation.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC