scientific article; zbMATH DE number 1552770

MaRDI QIDQ4524982zbMATH OpenFDO

Authors Varmo Vene

Publication date 16 January 2001

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Cited in

(9)

• Some remarks on type systems for course-of-value recursion
• Executable relational specifications of polymorphic type systems using Prolog
• Two extensions of System F with (co)iteration and primitive (co)recursion principles
• When is a function a fold or an unfold?
• Some properties of coalgebras and their rôle in computer science
• Recursion schemes in Coq
• A categorical setting for lower complexity
• Efficient lambda encodings for Mendler-style coinductive types in Cedille
• Safe recursion revisited. I: Categorical semantics for lower complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524982)