Sciweavers

IFL
2003
Springer
167views Formal Methods» more  IFL 2003»
15 years 6 months ago
A Functional Shell That Dynamically Combines Compiled Code
Abstract. We present a new shell that provides the full basic functionality of a strongly typed lazy functional language, including overloading. The shell can be used for manipulat...
Arjen van Weelden, Rinus Plasmeijer
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
15 years 6 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 6 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
15 years 6 months ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
IFL
2003
Springer
15 years 6 months ago
Lazy Assertions
Olaf Chitil, Dan McNeill, Colin Runciman
Formal Methods
Top of PageReset Settings