DOCSLIB.ORG

Functional Programming and Input/Output

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Functional Programming and Input/Output Functional Programming and InputOutput Andrew Donald Gordon Kings College A dissertation submitted to the University of Cambridge towards the degree of Do ctor of Philosophy August Contents Summary vii Preface ix Preface to the Bo ok Edition xi Intro duction Functional programming A brief history of functional IO Semantics of functional languages Hyp othesis Synopsis Results How to read the dissertation Mathematical preliminaries A calculus of recursive typ es Typ es of Terms of Reduction in Combinators to simulate Elim and Intro Two examples Strong normalisation for A metalanguage for semantics Syntax of M Typ e assignmentinM Op erational semantics of M i ii CONTENTS Convergence Op erational precongruence Contexts Exp eriments and contextualexp eriments Ground and conned relations in M Contextual and exp erimental order Applicative and compatible similarity Contextual order and applicative similarity Theory of the metalanguage Laws of op erational equivalence in M Empty and onep ointtyp es in M Iterated pro ducts and sums in M Bo oleans in M Natural numbers in M An op erational theory of functional programming H a small functional language Ground and conned relations in H Op erational equivalence for H Denotational equivalence for H A theory of H programming Derived laws of programming HX an extension of H with exceptions teletyp e IO Four mechanisms for Sideeecting IO Lab elled transition systems and bisimilarity Stream transformers Landinstream IO Synchronisedstream IO Continuationpassing IO Maps b etween three of the mechanisms Discussion CONTENTS iii Monadic IO Programming IO in a monadic style Aweak monad for teletyp e IO Aweak monad for the MRC computer Pro of of the motivating example Conclusion Summary A calculus of recursivetyp es A metalanguage for semantics Op erational precongruence Theory of the metalanguage An op erational theory of functional programming Four mechanisms for telet yp e IO Monadic IO Bibliography Notation Index Index iv CONTENTS List of Tables Terms of M Typ e assignment rules for M Evaluation rules for M A translation of M typ es and terms into b Denition of R Rules concerning conned relations Laws of equivalence in M Syntax of H Typ e assignment rules for H Some standard functions Interpretations of Haskell functions in H Op erational semantics of H Denotational semantics of H b Denition of R and rules concerning conned relations Laws of equivalence in H HX an extension of H with exceptions Three mechanisms for functional IO Translations in HX between three styles of IO Aweak monad for teletyp e IO Deriving the MRC programming mo del The motivating example A monadic style of IO for Standard ML v vi LIST OF TABLES Summary A common attraction to functional programming is the ease with which pro ofs can be given of program prop erties A common disapp ointment with functional programming is the diculty of expressing inputoutput IO while at the same time b eing able to verify programs In this dissertation we show how a theory of functional programming can b e smo othly extended to admit b oth an op erational semantics for functional IO and verication of programs engaged in IO The rst half develops the op erational theory of a semantic metalanguage used in the sec ond half The metalanguage M is a simplytyp ed calculus with pro duct sum function lifted and recursive typ es We study two denitions of op erational equivalence Morris We style contextual equivalence and a typ ed form of Abramskys applicative bisimulation prove op erational extensionality for Mthat these two denitions give rise to the same op erational equivalence We prove equational laws that are analogous to the axiomatic domain theory of LCF and derive a coinduction principle The second half denes a small functional language H and shows how the semantics of H can b e extended to accommo date IO H is essentially a fragmentofHaskell Wegive b oth op erational and denotational semantics for H The denotational semantics uses M in a case study of Moggis prop osal to use monads to parameterise semantic descriptions We dene op erational and denotational equivalences on H and show that denotational implies op erational equivalence We develop a theory of H based on equational laws and a coinduction principle We study simplied forms of four widelyimplemented IO mechanisms sideeecting Landinstream synchronisedstream and continuationpassing IO We give reasons why sideeecting IO is unsuitable for lazy languages We extend the semantics of H to include the other three mechanisms and prove that the three are equivalenttoeach other in expressivepower We investigate monadic IO a highlevel mo del for functional IO based on Wadlers suggestion that monads can express interaction with state in a functional language We describ e a simple monadic programming mo del and give its semantics as a particular form of state transformer Using the semantics weverify a simple programming example vii viii SUMMARY Prayer Let the light of truth and the help of grace be vital principles of action in us that we may in the time of life attain the ends for which we live and that our religion which begins in know ledge may proceed in action settle in temper and end in happiness Preface This dissertation is the result of myown work and includes nothing which is the outcome of work done in collab oration This dissertation is not substantially the same as any that I have submitted or am currently submitting for a degree diploma or any other qualication at any other university Iacknowledge here many p eople who have help ed me complete this work whether named here or not I thank all the p eople who have beengoodtomeover mytimeinCambridge y sup ervisor Larry Paulson who has read commented and Iam extremely grateful to m discussed many drafts of my work Perhaps the most imp ortant thing Ive learnt from Larry is to keep computer science relevant to practical computational concerns I am grateful also to Alan Mycroft who acted as joint sup ervisor for fruitful discussions ab out many drafts and ideas Ihave had many useful conversations with my friend Roy Crole His help over the years with understanding many mathematical ideas has been invaluable I am particularly grateful to him for explaining Moggis approach to denotational semantics to me in simple terms and for commenting on an early draft of this dissertation in detail Robin Milners ideas have b een an enormous inuence on this dissertation I am grateful to have b een in his undergraduate concurrency class at Edinburgh and to have had many helpful conver with him during his sabbatical in Cambridge Jon Fairbairn enlivened my early sations years in Cambridge with his idiosyncratic views he graciously passed on to me debates ab out IO in the Haskell committee During his absence from the Lab he is greatly missed I thank Andy Pitts for reading and discussing this work on many o ccasions and for his encouragement Mike Gordon provided funding for me to try out my semantic ideas on a dataow language for hardware description a go o d way to work out how semantics ix x PREFACE can serve practical needs Ken Mo o dy oered me students to teach many encouraging conversations and the o dd b ottle of wine I thank Roger Needham head of department for many things not least that he suggest I apply for an internship at DEC SRCinPalo Alto I learnt a great deal from my host Jim Horning and others at DEC for which I am very grateful I thank Ian Poole of the Medical Research Council at the Western General Hospital in Edinburgh for the time he sp ent explaining their system to me asking searching questions ab out functional IO and suggesting the example that motivates Chapter This work was supp orted partially by an SERC studentship This dissertation was pre pared on a Firey computer donated by DEC Mart yn Johnson keeps.
Load more

Recommended publications
  • Diabetes Care Diagnostics Diagnostics Diagnostics (RDC) (RPD) (RMD) (RTD)
    Committed to innovation and growth Roland Diggelmann, COO Roche Diagnostics UBS Best of Switzerland, Wolfsberg September 19, 2013 HY 2013 Group Results Diagnostics Overview & Strategy HY 2013 Companion Diagnostics Outlook HY 2013: Roche Group highlights HY 2013 performance • Strong Pharma performance, driven by US; solid growth for Diagnostics • 12% core EPS growth1, driven largely by strong underlying business • Solid operating free cash flow (+4%1) Innovation • Move into phase III: Bcl2 inhibitor and anti-PDL1 • Data read-outs for potential phase III decisions: etrolizumab and anti-factor D • Positive CHMP recommendation for Herceptin SC • Discontinued: aleglitazar and GA201 3 1 CER=Constant Exchange Rates HY 2013: Strong sales momentum continues HY 2013 HY 2012 Change in % CHF bn CHF bn CHF CER Pharmaceuticals Division 18.2 17.4 4 6 Diagnostics Division 5.1 5.0 2 3 Roche Group 23.3 22.4 4 5 4 CER=Constant Exchange Rates HY 2013 Group Results Diagnostics Overview & Strategy HY 2013 Companion Diagnostics Outlook In-Vitro Diagnostics market overview Large and growing market; Roche is market leader Market share Market size USD 50 bn Roche Professional Diagnostics 20% Others 39% Molecular Diagnostics 11% Abbott Tissue Diagnostics 10% 3% Siemens Diabetes Monitoring Biomerieux 8% 8% Danaher J&J 6 Source: Roche Analysis, Company reports for 2012 validated by an independent IVD consultancy Overview of Roche Diagnostics New reporting structure In Vitro Diagnostics & Life Sciences Professional Molecular Tissue Diabetes Care Diagnostics Diagnostics
    [Show full text]
  • Notes on Functional Programming with Haskell
    Notes on Functional Programming with Haskell H. Conrad Cunningham [email protected] Multiparadigm Software Architecture Group Department of Computer and Information Science University of Mississippi 201 Weir Hall University, Mississippi 38677 USA Fall Semester 2014 Copyright c 1994, 1995, 1997, 2003, 2007, 2010, 2014 by H. Conrad Cunningham Permission to copy and use this document for educational or research purposes of a non-commercial nature is hereby granted provided that this copyright notice is retained on all copies. All other rights are reserved by the author. H. Conrad Cunningham, D.Sc. Professor and Chair Department of Computer and Information Science University of Mississippi 201 Weir Hall University, Mississippi 38677 USA [email protected] PREFACE TO 1995 EDITION I wrote this set of lecture notes for use in the course Functional Programming (CSCI 555) that I teach in the Department of Computer and Information Science at the Uni- versity of Mississippi. The course is open to advanced undergraduates and beginning graduate students. The first version of these notes were written as a part of my preparation for the fall semester 1993 offering of the course. This version reflects some restructuring and revision done for the fall 1994 offering of the course|or after completion of the class. For these classes, I used the following resources: Textbook { Richard Bird and Philip Wadler. Introduction to Functional Program- ming, Prentice Hall International, 1988 [2]. These notes more or less cover the material from chapters 1 through 6 plus selected material from chapters 7 through 9. Software { Gofer interpreter version 2.30 (2.28 in 1993) written by Mark P.
    [Show full text]
  • 2.19 Historical Perspective and Further Reading 2.19
    2.19 Historical Perspective and Further Reading 2.19 This section surveys the history of instruction set architraves over time, and we give a short history of programming languages and compilers. ISAs include accu- mulator architectures, general-purpose register architectures, stack architectures, and a brief history of the IA-32. We also review the controversial subjects of high- level-language computer architectures and reduced instruction set computer architectures. The history of programming languages includes Fortran, Lisp, Algol, C, Cobol, Pascal, Simula, Smalltalk, C++, and Java, and the history of com- pilers includes the key milestones and the pioneers who achieved them. Accumulator Architectures accumulator:Archaic term for register. On-line use of it Hardware was precious in the earliest stored-program computers. Consequently, as a synonym for “register” is computer pioneers could not afford the number of registers found in today’s a fairly reliable indication machines. In fact, these machines had a single register for arithmetic instructions. that the user has been Since all operations would accumulate in a single register, it was called the accu- around quite a while. mulator, and this style of instruction set is given the same name. For example, EDSAC in 1949 had a single accumulator. Eric Raymond, The New The three-operand format of MIPS suggests that a single register is at least two Hacker’s Dictionary, 1991 registers shy of our needs. Having the accumulator as both a source operand and as the destination of the operation fills part of the shortfall, but it still leaves us one operand short. That final operand is found in memory.
    [Show full text]
  • Is Functional Programming (FP) for Me?
    Is Functional Programming (FP) for me? ACCU Conference 2008 Hubert Matthews [email protected] Overview of talk • History of computing • Types of problem, developers, solution, environments, managers • Pros and cons of FP • Comparison of FP to other choices – Success stories – Where traditional still wins • FP language v. FP style April 2008 Copyright © 2008 Hubert Matthews 2 History • Three strands in computing (1950s) – FORTRAN - numeric calculations – COBOL - state, process and I/O – LISP - symbolic calculations, AI • These strands still exist – FORTRAN - still numerics, procedural – COBOL -> structured prog -> OO – LISP -> functional, higher-level langs • These problem types still exist April 2008 Copyright © 2008 Hubert Matthews 3 Models of problem Numeric Mathematics Symbolic/algorithmic Functional State UML class Process UML statechart UML activity diagram I/O Pre/postconditions • Analysis models (not solution) – Describing the problem • Some fit a functional description, some don’t April 2008 Copyright © 2008 Hubert Matthews 4 Type of developers • Scientist turned developer • Mathematician turned developer • Developer from OO world • Novice • Keen to learn v. “old dog” • Comfort level of change • Human side of change – Change needs planning and selling April 2008 Copyright © 2008 Hubert Matthews 5 Mapping solution to problem Real world Solution space LISP Haskell Ocaml XSLT Prolog mapping ruby perl python business OO C++ Java problem C# Smalltalk FORTRAN C decomposition assembler April 2008 Copyright © 2008 Hubert Matthews 6 Levels
    [Show full text]
  • Overload Journal
    A ower Language Nee s Power Tools Smart editor Reliable with full language support refactorings Support for C++03/C++ll, Rename, Extract Function -:(r):- Boost andlibc++,C++ 7 Constant/ Variable, templates and macros. Change8ignature, & more Code generation Profound and navigation code analysis Generate menu, On-the-f y, analysis Find context usages, with Gluick-fixes& dozens 0 Go to Symbol, and more ofsmart checks GET A C++ DEVELOPMENT,:rOOL THAT YOU DESERV ReSharper C++ AppCode CLion Visual Studio Extension IDE for iOS Cross-platform IDE for C•• developers and OS X development for C and C•• developers Start a free 30-day trial jb.gg/cpp-accu Find out more at www.qbssoftware.com QBS SOFTWARE OVERLOAD CONTENTS OVERLOAD 160 December 2020 Overload is a publication of the ACCU ISSN 1354-3172 For details of the ACCU, our publications Editor and activities, visit the ACCU website: Frances Buontempo [email protected] www.accu.org Advisors Ben Curry [email protected] Mikael Kilpeläinen [email protected] 4 Questions on the Form of Software Steve Love Lucian Radu Teodorescu considers whether the [email protected] difficulties in writing software are rooted in the Chris Oldwood essence of development. [email protected] Roger Orr 8 Building g++ from the [email protected] Balog Pal GCC Modules Branch [email protected] Roger Orr demonstrates how to get a compiler that Tor Arve Stangeland supports modules up and running. [email protected] Anthony Williams 10 Consuming the uk-covid19 API [email protected] Donald Hernik demonstrates how to wrangle data Advertising enquiries out of the UK API.
    [Show full text]
  • The A-Z of Programming Languages (Interviews with Programming Language Creators)
    The A-Z of Programming Languages (interviews with programming language creators) Computerworld, 2008-20101 Ada: S. Tucker Taft ...................................................... 1 Arduino: Tom Igoe ...................................................... 5 ASP: Microsoft .......................................................... 9 AWK: Alfred Aho ....................................................... 11 AWK & AMPL: Brian Kernighan ....................................... 15 Bash: Chet Ramey....................................................... 17 C#: Anders Hejlsberg.................................................... 20 C++: Bjarne Stroustrup ................................................. 27 Clojure: Rich Hickey .................................................... 35 ColdFusion: Jeremy Allaire .............................................. 38 D: Walter Bright ......................................................... 41 Erlang: Joe Armstrong................................................... 44 F#: Don Syme .......................................................... 48 Falcon: Giancarlo Niccolai ............................................... 51 Forth: Charles Moore .................................................... 59 Groovy: Guillaume Laforge .............................................. 61 Haskell: Simon Peyton-Jones............................................. 65 INTERCAL: Don Wood................................................. 76 JavaScript: Brendan Eich................................................ 79 Lua: Roberto Ierusalimschy..............................................
    [Show full text]
  • Machine Translation from Natural Language to Code Using Long-Short Term Memory
    Machine Translation from Natural Language to Code using Long-Short Term Memory K.M. Tahsin Hassan Rahit1∗, Rashidul Hasan Nabil2, and Md Hasibul Huq3 1 Institute of Computer Science, Bangladesh Atomic Energy Commission, Dhaka, Bangladesh *current - Department of Bio-chemistry & Molecular Biology, University of Calgary, Calgary, Alberta, Canada [email protected] 2 Department of Computer Science, American International University-Bangladesh, Dhaka, Bangladesh Department of Computer Science & Engineering, City University, Dhaka, Bangladesh [email protected] 3 Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada [email protected] Abstract. Making computer programming language more understand- able and easy for the human is a longstanding problem. From assembly language to present day's object-oriented programming, concepts came to make programming easier so that a programmer can focus on the logic and the architecture rather than the code and language itself. To go a step further in this journey of removing human-computer language barrier, this paper proposes machine learning approach using Recurrent Neural Network(RNN) and Long-Short Term Memory(LSTM) to con- vert human language into programming language code. The programmer will write expressions for codes in layman's language, and the machine learning model will translate it to the targeted programming language. The proposed approach yields result with 74.40% accuracy. This can be further improved by incorporating additional techniques, which are also discussed in this paper. arXiv:1910.11471v1 [cs.CL] 25 Oct 2019 Keywords: Text to code, machine learning, machine translation, NLP, RNN, LSTM 1 Introduction Removing computer-human language barrier is an inevitable advancement re- searchers are thriving to achieve for decades.
    [Show full text]
  • PROGRAMME HEADLINE 2021 SPONSOR CONFERENCE Bloomberg Is the Leading Provider of Financial News and Information
    EVENT VIRTUAL Spring ACCU 2021.3.10–13 Pre-Conference tutorials 2021.3.9 2021 CONFERENCE PROGRAMME HEADLINE 2021 SPONSOR CONFERENCE Bloomberg is the leading provider of financial news and information. Our R&Ddepartment consists of 3000 engineers working across WELCOME teams in both London and New York. Terminal is the primary product we are known We are technology people – when we write for – it used to run on custom hardware, but code, we like to understand exactly what the is now a piece of software that runs on a PC – hardware is doing. We live and breathe C++, typically connected to 2 or more monitors. Over and are concerned about cpu performance, 315,000 customers pay a monthly subscription optimizations, memory allocation behaviour, to access our real-time data and news, deep Welcome to ACCU 2021! as well as higher-level software engineering analytic functions and trading functionality principles such as building modular, scalable, through our custom browser. You will see many ACCU Conference is the annual conference developers. Even though the conference in reliable and debuggable code. We write a Bloomberg Terminals on most trading floors of the ACCU membership club, but open 2020 had to be cancelled because of the lot of systems ourselves, but have embraced around the world, and in the offices of influential to any and all who wish to attend. The COVID-19 pandemic, many speakers are the open source community. The Bloomberg decision-makers within financial markets. ACCU Conference has a history founded in happy to give their presentations in 2021. studying and evolving C and C++ – many of So we have our usual mix of keynotes, its members continue to have active roles sessions, quickies and lightning talks.
    [Show full text]
  • Matlab, Python, Julia: What to Choose in Economics?
    Computational Economics https://doi.org/10.1007/s10614-020-09983-3 Matlab, Python, Julia: What to Choose in Economics? Chase Coleman1 · Spencer Lyon1 · Lilia Maliar2 · Serguei Maliar3 Accepted: 8 April 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020 Abstract We perform a comparison of Matlab, Python and Julia as programming languages to be used for implementing global nonlinear solution techniques. We consider two popular applications: a neoclassical growth model and a new Keynesian model. The goal of our analysis is twofold: First, it is aimed at helping researchers in econom- ics choose the programming language that is best suited to their applications and, if needed, help them transit from one programming language to another. Second, our collections of routines can be viewed as a toolbox with a special emphasis on techniques for dealing with high dimensional economic problems. We provide the routines in the three languages for constructing random and quasi-random grids, low-cost monomial integration, various global solution methods, routines for check- ing the accuracy of the solutions as well as examples of parallelization. Our global solution methods are not only accurate but also fast. Solving a new Keynesian model with eight state variables only takes a few seconds, even in the presence of an active zero lower bound on nominal interest rates. This speed is important because it allows the model to be solved repeatedly as would be required for estimation. Keywords Toolkit · Dynamic model · New Keynesian model · Global nonlinear · Low discrepancy · Quasi Monte Carlo Electronic supplementary material The online version of this article (https ://doi.org/10.1007/s1061 4-020-09983 -3) contains supplementary material, which is available to authorized users.
    [Show full text]
  • Programming Language Evolution
    UCAM-CL-TR-902 Technical Report ISSN 1476-2986 Number 902 Computer Laboratory Programming language evolution Raoul-Gabriel Urma February 2017 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom phone +44 1223 763500 http://www.cl.cam.ac.uk/ c 2017 Raoul-Gabriel Urma This technical report is based on a dissertation submitted September 2015 by the author for the degree of Doctor of Philosophy to the University of Cambridge, Hughes Hall. Technical reports published by the University of Cambridge Computer Laboratory are freely available via the Internet: http://www.cl.cam.ac.uk/techreports/ ISSN 1476-2986 Abstract Programming languages are the way developers communicate with computers|just like natural languages let us communicate with one another. In both cases multiple languages have evolved. However, the programming language ecosystem changes at a much higher rate compared to natural languages. In fact, programming languages need to constantly evolve in response to user needs, hardware advances and research developments or they are otherwise displaced by newcomers. As a result, existing code written by developers may stop working with a newer language version. Consequently, developers need to search (analyse) and replace (refactor) code in their code bases to support new language versions. Traditionally, tools have focused on the replace aspect (refactoring) to support de- velopers evolving their code bases. This dissertation argues that developers also need machine support focused on the search aspect. This dissertation starts by characterising factors driving programming language evolu- tion based on external versus internal forces. Next, it introduces a classification of changes introduced by language designers that affect developers.
    [Show full text]
  • Programming in Python 3
    Programming in Python 3 A Complete Introduction to the Python Language Second Edition Mark Summerfield Upper Saddle River, NJ · Boston · Indianapolis · San Francisco New York · Toronto · Montreal · London · Munich · Paris · Madrid Capetown · Sydney · Tokyo · Singapore · Mexico City 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 publisher was aware of a trademark claim, the designations have been printed with initial capital letters or in all capitals. The author and publisher have taken care in the preparation of this book, but make no expressed or implied warranty of any kind and assume no responsibility for errors or omissions. No liability is assumed for incidental or consequential damages in connection with or arising out of the use of the information or programs contained herein. The publisher offers excellent discounts on this book when ordered in quantity for bulk purchases or special sales, which may include electronic versions and/or custom covers and content particular to your business, training goals, marketing focus, and branding interests. For more information, please contact: U.S. Corporate and Government Sales (800) 382-3419 [email protected] For sales outside the United States, please contact: International Sales [email protected] Visit us on the Web: informit.com/aw Library of Congress Cataloging-in-Publication Data Summerfield, Mark. Programming in Python 3 : a complete introduction to the Python language / Mark Summerfield.—2nd ed. p. cm. Includes bibliographical references and index. ISBN 978-0-321-68056-3 (pbk. : alk. paper) 1. Python (Computer program language) 2.
    [Show full text]
  • The Java™ Language Specification Third Edition the Java™ Series
    The Java™ Language Specification Third Edition The Java™ Series The Java™ Programming Language Ken Arnold, James Gosling and David Holmes ISBN 0-201-70433-1 The Java™ Language Specification Third Edition James Gosling, Bill Joy, Guy Steele and Gilad Bracha ISBN 0-321-24678-0 The Java™ Virtual Machine Specification Second Edition Tim Lindholm and Frank Yellin ISBN 0-201-43294-3 The Java™ Application Programming Interface, Volume 1: Core Packages James Gosling, Frank Yellin, and the Java Team ISBN 0-201-63452-X The Java™ Application Programming Interface, Volume 2: Window Toolkit and Applets James Gosling, Frank Yellin, and the Java Team ISBN 0-201-63459-7 The Java™ Tutorial: Object-Oriented Programming for the Internet Mary Campione and Kathy Walrath ISBN 0-201-63454-6 The Java™ Class Libraries: An Annotated Reference Patrick Chan and Rosanna Lee ISBN 0-201-63458-9 The Java™ FAQ: Frequently Asked Questions Jonni Kanerva ISBN 0-201-63456-2 The Java™ Language Specification Third Edition James Gosling Bill Joy Guy Steele Gilad Bracha ADDISON-WESLEY Boston ● San Francisco ● New York ● Toronto ● Montreal London ● Munich ● Paris ● Madrid Capetown ● Sydney ● Tokyo ● Singapore ● Mexico City The Java Language Specification iv Copyright 1996-2005 Sun Microsystems, Inc. 4150 Network Circle, Santa Clara, California 95054 U.S.A. All rights reserved. Duke logo™ designed by Joe Palrang. RESTRICTED RIGHTS LEGEND: Use, duplication, or disclosure by the United States Government is subject to the restrictions set forth in DFARS 252.227-7013 (c)(1)(ii) and FAR 52.227-19. The release described in this manual may be protected by one or more U.S.
    [Show full text]