Sciweavers

1147 search results - page 62 / 230
» Termination in language-based systems
Sort
View
VTC
2010
IEEE
142views Communications» more  VTC 2010»
13 years 7 months ago
Low-Feedback Multiple-Access and Scheduling via Location and Geometry Information
—This paper exploits the use of location information of wireless terminals to improve the performance of a beamforming system and support multiple access. Based on a system provi...
Congzheng Han, Matthew Webb, Angela Doufexi, Mark ...
PODC
2010
ACM
14 years 20 days ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
MFCS
1997
Springer
14 years 28 days ago
Simulation as a Correct Transformation of Rewrite Systems
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
Wan Fokkink, Jaco van de Pol
ECBS
2005
IEEE
160views Hardware» more  ECBS 2005»
14 years 2 months ago
Building Compilers by Combining Algebras
Embedded systems present a wide variety of challenges for developers of language tools. Verification of correctness, flexibility for adding new language features, and retargetin...
Garrin Kimmell, Ed Komp, Perry Alexander
APAL
2008
79views more  APAL 2008»
13 years 9 months ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig