tag:blogger.com,1999:blog-10770855.post1473670991556918293..comments2024-03-28T03:20:57.393-04:00Comments on The Little Calculist: N-ary infix predicatesDave Hermanhttp://www.blogger.com/profile/00405190527081772997noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-10770855.post-27023240190302717302008-05-16T23:21:00.000-04:002008-05-16T23:21:00.000-04:00But in math, we overload binary predicates to the ...<I>But in math, we overload binary predicates to the n-ary case by assuming an implicit "and" between each pair. It would just take a little kludge</I>...<BR/><BR/>In Perl 6, this is called "chain" associativity, and could be written<BR/> sub infix:«<:» (Ty $x, Ty $y -->Bool) is assoc<chain> { subtype($x,$y) }<BR/><BR/><A HREF="http://feather.perl6.nl/syn/S06.html#Subroutine_traits" REL="nofollow">Synopsis 6: Subroutines / traits</A>Anonymousnoreply@blogger.com