Profinite lambda-terms and parametricity
From MaRDI portal
Cites work
- A topological approach to recognition
- Categorical combinatorics for non deterministic strategies on simple games
- Collapsible pushdown automata and recursion schemes
- Completeness, invariance and λ-definability
- Complexity of model checking recursion schemes for fragments of the modal mu-calculus
- Duality and Equational Theory of Regular Languages
- Finitary semantics of linear logic and higher-order model-checking
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
- Krivine machines and higher-order schemes
- Krivine machines and higher-order schemes
- LambdaY-calculus with priorities
- On phase semantics and denotational semantics in multiplicative-additive linear logic
- On phase semantics and denotational semantics: The exponentials
- Profinite Methods in Automata Theory
- Profinite semigroups and applications.
- Profinite semigroups and symbolic dynamics
- Recognizability in the Simply Typed Lambda-Calculus
- Regular languages and Stone duality
- Reiterman’s Theorem on Finite Algebras for a Monad
- Relational semantics of linear logic and higher-order model checking
- Stone duality, topological algebra, and recognition.
- The Birkhoff theorem for finite algebras
- Types and higher-order recursion schemes for verification of higher-order programs
Cited in
(1)
This page was built for publication: Profinite lambda-terms and parametricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831459)
