Sciweavers

2944 search results - page 114 / 589
» On Well Quasi-orders on Languages
Sort
View
TCS
2010
14 years 11 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
142
Voted
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 4 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
137
Voted
POPL
2012
ACM
13 years 8 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
COORDINATION
2008
Springer
15 years 2 months ago
Session Types for Orchestration Charts
We present a novel approach for the sound orchestration of services. It is based on Orcharts and Typecharts: a service orchestration language and an associated behavioural typing l...
Alessandro Fantechi, Elie Najm
94
Voted
ACL
2009
14 years 10 months ago
Case markers and Morphology: Addressing the crux of the fluency problem in English-Hindi SMT
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
Ananthakrishnan Ramanathan, Hansraj Choudhary, Avi...