DOCSLIB.ORG

Programnimg Prentice Hall International Series in Computer Science

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Programnimg Prentice Hall International Series in Computer Science Algebra of Programnimg Prentice Hall International Series in Computer Science C.A.R. Hoare, Series Editor APT., K. R., From Logic to Prolog ARNOLD, A., Finite Transition Systems ARNOLD, A. and GUESSARIAN, I., Mathematicsfor Computer Science BARR, M. and WELLS, C, Category Theoryfor Computing Science (2nd edn) BEN-ARI, M., Principles ofConcurrentand Distributed Programming BEN-ARI, M., Mathematical Logicfor Computer Science BEST, E., Semantics ofSequential and Parallel Programs BIRD, R. and de MOOR, O., The Algebra ofProgramming BIRD, R. and WADLER, P., Introduction to Functional Programming BOVET, D.P. and CRESCENZI, P., Introduction to the Theory ofComplexity de BROCK, B., Foundations ofSemantic Databases BRODA, EISENBACH, KHOSHNEVISAN and VICKERS, Reasoned Programming BRUNS, G., Distributed Systems Analysis with CCS BURKE, E. and FOXLEY, E., Logic Programming BURKE, E. and FOXLEY, E., Logic and Its Applications CLEMENT, T., Programming Language Paradigms DAHL, O.-J., Verifiable Programming DUNCAN, E., Microprocessor Programming and Software Development ELDER, J., Compiler Construction ELLIOTT, R.J. and HOARE, C.A.R. (eds), Scientific Applications ofMultiprocessors FREEMAN,T.L. and PHILLIPS, R.C.,Fara//e//VMmericfl/Algorithms GOLDSCHLAGER, L. and LISTER, A., Computer Science: A modern introduction (2nd edn) GORDON, M.J.C., Programming Language Theory and Its Implementation GRAY, P.M.D., KULKARNI, K.G. and PATON, N.W., Object-oriented Databases HAYES, I. (ed.), Specification Case Studies (2nd edn) HEHNER,E.C.R., The Logic ofProgramming HINCHEY, M.G. andBOWEN, I.V., Applications ofFormal Methods HOARE, C.A.R., Communicating Sequential Processes HOARE, C.A.R. and GORDON, M.J.C. (eds), Mechanized Reasoning and Hardware Design HOARE, C.A.R. and JONES, C.B. (eds), Essays in Computing Science HUGHES, J.G., Database Technology: A software engineering approach HUGHES, J.G., Object-oriented Databases INMOS LTD, Occam 2 Reference Manual JONES, C.B., Systematic Software Development Using VDM (2nd edn) JONES, C.B. and SHAW, R.C.F. (eds), Case Studies in Systematic Software Development JONES, G. and GOLDSMITH, M., Programming in Occam2 JONES, N.D., GOMARD, C.K. and SESTOFT, P., Partial Evaluation and Automatic Program Generatio JOSEPH, M. (ed.), Real-time Systems: Specification, verification and analysis KALDEWAIJ, A., Programming: The derivation ofalgorithms KING, P.J.B., Computer and Communications Systems Performance Modelling LALEMENT, R., Computation as Logic McCABE, F.G., Logic and Objects McCABE, F.G., High-level Programmer's Guide to the 68000 MEYER, B., Introduction to the Theory ofProgramming Languages MEYER, B., Object-oriented Software Construction MILNER, R., Communication and Concurrency MITCHELL, R., Abstract Data Types and Modula 2 MORGAN, C., Programmingfrom Specifications (2nd edn) OMONDI, A.R., ComputerArithmetic Systems PATON, COOPER, WILLIAMS and TRINDER, Database Programming Languages PEYTON JONES, S.L., The Implementation ofFunctional Programming Languages Algebra of Programming Richard Bird and Oege de Moor University of Oxford An imprint of Pearson Education Harlow, England London New York - Reading, Massachusetts * San, Francisco Toronto Don Mills, Ontario Sydney Tokyo Singapore J-Hong Kong Seoul Taipei Cape Town Madrid Mexico City Amsterdam Munich Paris Milan Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world Visit us on the World Wide Web at: http://www.pearsoneduc .com First published by Prentice Hall © Prentice Hall Europe 1997 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form, or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior permission, in writing, from the publisher. Printed and bound in Great Britain by MPG Books Ltd, Bodmin, Cornwall Library of Congress Cataloguing-in-Publication Data Available from the publisher British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library ISBN0-13-507245-X 10 98765432 04 03 02 01 00 Contents Foreword ix Preface xi Programs 1 1.1 Datatypes 1 1.2 Natural numbers 4 1.3 Lists t 7 1.4 Trees 14 1.5 Inverses 16 1.6 Polymorphic functions 18 1.7 Pointwise and point-free 19 Functions and Categories 25 2.1 Categories 25 2.2 Functors 30 2.3 Natural transformations 33 2.4 Constructing datatypes 36 2.5 Products and coproducts 38 2.6 Initial algebras 45 2.7 Type functors 49 Applications 55 3.1 Banana-split 55 3.2 Ruby triangles and Horner's rule 58 3.3 The TfiK problem - part one 62 3.4 Conditions and conditionals 66 3.5 Concatenation and currying 70 VI Relations and Allegories 81 4.1 Allegories 81 4.2 Special properties of arrows 86 4.3 Tabular allegories 91 4.4 Locally complete allegories 96 4.5 Boolean allegories 101 4.6 Power allegories 103 Datatypes in Allegories 111 5.1 Relators 111 5.2 Relational products 114 5.3 Relational coproducts 117 5.4 The power relator 119 5.5 Relational catamorphisms 121 5.6 Combinatorial functions 123 5.7 Lax natural transformations 132 Recursive Programs 137 6.1 Digits of a number 137 6.2 Least fixed points 140 6.3 Hylomorphisms 142 6.4 Fast exponentiation and modulus computation 144 6.5 Unique fixed points 146 6.6 Sorting by selection 151 6.7 Closure 157 Optimisation Problems 165 7.1 Minimum and maximum 166 7.2 Monotonic algebras 172 7.3 Planning a company party 175 7.4 Shortest paths on a cylinder 179 7.5 The security van problem 184 Thinning Algorithms 193 8.1 Thinning 193 8.2 Paths in a layered network 196 8.3 Implementing thin 199 8.4 The knapsack problem 205 8.5 The paragraph problem 207 8.6 Bitonic tours 212 Contents vn Dynamic Programming 219 9.1 Theory 220 9.2 The string edit problem 225 9.3 Optimal bracketing 230 9.4 Data compression 238 Greedy Algorithms 245 10.1 Theory 245 10.2 The detab-entab problem 246 10.3 The minimum tardiness problem 253 10.4 The T]eX problem - part two 259 Appendix 265 Bibliography 271 Index 291 Foreword It is a great pleasure and privilege to introduce this book on the Algebra of Programming as the hundredth book in the Prentice Hall International Series in Computing Science. It develops and consolidates one of the abiding and central themes of the series: it codifies the basic laws of algorithmics, and shows how they can be used to classify many ingenious and important programs into families related by the algebraic properties of their specifications. The formulae and equations that you will see here share the elegance of those which underlie physics or chemistry or any other branch of basic science; and like them, they inspire our interest, enlarge our understanding, and hold out promise of enduring benefits in application. Tony Hoare Preface Our purpose in this book is to show how to calculate programs. We describe an algebraic approach to programming, suitable both for the derivation of individual programs and for the study of programming principles in general. The programming principles we have in mind are those paradigms and strategies of program construction that form the core of the subject known as Algorithm Design. Examples of such principles include: dynamic programming, greedy algorithms, exhaustive search, and divide and conquer. The main ideas of the algebraic approach are illustrated by an extensive study of optimisation problems, conducted in Chapters 7-10. These are problems that involve finding a largest, smallest, cheapest, and so on, member of a set of possible solutions satisfying some given constraints. It is surprising how many computational problems can be specified in terms of optimising some suitable measure, even problems that do not at first sight fall into the traditional areas of combinatorial optimisation. However, the book is not primarily about optimisation problems, rather it is about one approach to solving programming problems in general. Our mathematical framework is a categorical calculus of relations. The calculus is categorical because we want to formulate algorithmic strategies without reference to specific datatypes, and relational because we need a degree of freedom in specification and proof that a calculus of functions alone would not provide. With the help of this calculus, the standard principles of algorithm design can be formulated as theorems about classes of problems whose specifications possess a particular structure. The problems are abstract in the sense that they are parameterised by one or more datatypes. These theorems say that, under appropriate conditions, a certain strategy works and leads to a particular form of abstract solution. Specific algorithms for specific problems are obtained by checking that the conditions hold and instantiating the results. The solution may take the form of a function, but more usually a relation, characterised as the solution to a certain recursive equation. The recursive equation is then refined to a recursive program that delivers a function, and the result is translated into a functional programming Xll Preface language. All the programs derived in Chapters 7-10 follow this pattern, and the popular language Gofer (Jones 1994) is used to implement the results. A categorical calculus provides not only a means for formulating algorithmic strategies abstractly, but also a smooth and integrated framework for conducting proofs. The style employed throughout the book is one of equational and inequational point-free reasoning with functions and relations. A point-free calculation is one in which the expressions under manipulation denote functions or relations, built using functional and relational composition as the basic combining form. In contrast, pointwise reasoning is reasoning conducted at the level of functional or relational application and expressed in a formalism such as the predicate calculus. The point-free style is intrinsic to a categorical approach, but is less common in proofs about programs.
Load more

Recommended publications
  • AB42.4.8 REMARKS on ABSTRACTO Leo Geurts Lambert
    AB42 p. 56 AB42.4.8 REMARKS ON ABSTRACTO Leo Geurts Lambert Meertens Mathematlsch Centrum, Amsterdam I. ABSTRACTO LIVES If an author wants to describe an algorithm, he has to choose a vehicle to express himself. The "traditional" way is to give a description in some natural language, such as English. This vehicle has some obvious drawbacks. The most striking one is that of the sloppyness of natural languages. Hill [|] gives a convincing (and hilarious) exposition of ambiguities in ordinary English, quoting many examples from actual texts for instructional or similar purposes. The problem is often not so much that of syntactical ambiguities ("You would not recognise little Johnny now. He has grown another foot.") as that of unintended possible interpretations ("How many times can you take 6 away from a million? [...] I can do this as many times as you like."). A precise and unambiguous description may require lengthy and repetitious phrases. The more precise the description, the more difficult it is to understand for many, if not most, people. Another drawback of natural languages is the inadequacy of referencing or grouping methods (the latter for lack of non-parenthetical parentheses). This tends to give rise to GOTO-like instructions. With the advent of modern computing automata, programming languages have been invented to communicate algorithms to these computers. Programming languages are almost by definition precise and unambiguous. Nevertheless, they do not provide an ideal vehicle for presenting algorithms to human beings. The reason for this is that programming languages require the specification of many details which are relevant for the computing equipment but not for the algorithm proper.
    [Show full text]
  • 301669474.Pdf
    Centrum voor Wiskunde en Informatica Centre for Mathematics and Computer Science L.G.L.T. Meertens Paramorphisms Computer Science/ Department of Algorithmics & Architecture Report CS-R9005 February Dib'I( I, 1fle.'1 Cootrumvoor ~', ;""'" ,,., tn!o.-1 Y.,'~• Am.,t,..-(,';if'! The Centre for Mathematics and Computer Science is a research institute of the Stichting Mathematisch Centrum, which was founded on February 11, 1946, as a nonprofit institution aiming at the promotion of mathematics, com­ puter science, and their applications. It is sponsored by the Dutch Govern­ ment through the Netherlands Organization for the Advancement of Research (N.W.O.). Copyright © Stichting Mathematisch Centrum, Amsterdam Paramorphisms Lambert Meertens CWI, Amsterdam, & University of Utrecht 0 Context This paper is a small contribution in the context of an ongoing effort directed towards the design of a calculus for constructing programs. Typically, the development of a program contains many parts that are quite standard, re­ quiring no invention and posing no intellectual challenge of any kind. If, as is indeed the aim, this calculus is to be usable for constructing programs by completely formal manipulation, a major concern is the amount of labour currently required for such non-challenging parts. On one level this concern can be addressed by building more or less spe­ cialised higher-level theories that can be drawn upon in a derivation, as is usual in almost all branches of mathematics, and good progress is being made here. This leaves us still with much low-level laboriousness, like admin­ istrative steps with little or no algorithmic content. Until now, the efforts in reducing the overhead in low-level formal labour have concentrated on using equational reasoning together with specialised notations to avoid the introduction of dummy variables, in particular for "canned induction" in the form of promotion properties for homomorphisms- which have turned out to be ubiquitous.
    [Show full text]
  • CWI Scanprofile/PDF/300
    Centrum voor Wiskunde en lnformatica Centre for Mathematics and Computer Science L.G.L.T. Meertens, S. Pemberton An implementation of the B programming language Department of Computer Science Note CS-N8406 June Biblioiiie.:;I( ~'~'l'i't'Hm.n<' Wi~f.i;r;de- c11 !nform;:,;i:i.C<a - Ams1errJar11 AN IMPLEMENTATION OF THE B PROGRAMMING LANGUAGE L.G.L.T. MEERTENS, S. PEMBERTON CentPe foP Mathematics and ComputeP Science~ AmstePdam Bis a new programming language designed for personal computing. We describe some of the decisions taken in implementing the language, and the problems involved. Note: B is a working title until the language is finally frozen. Then it will acquire its definitive name. The language is entirely unrelated to the predecessor of C. A version of this paper will appear in the proceedings of the Washington USENIX Conference (January 1984). 1982 CR CATEGORIES: 69D44. KEY WORDS & PHRASES: programming language implementation, progrannning envi­ ronments, B. Note CS-N8406 Centre f~r Mathematics and Computer Science P.O. Box 4079, 1009 AB Amsterdam, The Netherlands I The programming language B B is a programming language being designed and implemented at the CWI. It was originally started in 1975 in an attempt to design a language for beginners as a suitable replacement for BASIC. While the emphasis of the project has in the intervening years shifted from "beginners" to "personal computing", the main design objectives have remained the same: · • simplicity; • suitability for conversational use; • availability of tools for structured programming. The design of the language has proceeded iteratively, and the language as it now stands is the third iteration of this process.
    [Show full text]
  • Publiek Domein Laat Bedrijven Te Veel Invullen
    Steven Pemberton, software-uitvinder en bouwer aan het World wide web Publiek domein laat bedrijven te veel invullen De Brit Steven Pemberton is al sinds 1982 verbonden aan het Centrum voor Wiskunde Informatica (CWI) in Amsterdam. Ook hij is een aartsvader van het internet. Specifiek van het World wide web, waarvan hij destijds dicht bij de uitvinding zat. Steven blijft naar de toekomst kijken, nog met dezelfde fraaie idealen. C.V. 19 februari 1953 geboren te Ash, Surrey, Engeland 1972-1975 Programmeur Research Support Unit Sussex University 1975-1977 Research Programmer Manchester University 1977-1982 Docent Computerwetenschap Brighton University 1982-heden Onderzoeker aan het Centrum voor Wiskunde & Informatica (CWI) Verder: 1993–1999 Hoofdredacteur SIGCHI Bulletin en ACM Interactions 1999–2009 Voorzitter HTML en XHTML2 werkgroepen van W3C 2008-heden Voorzitter XForms werkgroep W3C The Internet Guide to Amsterdam Homepage bij het CWI Op Wikipedia 1 Foto’s: Frank Groeliken Tekst: Peter Olsthoorn Steven Pemberton laat zich thuis interviewen, op een typisch Amsterdamse plek aan de Bloemgracht, op de 6e etage van een pakhuis uit 1625 met uitzicht op de Westertoren. Hij schrijft aan een boek, een voortzetting van zijn jaarlijkse lezing in Pakhuis de Zwijger, met in 2011 The Computer as Extended Phenotype (Computers, Genes and You) als titel. Wat is je thema? “De invloed van hard- en software op de maatschappij, vanuit de nieuwe technologie bezien. ‘Fenotype’ gaat over computers als product van onze genen, als een onderdeel van de evolutie. Je kunt de aanwas van succesvolle genen zien als een vorm van leren, of een vorm van geheugen.
    [Show full text]
  • Ezért Érdemes Pythonban Fejleszteni Dr.Guta Gábor
    Ezért érdemes Pythonban fejleszteni Dr.Guta Gábor http://axonmatics.com Mennyire népszerű? index/ (7) - Forrás: https://www.tiobe.com/tiobe Forrás: 2019 (C) Axonmatics Ltd. - Air Quality Monitoring and Control for a Confidential Healthier City http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? Az ABC nyelv elveinek a továbbgondolása: • Egyszerű, python • Kompakt, - • Strukturált, • Kifejező, • Egységes, • Magas-szintű, https://freesvg.org/happy : • Egyértelmű, Forrás • Interaktív (Adaptálva: Leo Geurts, Lambert Meertens, and Steven Pemberton: The ABC Programmer's Handbook) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? (folyt.) Hatékonyság: • Megvalósítandó feladat/ráfordított idő python - • Átlagos commit méret (KLOC-ban) Elérhetőség: https://freesvg.org/happy • Eszköz támogatás : • Oktató anyag/dokumentáció Forrás • Képzett emberek http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért lehet utálni? mouth • Formázás (tabulálás) - • Nincs típusosság (de, van) • Nem olyan mint a megszokott/kedvenc programozási nyelv http://www.peakpx.com/5335/python • Lassú (általában ez nem gond, Forrás: de orvosolható) (Környezetemben hangzottak el) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Kik használják a nagyvilágban? • Web oldalak: Instagram, YouTube, Printest, Prezi… “Python where we • Cégek: Dropbox, Google, can, C++ where Bloomberg, Spotify… we must.” • Alkalmazások: Gedit, yum, Home Assistant, Cura… http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Mire használják a nagyvilágban? 2019/python/ Fejlesztők
    [Show full text]
  • Bibliography 161
    160 Biblio graphy [1] C. J. Aarts, R. C. Backhouse, P. Ho ogendijk, T. S. Vo ermans, and J. van der Woude, ARelational Theory of Datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub/math.prog.construction, Eindhoven University of Technology 1992. [2] H. Abrahamson and V. Dahl, Logic Grammars. Springer-Verlag 1989. [3] Peter Aczel, An introduction to Inductive De nitions. In: Handb o ok of Mathematical Logic (ed. Jon Barwise), North Holland 1977, pp. 739{782. [4] Peter Aczel, Non-wel l-founded Sets. CSLI Lecture Notes no. 14, Stanford 1988. [5] Roland Backhouse, Paul Chisholm, Grant Malcolm, and Erik Saaman, Do-it-yourself type theory. Formal Asp ects of Computing 1 (1989), pp. 19{84. [6] R.C. Backhouse, On a Relation on Functions. In: Beauty Is Our Business|A Birthday Salute to Edsger W. Dijkstra (ed. W.H.J. Feijen e.a.), Springer Verlag 1990, pp. 7{18. [7] R.C. Backhouse, P.J. de Bruin, G.R. Malcolm, T.S. Vo ermans, and J.C.S.P. van der Woude, Relational catamorphisms. In: Constructing Programs From Sp eci cations, North Holland 1991, pp. 287{318. [8] Roland Backhouse and Henk Do ornb os, Mathematical Induction Made Calculational. CS- rep ort 94-16, Eindhoven University of Technology 1994. [9] E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott, Functorial Polymorphism. Theo- retical Computer Science 70 (1990), pp. 35{64. [10] Erik Barendsen and Marc Bezem, Bar Recursion versus Polymorphism.Technical Rep ort 81, Utrecht Research Institute for Philosophy, Utrecht University 1991.
    [Show full text]
  • (Pdf) of the School of Squiggol: a History of the Bird−Meertens
    The School of Squiggol A History of the Bird{Meertens Formalism Jeremy Gibbons University of Oxford Abstract. The Bird{Meertens Formalism, colloquially known as \Squig- gol", is a calculus for program transformation by equational reasoning in a function style, developed by Richard Bird and Lambert Meertens and other members of IFIP Working Group 2.1 for about two decades from the mid 1970s. One particular characteristic of the development of the Formalism is fluctuating emphasis on novel `squiggly' notation: sometimes favouring notational exploration in the quest for conciseness and precision, and sometimes reverting to simpler and more rigid nota- tional conventions in the interests of accessibility. This paper explores that historical ebb and flow. 1 Introduction In 1962, IFIP formed Working Group 2.1 to design a successor to the seminal algorithmic language Algol 60 [4]. WG2.1 eventually produced the specification for Algol 68 [63, 64]|a sophisticated language, presented using an elaborate two- level description notation, which received a mixed reception. WG2.1 continues to this day; technically, it retains responsibility for the Algol languages, but practi- cally it takes on a broader remit under the current name Algorithmic Languages and Calculi. Over the years, the Group has been through periods of focus and periods of diversity. But after the Algol 68 project, the period of sharpest focus covered the two decades from the mid 1970s to the early 1990s, when what later became known as the Bird{Meertens Formalism (BMF) drew the whole group together again. It is the story of those years that is the subject of this paper.
    [Show full text]
  • Bitonic Sort on Ultracomputers by Lambert Meertens† Ultracomputer
    Bitonic Sort on Ultracomputers by Lambert Meertens† Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor New York, NY 10003 Ultracomputer Note #1 March, 1979 † Matematisch Centrum, Amsterdam ABSTRACT Batcher’s bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sort- ing n inputs in !((log n)2) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time !(n(log n)2). The method can also be adapted to ultracomputers (Schwartz [1979]) to exploit their high degree of parallelism. The resulting algorithm will take time !((log N)2) for ultracomputers of ‘‘size’’ N. The im- plicit constant factor is low, so that even for moderate values of N the ultracomputer ar- chitecture performs faster than the !(N log N) time conventional architecture can achieve. The purpose of this note is to describe the adapted algorithm. After some preliminaries a first version of the algorithm is given whose correctness is easily shown. Next, this algorithm is transformed to make it suitable for an ultracomputer. 1. Introduction Batcher’s bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in !((log n)2) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time !(n(log n)2). The method can also be adapted to ultracomputers (Schwartz [1979]) to exploit their high degree of parallelism. The resulting algorithm will take time !((log N)2) for ultracomputers of ‘‘size’’ N. The implicit constant factor is low, so that even for moderate values of N the ultracomputer architecture performs faster than the !(N log N) time conventional architecture can achieve.
    [Show full text]
  • JAVA 277 James Gosling Power Or Simplicity 278 a Matter of Taste 281 Concurrency 285 Designing a Language 287 Feedback Loop 291
    Download at Boykma.Com Masterminds of Programming Edited by Federico Biancuzzi and Shane Warden Beijing • Cambridge • Farnham • Köln • Sebastopol • Taipei • Tokyo Download at Boykma.Com Masterminds of Programming Edited by Federico Biancuzzi and Shane Warden Copyright © 2009 Federico Biancuzzi and Shane Warden. All rights reserved. Printed in the United States of America. Published by O’Reilly Media, Inc. 1005 Gravenstein Highway North, Sebastopol, CA 95472 O’Reilly books may be purchased for educational, business, or sales promotional use. Online editions are also available for most titles (safari.oreilly.com). For more information, contact our corporate/institutional sales department: (800) 998-9938 or [email protected]. Editor: Andy Oram Proofreader: Nancy Kotary Production Editor: Rachel Monaghan Cover Designer: Monica Kamsvaag Indexer: Angela Howard Interior Designer: Marcia Friedman Printing History: March 2009: First Edition. The O’Reilly logo is a registered trademark of O’Reilly Media, Inc. Masterminds of Programming and related trade dress are trademarks of O’Reilly Media, Inc. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and O’Reilly Media, Inc. was aware of a trademark claim, the designations have been printed in caps or initial caps. While every precaution has been taken in the preparation of this book, the publisher and authors assume no responsibility for errors or omissions, or for damages resulting from the use of the information contained herein. ISBN: 978-0-596-51517-1 [V] Download at Boykma.Com CONTENTS FOREWORD vii PREFACE ix 1 C++ 1 Bjarne Stroustrup Design Decisions 2 Using the Language 6 OOP and Concurrency 9 Future 13 Teaching 16 2 PYTHON 19 Guido von Rossum The Pythonic Way 20 The Good Programmer 27 Multiple Pythons 32 Expedients and Experience 37 3 APL 43 Adin D.
    [Show full text]
  • University of Groningen Inductive Types in Constructive Languages
    University of Groningen Inductive types in constructive languages Bruin, Peter Johan de IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Document Version Publisher's PDF, also known as Version of record Publication date: 1995 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Bruin, P. J. D. (1995). Inductive types in constructive languages. s.n. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 25-09-2021 160 Bibliography [1] C. J. Aarts, R. C. Backhouse, P. Hoogendijk, T. S. Voermans, and J. van der Woude, A Relational Theory of Datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub/math.prog.construction, Eindhoven University of Technology 1992. 12 [2] H. Abrahamson and V. Dahl, Logic Grammars. Springer-Verlag 1989. 19 [3] Peter Aczel, An introduction to Inductive Definitions. In: Handbook of Mathematical Logic (ed.
    [Show full text]
  • An Introduction to the Theories of Bulk Data Types
    An introduction to the theories of bulk data types Simon Dobson Informatics Department Rutherford Appleton Laboratory This note summarises my understanding to date of two closely-related theories for dealing with “bulk” data types: the Bird-Meertens formalism (henceforth abbreviated to BMF) and its extension in categorical data types (CDT). I've been led to this study for two reasons: as interesting formalisms for program derivation in their own right, and as a possible basis for defining useful operations for shared abstract data types. In this note I cover all the essential ideas I've found so far, and include a bibliography of the theories. Overview BMF is a theory of program synthesis in which functions are evolved from abstract specifications using a small number of higher-order constructs. Functions are expressed as combinations of functions over data structures, avoiding the explicit use of recursion. This both simplifies proofs of correctness and allows the possibility for efficient (possibly parallel) implementation of the combination operators over a range of data types. A small-scale theory leads to potentially large-scale applications. The theory does not, however, start from a standpoint of immediate mechanisation. To do so, in Bird and Meertens' view, would severely limit the many ways in which an algorithm may be evolved. There is a wonderful quote in [10]: “...we must abandon our fixation on efficiency if algorithmics [Meertens' name for programming as a mathematical activity] is to enjoy a fruitful development. In general, developing an efficient algorithm will require that we first understand the problem, and for this we need simple algorithmic expressions; but to simplify an expression we have to shed our old habits.” so BMF does not initially worry about the efficiency of functions: instead it makes the concise expression of algorithms possible whilst holding out the possibility for verifiable transformations to improve efficiency.
    [Show full text]
  • Towards a Ml Extension with Refinement : a Semantic Issue
    L R I TOWARDS A ML EXTENSION WITH REFINEMENT : A SEMANTIC ISSUE SIGNOLES J Unité Mixte de Recherche 8623 CNRS-Université Paris Sud – LRI 03/2006 Rapport de Recherche N° 1440 CNRS – Université de Paris Sud Centre d’Orsay LABORATOIRE DE RECHERCHE EN INFORMATIQUE Bâtiment 490 91405 ORSAY Cedex (France) Towards a ML Extension with Refinement: a Semantic Issue Julien Signoles PCRI — LRI (CNRS UMR 8623), LIX, INRIA Futurs Universit´eParis-Sud, 91405 Orsay Cedex, France, [email protected] Abstract. Refinement is a method to derive correct programs from specifications. A rich type language is another way to ensure program correctness. In this paper, we propose a wide-spectrum language mix- ing both approaches for the ML language. Mainly, base types are simply included into expressions, introducing underdeterminism and dependent types. We focus on the semantic aspects of such a language. We study three different semantics: a denotational, a deterministic operational and a nondeterministic operational semantics. We prove their equivalence. We show that this language is a conservative extension of ML. 1 Introduction Refinement Programming by refinement consists of getting an executable pro- gram from an original abstract specification by an unbounded sequence of cor- rectness preservation refinements. This programming paradigm, called stepwise refinement, comes from the writings of Dijkstra [10] and Wirth [22]. One of the main ideas of refinement is: as the refinement steps can be as small as wanted, correctness preserving is easy to establish. Another characteristic of refinement comes from the fact that it is piecewise: a large specification may be refined one piece at a time, each piece in an independent manner.
    [Show full text]