136 search results - page 14 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
SIAMCOMP
2008
13 years 10 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
100
click to vote
POPL
2009
ACM
14 years 11 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
ICFP
1999
ACM
14 years 3 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
AGP
1997
IEEE
14 years 3 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
FASE
2009
Springer
14 years 2 months ago
2009
Springer
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...