Map
Index
Random
Help
th

Quote: the ext combinator is a universal construct for comprehensions and NRC; restricted form of structural recursion

topics > all references > references t-z > QuoteRef: wongL9_2000 , p. 6



Topic:
curried functions
Topic:
functional programming

Quotation Skeleton

Let us briefly recall the restricted form of … [refs]. It is the combinator ext()() obeying these three equations: ext(f){}={} … CPL is ext{e_1|\x<-e_2}, which is interpreted as ext(f)(e_2), … Kleisli and is at the heart of the … As pointed out by [Wadler, P. Math. Struct. Comput. Sci. 1992], any comprehension can …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: curried functions (14 items)
Topic: functional programming (43 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.