Sciweavers

4211 search results - page 206 / 843
» Types as Abstract Interpretations
Sort
View
ENTCS
2002
114views more  ENTCS 2002»
15 years 4 months ago
Adjunction Models For Call-By-Push-Value With Stacks
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
Paul Blain Levy
FOSSACS
2003
Springer
15 years 9 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
CADE
2001
Springer
16 years 4 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
VMCAI
2010
Springer
15 years 11 months ago
An Analysis of Permutations in Arrays
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
Valentin Perrelle, Nicolas Halbwachs
EMMCVPR
2009
Springer
15 years 11 months ago
Image Registration under Varying Illumination: Hyper-Demons Algorithm
Abstract. The goal of this paper is to present a novel recipe for deformable image registration under varying illumination, as a natural extension of the demons algorithm. This gen...
Mehran Ebrahimi, Anne L. Martel