32 search results - page 5 / 7 » An expressive, scalable type theory for certified code |
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
CCR
2004
13 years 7 months ago
2004
The science of network service composition has emerged as one of the grand themes of networking research [17] as a direct result of the complexity and sophistication of emerging n...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...