We extend an ML-like implicit type system to include a number of structures and operations that are common in database programming including sets, labeled records, joins and projections. We then show that the type inf...
详细信息
Introduction: A system is parameterized when it has one or more external inputs which partially determine a result. In the lambda calculus parameterization arises in two situations;the value of a function is parameriz...
详细信息
An implementation of the Portable Standard lisp (PSL) on the BBN Butterfly is described. Butterfly PSL is identical, syntactically and semamtically, to implementations of PSL currently available on the VAX, Gould, and...
详细信息
Function caching is the technique of remembering previous function calls and avoiding the cost of recomputing them. Function caching provides a simple way of implementing dynamic programming algorithms and can provide...
详细信息
Introduction: Many functional languages have a construction to define inductive data types [Hoa75] (also called general structured types [Pey87], structures [Lan64], datatypes [Mil84] and free algebras [GTWW77]). An i...
详细信息
Combinator reduction is a well-known implementation technique for executing functional programs. In this paper we present a new method for parallel combinator reduction based on viewing combinators simply as "gra...
详细信息
Recent developments in functional language implementations have resulted in the G-machine, a programmed graph- reduction machine. Taking this as a basis, we introduce an optimised method of performing graph reduction,...
详细信息
The IEEE standard for floating point numbers is by now reasonably well known, but less well known is the fact that this standard provides for a certain exceptional class of bit patterns, the use of which are left to t...
详细信息
The proceedings contain 32 papers. The topics discussed include: a simple applicative language: Mini-ML;the CURRY Chip;desiderata for the standardisation of lisp;laws in Miranda;variations on strictness analysis;exper...
ISBN:
(纸本)0897912004
The proceedings contain 32 papers. The topics discussed include: a simple applicative language: Mini-ML;the CURRY Chip;desiderata for the standardisation of lisp;laws in Miranda;variations on strictness analysis;experience with an uncommon lisp;an architecture for mostly functional languages;integrating functional and imperative programming;code generation techniques for functional languages;the implementation of PC scheme;design of an optimising, dynamically retargetable compiler for common lisp;expansion-passing style: beyond conventional macros;the four-stroke reduction engine;lisp on a reduced-instruction-set-processor;hygienic macro expansion;partitioning parallel programs for macro-dataflow;exact real arithmetic: a case study in higher order programming;NORMA: a graph reduction processor;reconfigurable, retargetable bignums: a case study in efficient, portable lisp system building;implementing functional languages in the categorical abstract machine;connection graphs;connection machine@ lisp: pine-grained parallel symbolic processing;and the mystery of the tower revealed: a non-reflective description of the reflective tower.
暂无评论