Sciweavers

1185 search results - page 41 / 237
» Implementing Functional Languages: a tutorial
Sort
View
LISP
2008
96views more  LISP 2008»
14 years 9 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ICFP
2012
ACM
13 years 2 days ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
91
Voted
CEFP
2005
Springer
15 years 3 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond
70
Voted
SIGPLAN
2002
14 years 9 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen
78
Voted
IPPS
2002
IEEE
15 years 2 months ago
Implementing the NAS Benchmark MG in SAC
SAC is a purely functional array processing language designed with numerical applications in mind. It supports generic, high-level program specifications in the style of APL. How...
Clemens Grelck