Narrow Results

Since the first idea of a collider was patented by Rolf Wideröe (1902–1996) in 1943 and the first $e^{+}{e}^{-}$ circular collider, AdA, was successfully principle-proved in LAL, Orsay, France in 1963, different kinds of colliders have been built in the past and planned for the future. In this paper, we will make a rather complete and brief review of the history of different colliders and give a perspective for the future.

This paper describes the implementation of the ProTalk compiler for PrkAda. An important component of the ProKappa system is its multi-paradigm, mixed-rule/imperative language, ProTalk. ProTalk combines elements of backtracking AI languages such as Prolog with imperative constructs such as conditionals, iteration, assignment, and subprogram invocation. Our implementation illustrates the use of generators to achieve a Prolog-like semantics, and the possibility (and difficulties) of employing such mechanisms in Ada.

This paper describes the implementation of PrkAda, a system for delivering, in Ada, Artificial Intelligence and object-oriented applications developed using the ProKappa system. (ProKappa is a modern, multi-paradigm knowledge-based–system development tool. It includes facilities for dynamic object management, rule-based processing, daemons, and graphical developer and end-user interfaces. ProKappa is a successor system to KEE.) Creating PrkAda required creating a run-time, Ada-language, object-system "core," and developing a compiler to Ada from ProTalk (ProKappa's high-level, backtracking-based language). We describe PrkAda ProTalk compiler in a companion paper [5]. This paper concentrates on the issues involved in implementing an AI application delivery core, particularly with respect to Ada, including

• Automatic storage management (garbage collection) without either the cooperation of the compiler or access to the run-time stack,

• Dynamic (weak) typing in a strongly-typed language,

• Dynamic objects (objects that can change their slots and parentage as the program is executing)

• Dynamic function binding in a language designed to preclude "self-modifying programs," and

• Implementation trade-offs in object-oriented knowledge-based systems development environments