Philip Wadler - Böcker

Java Generics and Collections has been the go-to guide to generics for more than a decade. This second edition covers Java 21, providing a clear guide to generics from their most common uses to the strangest corner cases, giving you everything you need to know to use and write generic APIs effectively. It covers the collections library thoroughly, so you'll always know how and when to use each collection for any given task. And it explains stream processing, so you'll know which model to use and how they interoperate to get the best out of the platform library.This indispensable guide covers:Fundamentals of generics: type parameters and generic methodsSubtyping and wildcardsGenerics and reflectionDesign patterns for genericsSets, queues, lists, maps, and their implementationsConcurrent programming and thread safety with collectionsPerformance of different collection implementationsBest practices for using and extending the Java collections frameworkDesign philosophy and comparison with other collections libraries

Computation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) steps following a specific set of rules (an algorithm).

The Fifth International Symposium on Practical Aspects of Declarative L- guages (PADL 2003) was held in New Orleans on 13-14 January 2003. It was colocatedwiththe30thAnnualACMSymposiumonPrinciplesofProgramming Languages(POPL2003). We received 57 submissions, a record for PADL. One of the strengths of PADL is that it draws papers from both sides of the declarative divide, from boththefunctionalandlogicprogrammingcommunities.Ofthe57submissions, 25werefunctionaland32werelogical,withsomenotableoverlaps. The program committee was divided on the approach to take to the con- rence.Thosefromthelogicprogrammingcommunitypreferredtohaveparallel sessionsinordertoacceptmorepapers,thosefromthefunctionalprogramming communitypreferredtoavoidparallelsessionsthoughitmeantacceptingfewer papers. We decided to ?nd strength in diversity, and experiment with taking both paths. We accepted 8 papers on functional programming, each presented initsownslot,and15papersonlogicprogramming,10ofwhicharepresentedin parallelsessions.Wefeltthatpapersfrombothcommunitieswerecomparablein quality.Theratioof4hoursoffunctionaltalksto5hoursoflogictalksmatches theratioofsubmissions.WhilemostpaperssubmittedtoPADLaretraditionalresearchpapers,some weresubmittedasApplicationLettersorDeclarativePearls.Traditionalpapers maybejudgedonwhethertheypresentacrispnewresearchresult;Application Lettersmaybejudgedaccordingtotheinterestintheapplicationandthenovel useofdeclarativelanguages;andDeclarativePearlsmaybejudgedaccordingto theeleganceofthedevelopmentandtheclarityoftheexpression. This year PADL instituted a "Most Practical" paper award, for the paper that best exempli?ed the goals of PADL. The award went to "Data mining the yeast genome in a lazy functional language", Amanda Clare and Ross D. King,UniversityofWales,Aberystwyth,whichdescribesareal-wordapplication runningonmultiprocessors,drawingontechniquesfromboththefunctionaland logicprogrammingcommunities. Special thanks are due: to Shriram Krishnamurthi, Dave Tucker, and Paul Graunke of Brown University, for running the website of the PADL submission andreviewprocess(seeKrishnamurthi'sinvitedtalkinthisvolume);toMartina SharpofAvayaLabsandKimberlyVollofSimonFraserUniversity,forhelpwith preparingthisvolume;andtoGopalGuptaoftheUniversityofTexasatDallas, for serving as general chair.We thank Avaya Labs, Brown University, Simon FraserUniversity,Universit' edeProvence,andtheUniversityofTexasatDallas fortheirsupport. Ourthankstotheprogramcommitteemembersandrefereesfortheirrev- wingandfortheiradvice.Finally,ourthankstoallthosewhosubmittedpapers toorparticipatedinPADL2003.

This volume contains the papers presented at the latest Glasgow Workshop on Functional Programming, held in Portree on the Isle of Skye, 12-14 August 1991. These workshops have been held annually by the Glasgow Functional Programming group since 1988 and provide a valuable forum for members of the group and invited contributors from industry and other institutions to discuss current research work. The 29 papers contained in this volume, many of which have been rewritten since the original presentation, deal with both the theoretical and pragmatic aspects of functional programming, each paper summarizing the central issues of its subject area. A variety of themes emerged from the workshop, including relational algebra and its application to hardware design, partial evaluation and program transformation, implementation techniques and strictness analysis. Among the specific areas covered in this volume are: a new sharing mechanism for the TIM; evaluation order analysis for lazy data structures; extending deforestation for first order functional programs; a semantics for relational programming; abstractions in Ruby; and operational theories of improvement in functional languages.Functional Programming, Glasgow 1991 provides a comprehensive overview of current research in this field and should be of interest to anyone involved in the theory of functional programming or its application to practical problems.