Syntactically and semantically regular languages of lambda-terms coincide through logical relations
share
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed lambda-terms, defined using denotational semantics in finite sets. We provide here some evidence for its robustness. First, we give an equivalent characterization that naturally extends the seminal work of Hillebrand and Kanellakis connecting regular languages of words and syntactic lambda-definability. Second, we exhibit a class of categorical models of the simply typed lambda-calculus, which we call finitely pointable, and we show that, when used in Salvati's definition, they all recognize exactly the same class of languages of lambda-terms as the category of finite sets does. The proofs of these two results rely on logical relations and can be seen as instances of a more general construction of a categorical nature, inspired by previous categorical accounts of logical relations using the glueing construction
READ FULL TEXT
