Sciweavers

6201 search results - page 349 / 1241
» Implementation of Axiomatic Language
Sort
View
PLDI
2003
ACM
16 years 1 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
ICDE
1998
IEEE
104views Database» more  ICDE 1998»
16 years 8 months ago
Representing and Querying Changes in Semistructured Data
Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of cha...
Sudarshan S. Chawathe, Serge Abiteboul, Jennifer W...
POPL
2007
ACM
16 years 7 months ago
Data parallel Haskell: a status report
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original p...
Manuel M. T. Chakravarty, Roman Leshchinskiy, Simo...
PADL
2010
Springer
16 years 3 months ago
Conversion by Evaluation
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Mathieu Boespflug
153
Voted
PPPJ
2009
ACM
16 years 1 months ago
Three approaches to object evolution
Dynamic object reclassification allows changes to the type of an object at runtime. This paper makes the case for object evolution, a restriction of general reclassification by ...
Tal Cohen, Joseph Gil