As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
The formal language Lλar of acyclic recursion and its type-theory was introduced by Moschovakis between 2003 and 2006 for applications to computational semantics of human languages. Independently, implementations of large-scale grammars within the HPSG framework have been using semantic representations casted in the language of Minimal Recursion Semantics (MRS). While lacking strict formalization, MRS represents successfully ambiguous quantifier scoping. In this paper, we introduce the basic definitions of MRS by reflecting on possibilities for formalization of MRS with a version of the language Lλar.