A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
The Definition of Standard ML
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An implementation of parallel pattern-matching via concurrent haskell
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
A Logic for Probabilities in Semantics
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the computational complexity of Longeley's H functional
Theoretical Computer Science - Implicit computational complexity
Optimising parallel pattern-matching by source-level program transformation
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Information and Computation
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Biorthogonality, step-indexing and compiler correctness
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Relative definability and models of unary PCF
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Program logics for sequential higher-order control
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
On monadic parametricity of second-order functionals
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Continuity of Gödel's System T Definable Functionals via Effectful Forcing
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In an impure functional language, there are programs whose behaviour is completely functional (in that they behave extensionally on inputs), but the functions they compute cannot be written in the purely functional fragment of the language. That is, the class of programs with functional behaviour is more expressive than the usual class of pure functional programs. In this paper we introduce this extended class of "functional" programs by means of examples in Standard ML, and explore what they might have to offer to programmers and language implementors.After reviewing some theoretical background, we present some examples of functions of the above kind, and discuss how they may be implemented. We then consider two possible programming applications for these functions: the implementation of a search algorithm, and an algorithm for exact real-number integration. We discuss the advantages and limitations of this style of programming relative to other approaches. We also consider the increased scope for compiler optimizations that these functions would offer.