Sciweavers

116 search results - page 20 / 24
» Operations Preserving Recognizable Languages
Sort
View
FASE
2000
Springer
13 years 11 months ago
Parallel Refinement Mechanisms for Real-Time Systems
This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and f...
Paul Z. Kolano, Richard A. Kemmerer, Dino Mandriol...
LISP
2006
105views more  LISP 2006»
13 years 7 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
PVLDB
2010
122views more  PVLDB 2010»
13 years 6 months ago
Avalanche-Safe LINQ Compilation
We report on a query compilation technique that enables the construction of alternative efficient query providers for Microsoft’s Language Integrated Query (LINQ) framework. LIN...
Torsten Grust, Jan Rittinger, Tom Schreiber
CORR
2010
Springer
59views Education» more  CORR 2010»
13 years 6 months ago
Refinement and Verification of Real-Time Systems
This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and ...
Paul Z. Kolano, Carlo A. Furia, Richard A. Kemmere...
POPL
2009
ACM
14 years 8 months ago
State-dependent representation independence
Mitchell's notion of representation independence is a particularly useful application of Reynolds' relational parametricity -- two different implementations of an abstra...
Amal Ahmed, Derek Dreyer, Andreas Rossberg