Author:
Igarashi Atsushi,Kobayashi Naoki
Subject
General Computer Science,Theoretical Computer Science
Reference53 articles.
1. Subtyping recursive types;Amadio;ACM Trans. Programming Languages Systems,1993
2. L. Cardelli, A.D. Gordon, Anytime, anywhere: modal logics for mobile ambients, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2000, pp. 365–377.
3. S. Chaki, S. Rajamani, J. Rehof, Types as models: model checking message-passing programs, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 2002, pp. 45–57.
4. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, 1977, pp. 238–252.
5. S. Conchon, F. Pottier, JOIN(X): constraint-based type inference for the join-calculus, in: Proc. 10th European Symp. on Programming (ESOP’01), Lecture Notes in Computer Science, Vol. 2028, Springer, Berlin, 2001, pp. 221–236.
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A generic type system for higher-order Ψ-calculi;Information and Computation;2024-10
2. Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing;Proceedings of the ACM on Programming Languages;2024-01-05
3. DisLog: A Separation Logic for Disentanglement;Proceedings of the ACM on Programming Languages;2024-01-05
4. Higher-Order Leak and Deadlock Free Locks;Proceedings of the ACM on Programming Languages;2023-01-09
5. A Generic Type System for Higher-Order Ψ-calculi;Electronic Proceedings in Theoretical Computer Science;2022-09-06