DCFLs and recursive types

Some time ago, John Mitchell mentioned (on one of the ML lists) an
equivalence between deterministic context-free languages (DCFLs) --
those languages that are accepted by a deterministic pushdown
automaton -- and recursive types.  I haven't been able to locate the
reference for this.  I do see in Hopcroft and Ullman a mention of
Emily Friedman relating "monadic recursion schemes" and DCFLs.  Is
that what is meant?  Do DCFLs have a more explicit link to recursive

-- Paul