A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
From MaRDI portal
Publication:5426067
DOI10.2168/LMCS-3(3:1)2007zbMath1125.68068MaRDI QIDQ5426067
Publication date: 15 November 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items
Productivity of stream definitions, Typing Weak MSOL Properties, Krivine machines and higher-order schemes, Domains for Higher-Order Games