Sciweavers

270 search results - page 10 / 54
» A Simple and General Theoretical Account for Abstract Types
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
POPL
2007
ACM
14 years 8 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
AI
2004
Springer
13 years 7 months ago
Hierarchical model-based diagnosis based on structural abstraction
al Abstraction Luca Chittaro and Roberto Ranon Department of Mathematics and Computer Science, University of Udine, via delle Scienze 206, 33100 Udine, Italy ion has been advocat...
Luca Chittaro, Roberto Ranon
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 1 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring