> typedef pairil = typecase [a] int+a => a * int endcase (int+long);
> var x : pairil = 1L,2;
>
> proc p(x: pairil) {
> match x with
> | ?a,?b => { print a; print ","; print b; endl; }
> endmatch;
> }
>
> p x;
> ------------------------
> .. debug stuff ..
> 1,2
> -----------------------
Not that everything should be related to Haskell, but this reminds me
of Generalised Algebraic Data Types (GADTs), except that it is a more
powerful implementation as it is not bound by a set of constructors!
This is Great Stuff :)
-Pete
-------------------------------------------------------------------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642
_______________________________________________
Felix-language mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/felix-language
