Is there a reference that explains typing inference for Martin-Löf type theory as a computable map from abstract syntax trees of terms to abstract syntax trees of types? I don't want to identify non-identical judgmentally equal things.
The terms and the types are all defined in the empty context and we also include annotations for the variable types in lambda abstractions.
If there is such a map then is it true if a type is not in beta normal form then it has no terms in beta normal form map to it?