Sciweavers

331 search results - page 14 / 67
» HOLCF: Higher Order Logic of Computable Functions
Sort
View
LICS
2008
IEEE
15 years 3 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
CADE
1990
Springer
15 years 1 months ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
ICCV
2005
IEEE
15 years 3 months ago
Phase Field Models and Higher-Order Active Contours
The representation and modelling of regions is an important topic in computer vision. In this paper, we represent a region via a level set of a ‘phase field’ function. The fu...
Marie Rochery, Ian Jermyn, Josiane Zerubia
SIGGRAPH
1993
ACM
15 years 1 months ago
Radiosity algorithms using higher order finite element methods
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
Roy Troutman, Nelson L. Max
ERSHOV
2009
Springer
15 years 4 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko