We present Quantitative Type Theory, a Type Theory that records usage information for each variable in a judgement, based on a previous system by McBride. The usage information is used to give a realizability semantics using a variant of Linear Combinatory Algebras, refining the usual realizability semantics of Type Theory by accurately tracking resource behaviour. We define the semantics in terms of Quantitative Categories with Families, a novel extension of Categories with Families for modelling resource sensitive type theories
We define quantitative type systems for two intuitionistic term languages. While the first language ...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
We present Quantitative Type Theory, a Type Theory that records usage information for each variable ...
Both dependent types and linear types have their desirable properties. Department types can express ...
In programming, data is often considered to be infinitely copiable, arbitrarily discardable, and uni...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
We investigate intersection types and resource lambda-calculus in deep-inference proof theory. We gi...
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with param...
We combine dependent types with linear type systems that soundly and completely capture polynomial t...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
Dependent types allow us to express precisely what a function is intended to do. Recent work on Quan...
Considering resource usage is a powerful insight in the analysis of many phenomena in the sciences. ...
Funding: This work was funded by EPSRC grant EP/T007265/1.Dependent types allow us to express precis...
This paper shows that the recent approach to quantitative typing systems for programming languages c...
We define quantitative type systems for two intuitionistic term languages. While the first language ...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
We present Quantitative Type Theory, a Type Theory that records usage information for each variable ...
Both dependent types and linear types have their desirable properties. Department types can express ...
In programming, data is often considered to be infinitely copiable, arbitrarily discardable, and uni...
We investigate containers and polynomial functors in Quantitative Type Theory, and give initial alge...
We investigate intersection types and resource lambda-calculus in deep-inference proof theory. We gi...
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with param...
We combine dependent types with linear type systems that soundly and completely capture polynomial t...
peer reviewedChurch’s type theory, aka simple type theory, is a formal logical language which includ...
Dependent types allow us to express precisely what a function is intended to do. Recent work on Quan...
Considering resource usage is a powerful insight in the analysis of many phenomena in the sciences. ...
Funding: This work was funded by EPSRC grant EP/T007265/1.Dependent types allow us to express precis...
This paper shows that the recent approach to quantitative typing systems for programming languages c...
We define quantitative type systems for two intuitionistic term languages. While the first language ...
AbstractThis paper describes a general theory of overloading based on a system of qualified types. T...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...