Granular Lucid, GLU: coarse-grain dataflow language for programming conventional parallel computers; based on Lucid (circa 1994) an implicitly parallel, multidimensional dataflow language. A GLU program is a Lucid program with imperatively defined dat...

Prolog Instruction Set, Technical Note, SRI International Artificial Intelligence Center, D.S. Warren, S. Dietrich, F. Pereira. The SB Prolog System, SUNY at Stony Brook. Several references for this Prolog.

Describes basic elements (data, actions, tunings, voids, mixtures, ...) and principles of programming (stratification, implicit knowledge, limited freedom, ...), directed to amalgamating different programming paradigms (imperative, object-oriented, fu...

A constraint describes a relation to maintain; it states what the relationship is versus how to maintain it. In many uses (interactive graphics, planning, document formatting, decision support), one must express preferences (soft constraints), and str...

The Constraint Imperative Programming CIP family of languages integrates constraints and imperative, object oriented programming. Besides merging useful features of both paradigms, such integration has synergistic effects.

Thesis studies FORUM as specification language. FORUM is a higher order logic based on the logical connectives of Linear Logic. Initial example demonstrates that FORUM is well suited to specify concurrent computations by specifying the higher order ss...

Much work on validation and verification of knowledge based systems (KBSs) has been done in implementation languages, mostly rule based. Recent papers suggest it is useful to do validation and verification in a more abstract and formal specification o...

Describes design, implementation of high level visualization programming system, created from a need to support rapid visual prototyping in an environment that can be extended by abstractions in the application problem domain.

(Postscript) A paper by Matthias Blume (1997) which presents an outline of a module system for Scheme to solve several problems encountered with contemporary implementations.

Based on classical first-order logic; improves on usual concurrent logic languages (eg, Parlog) by explicitly specifying aspects of behavior of concurrent programs, namely: safety properties; gives advantages in writing concurrent programs and manipul...