Sciweavers

487 search results - page 3 / 98
» A Compiled Implementation of Normalization by Evaluation
Sort
View
SAC
2004
ACM
13 years 10 months ago
A back-end for GHC based on categorical multi-combinators
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...
LFP
1994
87views more  LFP 1994»
13 years 6 months ago
An Efficient Implementation of Multiple Return Values in Scheme
This paper describes an implementation of the new Scheme multiple values interface. The implementation handles multiple values efficiently, with no run-time overhead for normal ca...
J. Michael Ashley, R. Kent Dybvig
TYPES
2007
Springer
13 years 11 months ago
On Normalization by Evaluation for Object Calculi
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
Jan Schwinghammer
DATE
2010
IEEE
166views Hardware» more  DATE 2010»
13 years 9 months ago
A special-purpose compiler for look-up table and code generation for function evaluation
Abstract—Elementary functions are extensively used in computer graphics, signal and image processing, and communication systems. This paper presents a special-purpose compiler th...
Yuanrui Zhang, Lanping Deng, Praveen Yedlapalli, S...
ICFP
2002
ACM
14 years 4 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy