Relation algebra as programming language using the Ampersand compiler
From MaRDI portal
Publication:1785856
DOI10.1016/j.jlamp.2018.04.002zbMath1400.68045DBLPjournals/jlp/Joosten18aOpenAlexW2801589704WikidataQ64330967 ScholiaQ64330967MaRDI QIDQ1785856
Publication date: 1 October 2018
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.04.002
relation algebrareactive programmingsoftware developmentlegal reasoningAmpersandinformation systems design
Uses Software
Cites Work
- Relation algebras
- Isabelle/HOL. A proof assistant for higher-order logic
- Ampersand
- Relational Heterogeneity Relaxed by Subtyping
- Type Checking by Domain Analysis in Ampersand
- Can programming be liberated from the von Neumann style?
- Parsing and Printing of and with Triples
- Software Development in Relation Algebra with Ampersand
- Computer Algebra in Scientific Computing
- An axiomatic basis for computer programming
- A relational model of data for large shared data banks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relation algebra as programming language using the Ampersand compiler