Analysis of Algorithms Calculating the Maximal Disjoint Decomposition of a Set
From LRDE
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
- Authors
- Jim Newton
- Place
- Paris, France
- Type
- techreport
- Projects
- Climb
- Keywords
- types, set theory, graph, lisp
- Date
- 2017-02-02
Abstract
In this article we demonstrate 4 algorithms for calculating the maximal disjoint decomposition of a given set of types. We discuss some advantages and disadvantages of each, and compare their performance. We extended currently known work to describe an efficient algorithm for manipulating binary decision diagrams representing types in a programming language which supports subtyping viewed as subsets.
Documents
Bibtex (lrde.bib)
@TechReport{ newton.17.dtd.report, author = {Jim Newton}, title = {Analysis of Algorithms Calculating the Maximal Disjoint Decomposition of a Set}, institution = {LRDE}, year = 2017, address = {Paris, France}, month = jan, abstract = { In this article we demonstrate 4 algorithms for calculating the maximal disjoint decomposition of a given set of types. We discuss some advantages and disadvantages of each, and compare their performance. We extended currently known work to describe an efficient algorithm for manipulating binary decision diagrams representing types in a programming language which supports subtyping viewed as subsets.}, nodoi = {} }