Sciweavers

5415 search results - page 478 / 1083
» The Implementation of Functional Programming Languages
Sort
View
EVOW
1994
Springer
15 years 11 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
POPL
2009
ACM
16 years 8 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
LICS
1997
IEEE
15 years 12 months ago
Semantics of Exact Real Arithmetic
In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with nonnegative integer coe...
Peter John Potts, Abbas Edalat, Martín H&ou...
WOTUG
2008
15 years 9 months ago
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
Neil C. C. Brown
ICCS
2004
Springer
16 years 1 months ago
Extending Camelot with Mutable State and Concurrency
Abstract. Camelot is a resource-bounded functional programming language which compiles to Java byte code to run on the Java Virtual Machine. We extend Camelot to include language s...
Stephen Gilmore