We investigate containers and polynomial functors in Quantitative Type Theory, and give initial algebra semantics of inductive data types in the presence of linearity. We show that reasoning by induction is supported, and equivalent to initiality, also in the linear setting
Abstract. We construct a symmetric monoidal closed category of polynomial endofunc-tors (as objects)...
AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Marti...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
A broad class of data types, including arbitrary nestings of inductive types, coinductive types, and...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
Every Algebraic Datatype (ADT) is characterised as the initial al-gebra of a polynomial functor on s...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
Abstract. We show that strictly positive inductive types, constructed from polynomial functors, cons...
There are several different approaches to the theory of data types. At the simplest level, polynomia...
Abstract. This paper provides an induction rule that can be used to prove properties of data structu...
This paper introduces an expressive class of indexed quotient-inductivetypes, called QWI types, with...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
Abstract. We construct a symmetric monoidal closed category of polynomial endofunc-tors (as objects)...
AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Marti...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
A broad class of data types, including arbitrary nestings of inductive types, coinductive types, and...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
Every Algebraic Datatype (ADT) is characterised as the initial al-gebra of a polynomial functor on s...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
Abstract. We show that strictly positive inductive types, constructed from polynomial functors, cons...
There are several different approaches to the theory of data types. At the simplest level, polynomia...
Abstract. This paper provides an induction rule that can be used to prove properties of data structu...
This paper introduces an expressive class of indexed quotient-inductivetypes, called QWI types, with...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
Abstract. We construct a symmetric monoidal closed category of polynomial endofunc-tors (as objects)...
AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Marti...
This paper provides an induction rule that can be used to prove properties of data structures whose ...
DOI
Add to ORKG