Sciweavers

24 search results - page 3 / 5
» A Supercompiler for Core Haskell
Sort
View
ICFP
2010
ACM
13 years 6 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
ICFP
2012
ACM
11 years 7 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
ICFP
2009
ACM
14 years 5 months ago
A concurrent ML library in concurrent Haskell
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
Avik Chaudhuri
HASKELL
2009
ACM
13 years 11 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
ICCS
2007
Springer
13 years 9 months ago
SymGrid-Par: Designing a Framework for Executing Computational Algebra Systems on Computational Grids
Abstract. SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids. We present the design of SymGrid-Par, which supports multiple compute...
Abdallah Al Zain, Kevin Hammond, Philip W. Trinder...