The proceedings contain 25 papers. The special focus in this conference is on functionalprogramminglanguages andcomputerarchitecture. The topics include: An architecture that efficiently updates associative aggreg...
ISBN:
(纸本)9783540159759
The proceedings contain 25 papers. The special focus in this conference is on functionalprogramminglanguages andcomputerarchitecture. The topics include: An architecture that efficiently updates associative aggregates in applicative programminglanguages;lambda lifting: Transforming programs to recursive equations;optimizing almost-tail-recursive Prolog programs;designing regular array architectures using higher order functions;vFP: An environment for the multi-level specification, analysis, and synthesis of hardware algorithms;a distributed garbage collection algorithm;cyclic reference counting for combinator machines;design for a multiprocessing heap with on-board reference counting;a functional language and modular architecture for scientific computing;Data flow graph optimization in IF1;practical polymorphism;program verification in a logical theory of constructions;transforming recursive programs for execution on parallel machines;compiling pattern matching;serial combinators: “optimal” grains of parallelism;the G-machine: A fast, graph-reduction evaluator;strictness analysis — a practical approach;the categorical abstract machine;High order programming in extended FP;secd-m: A virtual machine for applicative programming;cobweb — A combinator reduction architecture;how to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functionallanguages;lazy memo-functions.
An extended graph rewriting computational model is proposed which can implement logic variables, nondeterminism, OR-parallelism, and guard calls of PARLOG very efficiently. It is pointed out that the methods for imple...
详细信息
ISBN:
(纸本)0818620846
An extended graph rewriting computational model is proposed which can implement logic variables, nondeterminism, OR-parallelism, and guard calls of PARLOG very efficiently. It is pointed out that the methods for implementing PARLOG based on this model are better than those in other related research works.< >
Polymorphic type systems as proposed by Milner and implemented in the programming language ML offer rich types, unobtrusive compile-time type-checking and complete type-safety in functionallanguages. However, straigh...
详细信息
An experimental functionally programmed multiprocessor for high performance computing applications is the subject of an ongoing research project at FPS, with the objective of bringing the benefits of functional progra...
详细信息
Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combina...
详细信息
The logical theory of constructions is a simple theory which combines functional programs and intuitionistic predicate calculus. Here we propose that it is a practical alternative to other constructive programming log...
详细信息
暂无评论