Work

Functional Programming With Apomorphisms (corecursion)

Year: 1998

Type: article

Abstract: In the mainstream categorical approach to typed (total) functional programming, functions with inductive source types defined by primitive recursion are called paramorphisms; the utility of primitive recursion as a scheme for defining functions in programming is well known.We draw attention to the dual notion of apomorphisms -functions with coinductive target types defined by primitive corecursion and show on examples that primitive corecursion is useful in programming.

Source: Proceedings of the Estonian Academy of Sciences Physics Mathematics

DOI: 10.3176/phys.math.1998.3.01

Authors: Varmo Vene, Tarmo Uustalu

Institutions: University of Tartu, KTH Royal Institute of Technology

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Eesti Teadusfondi

OpenAlex ID: W50416634