Towards a formal framework for heterogeneous relation algebra

DOI10.1016/S0020-0255(99)00014-6zbMath0942.03042OpenAlexW2076894627MaRDI QIDQ1961865

Peter Kempf, Claudia Hattensperger

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

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)

Uses Software

• Automath

Cites Work

• Relation algebraic domain constructions
• Explaining type inference
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item

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