A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Author:
Open Access
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 104-118
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- On Model-Checking Trees Generated by Higher-Order Recursion Schemes2006
- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is DecidableLecture Notes in Computer Science, 2005
- Unsafe Grammars and Panic AutomataLecture Notes in Computer Science, 2005
- On Continuous Normalization2002
- Higher-Order Pushdown Trees Are Easy2002
- Deciding Monadic Theories of Hyperalgebraic Trees2001
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- Finite investigations of transfinite derivationsJournal of Mathematical Sciences, 1978
- The use of abstract language in elementary metamathematics: Some pedagogic examplesLecture Notes in Mathematics, 1975
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969