Author:
Aiken Alexander,Murphy Brian R.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. A. Aiken and B. Murphy. Static type inference in a dynamically typed language. In Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 279–290, Orlando, 1991.
2. A. Aiken and E. Wimmers. A decision problem for set constraints. Research Report Forthcoming RJ, IBM, 1991.
3. J. Backus et al. FL language manual, parts 1 and 2. Research Report RJ 7100, IBM, 1989.
4. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95–169, 1983.
5. F. Gecseg and M. Steinby. Tree Automata. Academei Kaido, Budapest, 1984.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Use of Security Logs for Data Leak Detection: A Systematic Literature Review;Security and Communication Networks;2021-03-11
2. Type- and Control-Flow Directed Defunctionalization;IFL 2020: Proceedings of the 32nd Symposium on Implementation and Application of Functional Languages;2020-09-02
3. Galois Connections for Recursive Types;From Lambda Calculus to Cybersecurity Through Program Analysis;2020
4. An Efficient Type- and Control-Flow Analysis for System F;Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages;2014-10
5. Checking NFA equivalence with bisimulations up to congruence;ACM SIGPLAN Notices;2013-01-23