Syntactically and semantically regular languages of -terms coincide through logical relations
From MaRDI portal
Syntactically and semantically regular languages of \(\lambda\)-terms coincide through logical relations
Cites work
- An alternate proof of Statman's finite completeness theorem
- Automata theory in nominal sets
- Categorical reconstruction of a reduction free normalization proof
- Categorical semantics of linear logic
- Completeness, invariance and λ-definability
- Higher-order model checking: an overview
- Higher-order parity automata
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1342281 (Why is no real title available?)
- scientific article; zbMATH DE number 515743 (Why is no real title available?)
- scientific article; zbMATH DE number 774488 (Why is no real title available?)
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- Intersection types and denotational semantics: an extended abstract (invited paper)
- Model checking higher-order programs
- On the \(\lambda Y\) calculus
- Profinite lambda-terms and parametricity
- Recognizability in the Simply Typed Lambda-Calculus
- Semantic analysis of normalisation by evaluation for typed lambda calculus
- Semantic evaluation; intersection types and complexity of simply typed lambda calculus
- Syntax for Free: Representing Syntax with Binding Using Parametricity
- The blind spot. Lectures on logic
- The IO and OI hierarchies revisited
- The Scott model of linear logic is the extensional collapse of its relational model
This page was built for publication: Syntactically and semantically regular languages of \(\lambda\)-terms coincide through logical relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856011)
