A lower bound for the intersection of regular forests
Regular Sigma X-forests continue to play an important role in programming languages, specifically in the design of type systems. They arise naturally as terms of constructor-based, recursive data types in logic and functional languages. Deciding whether the intersection of a sequence …
Read online
Reader not loading? Open it on Archive.org instead.
