Sciweavers

4199 search results - page 438 / 840
» Generalizing Data in Natural Language
Sort
View
ESOP
2006
Springer
15 years 10 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
ESWS
2008
Springer
15 years 8 months ago
XSPARQL: Traveling between the XML and RDF Worlds - and Avoiding the XSLT Pilgrimage
With currently available tools and languages, translating between an existing XML format and RDF is a tedious and error-prone task. The importance of this problem is acknowledged b...
Waseem Akhtar, Jacek Kopecký, Thomas Krennw...
SAGA
2001
Springer
15 years 11 months ago
Stochastic Finite Learning
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
Thomas Zeugmann
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ASPLOS
2006
ACM
16 years 21 days ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro