Sciweavers

162 search results - page 13 / 33
» Encoding Types in ML-Like Languages
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
FSMNLP
2009
Springer
13 years 5 months ago
Minimizing Weighted Tree Grammars Using Simulation
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
Andreas Maletti
CSFW
2012
IEEE
11 years 10 months ago
Information-Flow Security for a Core of JavaScript
—Tracking information flow in dynamic languages remains an important and intricate problem. This paper makes substantial headway toward understanding the main challenges and res...
Daniel Hedin, Andrei Sabelfeld
ENTCS
2008
92views more  ENTCS 2008»
13 years 7 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 7 months ago
Scalable XQuery type matching
XML Schema awareness has been an integral part of the XQuery language since its early design stages. Matching XML data against XML types is the main operation that backs up XQuery...
Jens Teubner