Category theory for computing science
Category theory for computing science
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
Theory and Practice of Action Semantics
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
Verifying Action Semantics Specifications in UML Behavioral Models
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
MDA Implementation Based on Patterns and Action Semantics
ICIC '10 Proceedings of the 2010 Third International Conference on Information and Computing - Volume 02
Hi-index | 0.00 |
In this paper we deal the recursion and corecursion in functional programming. We discuss about the morphisms which express the recursion or corecursion, resp. We apply the linear logic which provides a logical perspective on computational issues such as control of resources and order of evaluation. The most important feature of linear logic is that formulae are considered as actions and its truth value depends on an internal state of a dynamic system. In this paper we present an alternative way of computation based on algebras and coalgebras. The correctness of our approaches we show by Curry-Howard correspondence.