Sciweavers

367 search results - page 6 / 74
» Relating Full Abstraction Results for Different Programming ...
Sort
View
ER
1995
Springer
109views Database» more  ER 1995»
13 years 11 months ago
Reverse Engineering of Relational Database Applications
Abstract. This paper presents techniques for reverse engineering of relational database applications. The target of such an effort is the definition of a fully equipped object-orie...
Mark W. W. Vermeer, Peter M. G. Apers
LLC
2011
120views more  LLC 2011»
13 years 2 months ago
How Talker Identity Relates to Language Processing
Speech carries both linguistic content – phonemes, words, sentences – and talker information, sometimes called ‘indexical information’. While talker variability materially...
Sarah C. Creel, Micah R. Bregman
ICALP
2011
Springer
12 years 11 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
BNCOD
2008
129views Database» more  BNCOD 2008»
13 years 9 months ago
A Semantics for a Query Language over Sensors, Streams and Relations
Abstract. We introduce a query language over sensors, streams and relations and formally describe its semantics. Although the language was specifically designed for sensor network ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...
POPL
2007
ACM
14 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell