Sciweavers

4757 search results - page 482 / 952
» Monads for Functional Programming
Sort
View
ORL
2008
82views more  ORL 2008»
15 years 6 months ago
On test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Jon Lee, Shmuel Onn, Robert Weismantel
JFP
2007
126views more  JFP 2007»
15 years 6 months ago
Engineering Software Correctness
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
Rex L. Page
SCP
2002
119views more  SCP 2002»
15 years 6 months ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
TCS
2002
15 years 6 months ago
Strictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
Mario Coppo, Ferruccio Damiani, Paola Giannini
ICFP
2005
ACM
16 years 6 months ago
High-level views on low-level representations
This paper explains how the high-level treatment of datatypes in functional languages--using features like constructor functions and pattern matching--can be made to coexist with ...
Iavor S. Diatchki, Mark P. Jones, Rebekah Leslie