Titlebook: Implementation of Functional Languages; 14th International W Ricardo Pe?a,Thomas Arts Conference proceedings 2003 Springer-Verlag Berlin He

頌揚國家

transient-pain

When Generic Functions Use Dynamic Values,s that can be specialized . to arguments of arbitrary type. Both techniques have been investigated and incorporated in the pure functional programming language Clean. Because generic functions work on all types and values, they are the perfect tool when manipulating dynamic values. But generics rely

不規(guī)則的跳動

engrossed

白楊

Proving Make Correct: I/O Proofs in Haskell and Clean,s which perform significant I/O. We developed a model of the I/O system and produced some techniques to reason about the behaviour of programs run in the model. We then used those techniques to prove some properties of a program based on the standard make tool. We consider the I/O systems of both la

ORBIT

FID

Lazy Dynamic Input/Output in the Lazy Functional Language Clean,an because it allows type safe exchange of both data and code. In this way mobile code and plug-ins can be realized easily. The paper discusses the most important implementation problems and their solutions in the context of a compiled lazy functional language. The implemented solution reflects the

Stricture

PolyAPM: Parallel Programming via Stepwise Refinement with Abstract Parallel Machines, and error-prone, the use of compilers reduces the programmer’s control and often does not lead to an optimal result. With our approach, PolyAPM, the programming process is structured as a series of source-to-source transformations. Each intermediate result is a program for an Abstract Parallel Mach

大范圍流行

Unboxed Compilation of Floating Point Arithmetic in a Dynamically Typed Language Environment,ontaining floating point numbers, how this information is used by the BEAM compiler, and a scheme for efficient (just-in-time) compilation of floating point bytecode instructions to native code. The attractiveness of the scheme lies in its implementation simplicity. It has been fully incorporated in

維持

Stacking Cycles: Functional Transformation of Circular Data,is paper, we characterize a class of functions on circular data graphs extending the class of primitively corecursive functions. We propose an abstract, effective implementation technique for these functions under an eager evaluation strategy on standard stack machines. The proposed implementation e