Some new approaches in functional programming based on categories

  • Authors:
  • Viliam Slodičák;Pavol Macko;Valerie Novitzká

  • Affiliations:
  • Faculty of Electrical Engineering and Informatics, Technical University of Košice, Košice, Slovak Republic;Faculty of Electrical Engineering and Informatics, Technical University of Košice, Košice, Slovak Republic;Faculty of Electrical Engineering and Informatics, Technical University of Košice, Košice, Slovak Republic

  • Venue:
  • CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.