Automata, Logic and Games for the $$\lambda $$ -Calculus

DOI10.1007/978-3-662-54069-5_3zbMath1480.03008OpenAlexW2557959769MaRDI QIDQ5224488

No author found.

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)

Related Items

Strong normalization from an unusual point of view

Uses Software

• MoCHi

Cites Work

• Unnamed Item
• An automata theoretic decision procedure for the propositional mu- calculus
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Pushdown processes: Games and model-checking
• Automata, logics, and infinite games. A guide to current research
• Böhm trees as higher-order recursion schemes
• Dependency Tree Automata
• Compositional higher-order model checking via ω -regular games over Böhm trees
• Higher-Order Model Checking: An Overview
• An automata-theoretic approach to branching-time model checking
• Model Checking Higher-Order Programs
• A type-directed abstraction refinement approach to higher-order model checking
• Verifying higher-order functional programs with pattern-matching algebraic data types

This page was built for publication: Automata, Logic and Games for the $$\lambda $$ -Calculus