Sciweavers

1193 search results - page 45 / 239
» A primer of simple theories
Sort
View
LICS
2008
IEEE
15 years 6 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
ECSQARU
2007
Springer
15 years 6 months ago
Interpreting Belief Functions as Dirichlet Distributions
Traditional Dempster Shafer belief theory does not provide a simple method for judging the effect of statistical and probabilistic data on belief functions and vice versa. This put...
Audun Jøsang, Zied Elouedi
SIGMETRICS
2012
ACM
197views Hardware» more  SIGMETRICS 2012»
13 years 2 months ago
Fluid limit of an asynchronous optical packet switch with shared per link full range wavelength conversion
We consider an asynchronous all optical packet switch (OPS) where each link consists of N wavelength channels and a pool of C ≤ N full range tunable wavelength converters. Under...
Benny Van Houdt, Luca Bortolussi
VMCAI
2012
Springer
13 years 7 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
TYPES
1998
Springer
15 years 4 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner