Sciweavers

POPL
1998
ACM
13 years 8 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
AFP
2004
Springer
117views Formal Methods» more  AFP 2004»
13 years 10 months ago
Refactoring Functional Programs
Abstract. Refactoring is the process of improving the design of existing programs without changing their functionality. These notes cover refactoring in functional languages, using...
Simon Thompson
HASKELL
2006
ACM
13 years 10 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones
PDCAT
2007
Springer
13 years 10 months ago
A Distributed Virtual Machine for Parallel Graph Reduction
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
ISCIS
2009
Springer
13 years 11 months ago
XLambda: A functional programming language with XML syntax
—We describe XLambda, a functional language with XML syntax, and its processor which is implemented fully and completely in XSLT. XLambda has all the basic features of a function...
Ruhsan Onder, Zeki Bayram
ICFP
2005
ACM
14 years 4 months ago
Witnessing side-effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alexander Aiken