Maximal Fixed Point
Historically, the least solution to the data flow equations is called the MFP solution (for Maximal Fixed Point) althout it in fact computes the least fixed point; the reason is that the classical literature tends to focus on analyses where $\bigsqcup $ is $\cap $ (and because the least fixed point with respect to $\u2291$ or $\supseteq $ then equals the greatest fixed point with respect to $\subseteq $)
Nielson, Flemming, Hanne R. Nielson, and Chris Hankin. Principles of program analysis. Springer, 2015.
No webmentions were found.
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}

{{ webmention.content }}
{% endfor %}
No bookmarks were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}
 {% endfor %}
No likes were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}

{{ webmention.content }}
{% endfor %}
No links were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}
 {{ webmention.title }} {% endfor %}
No posts were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}

{{ webmention.content }}
{% endfor %}
No replies were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}
 {% endfor %}
No reposts were found.
{% endif %}
{% if webmentions.size > 0 %}
{% capture webmention_types %}{{ types  join: ',' }}{% endcapture %}
{{ count }}{% capture webmention_types %}{{ types  join: ',' }}{% endcapture %}

{% for webmention in webmentions %}
 {% endfor %}
No RSVPs were found.
{% endif %}
{% if webmentions.size > 0 %}

{% for webmention in webmentions %}

{% if webmention.author %} {% endif %}{% if webmention.content %} {{ webmention.content }} {% else %} {{ webmention.title }} {% endif %}
{% endfor %}
No webmentions were found.
{% endif %}