Search

This book constitutes the thoroughly refereed post-conference proceedings of the 24th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2011, held in Fort Collins, CO, USA, in September 2011. The 19 revised full papers presented and 19 poster papers were carefully reviewed and selected from 52 submissions. The scope of the workshop spans the theoretical and practical aspects of parallel and high-performance computing, and targets parallel platforms including concurrent, multithreaded, multicore, accelerator, multiprocessor, and cluster systems.

This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2007, held in Urbana, IL, USA, in October 2007. The 23 revised full papers presented were carefully reviewed and selected from 49 submissions. The papers are organized in topical sections on reliability, languages, parallel compiler technology, libraries, run-time systems and performance analysis, and general compiler techniques.

This book constitutes the thoroughly refereed post-proceedings of the 23rd International Workshop on Languages and Compilers for Parallel Computing, LCPC 2010, held in Houston, TX, USA, in October 2010. The 18 revised full papers presented were carefully reviewed and selected from 47 submissions. The scope of the workshop spans foundational results and practical experience, and targets all classes of parallel platforms including concurrent, multithreaded, multicore, accelerated, multiprocessor, and cluster systems

This book constitutes the refereed proceedings of the 14th International Conference on the Theory and Application of Diagrams, Diagrams 2024, held in Münster, Germany, during September 27–October 1, 2024. The 17 full papers, 19 short papers and 11 papers of other types included in this book were carefully reviewed and selected from 69 submissions. They were organized in topical sections as follows: Keynote Talks; Analysis of Diagrams; Euler and Venn Diagrams; Diagrams in Logic; Diagrams and Applications; Diagram Tools; Historical Aspects of Diagrams; and Posters.

This book constitutes the refereed proceedings of the 13th International Conference on the Theory and Application of Diagrams, Diagrams 2022, held in Rome, Italy, in September 2022. The 11 full papers and 19 short papers presented together with 5 posters were carefully reviewed and selected from 58 submissions. 8 chapters are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the refereed proceedings of the 24th International Conference on Logic Programming, ICLP 2008, held in Udine, Italy, in December 2008. The 35 revised full papers together with 2 invited talks, 2 invited tutorials, 11 papers of the co-located first Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008), as well as 26 poster presentations and the abstracts of 11 doctoral consortium articles were carefully reviewed and selected from 177 initial submissions. The papers cover all issues of current research in logic programming - they are organized in topical sections on applications, algorithms, systems, and implementations, semantics and foundations, analysis and transformations, CHRs and extensions, implementations and systems, answer set programming and extensions, as well as constraints and optimizations.

This is the second time that of ESOP has formed part of the ETAPS cluster of conferences, workshops, working group meetings and other associated activities. One of the results of colocatingso many conferences is a reduction in the number of possibilities to submit a paper to a European conference and the increased competition between conferences that occurs when boundaries between indiv- ual conferences have not yet become well established. This may have been the reason for the fact that only 44 submission were received this year. On the other hand we feel that the average quality of submissions has gone up, and thus the program committee was able to select 18 good papers, only one less than the year before. The program committee did not meet physically, and all discussion was done usinga Web-driven data base system. Despite some mixed feelings there is an overall tendency to appreciate the extra time available for giving papers a s- ond look and really going into comments made by other program committee members. I want to thank my fellow program committee members for the work they have put into the refereeingprocess and the valuable feedback they have given to authors. I want to thank the referees for their work and many detailed comments, and?nally I want to thank everyone who has submitted a paper: without authors, no conference.

This book constitutes the refereed proceedings of the 12th European Symposium on Programming, ESOP 2003, held in Warsaw, Poland, in April 2003. The 25 revised full papers presented together with two invited papers were carefully reviewed and selected from 99 submissions. Among the topics addressed are programming paradigms and their integration, program semantics, calculi of computation, security, advanced type systems, program analysis, program transformation, and practical algorithms based on theoretical developments.

The computer programming language Prolog is quickly gaining popularity throughout the world. Since Its beginnings around 1970. Prolog has been chosen by many programmers for applications of symbolic computation. including: D relational databases D mathematical logic D abstract problem solving D understanding natural language D architectural design D symbolic equation solving D biochemical structure analysis D many areas of artificial Intelligence Until now. there has been no textbook with the aim of teaching Prolog as a practical programming language. It Is perhaps a tribute to Prolog that so many people have been motivated to learn It by referring to the necessarily concise reference manuals. a few published papers. and by the orally transmitted'folklore'of the modern computing community. However. as Prolog is beginning to be Introduced to large numbers of undergraduate and postgraduate students. many of our colleagues have expressed a great need for a tutorial guide to learning Prolog. We hope this little book will go some way towards meeting this need. Many newcomers to Prolog find that the task of writing a Prolog program Is not like specifying an algorithm in the same way as In a conventional programming language. Instead. the Prolog programmer asks more what formal relationships and objects occur In his problem.

The International Conference on Information Processing and Management of - certainty in Knowledge-Based Systems, IPMU, is organized every two years with the aim of bringing together scientists working on methods for the management of uncertainty and aggregation of information in intelligent systems. Since 1986, this conference has been providing a forum for the exchange of ideas between th theoreticians and practitioners working in these areas and related?elds. The 13 IPMU conference took place in Dortmund, Germany, June 28–July 2, 2010. This volume contains 79 papers selected through a rigorous reviewing process. The contributions re?ect the richness of research on topics within the scope of the conference and represent several important developments, speci?cally focused on theoretical foundations and methods for information processing and management of uncertainty in knowledge-based systems. We were delighted that Melanie Mitchell (Portland State University, USA), Nihkil R. Pal (Indian Statistical Institute), Bernhard Sch¨ olkopf (Max Planck I- titute for Biological Cybernetics, Tubing ¨ en, Germany) and Wolfgang Wahlster (German Research Center for Arti?cial Intelligence, Saarbruc ¨ ken) accepted our invitations to present keynote lectures. Jim Bezdek received the Kamp´ede F´ eriet Award, granted every two years on the occasion of the IPMU conference, in view of his eminent research contributions to the handling of uncertainty in clustering, data analysis and pattern recognition.

The International Conference on Intelligent Computing (ICIC) was formed to p- vide an annual forum dedicated to the emerging and challenging topics in artificial intelligence, machine learning, bioinformatics, and computational biology, etc. It aims to bring together researchers and practitioners from both academia and ind- try to share ideas, problems and solutions related to the multifaceted aspects of intelligent computing. ICIC 2008, held in Shanghai, China, September 15–18, 2008, constituted the 4th International Conference on Intelligent Computing. It built upon the success of ICIC 2007, ICIC 2006 and ICIC 2005 held in Qingdao, Kunming and Hefei, China, 2007, 2006 and 2005, respectively. This year, the conference concentrated mainly on the theories and methodologies as well as the emerging applications of intelligent computing. Its aim was to unify the picture of contemporary intelligent computing techniques as an integral concept that highlights the trends in advanced computational intelligence and bridges theoretical research with applications. Therefore, the theme for this conference was “Emerging Intelligent Computing Technology and Applications”. Papers focusing on this theme were solicited, addressing theories, methodologies, and applications in science and technology.

After a short chapter on basic aspects of software engineering and its realization in Go, this book introduces to nonsequential and distributed programming with Go. It systematically presents basic concepts for the synchronization and communication of concurrent processes. These include locks, semaphores, fairness and deadlocks, monitors, local and network-wide message passing, networks as graphs, network exploration, distributed depth and breadth first search, and the selection of a leader in networks. In order to make readers familiar with the concepts, the author always takes up the same classic examples. This makes learning easier, because the concepts presented can be compared more easily with the language resources.The algorithms are formulated in the Go programming language, which can be used to express numerous synchronization concepts. Due to its simple syntax, Go also offers the advantage that readers without prior knowledge can follow the basic concepts. The chapters on locks, semaphores, monitors and network-wide message passing also present some basic approaches to programming in C and Java. All source texts are available online.In the 4th edition of the textbook, which is aimed at students of computer science, some errors have been corrected, smaller extensions have been included and adjustments due to a change to Go have been made.

There is an established interest in integrating databases and programming languages. This book on Data Types and Persistence evolved from the proceedings of a workshop held at the Appin in August 1985. The purpose of the Appin workshop was to focus on these two aspects: persistence and data types, and to bring together people from various disciplines who have thought about these problems. Particular topics of'interest include the design of type systems appropriate for database work, the representation of persistent objects such as data types and modules, and the provision of orthogonal persistence and certain aspects of transactions and concurrency. The programme was broken into three sessions: morning, late afternoon and evening to allow the participants to take advantage of two beautiful days in the Scottish Highlands. The financial assistance of the Science and Engineering Research Council, the National Science Foundation and International Computers Ltd. is gratefully acknowledged. We would also like to thank Isabel Graham, Anne Donnelly and Estelle Taylor for their help in organising the workshop. Finally our thanks to Pete Bailey, Ray Carick and Dave Munro for the immense task they undertook in typesetting the book. The convergence of programming languages and databases to a coherent and consistent whole requires ideas from, and adjustment in, both intellectual camps. The first group of chapters in this book present ideas and adjustments coming from the programming language research community. This community frequently discusses types and uses them as a framework for other discussions.

'Specification and transformation of programs'is short for a methodology of software development where, from a formal specification of a problem to be solved, programs correctly solving that problem are constructed by stepwise application of formal, semantics-preserving transformation rules. The approach considers programming as a formal activity. Consequently, it requires some mathematical maturity and, above all, the will to try something new. A somewhat experienced programmer or a third- or fourth-year student in computer science should be able to master most of this material - at least, this is the level I have aimed at. This book is primarily intended as a general introductory textbook on transformational methodology. As with any methodology, reading and understanding is necessary but not sufficient. Therefore, most of the chapters contain a set of exercises for practising as homework. Solutions to these exercises exist and can, in principle, be obtained at nominal cost from the author upon request on appropriate letterhead. In addition, the book also can be seen as a comprehensive account of the particular transformational methodology developed within the Munich CIP project.

A leitmotif in the evolution of programming paradigms has been the level and extent of parametrisation that is facilitated — the so-called genericity of the paradigm. The sorts of parameters that can be envisaged in a programming language range from simple values, like integers and?oating-point numbers, through structured values, types and classes, to kinds (the type of types and/or classes).Datatype-generic programming is about parametrising programsby the structure of the data that they manipulate. Toappreciatethe importanceofdatatypegenericity,oneneedlooknofurther than the internet. The internet is a massive repository of structured data, but the structure is rarely exploited. For example, compression of data can be much more e?ective if its structure is known, but most compression algorithms regard the input data as simply a string of bits, and take no account of its internal organisation. Datatype-genericprogrammingisaboutexploitingthestructureofdatawhen it is relevant and ignoring it when it is not. Programming languages most c- monly used at the present time do not provide e?ective mechanisms for do- menting and implementing datatype genericity. This volume is a contribution towards improving the state of the art. The emergence of datatype genericity can be traced back to the late 1980s.

This book constitutes the refereed proceedings of the 16th European Symposium on Programming, ESOP 2007, held in Braga, Portugal in March/April 2007. It covers models and languages for Web services, verification, term rewriting, language based security, logics and correctness proofs, static analysis and abstract interpretation, semantic theories for object oriented languages, process algebraic techniques, applicative programming, and types for systems properties.

This volume contains the proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), held in Kinsale, Ireland, from September 29 to October 3, 2003. Detailed information about the CP 2003 conference can be found at the URL http://www.cs.ucc.ie/cp2003/ The CP conferences are held annually and provide an international forum for the latest results on all aspects of constraint programming. Previous CP conferences were held in Cassis (France) in 1995, in Cambridge (USA) in 1996, in Schloss Hagenberg (Austria) in 1997, in Pisa (Italy) in 1998, in Alexandria (USA) in 1999, in Singapore in 2000, in Paphos (Cyprus) in 2001, and in Ithaca (USA) in 2002. Like previous CP conferences, CP 2003 again showed the interdisciplinary nature of computing with constraints, and also its usefulness in many problem domains and applications. Constraint programming, with its solvers, languages, theoretical results, and applications, has become a widely recognized paradigm to model and solve successfully many real-life problems, and to reason about problems in many research areas.

Generic programming attempts to make programming more efficient by making it more general. This book is devoted to a novel form of genericity in programs, based on parameterizing programs by the structure of the data they manipulate. The book presents the following four revised and extended chapters first given as lectures at the Generic Programming Summer School held at the University of Oxford, UK in August 2002: - Generic Haskell: Practice and Theory - Generic Haskell: Applications - Generic Properties of Datatypes - Basic Category Theory for Models of Syntax

ECOOP'99 Workshops, Panels, and Posters Lisbon, Portugal, June 14-18, 1999 Proceedings