Sciweavers

2477 search results - page 23 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
78
Voted
FPCA
1995
15 years 1 months ago
A Generalization of Exceptions and Control in ML-like Languages
We add functional continuations and prompts to a language with an ML-style type system. The operators signi cantly extend and simplify the control operators in SML/NJ, and can be ...
Carl A. Gunter, Didier Rémy, Jon G. Riecke
WOB
2004
120views Bioinformatics» more  WOB 2004»
14 years 11 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
79
Voted
SAC
2010
ACM
15 years 4 months ago
Software transactional memory for implicitly parallel functional language
During the last decade, software transactional memory (STM) gained wide popularity in many areas of parallel computing. In this paper, we introduce LISP-derived language equipped ...
Petr Krajca, Vilém Vychodil
ICFP
2007
ACM
15 years 9 months ago
Type-safe higher-order channels in ML-like languages
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...
Sungwoo Park
TPHOL
2002
IEEE
15 years 2 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu