This volume constitutes the proceedings of the second International Workshop on the Semantics, Applications, and Implementation of Program Generation (SAIG 2001)held on 6 September, 2001, in Florence, Italy. SAIG 2001 was held as an ACM SIGPLAN workshop co-located with the International Conference on Principles, Logics, and Implementations of High-level Programming Languages (PLI). As the commercial production of software systems moves toward being a traditional industry, automation will necessarily play a more substantial role in this industry, just as it plays a key role in the production of traditional commodities. SAIG aims at promoting the development and the application of foundational techniques for supporting automatic program generation. A key goal of SAIG is to provide a unique forum for both theoreticians and practitioners to present their results and ideas to an audience from a diverse background. This year we are fortunate to have three in?uential invited speakers: Krzysztof Czarnecki (DaimlerChrysler), Tim Sheard (OGI School of Science and Engineering), and Mitchell Wand (Northeastern University). The proceedings include abstracts of the invited talks, and an invited paper by Tim Sheard. Seven technical papers and two position papers were presented at SAIG 2001.

This book constitutes the refereed proceedings of the 13th International Conference on Algebraic Methodology and Software Technology, AMAST 2010, held in Lac-Beauport, QC, Canada, in June 2010. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. The papers are organized in 1 invited paper, 10 contributed research papers, and 4 system demonstrations.

Language prototyping provides a means to generate language implementations automatically from high-level language definitions. This volume presents an algebraic specification approach to language prototyping, and is centered around the ASF+SDF formalism and Meta-Environment. The volume is an integrated collection of articles covering a number of case studies, and includes several chapters proposing new techniques for deriving advanced language implementations. The accompanying software is freely available.

This book offers a comprehensive view of the best and the latest work in functional programming. It is the proceedings of a major international conference and contains 30 papers selected from 126 submitted. A number of themes emerge. One is a growing interest in types: powerful type systems or type checkers supporting overloading, coercion, dynamic types, and incremental inference; linear types to optimize storage, and polymorphic types to optimize semantic analysis. The hot topic of partial evaluation is well represented: techniques for higher-order binding-time analysis, assuring termination of partial evaluation, and improving the residual programs a partial evaluator generates. The thorny problem of manipulating state in functional languages is addressed: one paper even argues that parallel programs with side-effects can be "more declarative" than purely functional ones. Theoretical work covers a new model of types based on projections, parametricity, a connection between strictness analysis and logic, and a discussion of efficient implementations of the lambda-calculus. The connection with computer architecture and a variety of other topics are also addressed.

Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.

This book constitutes the refereed proceedings of the Second International Colloquium on Theoretical Aspects of Computing, ICTAC 2005 held in Hanoi, Vietnam, in October 2005. The 35 revised full papers presented together with 5 invited talks and a summary of 5 tutorials were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections on formal languages, computer science logics, program construction, real-time systems, concurrency and refinement, software security, quantitative logics, object-orientation and component systems, model-checking and algorithms, and applied logics and computing theory.