632 search results - page 49 / 127 » Proving Invariants of Functional Programs |
121
Voted
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
100
click to vote
TOG
2008
15 years 14 days ago
2008
Object motion during camera exposure often leads to noticeable blurring artifacts. Proper elimination of this blur is challenging because the blur kernel is unknown, varies over t...
97
Voted
CORR
2000
Springer
15 years 12 days ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
122
Voted
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
ICFP
2004
ACM
16 years 16 days ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...