Interpretations of recursively defined types

DOI10.1016/0304-3975(92)90280-SMaRDI QIDQ685350zbMATH OpenOpenAlexFDO

Authors Michael I. Schwartzbach

Publication date 17 October 1993

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

Full work available at URL https://doi.org/10.1016/0304-3975(92)90280-s

zbMATH Keywords

polymorphismtype systemmultiple inheritanceimperative programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 3928338
• Type inference with recursive types: Syntax and semantics
• scientific article; zbMATH DE number 1377611
• scientific article; zbMATH DE number 3874579
• scientific article; zbMATH DE number 1047956
• scientific article; zbMATH DE number 1223720
• Type-based termination of recursive definitions
• Strictness analysis via abstract interpretation for recursively defined types
• scientific article; zbMATH DE number 1705161
• Recursion on Nested Datatypes in Dependent Type Theory

Cites work

• scientific article; zbMATH DE number 4180819 (Why is no real title available?)
• scientific article; zbMATH DE number 17823 (Why is no real title available?)
• scientific article; zbMATH DE number 177802 (Why is no real title available?)
• Fundamental properties of infinite trees
• Infinite trees in normal form and recursive equations having a unique solution

Cited in

(6)

• Type inference with recursive types: Syntax and semantics
• Builtin types viewed as inductive families
• Recursive types for Fun
• Types for Proofs and Programs
• scientific article; zbMATH DE number 1705161 (Why is no real title available?)
• Strictness analysis via abstract interpretation for recursively defined types

Describes a project that uses

Uses Software

• Nuprl

This page was built for publication: Interpretations of recursively defined types

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