Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907): Difference between revisions

Latest revision as of 04:33, 10 July 2024

scientific article

Language	Label	Description	Also known as
English	Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures	scientific article

Statements

instance of

scholarly article

0 references

title

Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (English)

0 references

0 references

0 references

Journal of Logical and Algebraic Methods in Programming

0 references

publication date

10 June 2015

0 references

zbMATH Keywords

directed graphs

0 references

relation algebra

0 references

reflexive-transitive closure

0 references

rectangle

0 references

functional programming

0 references

Haskell

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.jlamp.2014.08.003

0 references

0 references

0 references

0 references

Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem

0 references

Relational depth-first-search with applications

0 references

Computer Algebra in Scientific Computing

0 references

Implementing Relational Specifications in a Constraint Functional Logic Language

0 references

On Automated Program Construction and Verification

0 references

A Functional, Successor List Based Version of Warshall’s Algorithm with Applications

0 references

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures

0 references

Automated Verification of Relational While-Programs

0 references

On computing representatives

0 references

Q4213379

0 references

Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings

0 references

Q4281652

0 references

Functional programming with graphs

0 references

Inductive graphs and functional graph algorithms

0 references

New Bounds on the Complexity of the Shortest Path Problem

0 references

The integration of functions into logic programming: From theory to practice

0 references

Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell

0 references

The algebraic structure of transitive closure and its application to attribute type signatures

0 references

Efficient transitive closure of sparse matrices over closed semirings

0 references

Two graph algorithms derived

0 references

Deriving a class of layer-oriented graph algorithms

0 references

Q5287518

0 references

Rectangles, Fringes, and Inverses

0 references

Q3060335

0 references

Q3995087

0 references

Gaussian elimination is not optimal

0 references

Q4040000

0 references

A Theorem on Boolean Matrices

0 references

Identifiers

zbMATH Open document ID

1329.68062

0 references

DOI

10.1016/j.jlamp.2014.08.003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2347907

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jlamp.2014.08.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2055560858
@@ Property / OpenAlex ID: W2055560858 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114851603
@@ Property / Wikidata QID: Q114851603 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-point calculus
@@ Property / cites work: Fixed-point calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815518
@@ Property / cites work: Q3815518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4362883
@@ Property / cites work: Q4362883 / rank @@
+Normal rank
@@ Property / cites work @@
+Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
+Normal rank
@@ Property / cites work @@
+Relational depth-first-search with applications
@@ Property / cites work: Relational depth-first-search with applications / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Algebra in Scientific Computing
@@ Property / cites work: Computer Algebra in Scientific Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing Relational Specifications in a Constraint Functional Logic Language
+Normal rank
@@ Property / cites work @@
+On Automated Program Construction and Verification
+Normal rank
@@ Property / cites work @@
+A Functional, Successor List Based Version of Warshall’s Algorithm with Applications
+Normal rank
@@ Property / cites work @@
+Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures
+Normal rank
@@ Property / cites work @@
+Automated Verification of Relational While-Programs
+Normal rank
@@ Property / cites work @@
+On computing representatives
@@ Property / cites work: On computing representatives / rank @@
+Normal rank
@@ Property / cites work @@
+Q4213379
@@ Property / cites work: Q4213379 / rank @@
+Normal rank
@@ Property / cites work @@
+Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings
+Normal rank
@@ Property / cites work @@
+Q4281652
@@ Property / cites work: Q4281652 / rank @@
+Normal rank
@@ Property / cites work @@
+Functional programming with graphs
@@ Property / cites work: Functional programming with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inductive graphs and functional graph algorithms
@@ Property / cites work: Inductive graphs and functional graph algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+The integration of functions into logic programming: From theory to practice
+Normal rank
@@ Property / cites work @@
+Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell
+Normal rank
@@ Property / cites work @@
+The algebraic structure of transitive closure and its application to attribute type signatures
+Normal rank
@@ Property / cites work @@
+Efficient transitive closure of sparse matrices over closed semirings
+Normal rank
@@ Property / cites work @@
+Two graph algorithms derived
@@ Property / cites work: Two graph algorithms derived / rank @@
+Normal rank
@@ Property / cites work @@
+Deriving a class of layer-oriented graph algorithms
+Normal rank
@@ Property / cites work @@
+Q5287518
@@ Property / cites work: Q5287518 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangles, Fringes, and Inverses
@@ Property / cites work: Rectangles, Fringes, and Inverses / rank @@
+Normal rank
@@ Property / cites work @@
+Q3060335
@@ Property / cites work: Q3060335 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995087
@@ Property / cites work: Q3995087 / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040000
@@ Property / cites work: Q4040000 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank