Sciweavers

1286 search results - page 68 / 258
» From System F to Typed Assembly Language
Sort
View
DGO
2008
170views Education» more  DGO 2008»
13 years 9 months ago
Natural language processing and e-Government: crime information extraction from heterogeneous data sources
Much information that could help solve and prevent crimes is never gathered because the reporting methods available to citizens and law enforcement personnel are not optimal. Dete...
Chih Hao Ku, Alicia Iriberri, Gondy Leroy
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 11 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
FUIN
2010
156views more  FUIN 2010»
13 years 6 months ago
A Tutorial Implementation of a Dependently Typed Lambda Calculus
Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
Andres Löh, Conor McBride, Wouter Swierstra
ICFP
2009
ACM
14 years 8 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui