Programming: Pipes

Total Page:16

File Type:pdf, Size:1020Kb

Programming: Pipes IBM Tivoli NetView for z/OS Version 6 Release 2 Programming: Pipes IBM SC27-2859-04 IBM Tivoli NetView for z/OS Version 6 Release 2 Programming: Pipes IBM SC27-2859-04 Note Before using this information and the product it supports, read the information in “Notices” on page 327. This edition applies to version 6, release 2 of IBM Tivoli NetView for z/OS (product number 5697-NV6) and to all subsequent versions, releases, and modifications until otherwise indicated in new editions. This edition replaces SC27-2859-03. © Copyright IBM Corporation 1997, 2014. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Figures ................................... vii About this publication ............................. ix Intended audience ................................. ix Publications ................................... ix IBM Tivoli NetView for z/OS library .......................... ix Related publications ............................... xi Accessing terminology online ............................ xi Using NetView for z/OS online help .......................... xii Accessing publications online ............................ xii Ordering publications ............................... xii Accessibility ................................... xiii Service Management Connect ............................. xiii Tivoli technical training ............................... xiii Tivoli user groups ................................. xiii Downloads ................................... xiii Support information ................................ xiv Conventions used in this publication .......................... xiv Typeface conventions ............................... xiv Operating system-dependent variables and paths...................... xv Syntax diagrams................................. xv Chapter 1. NetView Pipelines Introduction and General Concepts ........... 1 What Is a Pipeline ................................. 1 Pipeline Stages .................................. 2 PIPE Command .................................. 3 Stage Input and Output ............................... 4 First and Subsequent Stages ............................. 6 Complex Pipelines ................................. 7 Creating a Complex Pipeline ............................. 7 Processing a Complex Pipeline ............................ 9 Stages ..................................... 11 Device Drivers ................................. 11 Filters .................................... 12 Understanding NetView Pipelines ............................ 12 How a Pipeline Begins .............................. 12 How a Pipeline Ends ............................... 12 Online Help Facility ................................ 13 Getting Started with NetView Pipelines .......................... 13 Chapter 2. Pipeline Stages and Syntax ...................... 19 PIPE (NCCF) ................................... 19 PIPE Stages .................................. 23 PIPE APPEND .................................. 26 PIPE BETWEEN .................................. 28 PIPE CASEI ................................... 30 PIPE CHANGE .................................. 31 PIPE CHOP ................................... 34 PIPE COLLECT .................................. 36 PIPE CONSOLE .................................. 41 PIPE COREVENT ................................. 44 PIPE COREVTDA ................................. 45 PIPE CORRCMD ................................. 46 PIPE CORRWAIT ................................. 49 PIPE COUNT................................... 54 © Copyright IBM Corp. 1997, 2014 iii PIPE CPDOMAIN ................................. 57 PIPE CZR .................................... 59 PIPE DELDUPES ................................. 61 PIPE DIVERT................................... 63 PIPE DROP ................................... 64 PIPE DUPLICAT ................................. 66 PIPE EDIT.................................... 67 PIPE ENVDATA ................................. 114 PIPE EXPOSE .................................. 115 PIPE FANIN................................... 117 PIPE FANINANY ................................. 118 PIPE FANOUT .................................. 120 PIPE FMTPACKT ................................. 121 PIPE HELDMSG ................................. 126 PIPE HOLE ................................... 127 PIPE INSTORE .................................. 129 PIPE INTERPRT ................................. 131 PIPE IPLOG ................................... 134 PIPE JOINCONT ................................. 135 PIPE KEEP ................................... 137 PIPE LITERAL .................................. 140 PIPE LOCATE .................................. 141 PIPE LOGTO .................................. 143 PIPE LOOKUP .................................. 144 PIPE MEMLIST.................................. 148 PIPE MVS ................................... 150 PIPE NETVIEW ................................. 152 PIPE NLOCATE ................................. 156 PIPE NLS ................................... 157 PIPE NOT ................................... 159 PIPE NPDAEVD ................................. 160 PIPE PERSIST .................................. 161 PIPE PICK ................................... 164 PIPE PIPEND .................................. 166 PIPE PPI .................................... 168 PIPE PRESATTR ................................. 173 PIPE QSAM ................................... 176 PIPE REVERSE .................................. 180 PIPE REVISRPT ................................. 182 PIPE ROUTE .................................. 182 PIPE SAFE ................................... 185 PIPE SEPARATE ................................. 188 PIPE SORT ................................... 190 PIPE SPLIT ................................... 192 PIPE SQL.................................... 195 Performing a Query with SQL SELECT......................... 198 Performing a Query with DESCRIBE SELECT ...................... 198 Loading Tables with SQL INSERT .......................... 199 Release statement, Set Connection, Set Current Degree, Set Current Package Set, Set Current Rules, or Send Current SQLID ................................. 199 Using SQL LISTREGS .............................. 199 Using SQL EXECUTE .............................. 200 Using Multiple Concurrent SQL Stages ......................... 200 Other Considerations When Using SQL ........................ 201 PIPE SQLCODES ................................. 201 PIPE STEM and PIPE $STEM ............................. 202 PIPE STRIP ................................... 206 PIPE SUBSYM .................................. 208 PIPE TAKE ................................... 209 PIPE TOSTRING ................................. 210 PIPE TSO.................................... 212 iv Programming: Pipes PIPE TSROUTE.................................. 217 PIPE UNIX ................................... 218 PIPE VAR and PIPE $VAR .............................. 222 PIPE VARLOAD ................................. 225 PIPE VERIFY .................................. 229 PIPE VET ................................... 230 PIPE VTAM ................................... 235 PIPE XCFMSG .................................. 238 PIPE XCFQUERY ................................. 239 PIPE XCFTABLE ................................. 241 PIPE XLATE................................... 243 PIPE < (From Disk) ................................ 245 PIPE > (To Disk) ................................. 248 Chapter 3. NetView Pipelines Device Drivers ................... 249 Interfacing with the Task: CONSOLE, HELDMSG, LITERAL, LOGTO ............... 249 Displaying Messages: CONSOLE ........................... 249 Copying Held Messages into the Pipeline: HELDMSG.................... 252 Inserting Text into the Pipeline: LITERAL ........................ 253 Copying Pipeline Contents to a Log: LOGTO....................... 255 Interfacing with Other Applications: NETVIEW, VTAM .................... 256 Running a NetView Command: NETVIEW ....................... 256 Running a VTAM Command: VTAM ......................... 259 Working with DASD Data: < (From Disk) ......................... 261 Reading from DASD: (<) ............................. 261 Accessing Variables within Command Procedures: VAR, STEM, SAFE ............... 262 Reading from or Writing to Named Variables: VAR..................... 262 Reading from or Writing to Variables in a Stemmed Array: STEM ................ 263 Reading from or Writing to a Command Procedure Message: SAFE ............... 265 Building Large PIPE Commands: INTERPRT ........................ 267 Using the INTERPRT Stage............................. 267 Chapter 4. NetView Pipeline Filters ....................... 269 Manipulating Messages: SEPARATE, COLLECT ....................... 269 Breaking Up an MLWTO: SEPARATE ......................... 269 Building an MLWTO: COLLECT ........................... 270 Selecting Messages by Content: LOCATE, NLOCATE, TOSTRING ................. 271 Keeping or Discarding Matching Messages: LOCATE, NLOCATE ................ 272 Selecting Messages Up to and Including a Message That Matches a Specified Text String: TOSTRING .... 275 Selecting Messages by Position: TAKE, DROP ....................... 277 Keeping the First or Last n Messages: TAKE ....................... 277 Discarding the First or Last n Messages: DROP ...................... 278 Emptying the Pipeline: HOLE ............................. 279 Determining Correlation: HOLE ..........................
Recommended publications
  • Asp Net Core Request Pipeline
    Asp Net Core Request Pipeline Is Royce always cowled and multilobate when achromatize some wall very instanter and lawlessly? Hobbyless and flustered brazensVladamir regressively? cocainizing her intangibles tiptoed or cluster advertently. Is Patric fuzzed or paintable when cogs some theocracy Or gray may choose to berry the request. Json files etc and community of response body is not inject all low maintenance, we will be same coin. Another through components that asp and cto of. How extensible it crashes, just by one of startup class controller. Do the extended with really very complex scenarios when he enjoys sharing it ever was to delete models first user makes for node. Even add to implement captcha in startup class to the same concept is the reason you want to. Let us a pipeline to any incoming request processing, firefox still create an output? For an app to build a cup of. Razor pages uses handler methods to deal of incoming HTTP request. Ask how the above mentioned in last middleware, the come to tell who are ready simply obsolete at asp and options. Have asp and asp net core request pipeline but will not be mapped to pipeline io threads to work both. The internet and when creating sawdust in snippets or improvements that by one description be a request pipeline branching. Help editing this article, ordinary code inside of hosting infrastructure asp and actions before, we issue was not. The body to deal with minimal footprint to entity framework of needed loans for each middleware will take a docker, that receive criticism.
    [Show full text]
  • Stclang: State Thread Composition As a Foundation for Monadic Dataflow Parallelism Sebastian Ertel∗ Justus Adam Norman A
    STCLang: State Thread Composition as a Foundation for Monadic Dataflow Parallelism Sebastian Ertel∗ Justus Adam Norman A. Rink Dresden Research Lab Chair for Compiler Construction Chair for Compiler Construction Huawei Technologies Technische Universität Dresden Technische Universität Dresden Dresden, Germany Dresden, Germany Dresden, Germany [email protected] [email protected] [email protected] Andrés Goens Jeronimo Castrillon Chair for Compiler Construction Chair for Compiler Construction Technische Universität Dresden Technische Universität Dresden Dresden, Germany Dresden, Germany [email protected] [email protected] Abstract using monad-par and LVars to expose parallelism explicitly Dataflow execution models are used to build highly scalable and reach the same level of performance, showing that our parallel systems. A programming model that targets parallel programming model successfully extracts parallelism that dataflow execution must answer the following question: How is present in an algorithm. Further evaluation shows that can parallelism between two dependent nodes in a dataflow smap is expressive enough to implement parallel reductions graph be exploited? This is difficult when the dataflow lan- and our programming model resolves short-comings of the guage or programming model is implemented by a monad, stream-based programming model for current state-of-the- as is common in the functional community, since express- art big data processing systems. ing dependence between nodes by a monadic bind suggests CCS Concepts • Software and its engineering → Func- sequential execution. Even in monadic constructs that explic- tional languages. itly separate state from computation, problems arise due to the need to reason about opaquely defined state.
    [Show full text]
  • Q International Business Machines Corporation
    Table of Contents UNITED STATES SECURITIES AND EXCHANGE COMMISSION WASHINGTON, DC 20549 FORM 10 - Q QUARTERLY REPORT PURSUANT TO SECTION 13 or 15(d) OF THE SECURITIES EXCHANGE ACT OF 1934 FOR THE QUARTER ENDED JUNE 30, 2017 1-2360 (Commission file number) INTERNATIONAL BUSINESS MACHINES CORPORATION (Exact name of registrant as specified in its charter) New York 13-0871985 (State of incorporation) (IRS employer identification number) Armonk, New York 10504 (Address of principal executive offices) (Zip Code) 914-499-1900 (Registrant’s telephone number) Indicate by check mark whether the registrant (1) has filed all reports required to be filed by Section l3 or l5(d) of the Securities Exchange Act of 1934 during the preceding 12 months (or for such shorter period that the registrant was required to file such reports), and (2) has been subject to such filing requirements for the past 90 days. Yes _ No Indicate by check mark whether the registrant has submitted electronically and posted on its corporate Web site, if any, every Interactive Data File required to be submitted and posted pursuant to Rule 405 of Regulation S-T (§232.405 of this chapter) during the preceding 12 months (or for such shorter period that the registrant was required to submit and post such files). Yes _ No Indicate by check mark whether the registrant is a large accelerated filer, an accelerated filer, a non-accelerated filer, smaller reporting company, or an emerging growth company. See the definitions of “large accelerated filer,” “accelerated filer,” “smaller reporting company,” and “emerging growth company” in Rule 12b-2 of the Exchange Act.
    [Show full text]
  • Let's Get Functional
    5 LET’S GET FUNCTIONAL I’ve mentioned several times that F# is a functional language, but as you’ve learned from previous chapters you can build rich applications in F# without using any functional techniques. Does that mean that F# isn’t really a functional language? No. F# is a general-purpose, multi paradigm language that allows you to program in the style most suited to your task. It is considered a functional-first lan- guage, meaning that its constructs encourage a functional style. In other words, when developing in F# you should favor functional approaches whenever possible and switch to other styles as appropriate. In this chapter, we’ll see what functional programming really is and how functions in F# differ from those in other languages. Once we’ve estab- lished that foundation, we’ll explore several data types commonly used with functional programming and take a brief side trip into lazy evaluation. The Book of F# © 2014 by Dave Fancher What Is Functional Programming? Functional programming takes a fundamentally different approach toward developing software than object-oriented programming. While object-oriented programming is primarily concerned with managing an ever-changing system state, functional programming emphasizes immutability and the application of deterministic functions. This difference drastically changes the way you build software, because in object-oriented programming you’re mostly concerned with defining classes (or structs), whereas in functional programming your focus is on defining functions with particular emphasis on their input and output. F# is an impure functional language where data is immutable by default, though you can still define mutable data or cause other side effects in your functions.
    [Show full text]
  • BIOVIA Pipeline Pilot System Requirements
    SYSTEM REQUIREMENTS PIPELINE PILOT 2020 Copyright Notice ©2019 Dassault Systèmes. All rights reserved. 3DEXPERIENCE, the Compass icon and the 3DS logo, CATIA, SOLIDWORKS, ENOVIA, DELMIA, SIMULIA, GEOVIA, EXALEAD, 3DVIA, 3DSWYM, BIOVIA, NETVIBES, IFWE and 3DEXCITE, are commercial trademarks or registered trademarks of Dassault Systèmes, a French "société européenne" (Versailles Commercial Register # B 322 306 440), or its subsidiaries in the U.S. and/or other countries. All other trademarks are owned by their respective owners. Use of any Dassault Systèmes or its subsidiaries trademarks is subject to their express written approval. Acknowledgments and References To print photographs or files of computational results (figures and/or data) obtained by using Dassault Systèmes software, acknowledge the source in an appropriate format. For example: "Computational results were obtained by using Dassault Systèmes BIOVIA software programs. Pipeline Pilot Server was used to perform the calculations and to generate the graphical results." Dassault Systèmes may grant permission to republish or reprint its copyrighted materials. Requests should be submitted to Dassault Systèmes Customer Support, either by visiting https://www.3ds.com/support/ and clicking Call us or Submit a request, or by writing to: Dassault Systèmes Customer Support 10, Rue Marcel Dassault 78140 Vélizy-Villacoublay FRANCE Contents About This Document 1 Definitions 1 Additional Information 1 Dassault Systèmes Support Resources 1 Pipeline Pilot Server Requirements 2 Minimum Hardware
    [Show full text]
  • Fast Linux I/O in the Unix Tradition
    — preprint only: final version will appear in OSR, July 2008 — PipesFS: Fast Linux I/O in the Unix Tradition Willem de Bruijn Herbert Bos Vrije Universiteit Amsterdam Vrije Universiteit Amsterdam and NICTA [email protected] [email protected] ABSTRACT ory wall” [26]). To improve throughput, it is now essential This paper presents PipesFS, an I/O architecture for Linux to avoid all unnecessary memory operations. Inefficient I/O 2.6 that increases I/O throughput and adds support for het- primitives exacerbate the effects of the memory wall by in- erogeneous parallel processors by (1) collapsing many I/O curring unnecessary copying and context switching, and as interfaces onto one: the Unix pipeline, (2) increasing pipe a result of these cache misses. efficiency and (3) exploiting pipeline modularity to spread computation across all available processors. Contribution. We revisit the Unix pipeline as a generic model for streaming I/O, but modify it to reduce overhead, PipesFS extends the pipeline model to kernel I/O and com- extend it to integrate kernel processing and complement it municates with applications through a Linux virtual filesys- with support for anycore execution. We link kernel and tem (VFS), where directory nodes represent operations and userspace processing through a virtual filesystem, PipesFS, pipe nodes export live kernel data. Users can thus interact that presents kernel operations as directories and live data as with kernel I/O through existing calls like mkdir, tools like pipes. This solution avoids new interfaces and so unlocks all grep, most languages and even shell scripts.
    [Show full text]
  • Making a Faster Curry with Extensional Types
    Making a Faster Curry with Extensional Types Paul Downen Simon Peyton Jones Zachary Sullivan Microsoft Research Zena M. Ariola Cambridge, UK University of Oregon [email protected] Eugene, Oregon, USA [email protected] [email protected] [email protected] Abstract 1 Introduction Curried functions apparently take one argument at a time, Consider these two function definitions: which is slow. So optimizing compilers for higher-order lan- guages invariably have some mechanism for working around f1 = λx: let z = h x x in λy:e y z currying by passing several arguments at once, as many as f = λx:λy: let z = h x x in e y z the function can handle, which is known as its arity. But 2 such mechanisms are often ad-hoc, and do not work at all in higher-order functions. We show how extensional, call- It is highly desirable for an optimizing compiler to η ex- by-name functions have the correct behavior for directly pand f1 into f2. The function f1 takes only a single argu- expressing the arity of curried functions. And these exten- ment before returning a heap-allocated function closure; sional functions can stand side-by-side with functions native then that closure must subsequently be called by passing the to practical programming languages, which do not use call- second argument. In contrast, f2 can take both arguments by-name evaluation. Integrating call-by-name with other at once, without constructing an intermediate closure, and evaluation strategies in the same intermediate language ex- this can make a huge difference to run-time performance in presses the arity of a function in its type and gives a princi- practice [Marlow and Peyton Jones 2004].
    [Show full text]
  • Pipecheck: 3D Scanning Solution Pipeline Integrity Assessment
    NDT SOLUTIONS 3D3D SCANNING SCANNING SOLUTION SOLUTION FORFOR PIPELINE PIPELINE INTEGRITY INTEGRITY ASSESSMENTASSESSMENT CODE-COMPLIANT CODE-COMPLIANT Pipeline operators and NDT service companies are facing an increasing pressure from regulation authorities and environmentalist groups to guarantee pipeline networks integrity, while wanting to keep maintenance costs as low as possible. Field crews are experiencing pressure to complete inspection as quickly as possible so the excavation site can be backfilled, and the pipeline, put back into service in the shortest time. Thus, the use of surface inspection tools that are reliable, efficient and user-friendly is of paramount importance. Creaform has developed the PipecheckTM solution for pipeline integrity assessment. The solution includes a HandySCAN 3DTM portable handheld scanner and the Pipecheck software. Thanks to this unique 3D scanning technology and innovative software, surface inspection has been reinvented completely! RELIABLE. EFFICIENT. EASY. INTRODUCING PIPECHECK. PIPECHECK SOFTWARE MODULES CORROSION MECHANICAL DAMAGE Pipecheck’s pipeline corrosion software module offers very fast and As its name states, this software module has been developed reliable data processing that generates instant, on-site results. specifically for pipeline mechanical damage analysis. This module In comparison with traditional measurement methods, this software features numerous key functionalities that increase dent understanding offers accuracy and repeatability that are beyond expectations. and facilitate the decision making process. ADVANCED FUNCTIONALITIES CORROSION IN ILI CORRELATION MECHANICAL DAMAGE STRAIGHTENING OPERATION TOOL Being able to separate material loss depth Traditional methods for depth measurement The ILI Correlation tool is used to correlate from a mechanical damage deformation is (pit gauge) on field bends can’t be used in-line inspection data with the Pipecheck 3D no longer a dream.
    [Show full text]
  • Characteristics of Workloads Using the Pipeline Programming Model
    Characteristics of Workloads Using the Pipeline Programming Model Christian Bienia and Kai Li Department of Computer Science, Princeton University {cbienia, li}@cs.princeton.edu Abstract covered by their applications. Second, we demonstrate that Pipeline parallel programming is a frequently used model to the programs using the pipeline model have different char- program applications on multiprocessors. Despite its popu- acteristics compared to other workloads. The differences larity, there is a lack of studies of the characteristics of such are significant and systematic in nature, which justifies the workloads. This paper gives an overview of the pipeline existence of pipelined programs in the PARSEC benchmark model and its typical implementations for multiprocessors. suite [2]. This suggests that pipelined workloads should be We present implementation choices and analyze their im- considered for the inclusion in future benchmark programs pact on the program. We furthermore show that workloads for computer architecture studies. that use the pipeline model have their own unique charac- The remainder of the paper is structured as follows: teristics that should be considered when selecting a set of Section 2 presents a survey of the pipeline parallelization benchmarks. Such information can be beneficial for pro- model. In Section 3 we discuss how we studied the impact gram developers as well as for computer architects who of the pipeline model on the workload characteristics, and want to understand the behavior of applications. we present our experimental results in Section 4. Related work is discussed in Section 5 before we conclude in Sec- 1 Introduction tion 6. Modern parallel workloads are becoming increasingly di- verse and use a wide range of techniques and methods to 2 Pipeline Programming Model take advantage of multiprocessors.
    [Show full text]
  • The Massachusetts-Israel Economic Impact Study
    The Massachusetts-Israel Economic Impact Study 2016 Edition: The Boston-Israel Power Partnership An expanding relationship that generates revenue, jobs, and investment for the benefit of both economies Boston Tel Aviv June 2016 Prepared for the New England-Israel Business Council With support from CJP of Greater Boston Based on research by Stax, Inc. With additional research by TAMID @ Boston University by David Goodtree Table of Contents » Executive Summary ....................................................................................................... 4 » Israeli Innovation Is a Major Driver of the Massachusetts Economy ............................4 » About the Title of This Whitepaper .....................................................................................5 » Israeli Entrepreneurs Choose Boston To Build Global Businesses ..................... 6 » Boston is a Gateway for Israel to U.S. and Global Markets ............................................6 » Revenue ...................................................................................................................................7 » Jobs ...........................................................................................................................................8 » Capital ......................................................................................................................................8 » Acquisitions .............................................................................................................................10
    [Show full text]
  • Elastic Pipeline Design of High Performance Micro-Controller YL8MCU for Signal Processing of Digital Home Appliances
    Send Orders for Reprints to [email protected] The Open Automation and Control Systems Journal, 2015, 7, 863-872 863 Open Access Elastic Pipeline Design of High Performance Micro-Controller YL8MCU for Signal Processing of Digital Home Appliances Fulong Chen1,*, Yunxiang Sun2, Chuanxin Zhao2, Jie Yang2, Heping Ye2, Junru Zhu2, and Qimei Tang2 1Department of Computer Science & Technology, Anhui Normal University, Wuhu, Anhui 241002, China 2Network and Information Security Engineering Research Center, Anhui Normal University, Wuhu, Anhui 241002, China Abstract-With the growing complexity of the structure and function of the digital home appliance controllers, the higher requirements on the design of integrated circuits are expected. In view of the lower efficiency of the traditional large scale integrated circuit design, such as long design cycle, high investment and bad flexibility, therefore, the traditional design method is unable to meet the rapid product development. A design and its implementation scheme based on System-on- Programmable-Chip (SoPC) technologies with the Intellectual Property (IP) core parametric technology and elastic design method are proposed for the Micro-controller Unit (MCU) YL8MCU applied in digital home appliances. It makes used of Reduced Instruction Set Computer (RISC) framework and 5-stage pipeline technology for designing the instruction sys- tem and hardware structure so as to improve the speed of processing data and instructions. Finally the correctness and fea- sibility of its function is verified with the integrated verification, the IP function module verification based on coverage and the simulation test of the controlling flow for the washer. The results show that YL8MCU meets the requirements of digital home appliances and supports system integration on chip.
    [Show full text]
  • Interleaving Data and Effects"
    Archived version from NCDOCKS Institutional Repository http://libres.uncg.edu/ir/asu/ Interleaving data and effects By: Robert Atkey and Patricia Johann Abstract: The study of programming with and reasoning about inductive datatypes such as lists and trees has benefited from the simple categorical principle of initial algebras. In initial algebra semantics, each inductive datatype is represented by an initial f-algebra for an appropriate functor f. The initial algebra principle then supports the straightforward derivation of definitional principles and proof principles for these datatypes. This technique has been expanded to a whole methodology of structured functional programming, often called origami programming.In this article we show how to extend initial algebra semantics from pure inductive datatypes to inductive datatypes interleaved with computational effects. Inductive datatypes interleaved with effects arise naturally in many computational settings. For example, incrementally reading characters from a file generates a list of characters interleaved with input/output actions, and lazily constructed infinite values can be represented by pure data interleaved with the possibility of non-terminating computation. Straightforward application of initial algebra techniques to effectful datatypes leads either to unsound conclusions if we ignore the possibility of effects, or to unnecessarily complicated reasoning because the pure and effectful concerns must be considered simultaneously. We show how pure and effectful concerns can be separated using the abstraction of initial f-and-m-algebras, where the functor f describes the pure part of a datatype and the monad m describes the interleaved effects. Because initial f-and-m-algebras are the analogue for the effectful setting of initial f- algebras, they support the extension of the standard definitional and proof principles to the effectful setting.
    [Show full text]