mauney@ncsu.UUCP (Jon Mauney) (03/05/86)
%A Keith Clark %A Steve Gregory %T PARLOG: parallel programming in logic %J TOPLAS %V 8 %N 1 %P 1-49 %D JAN 1986 %K And-parallelism, logic programming, nondeterminism, or-parallelism, parallel programming %A George B. Leeman, Jr. %T A formal approach to undo operations in programming languages %J TOPLAS %V 8 %N 1 %P 49-87 %D JAN 1986 %K checkpoint, language constructs, preprocessors, recovery, reverse execution, undo %A Robert M. Keller %A M. Ronan Sleep %T Applicative caching %J TOPLAS %V 8 %N 1 %P 88-108 %D JAN 1986 %K applicative programming, caching, distributed processing, functional programming, higher order functions, memo functions, parallel evaluation, pragmas %A Keshav Pingali %A Arvind %T Efficient demand-driven evaluation. part 2 %J TOPLAS %V 8 %N 1 %P 109-139 %D JAN 1986 %K data-driven evaluation, dataflow, demand-driven evaluation, demand propagation, function languages, lazy evaluation, program transformations, streams %A Keshav Pingali %A Arvind %T Clarification of "Feeding inputs on demand" in Efficient demand-driven evaluation part 1 %J TOPLAS %V 8 %N 1 %P 140-141 %D JAN 1986 %A J. Misra %T Axioms for memory access in asynchronous hardware systems %J TOPLAS %V 8 %N 1 %P 142-153 %D JAN 1986 %K design, verification, concurrent access %A Mohamed G. Gouda %A Chung-Kuo Chang %T Proving liveness for networks of communicating finite state machines %J TOPLAS %V 8 %N 1 %P 154-182 %D JAN 1986 %K alternating bit protocol, closed covers, communication protocols, CSMA/CD protocol, fairness, finite state machines, liveness, start-stop protocol -- Jon Mauney, mcnc!ncsu!mauney North Carolina State University