156 search results - page 11 / 32 » Proving Failure in Functional Logic Programs |
121
Voted
JLP
2007
15 years 2 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
191
Voted
PLPV
2011
ACM
14 years 5 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
137
Voted
POPL
2010
ACM
15 years 12 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
109
click to vote
CADE
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
131
Voted
ICFP
2010
ACM
15 years 2 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...