Model-Checking Games for Typed λ-Calculi
From MaRDI portal
Publication:2864164
DOI10.1016/j.entcs.2007.02.021zbMath1277.68148OpenAlexW2082037533MaRDI QIDQ2864164
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.021
Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The IO- and OI-hierarchies
- A representation of trees by languages. I
- Third order matching is decidable
- \(L(A)=L(B)\)? decidability results from complete formal systems
- \(L(A)=L(B)\)? A simplified decidability proof.
- Decidability of bisimulation equivalence for process generating context-free languages
- A Game-Theoretic Approach to Deciding Higher-Order Matching
- An automata-theoretical characterization of the OI-hierarchy
- Decidability of fourth-order matching
- Decidability of all minimal models
- Higher Order Matching is Undecidable
- Computer Science Logic
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata
- Foundations of Software Science and Computational Structures
- Decidability of DPDA equivalence
This page was built for publication: Model-Checking Games for Typed λ-Calculi
