Johan Jeuring – författare

Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example, they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities. Generic Programming comprises the edited proceedings of the Working Conference on Generic Programming, which was sponsored by the International Federation for Information Processing (IFIP) and held in Dagstuhl, Germany in July 2002. With contributions from leading researchers around the world, this volume captures the state of the art in this important emerging area.

Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example, they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities. Generic Programming comprises the edited proceedings of the Working Conference on Generic Programming, which was sponsored by the International Federation for Information Processing (IFIP) and held in Dagstuhl, Germany in July 2002. With contributions from leading researchers around the world, this volume captures the state of the art in this important emerging area.

This book constitutes the refereed proceedings of the 5th International Conference on Games and Learning Alliance, GALA 2016, held in Utrecht, The Netherlands, in December 2016.The 27 revised regular papers presented together with 14 poster papers were carefully reviewed and selected from 55 submissions. The papers cover topics such as games and sustainability; games for math and programming; games and health; games and soft skills; games and management; games and learning; game development and assessment; and mobile games.

This volume contains the notes of the lectures given at the Fourth Inter- tionalSchoolonAdvanced FunctionalProgramming,heldAugust19-24,2002,at St. Anne's College in Oxford, UK. This School was preceded by earlier ones in B? astad (1995, Sweden, LNCS 925),Olympia,WA (1996,USA, LNCS 1129),andBraga(1998,Portugal,LNCS 1608). The goal of this series of schools is to make recent developments in the area of functional programming widely available. The notes are published to enable individuals, small groups of students, and lecturers to study recent work in the rapidly developing area of functional programming. ThelecturesinthisSchoolintroducetools,languagefeatures,domain-speci?c languages, problem domains, or programming methods. All lectures are - companied by software, and all lectures contain exercises and practical assi- ments. Most of the resources can be downloaded via the website of the School: http://www.functional-programming.org/afp/afp4/. TheLectures Richard Bird and Jeremy Gibbons show how to construct a program for ari- meticcoding.Theyusethetheoryoffoldsandunfoldstodevelopbothaprogram forarithmeticcodinganddecoding,andaproofofcorrectness.Theelegantresult shows that using theory can make a di?cult proof digestible. Manuel Chakravarty and Gabriele Keller tackle the performance problem of Haskell's standard arrays. They introduce an array library with which arr- centric algorithms can be coded elegantly, which has very good performance. Koen Claessen and Colin Runciman show how to use QuickCheck to specify programpropertiesandtotestthesepropertiesonfunctionalprograms,andhow to use Hat to trace computations. The combination of the two tools which can be used to trace computations of unexpected results is a powerful debugging tool. MatthiasFelleisenexplainshowtodevelopinteractiveWebprogramsinfu- tional Scheme with continuations, using DrScheme and its built-in Web server.

This volume presents the tutorials given during the First International Spring School on Advanced Functional Programming Techniques, held in Bastad, Sweden in May 1995.The last few years have seen important new developments in functional programming techniques: concepts, such as monads, type classes, and several new special purpose libraries of higher-order functions are new and powerful methods for structuring programs. This book brings programmers, software engineers and computer scientists up-to-date with the latest techniques. Most tutorial contributions contain exercises to familiarize the reader with the new concepts and techniques, and only basic knowledge in functional programming is assumed.

This book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contributions. The volume is devoted to the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; varoius approaches to formal methods for systems design and analysis are covered.

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.

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 joint refereed proceedings of the 11th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2012, 19th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2012, 5th International Workshop on Digital Mathematics Libraries, DML 2012, 11th International Conference on Mathematical Knowledge Management, MKM 2012, Systems and Projects, held in Bremen, Germany as CICM 2012, the Conferences on Intelligent Computer Mathematics. The 13 revised full papers out of 19 submissions for MKM 2012, 6 revised full papers out of 9 submissions for Calculemus 2012, 6 revised full papers out of 8 submissions for AISC 2012, 2 revised full papers out of 3 submissions for DML 2012, and 11 revised full papers out of 12 submissions for Systems and Project track presented were carefully reviewed and selected, resulting in 38 papers from a total of 52 submissions.