What people are saying - Write a review
We haven't found any reviews in the usual places.
On the Operational Semantics of Distributed Concurrent Systems
A Constructive Specification Theory
Using Lazy Evaluation to Find Fixpoints in Infinite Domains
9 other sections not shown
Other editions - View all
abstract interpretation active data structures agent algorithm application argument atoms axiom behavioural C-classes cache calculus called causal cell cFSAa cFSAv circuits clause compiler constructive context copy Craig interpolation data dependency analysis data parallel data structure defined Definition denote distributed concurrent systems domain elements equations equivalent example execution FFDs finite fixpoint formal formula FSAa functional programming implementation implies initial instantiated interleaving label lambda lambda calculus Lemma Lisp and Prolog logic programming machine mathematical memory morphism node notion operational semantics packet partial ordering perform predicate problem Proc processor programming languages Prolog programs properties query recursive reduction relation rewriting rules rpmap sequence sequential processes set of grapes sigma terms SIMD Spec specification language specification theory stack Stream STRICT subgoal subsystem supercombinator syntax Theorem transactions unification unified variables