Some New Approaches in Functional Programming Using Algebras and Coalgebras

Authors:
Viliam Slodičák;Pavol Macko
Affiliations:
Department of Computers and Informatics, Technical University of Košice, Košice, Slovak Republic;Department of Computers and Informatics, Technical University of Košice, Košice, Slovak Republic
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 11
Cited 0

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Category theory for computing science

Category theory for computing science
Theory and Practice of Action Semantics

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Computer Simulations in Constructing a Coefficient of Uncertainty in Regression Estimation - Methodology and Results

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
An approach to developing complex database schemas using form types

Software—Practice & Experience
Models of Computation: An Introduction to Computability Theory

Models of Computation: An Introduction to Computability Theory
Verifying Action Semantics Specifications in UML Behavioral Models

CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Recursive coalgebras from comonads

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
MDA Implementation Based on Patterns and Action Semantics

ICIC '10 Proceedings of the 2010 Third International Conference on Information and Computing - Volume 02
Category Theory

Category Theory
Recursion schemes for dynamic programming

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our paper we deal with the expressing of recursion and corecursion in functional programming. We discuss about the morphisms which express the recursion or corecursion, respectively. Here we consider especially the catamorphisms, anamorphisms and their composition called the hylomorphisms. The main essence of this work is to describe a new method of programming the function for calculating the factorial by using hylomorphism. We show that using of hylomorphism is an alternative method for the computation of factorial to recursive methods programmed classically. Our new method we describe in action semantics which is a new formal method for the program description.