John Mylopoulos has made ground-breaking contributions to three areas of computer science: arti?cial intelligence, information systems and software - gineering. His contributions have been celebrated on multiple occasions. First, Misha Missiko? organized a one-day symposium on conceptual modeling on June 17, 2003, inVelden, Austria, tocelebrateJohn's60thbirthday.Second, JohnTsotsos led the organization of a day of celebrations on June 27th, 2009 in Toronto, Canada, on the occasionof John's retirementfrom the Departmentof Computer Science of the University of Toronto. This book grew out of our desire to honor and thank John by presenting him at the Toronto reunion with a volume that re?ects his belief that conceptual modeling is becoming a fundamental skill that will be a necessary tool for all futurecomputerscientists.Thepapersinthis bookarewrittenbyleading?gures in technical areas that intersect with conceptual modeling, as well as by John's closest collaborators.We are pleased to present this collection of papers that we believe are of lasting signi?cance and could also be used to support a course on conceptual modeling. We are extremely grateful to the eminent authors, who have contributed such high-quality material.

Welcome to the proceedings of ECOOP 2009! Thanks to the local organizersfor working hard on arranging the conference - with the hard work they put in, it was a great success. Thanks to Sophia Drossopoulou for her dedicated work as PC Chair in assembling a ?ne scienti?c program including forward-looking keynotes, and for her e?orts to reduce the environmental impact of the PC meeting by replacing a physical meeting with a virtual meeting. I would also like to thank James Noble for taking the time and e?ort to write up last year's banquet speech so that it could be included in this year's proceedings. One of the strong features of ECOOPis the two days of workshopspreceding themainconferencethatallowsintenseinteractionbetweenparticipants.Thanks to all workshop organizers. Lastyear'ssuccessfulsummerschooltutorialswerefollowedupthisyearwith seven interesting tutorials. Thanks to the organizers and speakers. This year's Dahl-Nygaard award honored yet another pioneer in the ?eld, namely, David Ungar for his contributions includingSelf. I appreciate his e?orts in providing us with an excellent award talk. The world is changing and so is ECOOP. Please contemplate my short note on the following pages entitled On Future Trends for ECOOP.

Dijkstra once wrote that computer science is no more about computers than astronomy is about telescopes. Despite the many incredible advances in c- puter science from times that predate practical mechanical computing, there is still a myriad of fundamental questions in understanding the interface between computers and the rest of the world. Why is it still hard to mechanize many tasks that seem to be fundamentally routine, even as we see ever-increasing - pacity for raw mechanical computing? The disciplined study of domain-speci?c languages (DSLs) is an emerging area in computer science, and is one which has the potential to revolutionize the ?eld, and bring us closer to answering this question. DSLs are formalisms that have four general characteristics. - They relate to a well-de?ned domain of discourse, be it controlling tra?c lights or space ships. - They have well-de?ned notation, such as the ones that exist for prescribing music, dance routines, or strategy in a football game. - The informal or intuitive meaning of the notation is clear. This can easily be overlooked, especially since intuitive meaning can be expressed by many di?erent notations that may be received very di?erently by users. - The formal meaning is clear and mechanizable, as is, hopefully, the case for the instructions we give to our bank or to a merchant online.

The book emphasizes the design of full-fledged, fully normalizing lambda calculus
machinery, as opposed to the just weakly normalizing machines.

Although the self-adaptability of systems has been studied in a wide range of disciplines, from biology to robotics, only recently has the software engineering community recognized its key role in enabling the development of future software systems that are able to self-adapt to changes that may occur in the system, its requirements, or the environment in which it is deployed.

The 12 carefully reviewed papers included in this state-of-the-art survey originate from the International Seminar on Software Engineering for Self-Adaptive Systems, held in Dagstuhl Castle, Germany, in January 2008. They examine the current state-of-the-art in the field, describing a wide range of approaches coming from different strands of software engineering, and present future challenges facing this ever-resurgent and challenging field of research. Also included in this book is an invited roadmap paper on the research challenges facing self-adaptive systems within the area of software engineering, based on discussions at the Dagstuhl Seminar and put together by several of its participants. The papers have been divided into topical sections on architecture-based self-adaptation, context-aware and model-driven self-adaptation, and self-healing. These are preceded by three research roadmap papers.

These proceedings contain a selection of refereed papers presented at or - lated to the Annual Workshop of the TYPES project (EU coordination action 510996), which was held during March 26-29, 2008 in Turin, Italy. The topic of this workshop, and of all previous workshops of the same project, was f- mal reasoning and computer programming based on type theory: languages and computerized tools for reasoning, and applications in several domains such as analysis of programming languages, certi?ed software, mobile code, formali- tion of mathematics, mathematics education. The workshop was attended by more than 100 researchers and included more than 40 presentations. We also had three invited lectures, from A. Asperti (University of Bologna), G. Dowek (LIX, Ecole polytechnique, France) and J. W. Klop (Vrije Universiteit, A- terdam, The Netherlands). From 27 submitted papers, 19 were selected after a reviewing process. Each submitted paper was reviewed by three referees; the ?nal decisions were made by the editors. This workshop is the last of a series of meetings of the TYPES working group funded by the European Union (IST project 29001, ESPRIT Working Group 21900, ESPRIT BRA 6435).

Embedded systems take over complex control and data processing tasks in diverse application ?elds such as automotive, avionics, consumer products, and telec- munications. They are the primary driver for improving overall system safety, ef?ciency, and comfort. The demand for further improvement in these aspects can only be satis?ed by designing embedded systems of increasing complexity, which in turn necessitates the development of new system design methodologies based on speci?cation, design, and veri?cation languages. The objective of the book at hand is to provide researchers and designers with an overview of current research trends, results, and application experiences in c- puter languages for embedded systems. The book builds upon the most relevant contributions to the 2008 conference Forum on Design Languages (FDL), the p- mier international conference specializing in this ?eld. These contributions have been selected based on the results of reviews provided by leading experts from - search and industry. In many cases, the authors have improved their original work by adding breadth, depth, or explanation.

This volume contains the papers presented at NLDB 2009, the 14th Inter- tional Conference on Applications of Natural Language to Information Systems held June 24-26, 2009, at the University of the Saarland and the German - search Center for Arti?cial Intelligence in Saarbruc ken, Germany. In addition to reviewed submissions, the program also included contributions to the doctoral symposiumheldduring NLDB2009aswellastwoinvitedtalks.Thesetalksc- ered some of the currently hot topics in the use of natural languagefor accessing information systems. Wereceived51submissionsasregularpapersforthemainconference,2extra submissions as posters, and 3 short papers for the doctoral symposium. Each paper for the main conference was assigned four reviewers, taking into account preferences expressed by the ProgramCommittee members as much as possible. Within the review deadline, we received at least three reviews for almost all submissions. After the review deadline, the Conference Organizing Committee members and the Program Committee Chair acted as meta-reviewers. This task included studying the reviews and the papers, speci?cally those whose assessment made them borderline cases, and discussing con?icting opinions and their impact on theassessmentofindividualpapers.Finally,themeta-reviewerswroteadditional reviews for the few papers which received less than three reviews, as well as for papers which received reviews with considerably con?icting assessments.

Thisvolumecontainsaselectionofthepaperspresentedatthe19thInternational SymposiumonLogic-BasedProgramSynthesisandTransformation(LOPSTR 2009)heldSeptember 9-11,2009in Coimbra,Portugal. Informationaboutthe conference can be found at http://www. cs. kuleuven. be/conference/ lopstr09+. PreviousLOPSTRsymposiawereheldinValencia(2008),Lyngby (2007),Venice(2006and1999),London(2005and2000),Verona(2004),U- sala(2003),Madrid(2002),Paphos(2001),Manchester(1998,1992,and1991), Leuven(1997),Stockholm(1996),Arnhem(1995),Pisa(1994),andLouvain-la- Neuve(1993). The aim of the LOPSTR series is to stimulate and promote international researchandcollaborationonlogic-basedprogramdevelopment. LOPSTRt- ditionally solicits papers in the areas of speci?cation, synthesis, veri?cation, transformation,analysis,optimization,composition,security,reuse,applications andtools,component-basedsoftwaredevelopment,softwarearchitectures,age- basedsoftwaredevelopment,andprogramre?nement. LOPSTRhasareputation forbeingalively,friendlyforumforpresentinganddiscussingworkinprogress. Formalproceedingsareproducedonlyafterthesymposiumsothatauthorscan incorporateanyfeedbackinthepublishedpapers. IwouldliketothankallthosewhosubmittedcontributionstoLOPSTRinthe categoriesoffullpapersandextendedabstracts. Eachsubmissionwasreviewed byatleastthreeProgramCommitteemembers. Thecommitteedecidedtoaccept threefullpapersforimmediateinclusioninthe?nalproceedings,andtenpapers wereacceptedafterrevisionandanotherroundofreviewing. Inadditiontothe accepted papers, the program also included an invited talk by Germ' an Vidal (TechnicalUniversityofValencia). IamgratefultotheProgramCommitteememberswhoworkedhardtop- duce high-qualityreviewsforthe submitted papersin atight schedule, aswell as all the external reviewers involved in the paper selection. I also would like to thank Andrei Voronkov for his excellent EasyChair system that automates manyofthetasksinvolvedinchairingaconference. LOPSTR2009wasco-locatedwithPPDP2009andCSL2009. Manythanks tothelocalorganizersoftheseevents,inparticular,toAnaAlmeida,theLOP- STR2009LocalOrganizationChair. January2010 DannyDeSchreye Conference Organization Program Chair DannyDeSchreye DepartmentofComputerScience KatholiekeUniversiteitLeuven B-3001Heverlee,Belgium Email:danny. deschreye@cs. kuleuven. be Local Organization Chair AnaAlmeida DepartamentodeMatematica FaculdadedeCienciaseTecnologia UniversidadedeCoimbra Coimbra,Portugal Email:amca@mat. uc. pt Program Committee SlimAbdennadher GermanUniversityCairo,Egypt Mar'?aAlpuenteFrasnedoTechnicalUniversityofValencia,Spain RobertoBagnara UniversityofParma,Italy DannyDeSchreye K. U. Leuven,Belgium(Chair) JohnGallagher RoskildeUniversity,Denmark RobertGluc .. k UniversityofCopenhagen,Denmark MichaelHanus UniversityofKiel,Germany ReinhardKahle UniversidadeNovadeLisboa,Portugal AndyKing UniversityofKent,UK MichaelLeuschel UniversityofDu ..sseldorf,Germany FabioMartinelli IstitutodiInformaticaeTelematicaPisa,Italy Fred Mesnard Universit'edeLaR' eunion,France MarioOrnaghi Universita 'degliStudidiMilano,Italy Germ' anPuebla TechnicalUniversityofMadrid,Spain SabinaRossi Universit' aCa'FoscaridiVenezia,Italy JosepSilva TechnicalUniversityofValencia,Spain PeterSchneider-Kamp UniversityofSouthernDenmark,Denmark TomSchrijvers K. U. Leuven,Belgium PetrStepanek CharlesUniversityPrague,CzechRepublic WimVanhoof UniversityofNamur,Belgium VIII Organization Organizing Committee AnaAlmeida PedroQuaresma ReinhardKahle External Reviewers JesperLouisAndersen FedericoBergenti UlrichBerger CarlFriedrichBolz PedroCabalar GabrieleCosta Francois , Degrave MarcDenecker CamilloFiorentini SebastianFischer EmilioJesusGallegoArias MichaelGelfond PepeIborra HaythemIsmail LeanidKrautsevich JoaoLeite GiftNuka EtiennePayet PaoloPilozzi FrankRaiser JuanRodriguez-Hortala ' CesarSanchez AntonSetzer MajaTonnesen PeterVanWeert DeanVoets GianluigiZavattaro Table of Contents Towards Scalable Partial Evaluation of Declarative Programs (Invited Talk) ...

Thisvolumecontainsthepapersofthe20thInternationalConferenceonRewr- ing Techniques and Applications (RTA 2009), which was held from June 29 to July 1, 2009, in Bras' ?lia, Brazil as part of the 5th International Conference on Rewriting, Deduction, and Programming (RDP 2009) together with the Int- national Conference on Typed Lambda Calculi and Applications (TLCA 2009), the International School on Rewriting (ISR 2009), the 4th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2009), the 10th Inter- tional Workshop on Rule-Based Programming (RULE 2009), the 8th Inter- tional Workshop on Functional and (Constraint) Logic Programming (WFLP 2009), the 9th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2009), and the annual meeting of the IFIP Working Group 1.6 on term rewriting. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), R- gers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht(2001),Copenhagen(2002),Valencia(2003),Aachen(2004),Nara(2005), Seattle (2006), Paris (2007), and Hagenberg (2008).

The nature of conceptual thinking constitutes a central topic in a variety of scienti?c disciplines. Since 1993, the International Conference on Conceptual Structures (ICCS) has served as a platform that brings together researchersand practioners in information and computer sciences as well as social science to explore novel ways of representing and analyzing conceptual knowledge. Ori- nally centered around research on knowledge representation and reasoning with conceptual graphs, over the years ICCS has broadened its scope to include in- vations from a wider range of theories and related practices, among them other forms of graph-based formalisms like RDF or existential graphs, formal concept analysis, Semantic Web technologies, ontologies, concept mapping and more. Today, ICCS draws inspiration from areas as diverse as arti?cial intelligence, knowledge representation and reasoning, applied mathematics and lattice t- ory, computational linguistics, conceptual modeling and design, diagrammatic reasoning and logic, intelligent systems and knowledge management. In addition to vivid conferences, the vibrancy of the ?eld is documented by two recently published books (Hitzler, Scha ..rfe (Eds): Conceptual Structures in Practice and Chein, Mugnier: Graph-based Knowledge Representation: C- putational Foundations of Conceptual Graphs) as well as by an ISO standard ("Common Logic", ISO/ IEC 24707) which orginated in this community.

The LNCS journal Transactions on Computational Science reflects recent developments in the field of Computational Science, conceiving the field not as a mere ancillary science but rather as an innovative approach supporting many other scientific disciplines. The journal focuses on original high-quality research in the realm of computational science in parallel and distributed environments, encompassing the facilitating theoretical foundations and the applications of large-scale computations and massive data processing. It addresses researchers and practitioners in areas ranging from aerospace to biochemistry, from electronics to geosciences, from mathematics to software architecture, presenting verifiable computational methods, findings and solutions and enabling industrial users to apply techniques of leading-edge, large-scale, high performance computational methods.

The fifth volume of the Transactions on Computational Science journal, edited by Yingxu Wang and Keith C.C. Chan, is devoted to the subject of cognitive knowledge representation. This field of study focuses on the internal knowledge representation mechanisms of the brain and how these can be applied to computer science and engineering. The issue includes the latest research results in internal knowledge representation at the logical, functional, physiological, and biological levels and describes their impacts on computing, artificial intelligence, and computational intelligence.

A family of internationally popular microcontrollers, the Atmel AVR microcontroller series is a low-cost hardware development platform suitable for an educational environment. Until now, no text focused on the assembly language programming of these microcontrollers. Through detailed coverage of assembly language programming principles and techniques, Some Assembly Required: Assembly Language Programming with the AVR Microcontroller teaches the basic system capabilities of 8-bit AVR microcontrollers.

The text illustrates fundamental computer architecture and programming structures using AVR assembly language. It employs the core AVR 8-bit RISC microcontroller architecture and a limited collection of external devices, such as push buttons, LEDs, and serial communications, to describe control structures, memory use and allocation, stacks, and I/O. Each chapter contains numerous examples and exercises, including programming problems.

By studying assembly languages, computer scientists gain an understanding of the functionality of basic processors and how their capabilities support high level languages and applications. Exploring this connection between hardware and software, this book provides a foundation for understanding compilers, linkers, loaders, and operating systems in addition to the processors themselves.

This volume contains the papers presented at the International GI/ITG C- ference on "Measurement, Modelling and Evaluation of Computing Systems" and "Dependability and Fault Tolerance," held during March 15-17, 2010 in Essen, Germany, hosted by the University of Duisburg-Essen. The Technical Committees of MMBand DFT coverallaspects ofperformanceand dependab- ityevaluationofsystemsincludingnetworks, computerarchitectures, distributed systems, software, fault-tolerant and secure systems. In 2010, both committees joined forces in a common conference MMB & DFT 2010. This current conf- ence was the 15th in a series of biannual conferences, initially started in 1981, with previous editions in Aachen, Dresden, Nuremberg and Dortmund. MMB & DFT 2010 received 42 submissions (37 regular papers and 5 tool descriptions) by authors from 15 di?erent countries. Each regular paper was reviewed by at least three (and up to ?ve) Program Committee members and external reviewers; tool papers were reviewed by two reviewers. In total we - ceived 158 reviews and the ProgramCommittee decided to accept 19 full papers and 5 tool papers. TheprogramwascompletedbytwoinvitedtalksandwewerehappythatPhil Koopman from Carnegie Mellon University and Paul Kuhn ] from the University of Stuttgart accepted to give an invited talk at the conference."

This volume presents the set of papers accompanying the lectures of the 9th International School on Formal Methods for the Design of Computer, Com- nication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience asaprominentapproachtotherigorousdesignofcomputer, communication, and software systems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2009 was devoted to formal methods for Web services and covered s- eral aspects including choreography, orchestration, description techniques, - teraction, synthesis, composition, session types, contracts, veri?cation, security, and performance. This volume comprises eight articles. Bruni's paper overviews some of the most recently proposed abstractions in the setting of process calculi tailored to the well-disciplined handling of issues such as long-running interactions, orch- tration, and unexpected events. Van der Aalst, Mooij, Stahl, and Wolf provide some foundational notions related to service interaction and address in a Petri net setting challenges like how to expose a service, how to replace and re?ne services, and how to generate service adapters. The paper by Marconi and - store presents a survey of existing approaches to the synthesis of Web service compositions, a di?cult and error-pronetask that requires automated solutions.

Since 2002, FoLLI awards an annual prize for an outstanding dissertation in the fields of Logic, Language, and Information. This book is based on the Ph.D. thesis of Gabriele Puppis, who was the winner of the E.W. Beth dissertation award for 2007. Puppis' thesis focuses on Logic and Computation and, more specifically, on automata-based decidability techniques for time granularity and on a new method for deciding Monadic Second Order theories of trees. The results presented represent a significant step towards a better understanding of the changes in granularity levels that humans make so easily in cognition of time, space, and other phenomena, whereas their logical and computational structure poses difficult conceptual and computational challenges.

This book teaches the principles of natural language processing and covers linguistics issues. It also details the language-processing functions involved, including part-of-speech tagging using rules and stochastic techniques. A key feature of the book is the author's hands-on approach throughout, with extensive exercises, sample code in Prolog and Perl, and a detailed introduction to Prolog. The book is suitable for researchers and students of natural language processing and computational linguistics.

This volume contains a selection of papers presented at the 17th International Conference on Applications of Declarative Programming and Knowledge M- agement INAP 2007 and the 21st Workshop on Logic Programming WLP 2007, which were held jointly in Wu ]rzburg, Germany, during October 4-6, 2007. Declarative programming is anadvancedparadigmforthe modelingandso- ing of complex problems. This speci?cation method has become more and more attractiveoverthelastyears, e.g., inthedomainsofdatabases, fortheprocessing of natural language, for the modeling and processing of combinatorial problems, and for establishing knowledge-based systems for the Web. The INAP conferences provide a forum for intensive discussions of appli- tions of important technologies around logic programming, constraint problem solving, and closely related advanced software. They comprehensively cover the impactof programmablelogic solversin the Internetsociety, its underlying te- nologies, and leading-edge applications in industry, commerce, government, and societal services. The WorkshopsonLogicProgrammingarethe annualmeeting of the Society for Logic Programming (GLP e.V.). They bring together researchers interested in logic programming, constraint programming, and related areas like databases and arti?cial intelligence. Previous workshops have been held in Germany, A- tria and Switzerland. The topics of the selected papers of this year's joint conference concentrated on three currently important ?elds: constraint programming and constraint solving, databases and data mining, and declarative programming with logic languages. Duringthelastcoupleofyearsalotofresearchhasbeenconductedonthe- ageof declarativeprogrammingfor databases and data mining. Reasoning about knowledgewrappedinrules, databases, ortheWeballowsonetoexploreintere- ing hidden knowledge.Declarativetechniques for the transformation, deduction, induction, visualization, or querying of knowledge, or data mining techniques for exploring knowledge have the advantage of high transparency and better maintainability compared to procedural approaches.

th FM 2009, the 16 International Symposium on Formal Methods, marked the 10th an- versary of the First World Congress on Formal Methods that was held in 1999 in Toulouse, France. We wished to celebrate this by advertising and organizing FM 2009 as the Second World Congress in the FM series, aiming to once again bring together the formal methods communities from all over the world. The statistics displayed in the table on the next page include the number of countries represented by the Programme Committee members, as well as of the authors of submitted and accepted papers. Novel this year was a special track on tools and industrial applications. Subm- sions of papers on these topics were especially encouraged, but not given any special treatment. (It was just as hard to get a special track paper accepted as any other paper.) What we did promote, however, was a discussion of how originality, contri- tion, and soundness should be judged for these papers. The following questions were used by our Programme Committee.

This volume contains the ?nal proceedings of the 7th International Andrei Ershov Memorial Conference on Perspectives of System Informatics Akad- gorodok (Novosibirsk, Russia), June 15-19, 2009. PSI is a forum for academic and industrial researchers, developers and users working on topics relating to computer, software and information sciences. The conference serves to bridge the gaps between di?erent communities whose - searchareasarecoveredbybutnotlimitedtofoundationsofprogramandsystem development and analysis, programming methodology and softwareengineering, and information technologies. PSI 2009 was dedicated to the memory of a prominent scientist, academician Andrei Ershov (1931-1988), and to a signi?cant date in the history of computer science in the country, namely, the 50th anniversary of the Programming - partment founded by Andrei Ershov. Initially, the department was a part of the Institute of Mathematics and later, in 1964, it joined the newly established Computing Center of the Siberian Branch of the USSR Academy of Sciences. Andrei Ershov, who was responsible for forming the department, gathered a team of young graduates from leading Soviet universities. The ?rst signi?cant project of the department was aimed at the development of ALPHA system, an optimizing compiler for an extension of Algol 60 implemented on a Soviet c- puterM-20. Later, theresearchersofthedepartmentcreatedtheAlgibr, Epsilon, Sigma, and Alpha-6 programming systems for the BESM-6 computers. The list of their achievements also includes the ?rst Soviet time-sharing system AIST-0, the multi-language system BETA, research projects in arti?cial intelligence and parallel programming, integrated tools for text processing and publishing, and many othe

The 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7-11, 2010 in Prague. After six successful conferences held in 2004-2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi'an, and ChangSha) TAMC left Asia for the ?rst time, aiming at the "heart of Europe. " Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via ?awlessly and e?ciently running EasyChair. We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks - John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks "New Research Directions in the Information Age" and "The Laplacian Paradigm: Emerging Algorithms for Massive Graph" were highlights of the conference.

Expert F# is about practical programming in a beautiful language that puts the power and elegance of functional programming into the hands of .NET developers. In combination with .NET, F# achieves unrivaled levels of programmer productivity and program clarity. This books serves asThe authoritative guide to F# by the designer of F# A comprehensive reference of F# concepts, syntax, and features A treasury of expert F# techniques for practical, realworld programming

While inspired by OCaml, F# isn't just another functional programming language. Drawing on many of the strengths of both OCaml and .NET, it's a generalpurpose language ideal for realworld development. F# integrates functional, imperative, and objectoriented programming styles so you can flexibly and elegantly solve programming problems, and brings .NET development alive with interactive execution. Whatever your background, you'll find that F# is easy to learn, fun to use, and extraordinarily powerful. F# will help change the way you think about and go about programming.

Written by F#'s designer and two active contributors, Expert F# is the authoritative, comprehensive, and indepth guide to the language and its use. Designed to help others become experts, the book gives a thorough introduction to the F# language from quick essentials to indepth advanced topics such as active pattern matching, aggregate data types and operators, sequence expressions, lazy values, mutable data and sideeffects, generics, type augmentations, functional decomposition and code organization.

The second half of the book is devoted to examining the practical application of F#, providing elegant solutions to common programming tasks includinguser interfaceimplementation, data access, web and distributed programming, symbolic and numerical computations, concurrent programming, testing, profiling, and interoperability with other languages. The latest hot developments in F# and .NET are also addressed, including Active Patterns, implicit class construction, integration with LINQ over relational data, meta programming and useful tips for working with Visual Studio and F# commandline tools.

The worlds foremost experts in F# show you how to program in F# the way they do What you'll learn How to use F# for functional, imperative, and objectoriented programming How to code elegant F# solutions with expert technique and style How to develop Windows, web, graphics, and database applications in F# How to do numerical, concurrent, lexical, and symbolic processing in F# How to interoperate with C and COM Who this book is for

This book is for anyone interested in state-of-the art .NET programming. Professional programmers will find it engrossing. F# provides invaluable insight into the future of both C# and VB, which are now adopting some (but far from all) of the functional features of F#. Once they learn F#, few feel like returning to either C# or VB. The academic community will find F# the answer to a decades-long prayer: a language suitable for teaching computer science that also excites and empowers students because it can be used not just in the classroom, but also in the real world.

The ILP conference series has been the premier forum for work on logic-based approaches to machine learning for almost two decades. The 19th International Conference on Inductive Logic Programming, which was organized in Leuven, July2-4,2009, continuedthistraditionbutalsoreachedouttoothercommunities as it was colocated with SRL-2009 - the International Workshop on Statistical RelationalLearning, andMLG-2009-the7thInternationalWorkshoponMining andLearningwithGraphs. While thesethreeseriesofeventseachhavetheirown focus, emphasis andtradition, they essentiallysharethe problemthatis studied: learning about structured data in the form of graphs, relational descriptions or logic. The colocation of the events was intended to increase the interaction between the three communities. There was a single program with joint invited and tutorial speakers, a panel, regular talks and poster sessions. The invited speakers and tutorial speakers were James Cussens, Jason Eisner, Jure Leskovec, Raymond Mooney, Scott Sanner, and Philip Yu. The panel featured Karsten Borgwardt, Luc De Raedt, Pedro Domingos, Paolo Frasconi, Thomas Gart ] ner, Kristian Kersting, Stephen Muggleton, and C. David Page. Video-recordings of these talks can be found atwww. videolectures. net. The overall program featured 30 talks presented in two parallel tracks and 53 posters. The talks and posters were selected on the basis of an extended abstract. These abstracts can be found at http: // dtai. cs. kuleuven. be/ilp-mlg-srl/. Inaddition, asinpreviousyears, a- lectionofthepapersofILP2009havebeenpublishedinavolumeintheLectures Notes in Arti?cial Intelligence seriesandinaspecialissueoftheMachine Lea- ing Jou

The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently, the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of "parametrized semantics" is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose, it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalizes Wadler's analysis for lists. It is also shown how the results of abstract interpretation may be used to improve the code generation.