Bruce A. Tate — «Seven More Languages in Seven Weeks

Total Page:16

File Type:pdf, Size:1020Kb

Bruce A. Tate — «Seven More Languages in Seven Weeks Early praise for Seven More Languages in Seven Weeks I’m tired of learning new programming languages and thought seven additional somewhat esoteric languages wouldn’t be very useful. I couldn’t have been more wrong. I loved it. The languages were suitably interesting and compellingly pre- sented, and I now want to experiment with them. ➤ Brian Sletten President, Bosatsu Consulting, Inc. Languages are not just new syntax, they are new ways of thinking about problems. What is the best way to think about user interfaces or scientific computing or distributed systems or safety guarantees? As you dive into each of the languages in this book you will get a glimpse of new abstractions and principles that will help you write better programs in any language. Do it! ➤ Evan Czaplicki Creator of Elm, Prezi If you think reading a book about programming languages won’t change your thinking about programming, I dare you to read the chapter on Idris—unless the idea of reasoning about your C++ (or C# or Java) code more clearly and reducing hundreds or thousands of lines of code down to two is not appealing to you, of course. ➤ Ted Neward Author, speaker, mentor, Neward and Associates, LLC Just as an artist’s choice of oil, acrylic, or watercolor paint constrains the range of effects they can achieve, the languages we choose constrain the programs we can write. Learning a new language enables you to both conceive new solutions and express them in new ways. Read this book to add seven particularly interesting languages to your repertoire. ➤ Paul Butcher Author of Seven Concurrency Models in Seven Weeks Seven More Languages in Seven Weeks is a well-paced introduction to a set of fascinating languages that will be new to many. This one goes at just the right tempo and provides enough detail to be useful—but not so much as to douse natural curiosity. Definitely a book I would recommend to others wanting to expand their programming horizons. ➤ Matthew Wild Author, Prosody IM XMPP server Seven More Languages in Seven Weeks not only introduces us to a wide spectrum of languages, but also challenges us on how we think about language use and design. Software development is a demanding career and learning new languages will always be essential. That is why the Seven in Seven series is one of the most invaluable reads for any serious programmer. ➤ Daniel Hinojosa Developer, speaker, instructor, author of Testing in Scala Seven More Languages in Seven Weeks Languages That Are Shaping the Future Bruce A. Tate Fred Daoud Ian Dees Jack Moffitt The Pragmatic Bookshelf Dallas, Texas • Raleigh, North Carolina 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 The Pragmatic Programmers, LLC was aware of a trademark claim, the designations have been printed in initial capital letters or in all capitals. The Pragmatic Starter Kit, The Pragmatic Programmer, Pragmatic Programming, Pragmatic Bookshelf, PragProg and the linking g device are trade- marks of The Pragmatic Programmers, LLC. Every precaution was taken in the preparation of this book. However, the publisher assumes no responsibility for errors or omissions, or for damages that may result from the use of information (including program listings) contained herein. Our Pragmatic courses, workshops, and other products can help you and your team create better software and have more fun. For more information, as well as the latest Pragmatic titles, please visit us at https://pragprog.com. The team that produced this book includes: Jacquelyn Carter (editor) Potomac Indexing, LLC (index) Liz Welch (copyedit) Dave Thomas (layout) Janet Furlow (producer) Ellie Callahan (support) For international rights, please contact [email protected]. Copyright © 2014 The Pragmatic Programmers, LLC. 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 the prior consent of the publisher. Printed in the United States of America. ISBN-13: 978-1-941222-15-7 Encoded using the finest acid-free high-entropy binary digits. Book version: P2.0—November 2015 Contents Foreword .............vii Acknowledgments ...........ix Introduction .............xv 1. Lua ...............1 Day 1: The Call to Adventure 2 Day 2: Tables All the Way Down 14 Day 3: Lua and the World 32 Wrapping Up Lua 47 2. Factor ..............49 Day 1: Stack On, Stack Off 50 Day 2: Painting the Fence 61 Day 3: Balancing on a Boat 73 Wrapping Up Factor 86 3. Elm ...............89 Day 1: Handling the Basics 90 Day 2: Taming Callbacks 100 Day 3: It’s All a Game 111 Wrapping Up Elm 123 4. Elixir ..............125 Day 1: Laying a Great Foundation 126 Day 2: Controlling Mutations 142 Day 3: Spawning and Respawning 158 Wrapping Up Elixir 167 5. Julia ..............171 Day 1: Resistance Is Futile 172 Day 2: Getting Assimilated 183 Contents • vi Day 3: Become One with Julia 195 Wrapping Up Julia 206 6. miniKanren ............209 Day 1: Unified Theories of Code 210 Day 2: Mixing the Logical and Functional 220 Day 3: Writing Stories with Logic 228 Wrapping Up miniKanren 240 7. Idris ..............243 Day 1: The Basics 244 Day 2: Getting Started With Dependent Types 253 Day 3: Dependent Types in Action 262 Wrapping Up Idris 274 8. Wrapping Up ............277 The Origins 277 The Central Expressway 279 The Frontier 281 The Dirty Map 282 A Final Challenge 284 Bibliography ............285 Index ..............287 Foreword Back in 2010, I was deeply troubled. The growing list of difficulties in writing concurrent software was nagging at me. The tools I had at hand were clunky, and none of them provided a mental model that helped me reason about the problems I was facing. I decided it was time for a change. However, out of the hundreds of programming languages out there, how could I possibly find one that fit my criteria? How could I even filter this huge set into a smaller one that I could explore in more detail? Then I found that someone had decided to tell the exact story I wanted to hear: Bruce Tate had just written Seven Languages in Seven Weeks, which explored Ruby, Io, Prolog, Erlang, Scala, Clojure, and Haskell. I was familiar with many of the languages in Seven Languages in Seven Weeks but the book did more than just introduce programming language constructs. It introduced their philosophy, community, and thinking models. To me, the book was telling a story about concurrency, and as I read the book, a very clear picture about immutability, threads, futures, actors, software transac- tional memory, and more was being painted. Once I finished the book, I knew exactly which languages and paradigms I wanted to explore next. I bought a heap of books about Erlang, Clojure, and Haskell and I also started writing code right away. Months later, though, I still hadn’t found one language that fit all my criteria. I wanted the robustness and distribution of the Erlang VM, but I also wanted the metaprogramming and polymorphism from Clojure alongside a syntax I was comfortable with. That’s when I decided to create the Elixir programming language that runs on the Erlang virtual machine. Now, four years later, Elixir is one of the languages covered in Seven More Languages in Seven Weeks. report erratum • discuss Foreword • viii The interesting thing is that the first book was not a story about concurrency but that’s how I read it. Seven Languages in Seven Weeks, as any other excellent book, gives space for the reader to include her own experiences as part of the story, allowing each reader to learn different lessons and, in this particular case, choose other languages to explore next. This is what makes Seven More Languages in Seven Weeks even more ambi- tious. Many of the languages in the book are relatively new and in active development, which brings a whole new range of ideas and lessons to be learned. It also opens up the possibility for readers to pick their next languages and not only master them but become part of the language development itself. Seven Languages in Seven Weeks had a deep impact on my programming career, and I am certain reading this book will do the same for yours. And remember: Reading Seven More Languages in Seven Weeks is just the start of a journey. José Valim Creator of Elixir report erratum • discuss Acknowledgments We’d like to make a deal with you. If you haven’t already programmed your virtual video recorder to skip this page, we’ll try to make it interesting and entertaining. The names on this page deserve to be read. Many of them are shaping the way we all think about programming, and still others put in the tireless, thankless work to make this book worth reading. If each chapter of a Seven Languages book is some kind of a metaphor, which movie character should we curse with acknowledgments? Perhaps we’ll serve up some form of Bill Murray. Is it Bill Murray in Groundhog Day, where each book shows you the same chapter with only slight variations of words but a same dreariness in sentiment and tone? Or maybe we’ll plod gracelessly unaware into your thoughts uninvited, like Bill in What About Bob? We’ve hidden several Bill Murray movie references in this chapter. See how many you can find. The Languages The stars of this show are the seven programming languages. Each of them has a role to play in exercising the poltergeists that haunt our current dusty mental motels.
Recommended publications
  • What If What I Need Is Not in Powerai (Yet)? What You Need to Know to Build from Scratch?
    IBM Systems What if what I need is not in PowerAI (yet)? What you need to know to build from scratch? Jean-Armand Broyelle June 2018 IBM Systems – Cognitive Era Things to consider when you have to rebuild a framework © 2017 International Business Machines Corporation 2 IBM Systems – Cognitive Era CUDA Downloads © 2017 International Business Machines Corporation 3 IBM Systems – Cognitive Era CUDA 8 – under Legacy Releases © 2017 International Business Machines Corporation 4 IBM Systems – Cognitive Era CUDA 8 Install Steps © 2017 International Business Machines Corporation 5 IBM Systems – Cognitive Era cuDNN and NVIDIA drivers © 2017 International Business Machines Corporation 6 IBM Systems – Cognitive Era cuDNN v6.0 for CUDA 8.0 © 2017 International Business Machines Corporation 7 IBM Systems – Cognitive Era cuDNN and NVIDIA drivers © 2017 International Business Machines Corporation 8 IBM Systems – Cognitive Era © 2017 International Business Machines Corporation 9 IBM Systems – Cognitive Era © 2017 International Business Machines Corporation 10 IBM Systems – Cognitive Era cuDNN and NVIDIA drivers © 2017 International Business Machines Corporation 11 IBM Systems – Cognitive Era Prepare your environment • When something goes wrong it’s better to Remove local anaconda installation $ cd ~; rm –rf anaconda2 .conda • Reinstall anaconda $ cd /tmp; wget https://repo.anaconda.com/archive/Anaconda2-5.1.0-Linux- ppc64le.sh $ bash /tmp/Anaconda2-5.1.0-Linux-ppc64le.sh • Activate PowerAI $ source /opt/DL/tensorflow/bin/tensorflow-activate • When you
    [Show full text]
  • The Machine That Builds Itself: How the Strengths of Lisp Family
    Khomtchouk et al. OPINION NOTE The Machine that Builds Itself: How the Strengths of Lisp Family Languages Facilitate Building Complex and Flexible Bioinformatic Models Bohdan B. Khomtchouk1*, Edmund Weitz2 and Claes Wahlestedt1 *Correspondence: [email protected] Abstract 1Center for Therapeutic Innovation and Department of We address the need for expanding the presence of the Lisp family of Psychiatry and Behavioral programming languages in bioinformatics and computational biology research. Sciences, University of Miami Languages of this family, like Common Lisp, Scheme, or Clojure, facilitate the Miller School of Medicine, 1120 NW 14th ST, Miami, FL, USA creation of powerful and flexible software models that are required for complex 33136 and rapidly evolving domains like biology. We will point out several important key Full list of author information is features that distinguish languages of the Lisp family from other programming available at the end of the article languages and we will explain how these features can aid researchers in becoming more productive and creating better code. We will also show how these features make these languages ideal tools for artificial intelligence and machine learning applications. We will specifically stress the advantages of domain-specific languages (DSL): languages which are specialized to a particular area and thus not only facilitate easier research problem formulation, but also aid in the establishment of standards and best programming practices as applied to the specific research field at hand. DSLs are particularly easy to build in Common Lisp, the most comprehensive Lisp dialect, which is commonly referred to as the “programmable programming language.” We are convinced that Lisp grants programmers unprecedented power to build increasingly sophisticated artificial intelligence systems that may ultimately transform machine learning and AI research in bioinformatics and computational biology.
    [Show full text]
  • Luarocks Fostering an Ecosystem of Lua Modules
    LuaRocks fostering an ecosystem of Lua modules Hisham Muhammad [email protected] @hisham_hm FOSDEM !"# $russels% $elgium &hat is LuaRocks 'ackage manager... like d(kg (a(t*get+% RPM% etc. like Ruby-ems, Python eggs, npm% C'/0% etc. ...for Lua e1tension modules written in Lua (.lua files) or ,inary modules (.so4.dll files) Fostering an ecosystem of Lua modules Some uni5ue challenges ...related to Lua as a language ...related to Lua as a community Lessons learned ...on building an ecosystem / one*slide introduction to Lua function process(filename, fn, ...) local f = io.open(filename) local rets = {} for line in f:lines() do rets[#rets+1] = { fn(line, ...) } end f:close() return rets end matches = process("file.txt", string.find, "foo") for i, match in ipairs(matches) do print(i, table.concat(match, ", ")) end / one*slide introduction to Lua function process(filename, fn, ...) local f = io.open(filename) local rets = {} o,6ects for line in f:lines() do rets[#rets+1] = { fn(line, ...) } end f:close() return rets end matches = process("file.txt", string.find, "foo") for i, match in ipairs(matches) do print(i, table.concat(match, ", ")) end / one*slide introduction to Lua function process(filename, fn, ...) local f = io.open(filename) local rets = {} for line in f:lines() do rets[#rets+1] = { fn(line, ...) } end f:close() return rets 3rst*class functions end matches = process("file.txt", string.find, "foo") for i, match in ipairs(matches) do print(i, table.concat(match, ", ")) end / one*slide introduction to Lua function process(filename, fn, ...)
    [Show full text]
  • Tarantool Выпуск 1.7.2
    Tarantool Выпуск 1.7.2 мар. 14, 2019 Оглавление 1 Что нового? 1 1.1 Что нового в Tarantool 1.7?....................................1 2 Общие сведения 2 2.1 Сервер приложений + СУБД...................................2 2.2 Возможности СУБД........................................3 3 Практикум 5 3.1 Практические задания на Lua..................................5 3.2 Практическое задание на C.................................... 17 4 Руководство пользователя 21 4.1 Предисловие............................................. 21 4.2 Начало работы........................................... 22 4.3 Функционал СУБД......................................... 25 4.4 Сервер приложений........................................ 58 4.5 Администрирование серверной части.............................. 72 4.6 Коннекторы............................................. 108 4.7 Вопросы и ответы......................................... 120 5 Справочники 121 5.1 Справочник по встроенной библиотеке............................. 121 5.2 Справочник по сторонним библиотекам............................. 228 5.3 Справочник по настройке..................................... 247 6 Руководство участника проекта 257 6.1 Справочник по C API....................................... 257 6.2 Детали реализации......................................... 280 6.3 Сборка и участие в проекте.................................... 293 6.4 Соглашения по разработке.................................... 298 Lua Module Index 329 i ГЛАВА 1 Что нового? Здесь собрана информация о существенных изменениях, которые
    [Show full text]
  • Exploratory Programming for the Arts and Humanities
    Exploratory Programming for the Arts and Humanities Exploratory Programming for the Arts and Humanities Second Edition Nick Montfort The MIT Press Cambridge, Massachusetts London, England © 2021 Nick Montfort The open access edition of this work was made possible by generous funding from the MIT Libraries. This work is subject to a Creative Commons CC-BY-NC-SA license. Subject to such license, all rights are reserved. This book was set in ITC Stone Serif Std and ITC Stone Sans Std by New Best-set Typesetters Ltd. Library of Congress Cataloging-in-Publication Data Names: Montfort, Nick, author. Title: Exploratory programming for the arts and humanities / Nick Montfort. Description: Second edition. | Cambridge, Massachusetts : The MIT Press, [2021] | Includes bibliographical references and index. | Summary: "Exploratory Programming for the Arts and Humanities offers a course on programming without prerequisites. It covers both the essentials of computing and the main areas in which computing applies to the arts and humanities"—Provided by publisher. Identifiers: LCCN 2019059151 | ISBN 9780262044608 (hardcover) Subjects: LCSH: Computer programming. | Digital humanities. Classification: LCC QA76.6 .M664 2021 | DDC 005.1—dc23 LC record available at https://lccn.loc.gov/2019059151 10 9 8 7 6 5 4 3 2 1 [Contents] [List of Figures] xv [Acknowledgments] xvii [1] Introduction 1 [1.1] 1 [1.2] Exploration versus Exploitation 4 [1.3] A Justification for Learning to Program? 6 [1.4] Creative Computing and Programming as Inquiry 7 [1.5] Programming Breakthroughs
    [Show full text]
  • From JSON to JSEN Through Virtual Languages of the Creative Commons Attribution License (
    © 2021 by the authors; licensee RonPub, Lübeck, Germany. This article is an open access article distributed under the terms and conditions A.of Ceravola, the Creative F. Joublin:Commons From Attribution JSON to license JSEN through(http://c reativecommons.org/licenses/by/4Virtual Languages .0/). Open Access Open Journal of Web Technology (OJWT) Volume 8, Issue 1, 2021 www.ronpub.com/ojwt ISSN 2199-188X From JSON to JSEN through Virtual Languages Antonello Ceravola, Frank Joublin Honda Research Institute Europe GmbH, Carl Legien Str. 30, Offenbach/Main, Germany, {Antonello.Ceravola, Frank.Joublin}@honda-ri.de ABSTRACT In this paper we describe a data format suitable for storing and manipulating executable language statements that can be used for exchanging/storing programs, executing them concurrently and extending homoiconicity of the hosting language. We call it JSEN, JavaScript Executable Notation, which represents the counterpart of JSON, JavaScript Object Notation. JSON and JSEN complement each other. The former is a data format for storing and representing objects and data, while the latter has been created for exchanging/storing/executing and manipulating statements of programs. The two formats, JSON and JSEN, share some common properties, reviewed in this paper with a more extensive analysis on what the JSEN data format can provide. JSEN extends homoiconicity of the hosting language (in our case JavaScript), giving the possibility to manipulate programs in a finer grain manner than what is currently possible. This property makes definition of virtual languages (or DSL) simple and straightforward. Moreover, JSEN provides a base for implementing a type of concurrent multitasking for a single-threaded language like JavaScript.
    [Show full text]
  • The Semantics of Syntax Applying Denotational Semantics to Hygienic Macro Systems
    The Semantics of Syntax Applying Denotational Semantics to Hygienic Macro Systems Neelakantan R. Krishnaswami University of Birmingham <[email protected]> 1. Introduction body of a macro definition do not interfere with names oc- Typically, when semanticists hear the words “Scheme” or curring in the macro’s arguments. Consider this definition of and “Lisp”, what comes to mind is “untyped lambda calculus a short-circuiting operator: plus higher-order state and first-class control”. Given our (define-syntax and typical concerns, this seems to be the essence of Scheme: it (syntax-rules () is a dynamically typed applied lambda calculus that sup- ((and e1 e2) (let ((tmp e1)) ports mutable data and exposes first-class continuations to (if tmp the programmer. These features expose a complete com- e2 putational substrate to programmers so elegant that it can tmp))))) even be characterized mathematically; every monadically- representable effect can be implemented with state and first- In this definition, even if the variable tmp occurs freely class control [4]. in e2, it will not be in the scope of the variable definition However, these days even mundane languages like Java in the body of the and macro. As a result, it is important to support higher-order functions and state. So from the point interpret the body of the macro not merely as a piece of raw of view of a working programmer, the most distinctive fea- syntax, but as an alpha-equivalence class. ture of Scheme is something quite different – its support for 2.2 Open Recursion macros. The intuitive explanation is that a macro is a way of defining rewrites on abstract syntax trees.
    [Show full text]
  • Conda-Build Documentation Release 3.21.5+15.G174ed200.Dirty
    conda-build Documentation Release 3.21.5+15.g174ed200.dirty Anaconda, Inc. Sep 27, 2021 CONTENTS 1 Installing and updating conda-build3 2 Concepts 5 3 User guide 17 4 Resources 49 5 Release notes 115 Index 127 i ii conda-build Documentation, Release 3.21.5+15.g174ed200.dirty Conda-build contains commands and tools to use conda to build your own packages. It also provides helpful tools to constrain or pin versions in recipes. Building a conda package requires installing conda-build and creating a conda recipe. You then use the conda build command to build the conda package from the conda recipe. You can build conda packages from a variety of source code projects, most notably Python. For help packing a Python project, see the Setuptools documentation. OPTIONAL: If you are planning to upload your packages to Anaconda Cloud, you will need an Anaconda Cloud account and client. CONTENTS 1 conda-build Documentation, Release 3.21.5+15.g174ed200.dirty 2 CONTENTS CHAPTER ONE INSTALLING AND UPDATING CONDA-BUILD To enable building conda packages: • install conda • install conda-build • update conda and conda-build 1.1 Installing conda-build To install conda-build, in your terminal window or an Anaconda Prompt, run: conda install conda-build 1.2 Updating conda and conda-build Keep your versions of conda and conda-build up to date to take advantage of bug fixes and new features. To update conda and conda-build, in your terminal window or an Anaconda Prompt, run: conda update conda conda update conda-build For release notes, see the conda-build GitHub page.
    [Show full text]
  • The Open Source Way 2.0
    THE OPEN SOURCE WAY 2.0 Contributors Version 2.0, 2020-12-16: This release contains opinions Table of Contents Presenting the Open Source Way . 2 The Shape of Things (I.e., Assumptions We Are Making) . 2 Structure of This Guide. 4 A Community of Practice Always Rebuilding Itself . 5 Getting Started. 6 Community 101: Understanding, Joining, or Forming a New Community . 6 New Project Checklist . 14 Creating an Open Source Product Strategy . 16 Attracting Users . 19 Communication Norms in Open Source Software Projects . 20 To Build Diverse Open Source Communities, Make Them Inclusive First . 36 Guiding Participants . 48 Why Do People Participate in Open Source Communities?. 48 Growing Contributors . 52 From Users to Contributors. 52 What Is a Contribution? . 58 Essentials of Building a Community . 59 Onboarding . 66 Creating a Culture of Mentorship . 71 Project and Community Governance . 78 Community Roles . 97 Community Manager Self-Care . 103 Measuring Success . 122 Defining Healthy Communities . 123 Understanding Community Metrics . 136 Announcing Software Releases . 144 Contributors . 148 Chapters writers. 148 Project teams. 149 This guidebook is available in HTML single page and PDF. Bugs (mistakes, comments, etc.) with this release may be filed as an issue in our repo on GitHub. You are also welcome to bring it as a discussion to our forum/mailing list. 1 Presenting the Open Source Way An English idiom says, "There is a method to my madness."[1] Most of the time, the things we do make absolutely no sense to outside observers. Out of context, they look like sheer madness. But for those inside that messiness—inside that whirlwind of activity—there’s a certain regularity, a certain predictability, and a certain motive.
    [Show full text]
  • Luarocks Past, Present and Future
    LuaRocks past, present and future Hisham Muhammad Prologue: what is LuaRocks? ● A package manager for Lua modules ● Modules written in Lua (.lua), binary Lua modules (.so/.dll) and Lua scripts ● Usual features you would expect from a package manager ○ luarocks install <module> ○ luarocks remove <module> ○ ... Rocks and rockspecs ● Rock: a LuaRocks package ○ archive files (actually .zip files) ○ *.src.rock - contains source code ○ *.win32-x86.rock - “binary rock”, contains compiled binaries for a given platform ● Rockspec: a package specification file ○ A declarative Lua script, with rules on how to build and package rocks ○ *.rockspec - a Lua file containing some tables A rockspec Part I The past: a short history of LuaRocks Origins ● Kepler Project: research project to develop a platform for web development using Lua ○ combining modules that already existed (LuaSocket, CGILua) and adding the missing pieces ○ For more of the story, read Yuri Takhteyev’s book, “Coding Places” :) ● I started (re)writing Unix makefiles to automate the packaging/install process ● Common patterns emerged LuaRocks 0.x-1.x: a bumpy start ● 0.x was a gradual evolution ○ the goal for 1.0 was for it to be able to build all Kepler modules ● The rockspec format is unchanged since 1.0 ○ We really care about compatibility ○ Learning the format and writing a rockspec are not disposable efforts ● We got many things right, but we also got some of them wrong... Annoyances in LuaRocks 1.x ● LuaRocks 1.0 did not use the standard Lua layout for modules ○ It wasn’t clear that
    [Show full text]
  • Star TEX: the Next Generation Several Ideas on How to Modernize TEX Already Exist
    TUGboat, Volume 33 (2012), No. 2 199 Star TEX: The Next Generation Several ideas on how to modernize TEX already exist. Some of them have actually been implemented. Didier Verna In this paper, we present ours. The possible future Abstract that we would like to see happening for TEX is some- what different from the current direction(s) TEX's While T X is unanimously praised for its typesetting E evolution has been following. In our view, modern- capabilities, it is also regularly blamed for its poor izing TEX can start with grounding it in an old yet programmatic offerings. A macro-expansion system very modern programming language: Common Lisp. is indeed far from the best choice in terms of general- Section 2 clarifies what our notion of a \better", or purpose programming. Several solutions have been \more modern" TEX is. Section 3 on the next page proposed to modernize T X on the programming E presents several approaches sharing a similar goal. side. All of them currently involve a heterogeneous Section 4 on the following page justifies the choice approach in which T X is mixed with a full-blown pro- E of Common Lisp. Finally, section 5 on page 205 gramming language. This paper advocates another, outlines the projected final shape of the project. homogeneous approach in which TEX is first rewrit- ten in a modern language, Common Lisp, which 2 A better TEX serves both at the core of the program and at the The T X community has this particularity of being scripting level. All programmatic macros of T X are E E a mix of two populations: people coming from the hence rendered obsolete, as the underlying language world of typography, who love it for its beautiful itself can be used for user-level programming.
    [Show full text]
  • Functional Programming Patterns in Scala and Clojure Write Lean Programs for the JVM
    Early Praise for Functional Programming Patterns This book is an absolute gem and should be required reading for anybody looking to transition from OO to FP. It is an extremely well-built safety rope for those crossing the bridge between two very different worlds. Consider this mandatory reading. ➤ Colin Yates, technical team leader at QFI Consulting, LLP This book sticks to the meat and potatoes of what functional programming can do for the object-oriented JVM programmer. The functional patterns are sectioned in the back of the book separate from the functional replacements of the object-oriented patterns, making the book handy reference material. As a Scala programmer, I even picked up some new tricks along the read. ➤ Justin James, developer with Full Stack Apps This book is good for those who have dabbled a bit in Clojure or Scala but are not really comfortable with it; the ideal audience is seasoned OO programmers looking to adopt a functional style, as it gives those programmers a guide for transitioning away from the patterns they are comfortable with. ➤ Rod Hilton, Java developer and PhD candidate at the University of Colorado Functional Programming Patterns in Scala and Clojure Write Lean Programs for the JVM Michael Bevilacqua-Linn The Pragmatic Bookshelf Dallas, Texas • Raleigh, North Carolina 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 The Pragmatic Programmers, LLC was aware of a trademark claim, the designations have been printed in initial capital letters or in all capitals.
    [Show full text]