Sciweavers

580 search results - page 51 / 116
» Building a Family of Compilers
Sort
View
ENTCS
2010
66views more  ENTCS 2010»
13 years 7 months ago
A Nominal Relational Model for Local Store
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
Rasmus Ejlers Møgelberg
CORR
2007
Springer
64views Education» more  CORR 2007»
13 years 7 months ago
Series which are both max-plus and min-plus rational are unambiguous
Consider partial maps Σ∗ −→   with a rational domain. We show that two families of such series are actually the same: the unambiguous rational series on the one hand, and ...
Sylvain Lombardy, Jean Mairesse
JSW
2008
152views more  JSW 2008»
13 years 7 months ago
Reasoning with Semantic Web Technologies in Ubiquitous Computing Environment
--The vast amounts of data about people, things and the environment will require new ways of handling, searching and presenting information. New applications will increasingly be a...
WenYing Guo
NAR
1998
101views more  NAR 1998»
13 years 7 months ago
The PRINTS protein fingerprint database in its fifth year
PRINTS is a database of protein family ‘fingerprints’ offering a diagnostic resource for newly-determined sequences. By contrast with PROSITE, which uses single consensus expr...
Terri K. Attwood, Michael E. Beck, Darren R. Flowe...
IANDC
2010
125views more  IANDC 2010»
13 years 6 months ago
Continuation semantics for the Lambek-Grishin calculus
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
Raffaella Bernardi, Michael Moortgat