Tarski's fixed-point theorem and lambda calculi with monotone inductive types

DOI10.1023/A:1020831825964zbMath1069.03009OpenAlexW2008058588MaRDI QIDQ1868162

Ralph Matthes

Publication date: 27 April 2003

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020831825964

zbMATH Keywords

initial algebrasinductively given structuresinitial recursive algebraslambda calculi with monotone inductive types

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Monotone recursive types and recursive data representations in Cedille ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ Martin Hofmann's Case for Non-Strictly Positive Data Types

This page was built for publication: Tarski's fixed-point theorem and lambda calculi with monotone inductive types