Name
Abstract | ||
|---|---|---|
In 1989, Eugenio Moggi proposed a categorical framework for program semantics based on the notion of a strong monad. He showed that various kinds of computation can be modeled in his framework. On the other hand, strong monads are not suited for the categorical semantics of traditional modal logics. According to these observations, Moggi thought that the CurryHoward correspondence would not hold between programs and constructive proofs in modal logics. However, contrary to his view, we can show that proofs in a certain kind of modal logics are actually considered as programs. In this paper, first we shall introduce the notion of an ℓ-strong monad which is a generalization of strong monads. Using this new notion, we can generalize Moggi's semantics-preserving soundness and completeness with respect to his equational logic. Next we shall show that ℓ-strong monads give a sound and complete semantics of a constructive version of S4 modal logic. Finally, we present a method to extract a monad-based imperative functional program from a proof in the modal logic. Interestingly, this method can also be understood in terms of ℓ-strong monads. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0304-3975(96)00169-7 | Theor. Comput. Sci. |
DocType | Volume | Issue |
Journal | 175 | 1 |
ISSN | Citations | PageRank |
Theoretical Computer Science | 16 | 1.59 |
References | Authors | |
1 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satoshi Kobayashi | 1 | 137 | 15.51 |