Recursively defined domains and their induction principles

DOI10.1016/0304-3975(87)90017-XzbMath0637.68017MaRDI QIDQ1098615

Kim Guldstrand Larsen, Finn Verner Jensen

Publication date: 1987

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

zbMATH Keywords

algorithmantikeys

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Edinburgh LCF. A mechanized logic of computation
• Algebraic specification of data types: A synthetic approach
• 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

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