Sciweavers

596 search results - page 117 / 120
» Subtyping Recursive Types
Sort
View
FPCA
1995
15 years 3 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
97
Voted
LICS
1991
IEEE
15 years 3 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
MCU
1998
119views Hardware» more  MCU 1998»
15 years 29 days ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
BMCBI
2008
119views more  BMCBI 2008»
14 years 11 months ago
A new method for 2D gel spot alignment: application to the analysis of large sample sets in clinical proteomics
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
Sabine Pérès, Laurence Molina, Nicol...
AMC
2006
67views more  AMC 2006»
14 years 11 months ago
A general probabilistic model of the PCR process
Earlier work by Saha et al. rigorously derived a general probabilistic model for the PCR process that includes as a special case the Velikanov-Kapral model where all nucleotide re...
Nilanjan Saha, Layne T. Watson, Karen Kafadar, Ale...