Publisher
Springer Berlin Heidelberg
Reference41 articles.
1. Aehlig, K.: A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science 3(1), 1–23 (2007)
2. Lecture Notes in Computer Science;K. Aehlig,2005
3. Aho, A.V.: Indexed grammars – an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)
4. Barendregt, H.: The type free lambda calculus. In: Handbook of Mathematical Logic, ch. D.7, pp. 1091–1132. North-Holland (1977)
5. Barendregt, H., Klop, J.W.: Applications of infinitary lambda calculus. Inf. Comput. 207(5), 559–582 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Using models to model-check recursive schemes;Logical Methods in Computer Science;2015-06-11
2. Using Models to Model-Check Recursive Schemes;Lecture Notes in Computer Science;2013