Author:
Ong C. -H. Luke,Tsukada Takeshi
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Ong, C.H.L.: On model-checking trees generated by higher-order recursion schemes. In: LICS, pp. 81–90. IEEE Computer Society (2006)
2. Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285–408 (2000)
3. Kobayashi, N.: Types and higher-order recursion schemes for verification of higher-order programs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 416–428. ACM (2009)
4. Salvati, S.: On the membership problem for non-linear abstract categorial grammars. Journal of Logic, Language and Information 19(2), 163–183 (2010)
5. Kobayashi, N., Ong, C.H.L.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: LICS, pp. 179–188. IEEE Computer Society (2009)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Semantics for Combinatory Logic With Intersection Types;Frontiers in Computer Science;2022-07-12
2. Plays as Resource Terms via Non-idempotent Intersection Types;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05
3. Higher-Order Model Checking: An Overview;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07
4. Using models to model-check recursive schemes;Logical Methods in Computer Science;2015-06-11
5. Indexed linear logic and higher-order model checking;Electronic Proceedings in Theoretical Computer Science;2015-03-17