A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
From MaRDI portal
Publication:3613331
DOI10.1007/11874683_7zbMath1225.68107arXiv0706.2076OpenAlexW1759451798MaRDI QIDQ3613331
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.2076
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)
Related Items (1)
This page was built for publication: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata