Partial Cartesian Graph Product
Moez A. AbdelGawad
TL;DR
This paper introduces a novel binary operation on directed graphs called the Partial Cartesian Graph Product, exploring its properties and potential application in defining subtyping relations in object-oriented programming languages.
Contribution
It presents a new graph operation and discusses its theoretical properties and application in programming language subtyping relations.
Findings
Defines the Partial Cartesian Graph Product operation.
Analyzes properties of the new graph operation.
Suggests application in programming language subtyping.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Logic, Reasoning, and Knowledge