A finite semantics of simply-typed lambda terms for infinite runs of automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4207 LNCS, Issue , 2006, Pages 104-118

  Aehlig, Klaus ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; MATHEMATICAL MODELS; SEMANTICS; SYNTACTICS; THEOREM PROVING; TREES (MATHEMATICS);

INFINITE TREES; LAMBDA-TREES; RECURSION SCHEMES; SYNTACTICAL RESTRICTION;

AUTOMATA THEORY;

EID: 33750360193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_7     Document Type: Conference Paper

References (13)

1. K. Aehlig and F. Joachimski. On continuous normalization. In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL '02), volume 2471 of Lecture Notes in Computer Science, pages 59-73. Springer Verlag, 2002.
2. K. Aehlig, J. G. d. Miranda, and C. H. L. Ong. The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In P. Urzyczyn, editor, Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA '05), volume 3461 of Lecture Notes in Computer Science, pages 39-54. Springer-Verlag, Apr. 2005.
3. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF. Information and Computation, 163(2):285-408, Dec. 2000.
4. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In S. Abramsky, editor, Proceedings of the 5th International Conference on Typed Lambda Caculi and Applications (TLCA '01), volume 2044 of Lecture Notes in Computer Science, pages 253-267. Springer Verlag, 2001.
5. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In M. Nielson, editor, Proceedings of the 5th International Conference Foundations of Software Science and Computation Structures (FOSSACS '02), volume 2303 of Lecture Notes in Computer Science, pages 205-222, Apr. 2002.
6. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars, panic automata, and decidability. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), volume 3580 of Lecture Notes in Computer Science, pages 1450-1461. Springer Verlag, 2005.
7. G. Kreisel, G. E. Mints, and S. G. Simpson. The use of abstract language in elementary metamathematics: Some pedagogic examples. In R. Parikh, editor, Logic Colloquium, volume 453 of Lecture Notes in Mathematics, pages 38-131. Springer Verlag, 1975.
8. G. E. Mints. Finite investigations of transfinite derivations. Journal of Soviet Mathematics, 10:548-596, 1978.
9. Translated from: Zap. Nauchn. Semin. LOMI 49 (1975).
10. Cited after Grigori Mints. Selected papers in Proof Theory. Studies in Proof Theory. Bibliopolis, 1992.
11. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In Proceedings of the Twentyfrist Annual IEEE Symposium on Logic in Computer Science (LICS '06), 2006. to appear.
12. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, July 1969.
13. W. W. Tait. Intensional interpretations of functional of finite type. The Journal of Symbolic Logic, 32(2):198-212, 1967.