Recursively defined domains and their induction principles

DOI10.1016/0304-3975(87)90017-XMaRDI QIDQ1098615zbMATH OpenFDO

Authors Finn V. Jensen, Kim G. Larsen

Publication date 1987

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmantikeys

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80)

Cites work

• scientific article; zbMATH DE number 3862480 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Algebraic specification of data types: A synthetic approach
• Edinburgh LCF. A mechanized logic of computation
• The Category-Theoretic Solution of Recursive Domain Equations
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Cited in

(4)

• scientific article; zbMATH DE number 4039271 (Why is no real title available?)
• Induction-recursion and initial algebras.
• Recursive Functions on Lazy Lists via Domains and Topologies
• scientific article; zbMATH DE number 4074550 (Why is no real title available?)

This page was built for publication: Recursively defined domains and their induction principles

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