نتایج جستجو برای: morphisms
تعداد نتایج: 3259 فیلتر نتایج به سال:
Journal:
:Electronic Notes in Theoretical Computer Science
1998
1998
Lex Augusteijn
Sorting algorithms can be classiied in many diierent ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classiied as the natural recursion patterns that destruct or construct a given data-type, the so called cata-and anamorphisms respectively. We show that the selectio...
Journal:
:Conformal Geometry and Dynamics of the American Mathematical Society
1999
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید