scientific article; zbMATH DE number 1552770
From MaRDI portal
Publication:4524982
zbMATH Open0966.68516MaRDI QIDQ4524982FDOQ4524982
Authors: Varmo Vene 
Publication date: 16 January 2001
Title of this publication is not available (Why is that?)
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)
- Safe recursion revisited. I: Categorical semantics for lower complexity
- Some properties of coalgebras and their rôle in computer science
- When is a function a fold or an unfold?
- Executable relational specifications of polymorphic type systems using Prolog
- A categorical setting for lower complexity
- Two extensions of System F with (co)iteration and primitive (co)recursion principles
- Some remarks on type systems for course-of-value recursion
- Recursion schemes in Coq
- Efficient lambda encodings for Mendler-style coinductive types in Cedille
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)
