Recursively defined domains and their induction principles

DOI10.1016/0304-3975(87)90017-XzbMATH Open0637.68017MaRDI QIDQ1098615FDOQ1098615

Authors: Finn V. Jensen, Kim G. Larsen 

Publication date: 1987

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

Recommendations

• scientific article; zbMATH DE number 4039271
• scientific article; zbMATH DE number 4074550
• scientific article; zbMATH DE number 4041340
• scientific article; zbMATH DE number 3982572
• scientific article; zbMATH DE number 3913729

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

• Edinburgh LCF. A mechanized logic of computation
• The Category-Theoretic Solution of Recursive Domain Equations
• Title not available (Why is that?)
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Algebraic specification of data types: A synthetic approach
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Induction-recursion and initial algebras.
• Recursive Functions on Lazy Lists via Domains and Topologies
• Title not available (Why is that?)

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)