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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barr, M., Wells, C.: Category Theory for Computing Science. Prentice Hall International (1990) ISBN 0-13-120486-6
Blute, R., Scott, P.: Category theory for linear logicians. In: Erhard, T., Girard, J.-Y., Ruet, P. (eds.) Linear Logic in Computer Science. London Mathematical Society Lecture Note Series. Cambridge Univ.Press (2004)
Cheng, F.: Mda implementation based on patterns and action semantics. In: 2010 Third International Conference on Information and Computing, vol. 2, pp. 25–28 (2010)
Girard, J.: Linear logic: Its syntax and semantics. Cambridge Univ. Press (2003)
Jacobs, B.: Introduction to coalgebra. Towards Mathematics of States and Observations, draft (2005)
Leroy, X.: The objective caml system release 3.12. Tech. rep., Institut National de Recherche en Informatique et en Automatique (2008)
Mosses, P.D.: Theory and Practice of Action Semantics. In: Penczek, W., Szałas, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 37–61. Springer, Heidelberg (1996)
Nielson, H.R., Nielson, F.: Semantics with Applications: A Formal Introduction. John Wiley & Sons, Inc. (2003)
Novitzká, V., Mihályi, D., Verbová, A.: Coalgebras as models of systems behaviour. In: International Conference on Applied Electrical Engineering and Informatics, Greece, Athens, pp. 31–36 (2008)
Planas, E., Cabot, J., Gómez, C.: Verifying Action Semantics Specifications in UML Behavioral Models. In: van Eck, P., Gordijn, J., Wieringa, R. (eds.) CAiSE 2009. LNCS, vol. 5565, pp. 125–140. Springer, Heidelberg (2009)
Reichel, H.: Behavioural equivalence - a unifying concept for initial and final specification methods. In: 3rd Hungarian Computer Science Conference, Akadémia kiadó, vol. 3, pp. 27–39 (1981)
Slodičák, V., Macko, P.: New approaches in functional programming using algebras and coalgebras. In: European Joint Conferrences on Theory and Practise of Software, ETAPS, Workshop on Generative Technologies, pp. 13–23 (2011)
Sørensen, M., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. University of Copenhagen a University of Warsaw (1999)
Stuurman, G.: Action semantics applied to model driven engineering (November 2010)
Uustalu, T., Vene, V.: Primitive (co)recursion and course-of-values (co)iteration. Informatica (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Slodičák, V., Macko, P., Novitzká, V. (2012). Some New Approaches in Functional Programming Based on Categories. In: Zsók, V., Horváth, Z., Plasmeijer, R. (eds) Central European Functional Programming School. CEFP 2011. Lecture Notes in Computer Science, vol 7241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32096-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-32096-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32095-8
Online ISBN: 978-3-642-32096-5
eBook Packages: Computer ScienceComputer Science (R0)