## Perspectives of System Informatics: Second International Andrei Ershov Memorial Conference, Akademgorodok, Novosibirsk, Russia, June 25 - 28, 1996; Proceedings, Volume 2This book constitutes the refereed post-conference proceedings of the Second International Andrei Ershov Memorial Conference on System Informatics, held in Akademgorodok, Novosibirsk, Russia, in June 1996. The 27 revised full papers presented together with 9 invited contributions were thoroughly refereed for inclusion in this volume. The book is divided in topical sections on programming methodology, artificial intelligence, natural language processing, machine learning, dataflow and concurrency models, parallel programming, supercompilation, partial evaluation, object-oriented programming, semantics and abstract interpretation, programming and graphical interfaces, and logic programming. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Semantics and Laws of ManMade Infrastructure Systems | 1 |

The Language Lola FPGAs and PLDs in Teaching Digital Circuit Design | 2 |

Calculating Digital Counters | 21 |

Generic Programming invited talk | 40 |

Algebraic Semantics of the Oberon Target Machine | 41 |

The Making of Algol 68 | 55 |

Explorations of a Genetic Algorithm System on the Highly Parallel Connection Machine invited talk | 68 |

Application of Subdefinite Models for Solving Constraint Satisfaction Problems | 80 |

Experiments with a Supercompiler | 249 |

Fast BindingTime Analysis for MultiLevel Specialization | 261 |

BTA Algorithms to Ensure Termination of OffLine Partial Evaluation | 273 |

Polyvariant Expansion and Compiler Generators | 285 |

The Disjunctive Constrained Lambda Calculus | 297 |

Efficient Metaobject Control Using Mediators invited talk | 310 |

Concepts Design Heuristics and Perspectives | 330 |

Prototype of a RunTime Adaptable ObjectOriented System | 341 |

Problem Solving in the ObjectOriented Technological Environment NeMo+ | 91 |

What a Universal Semantic Interlingua Can and Cannot Do invited talk | 101 |

Understanding Short Texts with Integration of Knowledge Representation Methods | 111 |

CoLearning of Recursive Languages from Positive Data | 122 |

Automatic Analysis Verification and Synthesis of RuleBased RealTime Decision Making Systems with Machine Learning Assistance | 134 |

Processes in CauseEffect Structures invited talk | 146 |

On the Power of Recursion in Dataflow Schemes | 166 |

Derivation of Explicitly Parallel Code from Declarative Program by Transformations | 178 |

Actors as a Coordinating Model of Computation | 191 |

An Associative Version of the PrimDijkstra Algorithm and Its Application to Some Graph Problems | 203 |

Adding Design Strategies to Fork Algebras | 214 |

Techniques and Results | 227 |

The Tree Equivalence Problem for Linear Recursion Schemes | 350 |

A Mode Analysis of Logic Programs by Abstract Interpretation | 362 |

A SemanticsBased Determinacy Analysis for Prolog with Cut | 374 |

Communicating Functional Agents and Their Application to Graphical User Interfaces | 386 |

The Design of a Functional GUI Library Using Constructor Classes | 398 |

Merging Relational Database Technology with Constraint Technology | 409 |

On Homeostatic Behavior of Dynamic Deductive Data Bases | 420 |

On Transformations into Linear Database Logic Programs | 433 |

List of Posters | 445 |

### Other editions - View all

Perspectives of System Informatics: Second International Andrei Ershov ... Dines Bjorner,Manfred Broy,Igor V. Pottosin No preview available - 2014 |

### Common terms and phrases

abstract abstract interpretation actor Algol 68 algorithm analysis application approach arity ASub atoms basic behavior binding-time bt-value c-e structure called circuits co-learning compiler components Computer Science configuration constraint clause construction constructor corresponding database dataflow Datalog DDDBs defined definition denotational semantics denote digit domain dynamic elements equations equivalence example expression finite FlCl fork algebras formal FPGA framework function Functional Programming graph hot spot hypothesis space implementation indexed family input integer interface interpretation lambda calculus linear linearizable Logic Programming metaobject method monad multi-level node object object-oriented operations output parallel parameters partial evaluation PEQL polyvariant predicate problem Proc procedure program transformation programming language prototype recursive Refal relational relational algebra representation represented result rules scheme SD-models semantics sequence solution specification static Store strategy stream stream function subdefinite subset supercompiler symbol term Theorem tree tuple variables widgets

### Popular passages

Page 408 - Wadler. Imperative Functional Programming. In Proc. 20th ACM Symposium on Principles of Programming Languages, Charlotte, North Carolina, January 1993.