A complete language for faceted dataflow programs

06/13/2019
by   Antonin Delpeuch, et al.
0

We present a complete categorical axiomatization of a wide class of dataflow programs. This gives a three-dimensional diagrammatic language for workflows, more expressive than the directed acyclic graphs generally used for this purpose. This calls for an implementation of these representations in data transformation tools.

READ FULL TEXT
research
05/15/2020

Monads and "do" notation in the Wolfram Language

This paper describes a categorical interpretation of the Wolfram Languag...
research
07/02/2022

On Structuring Functional Programs with Monoidal Profunctors

We study monoidal profunctors as a tool to reason and structure pure fun...
research
06/09/2011

A Knowledge Compilation Map

We propose a perspective on knowledge compilation which calls for analyz...
research
10/19/2012

LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs

We analyze a new property of directed acyclic graphs (DAGs), called laye...
research
08/28/2016

A Generalization of the Directed Graph Layering Problem

The Directed Layering Problem (DLP) solves a step of the widely used lay...
research
04/25/2018

Stratified Negation in Limit Datalog Programs

There has recently been an increasing interest in declarative data analy...
research
07/16/2018

Teaching machines to understand data science code by semantic enrichment of dataflow graphs

Your computer is continuously executing programs, but does it really und...

Please sign up or login with your details

Forgot password? Click here to reset