1 citations · 2 across the 3 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2013
Formalisation of the lambda aleph Runtime
Neal Glew, Tim Sweeney, Leaf Petersen
In previous work we describe a novel approach to dependent typing based on a multivalued term language. In this technical report we formalise the runtime, a kind of operational sem…
cs.PL2012★ 1 cited
Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version)
Neal Glew, Leaf Petersen
Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), and in previous work we have shown how to do so while maintaining co…
cs.PL2012★ 1 cited
Subtyping for F-Bounded Quantifiers and Equirecursive Types (Extended Version)
Neal Glew
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of…