the proceedings contain 34 papers. the special focus in this conference is on functionalprogramming and Narrowing. the topics include: A generic program for sequential decision processes;parsing visual languages with...
ISBN:
(纸本)354060359X
the proceedings contain 34 papers. the special focus in this conference is on functionalprogramming and Narrowing. the topics include: A generic program for sequential decision processes;parsing visual languages with constraint multiset grammars;programming with constructor classes;towards a taxonomy of functional language implementations;a verified implementation of narrowing;a new calculus for semantic matching;a complete narrowing calculus for higher-order functionallogicprogramming;exploiting parallelism in tabled evaluations;design and implementation of jump tables for fast indexing of logic programs;an abstract machine for Oz;uniform PERs and comportment analysis;uniqueness type inference;mode analysis of arrays and array comprehensions;better consumers for deforestation;efficient compile-time garbage collection for arbitrary data structures;efficient multi-level generating extensions;mechanically verifying the correctness of an offline partial evaluator;a semantic model of binding times for safe partial evaluation;lazy functional components for graphical user interfaces;lightweight GUIs for functionalprogramming;lazy functional components for graphical user interfaces;lightweight GUIs for functionalprogramming;a functional framework for deterministically interleaved interactive programs;a debugging model for lazy narrowing;evaluation of expressions in a multiparadigm framework;an expression-or-parallel implementation for a functionallogic language;attributed models of executable specifications;approximating constraint logic programs using polymorphic types and regular descriptions;performance of a data-parallel concurrent constraint programming system and a portable implementation of memoing evaluation.
Polymorphic type systems offer both type security and flexibility, allowing the definition and use of values which behave uniformly across a range of types. Constructor classes are one attempt to increase the expressi...
详细信息
Graphical user interfaces (GUIs) are hard to combine withfunctionalprogramming. Using a suitable combination of monads, we are able to tame the imperative aspects of graphical I/O in a straightforward and elegant wa...
详细信息
ISBN:
(纸本)354060359X
Graphical user interfaces (GUIs) are hard to combine withfunctionalprogramming. Using a suitable combination of monads, we are able to tame the imperative aspects of graphical I/O in a straightforward and elegant way. We present a concept to integrate lightweight GUIs into the functional framework, together with a library of basic functions and layout combinators to manipulate the GUI. An implementation of this library, using a set of high-level graphical I/O routines, is outlined. Examples demonstrate the simple way in which applications can be written.
A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays containing both ground and non-ground elements. To do this we leverage constraint-propagation mode analysis techniques...
详细信息
ISBN:
(纸本)354060359X
A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays containing both ground and non-ground elements. To do this we leverage constraint-propagation mode analysis techniques. the key ideas are to restrict multiple assignments only to variables at the leaves of paths, and to extend the language family with array comprehensions. the result is a language not significantly different than generic committed-choice languages, which can be safely mode analyzed, producing useful (not overly conservative) information, even for programs that assign to unbound array elements. An implementation of the analysis is presented.
this paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics T. Next, an equivalent fixpoint semantics F is ...
详细信息
ISBN:
(纸本)354060359X
this paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics T. Next, an equivalent fixpoint semantics F is defined: a dataflow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least fixpoint determines one set of constraints for each node of the dataflow graph. To prove that F and T are equivalent, an intermediate semantics O is used, which propagates a given set of constraints through the paths of the dataflow graph. Possible applications of F (and O) are discussed: in particular, its incrementality is used to define a parallel execution model for clp's based on asynchronous processors assigned to the nodes of the program graph. Moreover, O is used to formalize the Intermittent Assertion Method of Burstall [Bur74] for constraint logic programs.
We propose a goal-directed query processing method for disjunctive logic databases. the notion of ''relevancy'' proposed in a theorem prover called SATCHMORE in [LRW95] is useful for the satisfiability...
详细信息
ISBN:
(纸本)354060359X
We propose a goal-directed query processing method for disjunctive logic databases. the notion of ''relevancy'' proposed in a theorem prover called SATCHMORE in [LRW95] is useful for the satisfiability checking of a given set of clauses, but it is not sufficient for the query processing in disjunctive databases, where it is essential in some applications for the answer to a given query to be distinguished between ''true'', ''false'', or ''unknown (possibly true)''. We first give a goal-directed query processing procedure based on the relevancy, but suitably modified for the above purpose, and show that our procedure is sound and complete for a class of positive disjunctive databases in the minimal model semantics. We then show that a modified version of our procedure effectively works as a correct query processing method for the possible model semantics [SI93], a recently proposed alternative semantics for disjunctive databases. We also show some experimental results of the procedure.
We use Girard’s linear logic (LL) to produce a semantics for Gamma, a multiset transformation language. the semantics improves on the existing structured operational semantics (SOS) of the language by highlighting Ga...
详细信息
暂无评论