NDLI: Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Please wait, while we are loading the content...

TensorFlow: learning functions at scale

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

A new verified compiler backend for CakeML

Fully abstract compilation via universal embedding

Compact bit encoding schemes for simply-typed lambda-terms

A glimpse of Hopjs

Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong)

Unifiers as equivalences: proof-relevant unification of dependently typed data

Constructive Galois connections: taming the Galois connection framework for mechanized metatheory

Ghostbuster: a tool for simplifying and converting GADTs

Hierarchical memory management for parallel programs

Talking bananas: structural recursion for session types

Combining effects and coeffects via grading

Journey to find bugs in JavaScript web applications in the wild

Dag-calculus: a calculus for parallel computation

Sequent calculus as a compiler intermediate language

Oh Lord, please don't let contracts be misunderstood (functional pearl)

Queueing and glueing for optimal partitioning (functional pearl)

Experience report: growing and shrinking polygons for random testing of computational geometry algorithms

Automatically disproving fair termination of higher-order functional programs

Elaborator reflection: extending Idris in Idris

An abstract memory functor for verified C static analyzers

Indexed codata types

Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis

The best of both worlds: linear functional programming without compromise

String diagrams for free monads (functional pearl)

A functional programmer's guide to homotopy type theory

A lambda-calculus foundation for universal probabilistic programming

Refinement through restraint: bringing down the cost of verification

A type theory for incremental computational complexity with control flow changes

All sorts of permutations (functional pearl)

Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing

Higher-order ghost state

Partial type equivalences for verified dependent interoperability

Disjoint intersection types

A fully concurrent garbage collector for functional programs on multicore processors

Context-free session types

Deriving a probability density calculator (functional pearl)

Datafun: a functional Datalog

Set-theoretic types for polymorphic variants

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Content Provider	ACM Digital Library
Author	Castro, David Hammond, Kevin Sarkar, Susmit
Abstract	The increasing importance of parallelism has motivated the creation of better abstractions for writing parallel software, including structured parallelism using nested algorithmic skeletons. Such approaches provide high-level abstractions that avoid common problems, such as race conditions, and often allow strong cost models to be defined. However, choosing a combination of algorithmic skeletons that yields good parallel speedups for a program on some specific parallel architecture remains a difficult task. In order to achieve this, it is necessary to simultaneously reason both about the costs of different parallel structures and about the semantic equivalences between them. This paper presents a new type-based mechanism that enables strong static reasoning about these properties. We exploit well-known properties of a very general recursion pattern, hylomorphisms, and give a denotational semantics for structured parallel processes in terms of these hylomorphisms. Using our approach, it is possible to determine formally whether it is possible to introduce a desired parallel structure into a program without altering its functional behaviour, and also to choose a version of that parallel structure that minimises some given cost model. .
Starting Page	4
Ending Page	17
Page Count	14
File Format	PDF
ISBN	9781450342193
DOI	10.1145/2951913.2951920
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-09-04
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Type systems Term rewriting systems Parallelism Hylomorphisms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Automatically deriving cost models for structured parallel processes using hylomorphisms

Reasoning about Inherent Parallelism in Object-Oriented Programs using Ownership Types

Inductive reasoning about effectful data types

On the power of p systems with parallel rewriting and conditional communication.

Congruence Types (1996)

Reasoning about Term Rewriting in Kleene Categories with Converse

iRho: an imperative rewriting calculus

Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Similar Documents

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms

Automatically deriving cost models for structured parallel processes using hylomorphisms

Reasoning about Inherent Parallelism in Object-Oriented Programs using Ownership Types

Inductive reasoning about effectful data types

On the power of p systems with parallel rewriting and conditional communication.

Congruence Types (1996)

Reasoning about Term Rewriting in Kleene Categories with Converse

iRho: an imperative rewriting calculus

Conjugate Hylomorphisms -- Or: The Mother of All Structured Recursion Schemes

Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms