DOCSLIB.ORG

Parallel Programming with Ocaml: a Tutorial Victor Allombert, Mathias Bourgoin, Frédéric Loulergue

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Parallel Programming with Ocaml: a Tutorial Victor Allombert, Mathias Bourgoin, Frédéric Loulergue Parallel Programming with OCaml: A Tutorial Victor Allombert, Mathias Bourgoin, Frédéric Loulergue To cite this version: Victor Allombert, Mathias Bourgoin, Frédéric Loulergue. Parallel Programming with OCaml: A Tutorial. International Conference on High Performance Computing and Simulation (HPCS 2018), Jul 2018, Orléans, France. hal-01941231 HAL Id: hal-01941231 https://hal.archives-ouvertes.fr/hal-01941231 Submitted on 30 Nov 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Parallel Programming with OCaml: A Tutorial Victor Allombert Mathias Bourgoin Fred´ eric´ Loulergue Univ Orleans, INSA Centre Val-de-Loire, Univ Orleans, INSA Centre Val-de-Loire, SICCS LIFO EA 4022 LIFO EA 4022 Northern Arizona University Orleans,´ France Orleans,´ France Flagstaf, USA [email protected] [email protected] [email protected] INVITED TUTORIAL PAPER Abstract—OCaml is a multi-paradigm (functional, imperative, I. AN OVERVIEW OF OCAML object-oriented) high level sequential language. Types are stati- cally inferred by the compiler and the type system is expressive In this section we describe the OCaml language and the and strong. These features make OCaml a very productive features of the OCaml library that are necessary for a good language for developing efficient and safe programs. In this understanding of this tutorial. tutorial we present three frameworks for using OCaml to program scalable parallel architectures: BSML, Multi-ML and A. What is OCaml? Spoc. OCaml [3] is a functional programming language [4] from Keywords— Parallel programming; functional programming; the ML (Meta Language) family. It is the main implementation bulk synchronous parallelism; Multi-BSP; GPGPU of Caml, a general-purposes language developed at Inria. As parallel architectures are now the norm, it is necessary OCaml relies on a powerful static type system allowing type to consider programming languages and libraries that offer a inference, as well as parametric and generalized algebraic data trade-off between execution efficiency and programming pro- types polymorphism. It also proposes a system of modules ductivity. While languages and libraries for high performance and an object oriented approach. The code generated by the computing, such as MPI [1], favor efficiency over productivity, compiler is thus safe, thanks to the type checker. a lot of application domains require that mainstream program- The OCaml language offers a bytecode compiler to allow mers develop parallel applications without huge knowledge code portability on various architectures. The quality of the about parallel programming. native compilation allows performances close to the highest standards of modern compilers. OCaml also provides auto- Big Data is an area where productivity is also considered matic memory management thanks to its embedded garbage as important. MapReduce [2] is a well-known programming collector. A toplevel that permits interactive use of OCaml model where it is only possible to express a parallel through and interactive loop is also available. algorithm in a very structured and specific way. The creators OCaml is supported by a widespread community and has a of MapReduce indicate functional programming as an rich set of libraries and development tools [5], [6] inspiration for their framework. Moreover, there is a recent trend to include functional features in mainstream languages, B. Introduction to the OCaml Syntax such as Java or C++. As OCaml provides type inference, it is not necessary to This tutorial is an introduction to parallel programming specify the type of a variable. Variables are defined using let using a modern functional programming language: OCaml, a let-bindings. For example, x = 1 declares that x is a statically and strongly typed language, with a type inference variable of type int with the value of 1. Although unneces- system. This allows detecting errors very early in the develop- sary, it is possible to annotate an expression with a type, so let ment of applications. OCaml offers high-level features yet it x : int = 1 is valid too. We use type annotations in is efficient. While the style of an OCaml application is mainly the next sections as types provide valuable information to the functional, OCaml is a multi paradigm language: it provides reader. imperative and object-oriented features that can be used for To declare a function in OCaml it is also possible to use efficiency or modularity reasons. a let-binding as following: let prod x y = x *. y. Here, we define the function prod which takes two arguments (x and The three presented frameworks leverage OCaml for scal- y) and returns the product of them. Notice the usage of the *. able parallel programming of homogeneous clusters (Sec- operator which stands for floating point addition. The usage tion II), hierarchical architectures (Section III), and GPUs of this operators forces the types of x and y to be float. The (Section IV). We use, as a running example, a parallel map prod function is typed prod:float → float → float and reduce implementations on distributed lists or distributed as it takes as argument two floats and returns a float. The arrays. We begin with a short presentation of OCaml in application of the function prod can be written as follows: Section I and discuss further reading in Section V. f 1.0 2.0. When there is no type constraints on values, the type ● hd::tl a list composed of the head element hd and the system generates forall types. For example, let f x = x is tail tl (the rest of the list). In this case, we return the a function taking an argument x and returning the exact same result of the application of f on h concatenated with the value. Here, the f can be applied on any value of x. Thus, it result of the recursive call on the tail. → is typed f : α α where α stands for any types. It is also possible to define arrays in OCaml as follows: Because of its functional capabilities, high-order functions let a = [|1;2;3|]. Thus, a is typed int array. Unlike are common in OCaml programs. For example, we can write a lists, arrays are mutable data structures. Updating the cell at square function as following: let square x = prod x x. index i of an array a with a value v is written a.(i)←v. Anonymous function are also often used and are identi- In OCaml, it is simple to define its own types using records. fied by the fun keyword. Thus, the following code al- A record is a data structure holding multiple values. For lows the definition of the square function using anony- example, the definition of a point of a Cartesian coordinate mous function instead of using the prod function: system can be written: let square x = (fun x y → x *. y) x x. Lists are one of the most common data structure used in the type point = { context of functional programming. In Ocaml, a list is imple- name : string; mented as an immutable singly linked list. A list of integers x : float; y : float; let l1 = [1;2;3] in OCaml can be defined as following: . } The type of the l1 is int list. The brackets delimits the list and elements are separated with the semicolon. The Here, the record point is made of three fields: the name empty list is written [] and the concatenation of two lists of the point and the x and y coordinates. An instance of is written l1 @ [4;5;6]. The infix operator :: adds an a point is written: let a = {name="A";x=3.0;y=5.0}. elements at the beginning of a list. Therefore l1 can also Records can have mutable fields that can be set using the be written 1::2::3::[]. Actually [] and :: are the two list ← operator. For example, annotating the field x as follows constructors, i.e. any list value can be described in terms of mutable x : float allows one to write a.x←4.0. this constant and this operation. The definition of recursive functions using the let-binding must be annotated by the rec keyword. For example, we can C. Some Features of OCaml Libraries write a (non tail-)recursive function that builds a list containing To manipulate common data structures such as lists or arrays the values from n1 to n2 as follows: it is possible to use the List and Array modules from the let rec from_to n1 n2 = standard library. if n1>n2 map then [] Regarding lists, the function is very useful to else n1::(from_to (n1+1) n2) apply a function on each element of a list. List.map is typed map : (α→β)→α list→β list. The code This function returns [] if the lower bound is greater than List.map f l applies function f on each elements of the upper bound. Otherwise, it returns the value of n1 con- the list l. Thus, List.map (fun x → x*x) [0;1;2;3] catenated with the recursive call of from_to on n1+1 and n2 produces list [0;1;4;9]. using the operator ::. Folding on lists is a common operation that can be done Pattern matching is a powerfully control structure used using List.fold_left : (α→β→α)→α→β list→α. to match values or expressions (patterns) to computations.
Load more

Recommended publications
  • Scala−−, a Type Inferred Language Project Report
    Scala−−, a type inferred language Project Report Da Liu [email protected] Contents 1 Background 2 2 Introduction 2 3 Type Inference 2 4 Language Prototype Features 3 5 Project Design 4 6 Implementation 4 6.1 Benchmarkingresults . 4 7 Discussion 9 7.1 About scalac ....................... 9 8 Lessons learned 10 9 Language Specifications 10 9.1 Introdution ......................... 10 9.2 Lexicalsyntax........................ 10 9.2.1 Identifiers ...................... 10 9.2.2 Keywords ...................... 10 9.2.3 Literals ....................... 11 9.2.4 Punctions ...................... 12 9.2.5 Commentsandwhitespace. 12 9.2.6 Operations ..................... 12 9.3 Syntax............................ 12 9.3.1 Programstructure . 12 9.3.2 Expressions ..................... 14 9.3.3 Statements ..................... 14 9.3.4 Blocksandcontrolflow . 14 9.4 Scopingrules ........................ 16 9.5 Standardlibraryandcollections. 16 9.5.1 println,mapandfilter . 16 9.5.2 Array ........................ 16 9.5.3 List ......................... 17 9.6 Codeexample........................ 17 9.6.1 HelloWorld..................... 17 9.6.2 QuickSort...................... 17 1 of 34 10 Reference 18 10.1Typeinference ....................... 18 10.2 Scalaprogramminglanguage . 18 10.3 Scala programming language development . 18 10.4 CompileScalatoLLVM . 18 10.5Benchmarking. .. .. .. .. .. .. .. .. .. .. 18 11 Source code listing 19 1 Background Scala is becoming drawing attentions in daily production among var- ious industries. Being as a general purpose programming language, it is influenced by many ancestors including, Erlang, Haskell, Java, Lisp, OCaml, Scheme, and Smalltalk. Scala has many attractive features, such as cross-platform taking advantage of JVM; as well as with higher level abstraction agnostic to the developer providing immutability with persistent data structures, pattern matching, type inference, higher or- der functions, lazy evaluation and many other functional programming features.
    [Show full text]
  • The Scala Experience Safe Programming Can Be Fun!
    The Scala Programming Language Mooly Sagiv Slides taken from Martin Odersky (EPFL) Donna Malayeri (CMU) Hila Peleg (Technion) Modern Functional Programming • Higher order • Modules • Pattern matching • Statically typed with type inference • Two viable alternatives • Haskel • Pure lazy evaluation and higher order programming leads to Concise programming • Support for domain specific languages • I/O Monads • Type classes • ML/Ocaml/F# • Eager call by value evaluation • Encapsulated side-effects via references • [Object orientation] Then Why aren’t FP adapted? • Education • Lack of OO support • Subtyping increases the complexity of type inference • Programmers seeks control on the exact implementation • Imperative programming is natural in certain situations Why Scala? (Coming from OCaml) • Runs on the JVM/.NET • Can use any Java code in Scala • Combines functional and imperative programming in a smooth way • Effective libraries • Inheritance • General modularity mechanisms The Java Programming Language • Designed by Sun 1991-95 • Statically typed and type safe • Clean and Powerful libraries • Clean references and arrays • Object Oriented with single inheritance • Interfaces with multiple inheritance • Portable with JVM • Effective JIT compilers • Support for concurrency • Useful for Internet Java Critique • Downcasting reduces the effectiveness of static type checking • Many of the interesting errors caught at runtime • Still better than C, C++ • Huge code blowouts • Hard to define domain specific knowledge • A lot of boilerplate code •
    [Show full text]
  • 1 Ocaml for the Masses
    PROGRAMMING LANGUAGES OCaml for the Masses Why the next language you learn should be functional Yaron Minsky, Jane Street Sometimes, the elegant implementation is a function. Not a method. Not a class. Not a framework. Just a function. - John Carmack Functional programming is an old idea with a distinguished history. Lisp, a functional language inspired by Alonzo Church’s lambda calculus, was one of the first programming languages developed at the dawn of the computing age. Statically typed functional languages such as OCaml and Haskell are newer, but their roots go deep—ML, from which they descend, dates back to work by Robin Milner in the early ’70s relating to the pioneering LCF (Logic for Computable Functions) theorem prover. Functional programming has also been enormously influential. Many fundamental advances in programming language design, from garbage collection to generics to type inference, came out of the functional world and were commonplace there decades before they made it to other languages. Yet functional languages never really made it to the mainstream. They came closest, perhaps, in the days of Symbolics and the Lisp machines, but those days seem quite remote now. Despite a resurgence of functional programming in the past few years, it remains a technology more talked about than used. It is tempting to conclude from this record that functional languages don’t have what it takes. They may make sense for certain limited applications, and contain useful concepts to be imported into other languages; but imperative and object-oriented languages are simply better suited to the vast majority of software engineering tasks.
    [Show full text]
  • An Overview of the Scala Programming Language
    An Overview of the Scala Programming Language Second Edition Martin Odersky, Philippe Altherr, Vincent Cremet, Iulian Dragos Gilles Dubochet, Burak Emir, Sean McDirmid, Stéphane Micheloud, Nikolay Mihaylov, Michel Schinz, Erik Stenman, Lex Spoon, Matthias Zenger École Polytechnique Fédérale de Lausanne (EPFL) 1015 Lausanne, Switzerland Technical Report LAMP-REPORT-2006-001 Abstract guage for component software needs to be scalable in the sense that the same concepts can describe small as well as Scala fuses object-oriented and functional programming in large parts. Therefore, we concentrate on mechanisms for a statically typed programming language. It is aimed at the abstraction, composition, and decomposition rather than construction of components and component systems. This adding a large set of primitives which might be useful for paper gives an overview of the Scala language for readers components at some level of scale, but not at other lev- who are familar with programming methods and program- els. Second, we postulate that scalable support for compo- ming language design. nents can be provided by a programming language which unies and generalizes object-oriented and functional pro- gramming. For statically typed languages, of which Scala 1 Introduction is an instance, these two paradigms were up to now largely separate. True component systems have been an elusive goal of the To validate our hypotheses, Scala needs to be applied software industry. Ideally, software should be assembled in the design of components and component systems. Only from libraries of pre-written components, just as hardware is serious application by a user community can tell whether the assembled from pre-fabricated chips.
    [Show full text]
  • How to Run Your Favorite Language on Web Browsers
    Benjamin Canou, Emmanuel Chailloux and Jérôme Vouillon Laboratoire d'Informatique de Paris 6 (LIP6) Laboratoire Preuves Programmes et Systèmes (PPS) How to Run your Favorite. Language on Browsers The Revenge of Virtual Machines WWW 2012, Lyon, France Introduction. Introduction . 3/20 What ? I You have a favorite language I You have just designed or extended one I You want to run it on a Web browser Why ? I To program a new Web app I To program your client with the same language than your server I To run an online demo of an existing app Introduction . 4/20 How ? I Use applets I Write an interpreter in JavaScript I Write a compiler to JavaScript Or as we present in this talk: I Reuse the language bytecode compiler I Write a bytecode interpreter in JavaScript I Write a bytecode to JavaScript expander Introduction . 5/20 An experiment report: I Project Ocsigen: use OCaml to code entire Web apps I OBrowser: an OCaml bytecode interpreter I js_of_ocaml: an OCaml bytecode expander Retrospectively, a good approach: I Reasonable time to obtain a first platform I Good performance achievable I Fidelity to language/concurrency models Core techniques. Bytecode interpretation (1/3). 7/20 Main method: 1. Make the bytecode file network compliant (ex. JSON array) 2. Choose/implement the representation of values 3. Write a minimal runtime and standard library 4. Write the main interpretation loop 5. Run tests and extend the library as needed Possible improvements: I Use core, well supported/optimized JavaScript control structures I Use simple, array based memory representation I Preliminary bytecode cleanup pass Bytecode interpretation (2/3).
    [Show full text]
  • Design Patterns in Ocaml
    Design Patterns in OCaml Antonio Vicente [email protected] Earl Wagner [email protected] Abstract The GOF Design Patterns book is an important piece of any professional programmer's library. These patterns are generally considered to be an indication of good design and development practices. By giving an implementation of these patterns in OCaml we expected to better understand the importance of OCaml's advanced language features and provide other developers with an implementation of these familiar concepts in order to reduce the effort required to learn this language. As in the case of Smalltalk and Scheme+GLOS, OCaml's higher order features allows for simple elegant implementation of some of the patterns while others were much harder due to the OCaml's restrictive type system. 1 Contents 1 Background and Motivation 3 2 Results and Evaluation 3 3 Lessons Learned and Conclusions 4 4 Creational Patterns 5 4.1 Abstract Factory . 5 4.2 Builder . 6 4.3 Factory Method . 6 4.4 Prototype . 7 4.5 Singleton . 8 5 Structural Patterns 8 5.1 Adapter . 8 5.2 Bridge . 8 5.3 Composite . 8 5.4 Decorator . 9 5.5 Facade . 10 5.6 Flyweight . 10 5.7 Proxy . 10 6 Behavior Patterns 11 6.1 Chain of Responsibility . 11 6.2 Command . 12 6.3 Interpreter . 13 6.4 Iterator . 13 6.5 Mediator . 13 6.6 Memento . 13 6.7 Observer . 13 6.8 State . 14 6.9 Strategy . 15 6.10 Template Method . 15 6.11 Visitor . 15 7 References 18 2 1 Background and Motivation Throughout this course we have seen many examples of methodologies and tools that can be used to reduce the burden of working in a software project.
    [Show full text]
  • Automated Fortran–C++ Bindings for Large-Scale Scientific Applications
    Automated Fortran–C++ Bindings for Large-Scale Scientific Applications Seth R Johnson HPC Methods for Nuclear Applications Group Nuclear Energy and Fuel Cycle Division Oak Ridge National Laboratory ORNL is managed by UT–Battelle, LLC for the US Department of Energy github.com/swig-fortran Overview • Introduction • Tools • SWIG+Fortran • Strategies • Example libraries 2 Introduction 3 How did I get involved? • SCALE (1969–present): Fortran/C++ • VERA: multiphysics, C++/Fortran • MPACT: hand-wrapped calls to C++ Trilinos 4 Project background • Exascale Computing Project: at inception, many scientific app codes were primarily Fortran • Numerical/scientific libraries are primarily C/C++ • Expose Trilinos solver library to Fortran app developers: ForTrilinos product 5 ECP: more exascale, less Fortran Higher-level { }Fortran ECP application codes over time (credit: Tom Evans) 6 Motivation • C++ library developers: expand user base, more F opportunities for development and follow-on funding • Fortran scientific app developers: use newly exposed algorithms and tools for your code C • Multiphysics project integration: in-memory coupling of C++ physics code to Fortran physics code • Transitioning application teams: bite-size migration from Fortran to C++ C++ 7 Tools 8 Wrapper “report card” • Portability: Does it use standardized interoperability? • Reusability: How much manual duplication needed for new interfaces? • Capability: Does the Fortran interface have parity with the C++? • Maintainability: Do changes to the C++ code automatically update
    [Show full text]
  • Installation and Configuration of Ocaml for Windows 10
    Installation and Configuration of OCaml for Windows 10 By: Brandon Kim, Jonathan Morley, Francis Oyebanjo, and BT Rappaport Table of Contents Introduction 2 Installing OPAM and OCaml 3 Checkpoint 7 Installing Extra Packages (OCamlfind, OUnit, rlwrap) 8 Ensuring Correct Installation and Configuration 11 Troubleshooting Errors 12 Glossary 16 1 Introduction This manual is for OCaml beginners who would like to use OCaml on a Windows 10 computer. OCaml is not very compatible for installation on a Windows computer but is made simple with Bash on Ubuntu on Windows, a brand new Windows 10 feature that enables direct use of Linux command-line tools. However, the directions available are usually not Windows 10 specific and assume the audience is already well versed in Linux tools. This manual provides beginners to OCaml and Linux with a clear and orderly set of instructions for installing and configuring OCaml on Windows 10. OCaml is a heavy-duty programming language that supports functional, imperative and object- oriented styles. OCaml’s safety, advanced type system, and automatic memory management are a few features that make it a highly effective programming tool. Even though OCaml is a powerful language, it is also simple and easy to use, making it an ideal language to expose to students in undergraduate computer science courses. In this manual we will install OCaml via OPAM, a package manager (collection of tools that automates the process of installing, upgrading, configuring, and removing programs from a computer) for OCaml. Requirements/ Materials ● Computer running Windows 10 (64-bit) with build 14393 or later ● Administrative access of the computer ● Bash on Ubuntu on Windows installed and setup ○ https://msdn.microsoft.com/en-us/commandline/wsl/install_guide ● Internet access with decent download speed Important Notes ● Copy and paste (to paste simply right click in bash where you want to paste) the commands from the manual into Bash, especially if they are long.
    [Show full text]
  • The Ocaml System Release 4.02
    The OCaml system release 4.02 Documentation and user's manual Xavier Leroy, Damien Doligez, Alain Frisch, Jacques Garrigue, Didier R´emy and J´er^omeVouillon August 29, 2014 Copyright © 2014 Institut National de Recherche en Informatique et en Automatique 2 Contents I An introduction to OCaml 11 1 The core language 13 1.1 Basics . 13 1.2 Data types . 14 1.3 Functions as values . 15 1.4 Records and variants . 16 1.5 Imperative features . 18 1.6 Exceptions . 20 1.7 Symbolic processing of expressions . 21 1.8 Pretty-printing and parsing . 22 1.9 Standalone OCaml programs . 23 2 The module system 25 2.1 Structures . 25 2.2 Signatures . 26 2.3 Functors . 27 2.4 Functors and type abstraction . 29 2.5 Modules and separate compilation . 31 3 Objects in OCaml 33 3.1 Classes and objects . 33 3.2 Immediate objects . 36 3.3 Reference to self . 37 3.4 Initializers . 38 3.5 Virtual methods . 38 3.6 Private methods . 40 3.7 Class interfaces . 42 3.8 Inheritance . 43 3.9 Multiple inheritance . 44 3.10 Parameterized classes . 44 3.11 Polymorphic methods . 47 3.12 Using coercions . 50 3.13 Functional objects . 54 3.14 Cloning objects . 55 3.15 Recursive classes . 58 1 2 3.16 Binary methods . 58 3.17 Friends . 60 4 Labels and variants 63 4.1 Labels . 63 4.2 Polymorphic variants . 69 5 Advanced examples with classes and modules 73 5.1 Extended example: bank accounts . 73 5.2 Simple modules as classes .
    [Show full text]
  • Top Functional Programming Languages Based on Sentiment Analysis 2021 11
    POWERED BY: TOP FUNCTIONAL PROGRAMMING LANGUAGES BASED ON SENTIMENT ANALYSIS 2021 Functional Programming helps companies build software that is scalable, and less prone to bugs, which means that software is more reliable and future-proof. It gives developers the opportunity to write code that is clean, elegant, and powerful. Functional Programming is used in demanding industries like eCommerce or streaming services in companies such as Zalando, Netflix, or Airbnb. Developers that work with Functional Programming languages are among the highest paid in the business. I personally fell in love with Functional Programming in Scala, and that’s why Scalac was born. I wanted to encourage both companies, and developers to expect more from their applications, and Scala was the perfect answer, especially for Big Data, Blockchain, and FinTech solutions. I’m glad that my marketing and tech team picked this topic, to prepare the report that is focused on sentiment - because that is what really drives people. All of us want to build effective applications that will help businesses succeed - but still... We want to have some fun along the way, and I believe that the Functional Programming paradigm gives developers exactly that - fun, and a chance to clearly express themselves solving complex challenges in an elegant code. LUKASZ KUCZERA, CEO AT SCALAC 01 Table of contents Introduction 03 What Is Functional Programming? 04 Big Data and the WHY behind the idea of functional programming. 04 Functional Programming Languages Ranking 05 Methodology 06 Brand24
    [Show full text]
  • Programming Language Use in US Academia and Industry
    Informatics in Education, 2015, Vol. 14, No. 2, 143–160 143 © 2015 Vilnius University DOI: 10.15388/infedu.2015.09 Programming Language Use in US Academia and Industry Latifa BEN ARFA RABAI1, Barry COHEN2, Ali MILI2 1 Institut Superieur de Gestion, Bardo, 2000, Tunisia 2 CCS, NJIT, Newark NJ 07102-1982 USA e-mail: [email protected], [email protected], [email protected] Received: July 2014 Abstract. In the same way that natural languages influence and shape the way we think, program- ming languages have a profound impact on the way a programmer analyzes a problem and formu- lates its solution in the form of a program. To the extent that a first programming course is likely to determine the student’s approach to program design, program analysis, and programming meth- odology, the choice of the programming language used in the first programming course is likely to be very important. In this paper, we report on a recent survey we conducted on programming language use in US academic institutions, and discuss the significance of our data by comparison with programming language use in industry. Keywords: programming language use, academic institution, academic trends, programming lan- guage evolution, programming language adoption. 1. Introduction: Programming Language Adoption The process by which organizations and individuals adopt technology trends is complex, as it involves many diverse factors; it is also paradoxical and counter-intuitive, hence difficult to model (Clements, 2006; Warren, 2006; John C, 2006; Leo and Rabkin, 2013; Geoffrey, 2002; Geoffrey, 2002a; Yi, Li and Mili, 2007; Stephen, 2006). This general observation applies to programming languages in particular, where many carefully de- signed languages that have superior technical attributes fail to be widely adopted, while languages that start with modest ambitions and limited scope go on to be widely used in industry and in academia.
    [Show full text]
  • Functional Programming with Ocaml
    CMSC 330: Organization of Programming Languages Functional Programming with OCaml CMSC 330 - Spring 2019 1 What is a functional language? A functional language: • defines computations as mathematical functions • discourages use of mutable state State: the information maintained by a computation Mutable: can be changed CMSC 330 - Spring 2019 2 Functional vs. Imperative Functional languages: • Higher level of abstraction • Easier to develop robust software • Immutable state: easier to reason about software Imperative languages: • Lower level of abstraction • Harder to develop robust software • Mutable state: harder to reason about software CMSC 330 - Spring 2019 3 Imperative Programming Commands specify how to compute, by destructively changing state: x = x+1; a[i] = 42; p.next = p.next.next; Functions/methods have side effects: int wheels(Vehicle v) { v.size++; return v.numWheels; } CMSC 330 - Spring 2019 4 Mutability The fantasy of mutability: • It's easy to reason about: the machine does this, then this... The reality of mutability: • Machines are good at complicated manipulation of state • Humans are not good at understanding it! • mutability breaks referential transparency: ability to replace an expression with its value without affecting the result • In math, if f(x)=y, then you can substitute y anywhere you see f(x) • In imperative languages, you cannot: f might have side effects, so computing f(x) at one time might result in different value at another CMSC 330 - Spring 2019 5 Mutability The fantasy of mutability: • There is a single state • The computer does one thing at a time The reality of mutability: • There is no single state • Programs have many threads, spread across many cores, spread across many processors, spread across many computers..
    [Show full text]