Sciweavers

2646 search results - page 80 / 530
» Local Type Inference
Sort
View
HOTNETS
2010
14 years 7 months ago
Using strongly typed networking to architect for tussle
Today's networks discriminate towards or against traffic for a wide range of reasons, and in response end users and their applications increasingly attempt to evade monitorin...
Chitra Muthukrishnan, Vern Paxson, Mark Allman, Ad...
FLOPS
2008
Springer
15 years 2 months ago
Undoing Dynamic Typing (Declarative Pearl)
We propose undoable versions of the projection operations used when programs written in higher-order statically-typed languages interoperate with dynamically typed ones, localizing...
Nick Benton
86
Voted
APAL
2008
79views more  APAL 2008»
15 years 22 days ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig
ACL
2006
15 years 2 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning
111
Voted
PODS
2005
ACM
99views Database» more  PODS 2005»
16 years 22 days ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...