Functional Languages all share the lambda calculus as a common basis.
Existing intermediate functional languages are simple extensions of the
lambda calculus to include let and letrec constructs. This paper proposes
a more extensive intermediate language which supports simple data types,
pattern matching, and interactive environments. Motivation, design
considerations, semantics, and progress to date are included.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at email@example.com