Titlebook: Mathematical Foundations of Computer Science 1986; 12th Symposium held Jozef Gruska,Branislav Rovan,Juraj Wiedermann Conference proceeding

独行者

Developing implicit data structures,We present a new, and basically simple, algorithm for maintaining a structure supporting insert, delete and search in O(log..) with no storage requirements other than that of the data itself.

REIGN

Efficient testing of optimal time adders,We consider the design of two well-known optimal time adders: the ”carry look-ahead” adder ([BrKu]) and the ”conditional sum” adder ([Sk])..It is shown, that 6.(.) – 4, resp. 6.(.)+2, test patterns suffice to exhaustively test the .-bit carry look-ahead adder, resp. the .-bit conditional sum adder with respect to the single stuck-at fault model.

武器

glamor

诱惑

0302-9743 Overview: 978-3-540-16783-9978-3-540-39909-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

Resistance

Partial interpretations of higher order algebraic types,objects based on the concept of partial interpretations. Models of such types are studied where all explicit equations have solutions. Higher order types, i.e. types comprising higher order functions are treated, too. This allows an algebraic (“equational”) specification of algebras including sorts

功多汁水

Kins of context-free languages,verging if each string w of its limit language belongs to an L. which has a grammatical description very concise in comparison with the length of w . We prove that these languages are closely related to context-free languages in several properties: pumping lemma, interchange lemma, regularity of una

偶像

infatuation

A semantical model for integration and modularization of rules, of having a relational model, but which otherwise have very little in common. Due to lack of space I cannot include a convincing example which will show that the . language will be a convenient tool for expressing real life rules, but my experience is positive. Also the modularization feature turne

BRAVE

An approach to proof checker,ed on unification and its high productivity. The logic programming language itself is based on theorem proving such as SLD resolution. Studies of theorem proving or proof checking play an essential role in the total plans of FGCS in Japan. Computer science has a history of only 40 years, while histo