Inductive Type Schemas as Functors

DOI10.1007/11753728_7zbMATH Open1185.68189OpenAlexW1505226138MaRDI QIDQ3434680

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

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

Related Items (1)

When Is a Type Refinement an Inductive Type?

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Inductive types and exact completion 👍 👎
• On the internal structures of inductive types 👍 👎
• Constructing inductive-inductive types in cubical type theory 👍 👎
• Inductive Types in Homotopy Type Theory 👍 👎
• Semantics of higher inductive types 👍 👎
• Inductively defined types in the Calculus of Constructions 👍 👎

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)