Sciweavers

756 search results - page 20 / 152
» Understanding COBOL Systems using Inferred Types
Sort
View
134
Voted
ACL
2010
15 years 20 days ago
Using Document Level Cross-Event Inference to Improve Event Extraction
Event extraction is a particularly challenging type of information extraction (IE). Most current event extraction systems rely on local information at the phrase or sentence level...
Shasha Liao, Ralph Grishman
138
Voted
SYNTHESE
2011
72views more  SYNTHESE 2011»
14 years 9 months ago
Science without (parametric) models: the case of bootstrap resampling
Scientific and statistical inferences build heavily on explicit, parametric models, and often with good reasons. However, the limited scope of parametric models and the increasin...
Jan Sprenger
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
15 years 7 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
ICFP
2003
ACM
16 years 2 months ago
MLF: raising ML to the power of system F
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
Didier Le Botlan, Didier Rémy
127
Voted
ESOP
2007
Springer
15 years 6 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan