paf31

12 ms·

1. 91.▲
   Typechecking Purity programs using a modified Algorithm W(typesandotherdistractions.com)

   4 points by paf31 15y ago|0 comments
2. 92.▲
   Abstraction Elimination in the Purity language(typesandotherdistractions.com)

   2 points by paf31 15y ago|0 comments
3. 93.▲
   by paf31 16y ago

   I'd thought about that, I might give it a go once I have a few more features in the language worked out.
4. 94.▲
   by paf31 16y ago

   No, thank you :)
5. 95.▲
   by paf31 16y ago

   I'm sure it would be possible, but my js skills aren't quite up to the task...
6. 96.▲
   Please rate my lang

   2 points by paf31 16y ago|6 comments
7. 97.▲
   by paf31 16y ago

   You may also be interested in Charity : http://pll.cpsc.ucalgary.ca/charity1/www/home.html - there is a similar quicksort algorithm on the Examples page.
8. 98.▲
   by paf31 16y ago

   Everything involving only catamorphisms (|...|) terminates, since all atoms in the language define terminating functions, and least fixed point types can only be constructed in finite ways using the 'in' function or by catamorphism themselv
9. 99.▲
   by paf31 16y ago

   Testing my new language, see http://typesandotherdistractions.com
10. 100.▲
    A proof that the quicksort algorithm terminates on all inputs(gist.github.com)

    15 points by paf31 16y ago|5 comments