632 search results - page 35 / 127 » Proving Invariants of Functional Programs |
123
click to vote
ISVC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
103
Voted
IFL
1997
Springer
15 years 4 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
84
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
83
Voted
AVBPA
1997
Springer
15 years 4 months ago
1997
Springer
We suggest a novel attentional mechanism for detection of smooth convex and concave objects based on direct processing of intensity values. The operator detects the regions of the ...
ENTCS
2007
15 years 15 days ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...