Partial Cartesian Graph Product

05/18/2018
by   Moez A. AbdelGawad, et al.
0

In this paper we define a new product-like binary operation on directed graphs, and we discuss some of its properties. We also briefly discuss its application in constructing the subtyping relation in generic nominally-typed object-oriented programming languages.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2018

Java Subtyping as an Infinite Self-Similar Partial Graph Product

Due to supporting variance annotations, such as wildcard types, the subt...
research
01/31/2022

Network Programming via Computable Products

The User Plane Function (UPF) aims to provide network services in the 3G...
research
07/11/2023

Simple Reference Immutability for System F-sub

Reference immutability is a type based technique for taming mutation tha...
research
12/31/2019

Definitions and Semantic Simulations Based on Object-Oriented Analysis and Modeling

We have proposed going beyond traditional ontologies to use rich semanti...
research
01/21/2018

NOOP: A Domain-Theoretic Model of Nominally-Typed OOP

The majority of industrial-strength object-oriented (OO) software is wri...
research
11/22/2018

Object-oriented design for massively parallel computing

We define an abstract framework for object-oriented programming and show...
research
12/19/2017

Object-Orientation in Graph-Based Design Grammars

The ongoing digital transformation in industry applies to all product li...

Please sign up or login with your details

Forgot password? Click here to reset