</term>
, that are
<term>
Stabler 's formalization
#1933We provide a logical definition of Minimalist grammars , that are Stabler's formalization of Chomsky's minimalist program.
other,34-2-P01-1047,ak
<term>
learning algorithm
</term>
from
<term>
structured data
</term>
( based on a
<term>
typing-algorithm
#1981Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification).