skaller wrote:
> Pls read:
>
> http://www.ps.uni-sb.de/hamlet/#successor-ml
>
> in search of interesting ideas ..
>
I read through that a week or two ago when it showed up on
lambda-the-ultimate. If you're looking for something interesting to do,
here's a couple ideas:
1. destructuring function inputs:
Allowing for something like:
fun foo (x:int) (struct { y:int; z:int; w:int; }) => x + y + z + w;
let yz = struct { z = 1; y = 2; };
print$ foo $ { yz with w = 3; }; endl;
////
open List;
fun head[T] (Cons[T] (h, t)) => h;
I'd prefer not to have to have the '?', but if they're needed for
parsing, then oh well :)
2. views/active patterns
see
http://blogs.msdn.com/dsyme/archive/2007/04/06/detailed-release-notes-for-1-9-1-8.aspx.
This lets you extend pattern matching so that you can create virtual
constructors to match against.
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys-and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Felix-language mailing list
Felix-language@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/felix-language
