Sciweavers

1320 search results - page 216 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
CP
2006
Springer
13 years 11 months ago
High-Level Nondeterministic Abstractions in
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CASES
2006
ACM
14 years 1 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 29 days ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ICFP
2009
ACM
14 years 8 months ago
Identifying query incompatibilities with evolving XML schemas
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
Nabil Layaïda, Pierre Genevès, Vincent...