Relations as abstract datatypes: An institution to specify relations between algebras
DOI10.1007/3-540-59293-8_233zbMATH Open1496.68198OpenAlexW1480884270MaRDI QIDQ5096763FDOQ5096763
Authors: Hubert Baumeister 
Publication date: 18 August 2022
Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59293-8_233
Recommendations
- Dependently-typed formalisation of relation-algebraic abstractions
- Classes of finite relations as initial abstract data types. II
- Classes of finite relations as initial abstract data types. I
- Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
- scientific article; zbMATH DE number 591252
- A perspective on the theory of relation algebras
- PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
- Computer Science Logic
- Relational lattices: from databases to universal algebra
- A Logic of Type Relations and its Applications to Relational Databases
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)
Cites Work
- Title not available (Why is that?)
- Institutions: abstract model theory for specification and programming
- Title not available (Why is that?)
- Specifications in an arbitrary institution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group extensions for 45 years
- Title not available (Why is that?)
- D-oids: a model for dynamic data-types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Relations as abstract datatypes: An institution to specify relations between algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096763)
