Automata, Logic and Games for the \lambda -Calculus
From MaRDI portal
Publication:5224488
Cites work
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- A type-directed abstraction refinement approach to higher-order model checking
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- An automata theoretic decision procedure for the propositional mu- calculus
- An automata-theoretic approach to branching-time model checking
- Automata, logics, and infinite games. A guide to current research
- Böhm trees as higher-order recursion schemes
- Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees
- Dependency Tree Automata
- Higher-order model checking: an overview
- Model checking higher-order programs
- Pushdown processes: Games and model-checking
- Verifying higher-order functional programs with pattern-matching algebraic data types
Cited in
(4)
This page was built for publication: Automata, Logic and Games for the $$\lambda $$ -Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224488)