Towards a formal framework for heterogeneous relation algebra

DOI10.1016/S0020-0255(99)00014-6zbMATH Open0942.03042OpenAlexW2076894627MaRDI QIDQ1961865FDOQ1961865

Authors: Claudia Hattensperger, Peter Kempf 

Publication date: 23 August 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00014-6

Recommendations

• Polymorphic type inference for the relational algebra
• Relational heterogeneity relaxed by subtyping
• Typed homomorphic relations extended with subtypes
• Relational and Kleene-Algebraic Methods in Computer Science
• A Logic of Type Relations and its Applications to Relational Databases

zbMATH Keywords

relation algebramodular type inference systempolymorphic typed relationstyping discipline

Mathematics Subject Classification ID

Logic in computer science (03B70) Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Title not available (Why is that?)
• Explaining type inference
• Relation algebraic domain constructions

Cited In (1)

• Relational heterogeneity relaxed by subtyping

Uses Software

• Automath

This page was built for publication: Towards a formal framework for heterogeneous relation algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961865)