From: scottmcl@comcast.net   
      
   I'm working on a mostly functional, mostly manifestly typed language   
   that offers Common Lisp like lambda lists/function signatures - optional   
   (variable arity), rest (indefinite arity) and keyword (optional, out of   
   order, named) arguments.   
      
   Rationale here is that libraries in certain domains (e.g., GUI   
   frameworks) greatly benefit from optional and optional keyword arguments.   
      
   I'm looking for a semantic analysis, formal or otherwise, for such   
   function signatures, particularly (hopefully) in a language that   
   supports both higher order functions as well as programmer defined data   
   types (classes) with subtyping and virtual methods.   
      
   Thanks much!   
      
   Scott   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)