Automata, Logic and Games for the \lambda -Calculus

DOI10.1007/978-3-662-54069-5_3zbMATH Open1480.03008OpenAlexW2557959769MaRDI QIDQ5224488FDOQ5224488

Authors:

Publication date: 24 July 2019

Published in: Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_3

Mathematics Subject Classification ID

Applications of game theory (91A80) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)

Cites Work

• Automata, logics, and infinite games. A guide to current research
• Title not available (Why is that?)
• An automata-theoretic approach to branching-time model checking
• Pushdown processes: Games and model-checking
• An automata theoretic decision procedure for the propositional mu- calculus
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Model checking higher-order programs
• Verifying higher-order functional programs with pattern-matching algebraic data types
• A type-directed abstraction refinement approach to higher-order model checking
• Higher-order model checking: an overview
• Compositional higher-order model checking via \(\omega\)-regular games over Böhm trees
• Böhm trees as higher-order recursion schemes
• Dependency Tree Automata

Cited In (4)

• Strong normalization from an unusual point of view
• Title not available (Why is that?)
• Logic and games on automatic structures. Playing with quantifiers and decompositions
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

Uses Software

• MoCHi

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)