Sciweavers

272 search results - page 28 / 55
» Programming languages capturing complexity classes
Sort
View
158
Voted
POPL
1994
ACM
15 years 4 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
CAISE
2004
Springer
15 years 6 months ago
Description Logics for Interoperability
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
Enrico Franconi
JMLR
2008
127views more  JMLR 2008»
15 years 20 days ago
Incremental Identification of Qualitative Models of Biological Systems using Inductive Logic Programming
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
Ashwin Srinivasan, Ross D. King
112
Voted
PLDI
2009
ACM
15 years 7 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICALP
2007
Springer
15 years 6 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...