Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
SLP Jones - Journal of functional programming, 1992 - cambridge.org
The Spineless Tagless G-machine is an abstract machine designed to support non-strict
higher-order functional languages. This presentation of the machine falls into three parts …
higher-order functional languages. This presentation of the machine falls into three parts …
Compiling language definitions: the ASF+ SDF compiler
The ASF+ SDF Meta-Environment is an interactive language development environment
whose main application areas are definition and implementation of domain-specific …
whose main application areas are definition and implementation of domain-specific …
The ins and outs of Clean I/O
Functional programming languages have banned assignment because of its undesirable
properties. The reward of this rigorous decision is that functional programming languages …
properties. The reward of this rigorous decision is that functional programming languages …
[PDF][PDF] Practical implementation of a dependently typed functional programming language
EC Brady - 2005 - Citeseer
Computer programs are ubiquitous. As we rely on computers more and more in all aspects
of daily life, it becomes more important to minimise errors in computer software; it is …
of daily life, it becomes more important to minimise errors in computer software; it is …
Benchmarking implementations of functional languages with 'Pseudoknot', a float-intensive benchmark
PH Hartel, M Feeley, M Alt, L Augustsson… - Journal of functional …, 1996 - cambridge.org
Over 25 implementations of different functional languages are benchmarked using the same
program, a floating-point intensive application taken from molecular biology. The principal …
program, a floating-point intensive application taken from molecular biology. The principal …
Measuring the effectiveness of a simple strictness analyser
We describe a simple strictness analyser for purely-functional programs, show how its
results are used to improve programs, and provide measurements of the effects of these …
results are used to improve programs, and provide measurements of the effects of these …
High level specification of I/O in functional languages
The interface with the outside world has always been one of the weakest points of functional
languages. It is not easy to incorporate I/O without being allowed to do side-effects …
languages. It is not easy to incorporate I/O without being allowed to do side-effects …
The GRIN project: A highly optimising back end for lazy functional languages
U Boquist, T Johnsson - … Languages: 8th International Workshop, IFL'96 …, 1997 - Springer
Low level optimisations from conventional compiler technology often give very poor results
when applied to code from lazy functional languages, mainly because of the completely …
when applied to code from lazy functional languages, mainly because of the completely …
[PDF][PDF] Implementing haskell overloading
L Augustsson - Proceedings of the conference on Functional …, 1993 - dl.acm.org
Haskell overloading poses new challenges for compiler writers. Until recently there have
been no implementations of it which have had acceptable performance; users have been …
been no implementations of it which have had acceptable performance; users have been …
Separation constraint partitioning: a new algorithm for partitioning non-strict programs into sequential threads
In this paper we present substantially improved thread partitioning algorithms for modern
implicitly parallel languages. We present a new block partitioning algorithm, separation …
implicitly parallel languages. We present a new block partitioning algorithm, separation …