Interpretations of recursively defined types

DOI10.1016/0304-3975(92)90280-SzbMATH Open0783.68020OpenAlexW2092707571MaRDI QIDQ685350FDOQ685350

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

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
• Publication:2771055
• Recursion on Nested Datatypes in Dependent Type Theory

zbMATH Keywords

polymorphismtype systemmultiple inheritanceimperative programming language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• Fundamental properties of infinite trees
• Title not available (Why is that?)
• Infinite trees in normal form and recursive equations having a unique solution
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Type inference with recursive types: Syntax and semantics
• Strictness analysis via abstract interpretation for recursively defined types
• Types for Proofs and Programs
• Recursive types for Fun
• Builtin types viewed as inductive families
• Title not available (Why is that?)

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)