Inductive Type Schemas as Functors

DOI10.1007/11753728_7MaRDI QIDQ3434680zbMATH OpenOpenAlexFDO

Authors Freiric Barral, Serguei V. Solov'ev

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_7

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Inductive types in homotopy type theory
• On the internal structures of inductive types
• Inductive and functional types in ludics
• Constructing inductive-inductive types in cubical type theory
• Inductively defined types in the Calculus of Constructions
• Inductive types and exact completion
• Semantics of higher inductive types
• scientific article; zbMATH DE number 4189687
• scientific article; zbMATH DE number 1400097
• scientific article; zbMATH DE number 2061701

Cited in

(2)

• When Is a Type Refinement an Inductive Type?
• scientific article; zbMATH DE number 1342222 (Why is no real title available?)

This page was built for publication: Inductive Type Schemas as Functors

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