The conference materials contain 33 papers. The topics covered include experience with functionalprogramming applications, theory and implementation of types, storage reclamation, semantics analysis of imperative ext...
详细信息
ISBN:
(纸本)089791595X
The conference materials contain 33 papers. The topics covered include experience with functionalprogramming applications, theory and implementation of types, storage reclamation, semantics analysis of imperative extensions, compiling and performance evaluation, language design, compiler optimization, static analysis, functional algorithms and partial evaluation.
The proceedings contain 31 papers. The topics discussed include: frontiers and open sets in abstract interpretation;separating binding times in language specifications;separating binding times in language specificatio...
ISBN:
(纸本)0897913280
The proceedings contain 31 papers. The topics discussed include: frontiers and open sets in abstract interpretation;separating binding times in language specifications;separating binding times in language specifications;replacing function parameters by global variables;compile-time garbage collection by sharing analysis;compilation as partitioning: a new approach to compiling non-strict functionallanguages;untagged data in tagged environments: choosing optimal representations at compile time;improving the three instruction machine;stacklessness: compiling recursion for a distributed architecture;transformations on higher-order functions;a composition approach to time analysis of first order lazy functional programs;retrieving reusable software components by polymorphic type;using types as search keys in function libraries;parallel graph reduction with the (v , G)-machine;An abstract machine for parallel graph reduction;P-TAC: a parallel intermediate language;architectural improvements for data-driven VLSI processing arrays;strictness analysis: a new perspective based on type inference;f-bounded polymorphism for object-oriented programming;a simple semantics for ML polymorphism;on the complexity of type inference with coercion;extended projection-new method to extract efficient programs from constructive proofs;and set abstraction in functional and logic programming.
In this paper we discuss relational programming, i.e. a style of programming in which entire relations are manipulated rather than individual data. This analogous to functionalprogramming [1], wherein entire function...
ISBN:
(纸本)0897910605
In this paper we discuss relational programming, i.e. a style of programming in which entire relations are manipulated rather than individual data. This analogous to functionalprogramming [1], wherein entire functions are the values manipulated by the operators. We will see that relational programming subsumes functionalprogramming because every function is also a relation. It is appropriate this point to discuss why we have chosen investigate relational programming.
A cellular binary tree machine proposed by Mac0 accommodates the parallelism inherent in the functionalprogramminglanguages of Backus by simultaneously executing innermost applications. Data communication time on th...
详细信息
functionalprogramming systems, although they have nice theoretical properties and elegant implementations, have failed to make any significant impact in the practical world of applications programming. We shall descr...
详细信息
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits the parallelism due to nondeterministic choices in a logic program. A working interpreter based on this model is desc...
详细信息
The use of feedback loops in functionalprogramminglanguages is explored, particularly in the context of graph-based semantic models. In this setting, program cycles (termed "applicative loops") offer benef...
详细信息
functionallanguages provide a framework in which combining existing programs to produce new ones is particularly simple and elegant. However, the penalty usually paid for such simplicity and elegance is poor executio...
详细信息
Operators in functionallanguages such as APL and FFP are a useful programming concept. However, this concept cannot be fully exploited in these languages because of certain constraints. It is proposed that an operato...
详细信息
We describe the data definition facilities of a new applicative language called CDS, which is based on Kahn-Plotkin's theory of concrete data structures and on Berry-Curien's theory of sequential algorithms. C...
详细信息
暂无评论