Sciweavers

269 search results - page 39 / 54
» Computational soundness of observational equivalence
Sort
View
LICS
2007
IEEE
14 years 2 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba
APLAS
2005
ACM
14 years 2 months ago
Abstract Dependences for Alarm Diagnosis
Dependences for Alarm Diagnosis Xavier Rival ´Ecole Normale Sup´erieure 45, rue d’Ulm, 75230, Paris cedex 5, France We propose a framework for dependence analyses, adapted –a...
Xavier Rival
FOSSACS
2005
Springer
14 years 2 months ago
Duality for Logics of Transition Systems
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
Marcello M. Bonsangue, Alexander Kurz
INFOCOM
2003
IEEE
14 years 1 months ago
Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman, L...
ECOOP
2003
Springer
14 years 1 months ago
A Calculus of Untyped Aspect-Oriented Programs
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
Radha Jagadeesan, Alan Jeffrey, James Riely