Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Generic Programming
Thepaperscollectedherearereportsfromthe?eldonthe majorproblemsandemergingsolutionsofgenericprogrammingmethodology. June2000 MehdiJazayeri Rudige ̈ rLoos DavidMusser VI Organization Organization The Generic Programming Seminar was held 27 April–1May 1998 at the ConferenceCenteroftheSchloßDagstuhl,locatedinWadern,Germany(near Saarbruc ̈ ken). Therewerefortynineattendeesfromtencountries. Theformal programofthemeetingincludedthirtysevenlectures,apanelsessiononsoftware librarystandardization,andadiscussionofopenproblemsandprojects. Many informaldiscussionsalsotookplace,oneofthemanybene?tsoftheDagstuhl setting. The traditional Dagstuhl social event was at this meeting a Baroque concertheldinthechapeloftheSchloß. Organizers MehdiJazayeri TechnicalUniversityofVienna R ̈ udigerLoos Tubingen ̈ University DavidMusser RensselaerPolytechnicInstitute AlexanderStepanov SGI Attendees DavidAbrahams MarkoftheUnicorn,Inc.
Rewriting Techniques and Applications
This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.
Generic Programming
Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example, they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities. Generic Programming comprises the edited proceedings of the Working Conference on Generic Programming, which was sponsored by the International Federation for Information Processing (IFIP) and held in Dagstuhl, Germany in July 2002. With contributions from leading researchers around the world, this volume captures the state of the art in this important emerging area.
Perspectives of System Informatics
This book constitutes the thoroughly refereed post-proceedings of the 4th International Andrei Ershov Memorial Conference, PSI 2001, held in Akademgorodok, Novosibirsk, Russia, in July 2001. The 50 revised papers presented together with 2 invited memorial papers devoted to the work of Andrei Ershov were carefully selected during 2 rounds of reviewing and improvement. The book offers topical sections on computing and algorithms, logical methods, verification, program transformation and synthesis, semantics and types, processes and concurrency, UML specification, Petri nets, testing, software construction, data and knowledge bases, logic programming, constraint programming, program analysis, and language implementation.
Elements of Programming
Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering, must be based on a solid mathematical foundation. This book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.
