Seeking papers offering clean semantics for optional, keyword and rest arguments

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

Return to the comp.compilers page.
Search the comp.compilers archives again.