Sciweavers

207 search results - page 2 / 42
» Elementary Strong Functional Programming
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
JCT
2000
103views more  JCT 2000»
13 years 7 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
BSL
2004
110views more  BSL 2004»
13 years 7 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
BMCBI
2006
107views more  BMCBI 2006»
13 years 7 months ago
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
Kalyan Gayen, K. V. Venkatesh
MPC
2004
Springer
161views Mathematics» more  MPC 2004»
14 years 1 months ago
Compiling Exceptions Correctly
Exceptions are an important feature of modern programming languages, but their compilation has traditionally been viewed as an advanced topic. In this article we show that the basi...
Graham Hutton, Joel Wright