110 search results - page 2 / 22 » Language Boxes |
POPL
1992
ACM
13 years 8 months ago
1992
ACM
This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations, more efficien...
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
POPL
1994
ACM
13 years 8 months ago
1994
ACM
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...
PROPOR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract In this paper we assess to what extent the available Portuguese treebanks and available probabilistic parsers are suitable for outof-the-box robust parsing of Portuguese. ...
CP
2003
Springer
13 years 10 months ago
2003
Springer
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...