Sciweavers

632 search results - page 47 / 127
» Explicit Substitutions and Programming Languages
Sort
View
ICFP
2010
ACM
13 years 8 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
POPL
2011
ACM
12 years 10 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
13 years 7 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
14 years 2 months ago
A Tutorial on Parallel and Concurrent Programming in Haskell
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...
Simon L. Peyton Jones, Satnam Singh
ICSE
1999
IEEE-ACM
13 years 12 months ago
An Initial Assessment of Aspect-Oriented Programming
The principle of separation of concerns has long been used by software engineers to manage the complexity of software system development. Programming languages help software engin...
Robert J. Walker, Elisa L. A. Baniassad, Gail C. M...