When Is a Type Refinement an Inductive Type?

DOI10.1007/978-3-642-19805-2_6zbMath1326.68066arXiv1205.2492OpenAlexW1594164162MaRDI QIDQ3000600

Patricia Johann, Neil Ghani, Robert Atkey

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2492

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (1)

Initial Algebras of Terms with Binding and Algebraic Structure

This page was built for publication: When Is a Type Refinement an Inductive Type?