21 citations · 70 across the 12 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2015★ 3 cited
The exp-log normal form of types
Danko Ilik
Lambda calculi with algebraic data types lie at the core of functional programming languages and proof assistants, but conceal at least two fundamental theoretical problems already…
cs.LO2014★ 12 cited
Axioms and Decidability for Type Isomorphism in the Presence of Sums
Danko Ilik
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian prod…