Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This textbook presents a systematic methodology for program development by using design recipes, i.e. a series of steps, each with a specific outcome, that takes a problem solver from a problem statement to a working and tested programmed solution. It introduces the reader to generative recursion, heuristic searching, accumulative recursion, tail recursion, iteration, mutation, loops, program correctness, and vectors. It uses video game development to make the content fun while at the same time teaching problem-solving techniques. The book is divided into four parts. Part I presents introductory material on basic problem solving and program design. It starts by reviewing the basic steps of a design recipe using structural recursion on a list. It then proceeds to review code refactoring–a common technique used to refine programs when a better or more elegant way is found to solve a problem–and introduces the reader to randomness. Next, Part II explores a new type of recursion called generative recursion. It navigates the reader through examples involving fractal image generation, efficient sorting, and efficient searching techniques such as binary, depth-first, and breadth-first search. Part III then explores a new type of recursion called accumulative (or accumulator) recursion. Examples used include finding a path in a graph, improving insertion sorting, and list-folding operations. Finally, Part IV explores mutation. To aid the reader in properly sequencing mutations it presents Hoare Logic and program correctness. In addition, it introduces vectors, vector processing, in-place operations, and circular data. Throughout the whole book complexity analysis and empirical experimentation is used to evaluate solutions. This textbook targets undergraduates at all levels as well as graduate students wishing to learn about program design. It details advanced types of recursion, a disciplined approach to the use of mutation, and illustrates the design process by developing a video game exploiting iterative refinement.

Video games --- Programming. --- Design. --- Computer games --- Computer game programming --- Game programming (Computer games) --- Computer programming --- Design --- Programming --- Software engineering. --- Computer programming. --- Software Engineering. --- Programming Techniques. --- Game Development. --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer software engineering --- Engineering

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains the selected peer-reviewed revised articles that were p- st sented at the 21 International Symposium on Implementation and Application of Functional Languages (IFL 2009). IFL 2009 was held September 23-25, 2009 at Seton Hall University in South Orange, NJ, USA. This version of the IFL symposium marked a milestone by being the ?rst ever to be held in the United States. Ourgoalsareto makeIFLaregulareventheldintheUSAandinEurope byalternatingthehostcontinenteveryyearandtofostercollaborations,inter- tions, and friendships between researchers and practitioners on both continents and beyond. The IFL symposia bring together researchers and practitioners that are actively engaged in the implementation and the use of functional and functi- based programming languages. Every year IFL provides a venue for the p- sentation and discussion of new ideas and concepts, of work in progress, and of publication-riperesults. Participantsareinvitedtosubmiteitheradraftpaperor an extended abstract describing work to be presented at the symposium. These submissions are screened by the Program Committee Chair to make sure they are within the scope of IFL. The submissions accepted for presentation appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the sym- sium, authors are given the opportunity to consider the feedback received from discussions at the symposium and are invited to submit revised, full articles to the formalreviewprocess. Therevisedsubmissionsarereviewedbythe Program Committee using prevailing academic standards, and the best submissions are chosento appearin theformalproceedings. Thisvolumeisthe resultofthework done by the IFL 2009 Program Committee and the contributing authors.

Mathematical logic --- Logic --- Computer science --- Programming --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- ontwerpen --- programmeren (informatica) --- programmeertalen --- wiskunde --- software engineering --- KI (kunstmatige intelligentie) --- robots

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the thoroughly refereed post-proceedings of the 22nd International Workshop on Implementation and Applications of Functional Languages, IFL 2011, held in Alphen aan den Rijn, The Netherlands in September 2011. The 13 revised full papers presented were carefully reviewed and were selected from 31 submissions. The IFL symposia bring together researchers and practitioners that are actively engaged in the implementation and the use of functional and function based programming languages. Every year IFL provides a venue for the presentation and discussion of new ideas and concepts, of work in progress, and of publication-ripe results.

Functional programming languages --- Engineering & Applied Sciences --- Computer Science --- Computer science. --- Computer programming. --- Software engineering. --- Programming languages (Electronic computers). --- Computer logic. --- Mathematical logic. --- Computer Science. --- Logics and Meanings of Programs. --- Programming Languages, Compilers, Interpreters. --- Software Engineering. --- Mathematical Logic and Formal Languages. --- Programming Techniques. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Computer software engineering --- Engineering --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Informatics --- Science --- Programming --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Compilers (Computer programs). --- Machine theory. --- Computer Science Logic and Foundations of Programming. --- Compilers and Interpreters. --- Formal Languages and Automata Theory. --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Recursive functions --- Robotics --- Compiling programs (Computer programs) --- Computer programs --- Programming software --- Systems software