Sciweavers

1286 search results - page 47 / 258
» From System F to Typed Assembly Language
Sort
View
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 27 days ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ICFP
2005
ACM
14 years 7 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
SEBD
2007
114views Database» more  SEBD 2007»
13 years 9 months ago
A New Type of Metadata for Querying Data Integration Systems
Research on data integration has provided languages and systems able to guarantee an integrated intensional representation of a given set of data sources. A significant limitation...
Sonia Bergamaschi, Francesco Guerra, Mirko Orsini,...
ICFP
1997
ACM
13 years 12 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
INLG
2010
Springer
13 years 5 months ago
UDel: Named Entity Recognition and Reference Regeneration from Surface Text
This report describes the methods and results of a system developed for the GREC Named Entity Recognition and GREC Named Entity Regeneration Challenges 2010. We explain our proces...
Nicole L. Sparks, Charles F. Greenbacker, Kathleen...