Distributed Control Flow with Classical Modal Logic-Reference-Cited by-同舟云学术

Distributed Control Flow with Classical Modal Logic

Published:2005 Issue: Volume: Page:51-69
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Murphy VII Tom,Crary Karl,Harper Robert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11538363_6.pdf

Reference15 articles.

1. Abel, A.: A third-order representation of the λμ-Calculus. In: Ambler, S.J., Crole, R.L., Momigliano, A. (eds.) Electronic Notes in Theoretical Computer Science, vol. 58, Elsevier, Amsterdam (2001)

2. Girard, J.-Y.: Towards a geometry of interaction. Contemporary Mathematics 92, 69–108

3. Girard, J.-Y.: Linear logic. Theoretical Computer Science 50(1), 1–102 (1987)

4. Griffin, T.G.: The formulae-as-types notion of control. In: Conf. Record 17th Annual ACM Symp. on Principles of Programming Languages, POPL 1990, San Francisco, CA, USA, January 17-19, pp. 47–57. ACM Press, New York (1990)

5. Jia, L., Walker, D.: Modal proofs as distributed programs. In: 13th European Symposium on Programming, March 2004, pp. 219–223 (2004)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Satisfiability Threshold of Random Propositional S5 Theories;Axioms;2024-04-06

2. Natural deduction calculi for classical and intuitionistic S5;Journal of Applied Non-Classical Logics;2023-04-03

3. A unified view of modalities in type systems;Proceedings of the ACM on Programming Languages;2020-08-02

4. An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem;Automated Reasoning;2018

5. A Sequent Calculus for Counterfactual Reasoning;Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security;2017-10-30