Personal tools

Analysis of Algorithms Calculating the Maximal Disjoint Decomposition of a Set

From LRDE

Jump to: navigation, search

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.}
}