Guilherme Grochau Azzi
Guilherme Grochau Azzi
Javalang cannot parse line comments in the last line of code, if this line is terminated by the end of file instead of a line break character. This is probably...
The current mechanism for suggesting accounts is sometimes a bit too rigid, since it requires exact matches of the description. Instead, multiple suggestions could be obtained with naive bayesian inference,...
Types with the following structure occur in several modules. Indeed, some of those types are exactly the same (`NamedRule` is a common example.) ```haskell type NamedX = (String, X) ```...
The modules that implement the search for conflicts and dependencies have lot of duplicated code. In particular, some pushout complements are calculated in multiple places, some searches for morphisms are...
The types that characterize conflicts and dependencies are somewhat hard to understand. In particular, the type `CriticalPair` has some fields of type `Maybe`, but whose existence is related to the...
The default implementation for isomorphism checking between morphisms scales _terribly_, since for every isomorphism between codomains it has to find isomorphism on the domains. In the case of graph morphisms,...
Some categories have different classes of morphism, not just epi/mono/iso. In particular, some categories are adhesive with respect to a subclass N of monomorphisms. Some will further restrict the morphisms...
The method `induceSpanMorphism` of the `FindMorphism` class will sometimes generate an invalid morphism, since the desired morphism doesn't always exist. This should be documented, or even better, it should return...
Allow user-defined node/edge types in symbolic graphs. Allow user-defined attributes for each of these types.
Implement a data type for (untyped) symbolic graphs and morphisms, including instances of `Morphism`, `FindMorphism`, `EpiPair`, `AdhesiveHLR`. The base algebra should support only integers. The graphs are untyped, and each...