A fast parallel merging algorithm for 2–3 trees.- Evaluation of graph representations with active nodes.- On equivalence transformations for term rewriting systems.- A portable logic simulation system for development of FLATS machine.- Partial computation with a dataflow machine.- OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog.- Incorporating Naïve Negation into Prolog.- Algebraic specification method of programming languages.- Multiversion concurrency control scheme for a distributed database system — A trial to break concurrent update of redundant copies —.- Global storage allocation in attribute evaluation.- On program transformation with tupling technique.- Evaluation of working set algorithms for data-flow machines.- Comparison of closure reduction and combinatory reduction schemes.- The BC-chain method for representing combinators in linear space.- Circuit simulation code generation by computer algebra.- List 1 Algebraic code for simple harmonic motion.- List 2 Generated fortran code for simple harmonic motion.
A fast parallel merging algorithm for 2-3 trees.- Evaluation of graph representations with active nodes.- On equivalence transformations for term rewriting systems.- A portable logic simulation system for development of FLATS machine.- Partial computation with a dataflow machine.- OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog.- Incorporating Naïve Negation into Prolog.- Algebraic specification method of programming languages.- Multiversion concurrency control scheme for a distributed database system - A trial to break concurrent update of redundant copies -.- Global storage allocation in attribute evaluation.- On program transformation with tupling technique.- Evaluation of working set algorithms for data-flow machines.- Comparison of closure reduction and combinatory reduction schemes.- The BC-chain method for representing combinators in linear space.- Circuit simulation code generation by computer algebra.- List 1 Algebraic code for simple harmonic motion.- List 2 Generated fortran code for simple harmonic motion.
Inhaltsverzeichnis
A fast parallel merging algorithm for 2-3 trees.- Evaluation of graph representations with active nodes.- On equivalence transformations for term rewriting systems.- A portable logic simulation system for development of FLATS machine.- Partial computation with a dataflow machine.- OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog.- Incorporating Naïve Negation into Prolog.- Algebraic specification method of programming languages.- Multiversion concurrency control scheme for a distributed database system - A trial to break concurrent update of redundant copies -.- Global storage allocation in attribute evaluation.- On program transformation with tupling technique.- Evaluation of working set algorithms for data-flow machines.- Comparison of closure reduction and combinatory reduction schemes.- The BC-chain method for representing combinators in linear space.- Circuit simulation code generation by computer algebra.- List 1 Algebraic code for simple harmonic motion.- List 2 Generated fortran code for simple harmonic motion.
Klappentext
A fast parallel merging algorithm for 2¿3 trees.- Evaluation of graph representations with active nodes.- On equivalence transformations for term rewriting systems.- A portable logic simulation system for development of FLATS machine.- Partial computation with a dataflow machine.- OR-Parallel Optimizing Prolog System: Pops its design and implementation in Concurrent Prolog.- Incorporating Na¿ Negation into Prolog.- Algebraic specification method of programming languages.- Multiversion concurrency control scheme for a distributed database system ¿ A trial to break concurrent update of redundant copies ¿.- Global storage allocation in attribute evaluation.- On program transformation with tupling technique.- Evaluation of working set algorithms for data-flow machines.- Comparison of closure reduction and combinatory reduction schemes.- The BC-chain method for representing combinators in linear space.- Circuit simulation code generation by computer algebra.- List 1 Algebraic code for simple harmonic motion.- List 2 Generated fortran code for simple harmonic motion.
Springer Book Archives
