DOCSLIB.ORG

Introduction to Standard ML

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Standard ML Intro duction to Standard ML Rob ert Harp er Scho ol of Computer Science Carnegie Mellon University Pittsburgh PA c Copyright Rob ert Harp er All rights reserved 1 With exercises by Kevin Mitchell Edinburgh University Edinburgh UK Contents Intro duction The Core Language Interacting with ML Basic expressions values and typ es Unit Bo oleans Integers Strings Real Numb ers Tuples Lists Records Identiers bindings and declarations Patterns Dening functions Polymorphism and Overloading Dening typ es Exceptions Imp erative features The Mo dules System Overview Structures and Signatures Abstractions Functors The mo dules system in practice iii iv CONTENTS InputOutput A Answers Acknowledgements Several of the examples were cribb ed from Luca Cardellis intro duction to his dialect of ML from Robin Milners core language denition from Dave MacQueens mo dules pap er and from Ab elson and Sussmans b o ok Joachim Parrow Don Sannella and David Walker made many helpful sug gestions vii Chapter Intro duction These notes are an intro duction to the Standard ML programming language Here are some of the highlights of Standard ML ML is a functional programming language Functions are rstclass data ob jects they may b e passed as arguments returned as results and stored in variables The principal control mechanism in ML is recursive function application ML is an interactive language Every phrase read is analyzed compiled and executed and the value of the phrase is rep orted together with its typ e ML is strongly typed Every legal expression has a typ e which is deter mined automatically by the compiler Strong typing guarantees that no program can incur a typ e error at run time a common source of bugs ML has a polymorphic typ e system Each legal phrase has a uniquely determined most general typing that determines the set of contexts in which that phrase may b e legally used ML supp orts abstract types Abstract typ es are a useful mechanism for program mo dularization New typ es together with a set of functions on ob jects of that typ e may b e dened The details of the implementation are hidden from the user of the typ e achieving a degree of isolation that is crucial to program maintenance CHAPTER INTRODUCTION ML is statical ly scoped ML resolves identier references at compile time leading to more mo dular and more ecient programs ML has a typ esafe exception mechanism Exceptions are a useful means of handling unusual or deviant conditions arising at runtime ML has a modules facility to supp ort the incremental construction of large programs An ML program is constructed as an interdep endent collection of structures which are glued together using functors Sepa rate compilation is supp orted through the ability to exp ort and imp ort functors Standard ML is the newest memb er of a family of languages tracing its origins to the ML language develop ed at Edinburgh by Mike Gordon Robin Milner and Chris Wadsworth in the midseventies Since then numerous dialects and implementations have arisen b oth at Edinburgh and elsewhere Standard ML is a synthesis of many of the ideas that were explored in the variant languages notably Luca Cardellis dialect and in the functional language HOPE develop ed by Ro d Burstall Dave MacQueen and Don San nella The most recent addition to the language is the mo dules system develop ed by Dave MacQueen These notes are intended as an informal intro duction to the language and its use and should not b e regarded as a denitive description of Standard ML They have evolved over a numb er of years and are in need of revision b oth to reect changes in the language and the exp erience gained with it since its inception Comments and suggestions from readers are welcome The denition of Standard ML is available from MIT Press A less formal but in many ways obsolete account is available as an Edinburgh University technical rep ort The reader is encouraged to consult the denition for precise details ab out the language Chapter The Core Language Interacting with ML Most implementations of ML are interactive with the basic form of interac tion b eing the readevalprint dialogue familiar to LISP users in which an expression is entered ML analyzes compiles and executes it and the 1 result is printed on the terminal Here is a sample interaction int ML prompts with and precedes its output with The user entered the phrase ML evaluated this expression and printed the value of the phrase together with its typ e int Various sorts of errors can arise during an interaction with ML Most of these fall into three categories syntax errors typ e errors and runtime faults You are probably familiar with syntax errors and runtime errors from your exp erience with other programming languages Here is an example of what happ ens when you enter a syntactically incorrect phrase let x in x end Parse error Was expecting in in let x 1 The details of the interaction with the ML top level vary from one implementation to another but the overall feel is similar in all systems known to the author These notes were prepared using the Edinburgh compiler circa CHAPTER THE CORE LANGUAGE Runtime errors such as dividing by zero are a form of exception ab out which we shall have more to say b elow For now we simply illustrate the sort of output that you can exp ect from a runtime error div Failure Div The notion of a typ e error is somewhat more unusual We shall have more to say ab out typ es and typ e errors later For now it suces to remark that a typ e error arises from the improp er use of a value such as trying to add to true true Type clash in true Looking for a int I have found a bool One particularly irksome form of error that ML cannot diagnose is the innite lo op If you susp ect that your program is lo oping then it is often p os sible to break the lo op by typing the interrupt character typically Control C ML will resp ond with a message indicating that the exception interrupt has b een raised and return to the top level Some implementations have a debugging facility that may b e helpful in diagnosing the problem Other forms of errors do arise but they are relatively less common and are often dicult to explain outside of context If you do get an error message that you cannot understand then try to nd someone with more exp erience with ML to help you The details of the user interface vary from one implementation to another particularly with regard to output format and error messages The examples that follow are based on the Edinburgh ML compiler you should have no diculty interpreting the output and relating it to that of other compilers Basic expressions values and typ es We b egin our intro duction to ML by intro ducing a set of basic typ es In ML a typ e is a collection of values For example the integers form a typ e as do the character strings and the b o oleans Given any two typ es and the set of ordered pairs of values with the left comp onent a value of typ e and BASIC EXPRESSIONS VALUES AND TYPES the right a value of typ e is a typ e More signicantly the set of functions mapping one typ e to another form a typ e In addition to these and other basic typ es ML allows for userdened typ es We shall return to this p oint later Expressions in ML denote values in the same way that numerals denote numb ers The typ e of an expression is determined by a set of rules that guarantee that if the expression has a value then the value of the expression is a value of the typ e assigned to the expression got that For example every numeral has typ e int since the value of a numeral is an integer We shall illustrate the typing system of ML by example Unit The typ e unit consists of a single value written sometimes pronounced unit as well This typ e is used whenever an expression has no interesting value or when a function is to have no arguments Bo oleans The typ e bool consists of the values true and false The ordinary b o olean negation is available as not the b o olean functions andalso and orelse are also provided as primitive The conditional expression if e then e else e is also considered 1 2 here b ecause its rst argument e must b e a b o olean Note that the else clause is not optional The reason is that this if is a conditional expres sion rather than a conditional command such as in Pascal If the else clause were omitted and the test were false then the expression would have no value Note to o that b oth the then expression and the else expression must have the same typ e The expression if true then true else is type incorrect or il ltyped since the typ e of the then clause is bool whereas the typ e of the else clause is unit not true false bool false andalso true CHAPTER THE CORE LANGUAGE false bool false orelse true true bool if false then false else true true bool if true then false else true false bool Integers The typ e int is the set of p ositive and negative integers Integers are written in the
Load more

Recommended publications
  • Type-Safe Multi-Tier Programming with Standard ML Modules
    Experience Report: Type-Safe Multi-Tier Programming with Standard ML Modules Martin Elsman Philip Munksgaard Ken Friis Larsen Department of Computer Science, iAlpha AG, Switzerland Department of Computer Science, University of Copenhagen, Denmark [email protected] University of Copenhagen, Denmark [email protected] kfl[email protected] Abstract shared module, it is now possible, on the server, to implement a We describe our experience with using Standard ML modules and module that for each function responds to a request by first deseri- Standard ML’s core language typing features for ensuring type- alising the argument into a value, calls the particular function and safety across physically separated tiers in an extensive web applica- replies to the client with a serialised version of the result value. tion built around a database-backed server platform and advanced Dually, on the client side, for each function, the client code can client code that accesses the server through asynchronous server serialise the argument and send the request asynchronously to the requests. server. When the server responds, the client will deserialise the re- sult value and apply the handler function to the value. Both for the server part and for the client part, the code can be implemented in 1. Introduction a type-safe fashion. In particular, if an interface type changes, the The iAlpha Platform is an advanced asset management system programmer will be notified about all type-inconsistencies at com- featuring a number of analytics modules for combining trading pile
    [Show full text]
  • Four Lectures on Standard ML
    Mads Tofte March Lab oratory for Foundations of Computer Science Department of Computer Science Edinburgh University Four Lectures on Standard ML The following notes give an overview of Standard ML with emphasis placed on the Mo dules part of the language The notes are to the b est of my knowledge faithful to The Denition of Standard ML Version as regards syntax semantics and terminology They have b een written so as to b e indep endent of any particular implemen tation The exercises in the rst lectures can b e tackled without the use of a machine although having access to an implementation will no doubt b e b enecial The pro ject in Lecture presupp oses access to an implementation of the full language including mo dules At present the Edinburgh compiler do es not fall into this category the author used the New Jersey Standard ML compiler Lecture gives an introduction to ML aimed at the reader who is familiar with some programming language but do es not know ML Both the Core Language and the Mo dules are covered by way of example Lecture discusses the use of ML mo dules in the development of large programs A useful metho dology for programming with functors signatures and structures is presented Lecture gives a fairly detailed account of the static semantics of ML mo dules for those who really want to understand the crucial notions of sharing and signature matching Lecture presents a one day pro ject intended to give the student an opp ortunity of mo difying a nontrivial piece of software using functors signatures and structures
    [Show full text]
  • Terra: a Multi-Stage Language for High-Performance Computing
    Terra: A Multi-Stage Language for High-Performance Computing Zachary DeVito James Hegarty Alex Aiken Pat Hanrahan Jan Vitek Stanford University Purdue University (zdevito|jhegarty|aiken|hanrahan)@cs.stanford.edu [email protected] Abstract However, high-performance applications that rely on code gen- High-performance computing applications, such as auto-tuners and eration are often implemented as ad hoc source-to-source trans- domain-specific languages, rely on generative programming tech- lators. For instance, consider FFTW which implements its genfft niques to achieve high performance and portability. However, these compiler in OCaml and emits C code [12], or Liszt, a DSL which systems are often implemented in multiple disparate languages and uses Scala for its transformations and generates code that links perform code generation in a separate process from program execu- against a runtime written in C [9]. tion, making certain optimizations difficult to engineer. We lever- While these designs produce high-performance code, they are age a popular scripting language, Lua, to stage the execution of hard to engineer. A DSL or auto-tuner typically has three compo- a novel low-level language, Terra. Users can implement optimiza- nents: an optimizer that performs domain-specific transformations tions in the high-level language, and use built-in constructs to gen- to generate a plan of execution, a compiler that generates high- erate and execute high-performance Terra code. To simplify meta- performance code based on the plan, and a runtime that supports programming, Lua and Terra share the same lexical environment, the generated code and provides feedback to the optimizer.
    [Show full text]
  • Teach Yourself Perl 5 in 21 Days
    Teach Yourself Perl 5 in 21 days David Till Table of Contents: Introduction ● Who Should Read This Book? ● Special Features of This Book ● Programming Examples ● End-of-Day Q& A and Workshop ● Conventions Used in This Book ● What You'll Learn in 21 Days Week 1 Week at a Glance ● Where You're Going Day 1 Getting Started ● What Is Perl? ● How Do I Find Perl? ❍ Where Do I Get Perl? ❍ Other Places to Get Perl ● A Sample Perl Program ● Running a Perl Program ❍ If Something Goes Wrong ● The First Line of Your Perl Program: How Comments Work ❍ Comments ● Line 2: Statements, Tokens, and <STDIN> ❍ Statements and Tokens ❍ Tokens and White Space ❍ What the Tokens Do: Reading from Standard Input ● Line 3: Writing to Standard Output ❍ Function Invocations and Arguments ● Error Messages ● Interpretive Languages Versus Compiled Languages ● Summary ● Q&A ● Workshop ❍ Quiz ❍ Exercises Day 2 Basic Operators and Control Flow ● Storing in Scalar Variables Assignment ❍ The Definition of a Scalar Variable ❍ Scalar Variable Syntax ❍ Assigning a Value to a Scalar Variable ● Performing Arithmetic ❍ Example of Miles-to-Kilometers Conversion ❍ The chop Library Function ● Expressions ❍ Assignments and Expressions ● Other Perl Operators ● Introduction to Conditional Statements ● The if Statement ❍ The Conditional Expression ❍ The Statement Block ❍ Testing for Equality Using == ❍ Other Comparison Operators ● Two-Way Branching Using if and else ● Multi-Way Branching Using elsif ● Writing Loops Using the while Statement ● Nesting Conditional Statements ● Looping Using
    [Show full text]
  • A Separate Compilation Extension to Standard ML
    A Separate Compilation Extension to Standard ML David Swasey Tom Murphy VII Karl Crary Robert Harper Carnegie Mellon {swasey,tom7,crary,rwh}@cs.cmu.edu Abstract The goal of this work is to consolidate and synthesize previ- We present an extension to Standard ML, called SMLSC, to support ous work on compilation management for ML into a formally de- separate compilation. The system gives meaning to individual pro- fined extension to the Standard ML language. The extension itself gram fragments, called units. Units may depend on one another in a is syntactically and conceptually very simple. A unit is a series of way specified by the programmer. A dependency may be mediated Standard ML top-level declarations, given a name. To the current by an interface (the type of a unit); if so, the units can be compiled top-level declarations such as structure and functor we add an separately. Otherwise, they must be compiled in sequence. We also import declaration that is to units what the open declaration is to propose a methodology for programming in SMLSC that reflects structures. An import declaration may optionally specify an inter- code development practice and avoids syntactic repetition of inter- face for the unit, in which case we are able to compile separately faces. The language is given a formal semantics, and we argue that against that dependency; with no interface we must compile incre- this semantics is implementable in a variety of compilers. mentally. Compatibility with existing compilers, including whole- program compilers, is assured by making no commitment to the Categories and Subject Descriptors D.3.3 [Programming Lan- precise meaning of “compile” and “link”—a compiler is free to guages]: Language Constructs and Features—Modules, pack- limit compilation to elaboration and type checking, and to perform ages; D.3.1 [Programming Languages]: Formal Definitions and code generation as part of linking.
    [Show full text]
  • Functional Programming (ML)
    Functional Programming CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Functional Programming Function evaluation is the basic concept for a programming paradigm that has been implemented in functional programming languages. The language ML (“Meta Language”) was originally introduced in the 1970’s as part of a theorem proving system, and was intended for describing and implementing proof strategies. Standard ML of New Jersey (SML) is an implementation of ML. The basic mode of computation in SML is the use of the definition and application of functions. 2 (c) Paul Fodor (CS Stony Brook) Install Standard ML Download from: http://www.smlnj.org Start Standard ML: Type ''sml'' from the shell (run command line in Windows) Exit Standard ML: Ctrl-Z under Windows Ctrl-D under Unix/Mac 3 (c) Paul Fodor (CS Stony Brook) Standard ML The basic cycle of SML activity has three parts: read input from the user, evaluate it, print the computed value (or an error message). 4 (c) Paul Fodor (CS Stony Brook) First SML example SML prompt: - Simple example: - 3; val it = 3 : int The first line contains the SML prompt, followed by an expression typed in by the user and ended by a semicolon. The second line is SML’s response, indicating the value of the input expression and its type. 5 (c) Paul Fodor (CS Stony Brook) Interacting with SML SML has a number of built-in operators and data types. it provides the standard arithmetic operators - 3+2; val it = 5 : int The Boolean values true and false are available, as are logical operators such as not (negation), andalso (conjunction), and orelse (disjunction).
    [Show full text]
  • Robert Harper Carnegie Mellon University
    The Future Of Standard ML Robert Harper Carnegie Mellon University Sunday, September 22, 13 Whither SML? SML has been hugely influential in both theory and practice. The world is slowly converging on ML as the language of choice. There remain big opportunities to be exploited in research and education. Sunday, September 22, 13 Convergence The world moves inexorably toward ML. Eager, not lazy evaluation. Static, not dynamic, typing. Value-, not object-, oriented. Modules, not classes. Every new language is more “ML-like”. Sunday, September 22, 13 Convergence Lots of ML’s and ML-like languages being developed. O’Caml, F#, Scala, Rust SML#, Manticore O’Caml is hugely successful in both research and industry. Sunday, September 22, 13 Convergence Rich typing supports verification. Polytyping >> Unityping Not all types are pointed. Useful cost model, especially for parallelism and space usage. Modules are far better than objects. Sunday, September 22, 13 Standard ML Standard ML remains important as a vehicle for teaching and research. Intro CS @ CMU is in SML. Lots of extensions proposed. We should consolidate advances and move forward. Sunday, September 22, 13 Standard ML SML is a language, not a compiler! It “exists” as a language. Stable, definitive criterion for compatibility. Having a semantics is a huge asset, provided that it can evolve. Sunday, September 22, 13 Standard ML At least five compatible compilers: SML/NJ, PolyML, MLKit, MosML, MLton, MLWorks (?). Several important extensions: CML, SML#, Manticore, SMLtoJS, ParallelSML (and probably more). Solid foundation on which to build and develop. Sunday, September 22, 13 The Way Forward Correct obvious shortcomings.
    [Show full text]
  • Standard ML Mini-Tutorial [1Mm] (In Particular SML/NJ)
    Standard ML Mini-tutorial (in particular SML/NJ) Programming Languages CS442 David Toman School of Computer Science University of Waterloo David Toman (University of Waterloo) Standard ML 1 / 21 Introduction • SML (Standard Meta Language) ⇒ originally part of the LCF project (Gordon et al.) • Industrial strength PL (SML’90, SML’97) ⇒ based formal semantics (Milner et al.) • SML “Basis Library” (all you ever wanted) ⇒ based on advanced module system • Quality compilers: ⇒ SML/NJ (Bell Labs) ⇒ Moscow ML David Toman (University of Waterloo) Standard ML 2 / 21 Features • Everything is built from expressions ⇒ functions are first class citizens ⇒ pretty much extension of our simple functional PL • Support for structured values: lists, trees, . • Strong type system ⇒ let-polymorphic functions ⇒ type inference • Powerful module system ⇒ signatures, implementations, ADTs,. • Imperative features (e.g., I/O) David Toman (University of Waterloo) Standard ML 3 / 21 Tutorial Goals 1 Make link from our functional language to SML 2 Provide enough SML syntax and examples for A2 • How to use SML/NJ interactive environment • How to write simple functional programs • How to define new data types • How to understand compiler errors • Where to find more information 3 Show type inference in action (so we understand what’s coming) David Toman (University of Waterloo) Standard ML 4 / 21 Getting started • Starting it up: sml in UNIX (click somewhere in W/XP) Example Standard ML of New Jersey, Version 110.0.7 [CM&CMB] - ⇒ great support in Emacs • Notation and simple
    [Show full text]
  • SML# JSON Support
    A Calculus with Partially Dynamic Records for Typeful Manipulation of JSON Objects∗ Atsushi Ohori1,2, Katsuhiro Ueno1,2, Tomohiro Sasaki1,2, and Daisuke Kikuchi1,3 1 Research Institute of Electrical Communication, Tohoku University Sendai, Miyagi, 980-8577, Japan {ohori,katsu,tsasaki,kikuchi}@riec.tohoku.ac.jp 2 Graduate School of Information Sciences, Tohoku University Sendai, Miyagi, 980-8579, Japan 3 Hitachi Solutions East Japan, Ltd. Sendai, Miyagi, 980-0014, Japan [email protected] Abstract This paper investigates language constructs for high-level and type-safe manipulation of JSON objects in a typed functional language. A major obstacle in representing JSON in a static type system is their heterogeneous nature: in most practical JSON APIs, a JSON array is a heterogeneous list consisting of, for example, objects having common fields and possibly some optional fields. This paper presents a typed calculus that reconciles static typing constraints and heterogeneous JSON arrays based on the idea of partially dynamic records originally proposed and sketched by Buneman and Ohori for complex database object manipulation. Partially dynamic records are dynamically typed records, but some parts of their structures are statically known. This feature enables us to represent JSON objects as typed data structures. The proposed calculus smoothly extends with ML-style pattern matching and record polymorphism. These results yield a typed functional language where the programmer can directly import JSON data as terms having static types, and can manipulate them with the full benefits of static polymorphic type-checking. The proposed calculus has been embodied in SML#, an extension of Standard ML with record polymorphism and other practically useful features.
    [Show full text]
  • Haskell-Like S-Expression-Based Language Designed for an IDE
    Department of Computing Imperial College London MEng Individual Project Haskell-Like S-Expression-Based Language Designed for an IDE Author: Supervisor: Michal Srb Prof. Susan Eisenbach June 2015 Abstract The state of the programmers’ toolbox is abysmal. Although substantial effort is put into the development of powerful integrated development environments (IDEs), their features often lack capabilities desired by programmers and target primarily classical object oriented languages. This report documents the results of designing a modern programming language with its IDE in mind. We introduce a new statically typed functional language with strong metaprogramming capabilities, targeting JavaScript, the most popular runtime of today; and its accompanying browser-based IDE. We demonstrate the advantages resulting from designing both the language and its IDE at the same time and evaluate the resulting environment by employing it to solve a variety of nontrivial programming tasks. Our results demonstrate that programmers can greatly benefit from the combined application of modern approaches to programming tools. I would like to express my sincere gratitude to Susan, Sophia and Tristan for their invaluable feedback on this project, my family, my parents Michal and Jana and my grandmothers Hana and Jaroslava for supporting me throughout my studies, and to all my friends, especially to Harry whom I met at the interview day and seem to not be able to get rid of ever since. ii Contents Abstract i Contents iii 1 Introduction 1 1.1 Objectives ........................................ 2 1.2 Challenges ........................................ 3 1.3 Contributions ...................................... 4 2 State of the Art 6 2.1 Languages ........................................ 6 2.1.1 Haskell ....................................
    [Show full text]
  • Using Domain Specific Language for Modeling and Simulation: Scalation As a Case Study
    Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yucesan,¨ eds. USING DOMAIN SPECIFIC LANGUAGE FOR MODELING AND SIMULATION: SCALATION AS A CASE STUDY John A. Miller Jun Han Maria Hybinette Department of Computer Science University of Georgia Athens, GA, 30602, USA ABSTRACT Progress in programming paradigms and languages has over time influenced the way that simulation programs are written. Modern object-oriented, functional programming languages are expressive enough to define embedded Domain Specific Languages (DSLs). The Scala programming language is used to implement ScalaTion that supports several popular simulation modeling paradigms. As a case study, ScalaTion is used to consider how language features of object-oriented, functional programming languages and Scala in particular can be used to write simulation programs that are clear, concise and intuitive to simulation modelers. The dichotomy between “model specification” and “simulation program” is also considered both historically and in light of the potential narrowing of the gap afforded by embedded DSLs. 1 INTRODUCTION As one learns simulation the importance of the distinction between “model specification” and “simulation program” is made clear. In the initial period (Nance 1996), the distinction was indeed important as models were expressed in a combination of natural language (e.g., English) and mathematics, while the simulation programs implementing the models were written in Fortran. The gap was huge. Over time, the gap has narrowed through the use of more modern general-purpose programming languages (GPLs) with improved readability and conciseness. Besides advances in general-purpose languages, the developers of Simulation Programming Languages (SPLs) have made major contributions.
    [Show full text]
  • Error Notice Undefined Index in Php
    Error Notice Undefined Index In Php Chris never craving any ampliation confederates counterfeitly, is Ishmael rainier and dispensatory enough? Hypophyseal marginallyand refreshed or though Aaron afternets hisVerne dactyl clot tremblings and fried facetiously, propagandises presbyteral insalubriously. and introductory. Claudius mongrelised his agonist frozen Collect information in this may greatly facilitate and versions over the introduction of a string to php error notice undefined index is free for example What remain the meaning of record error messages? Have a while about good project? Let us improve please post! What exactly what exactly what to ensure you cannot even though. Direct calls to _gaq will the longer function. These methods are used for obtaining values from the user through better form. Access to notice: edit and gen z population is may have been made free extensions portfolio and easy way to notice undefined variables that we use the extra variable does not error at least. Because Python takes significantly less safe to build your projects compared to other programming languages, your ideas come discover life has lot faster, allowing you to quality feedback and iterate quickly. PHP 7x MySQL SuiteCRM 711 Throughout the application and hollow the page loads I view Notice Undefined index currentuser in. How to bounds the undefined index error when adding the. Thanks for spine help, greatly appreciated. Thank her too conspicuous the amazing module btw. Also, everything I kneel not inserting this into a database is this with necessary? Profit Organizations and Joomla! Thank you because your reply. So what favor you get about PHP? Amidst people with obesity and fast decay soaring, the manufacturers have been compelled to reference sugar level with mandatory object of pack labelling.
    [Show full text]