the proceedings contain 33 papers. the special focus in this conference is on programming Language Implementation and logicprogramming. the topics include: Executable specifications for language implementation;avoidi...
ISBN:
(纸本)9783540571865
the proceedings contain 33 papers. the special focus in this conference is on programming Language Implementation and logicprogramming. the topics include: Executable specifications for language implementation;avoiding dynamic delays in functional logic programs;a debugging model for functional logic programs;a conservative approach to meta-programming in constraint logicprogramming;the versatility of handling disjunctions as constraints;improvements in compile-time analysis for ground prolog;a new top-down parsing algorithm for left-recursive DCGs;specification and implementation of grammar couplings using attribute grammars;programming language specification and prototyping using the MAX system;flang and its implementation;efficient lazy narrowing using demandedness analysis;a demand driven computation strategy for lazy narrowing;functional programming languages withlogical variables: a linear logic view;objects with state in contextual logicprogramming;a novel method for parallel implementation of findall;a parallel implementation for AKL;inlining to reduce stack space;a WAM-based implementation of a logic language with sets;executing bounded quantifications on shared memory multiprocessors;a lattice of abstract graphs;higher-order chaotic iteration sequences;proving the correctness of compiler optimisations based on strictness analysis;abstract complexity of prolog based on WAM;development of rewriting strategies;narrowing approximations as an optimization for equational logic programs;a back end generator;selflog: language and implementation;embedding declarative subprograms into imperative constructs;stack management of runtime structures in distributed implementations and efficient register allocation for large basic blocks.
Here we give one particularly starting result which states that a simple syntactic restriction on logic programs yields a simple programming language in which one can define all and only polynomial time decision proce...
详细信息
ISBN:
(纸本)0818642009
Here we give one particularly starting result which states that a simple syntactic restriction on logic programs yields a simple programming language in which one can define all and only polynomial time decision procedures. A logic program is a set of positive Horn clauses of first order logic. Each clause can be represented as an implication of the form A1Λ A2Λ....Λ An&rarrC where each antecedent Ai and the conclusion C are all atomic first order formulas, i.e., formulas of the form P(t1. ....., tk) where P is a predicate symbol and each ti is a term. the transitivity axiom x &leyΛy&lez&rarrx&lez is a simple example of a positive Horn clause. Each such clause can be viewed as an inference rule stating that from any particular instance of the antecedents one can derive the corresponding instance of the conclusion.
Combinatorial search problems are ubiquitous in computer science and appears in many application areas, including operations research, hardware design, computational geometry, and finance. I take the position here tha...
详细信息
ISBN:
(纸本)0818642009
Combinatorial search problems are ubiquitous in computer science and appears in many application areas, including operations research, hardware design, computational geometry, and finance. I take the position here that constraint programming languages will play an increasingly important role in the development of these applications. the basic motivation behind these languages is to support will established paradigms and constraint solving techniques inside programming languages to (1) reduce the development time of these applications significantly and (2) preserve most of the efficiency of specialized algorithms. Constraints programming languages have a long history in artificial intelligence and important landmarks were the development of Sutherland's Sketchpad, Fike's REF-ARF, Borning's thingLan and Steele's Constraint. However, the development of Constraint logicprogramming (CLP) languages, such CHIP (2, 4), Prolog III and CLP (R) have given another dimension to these tools by embedding sophisticated search and constraint solving techniques (including constraint solving over Booleans, integers, and reals) into nondeterministic programming languages (i.e. Prolog). the main benefit of CLP languages is to support important abstractions, such as search and constraint solving, at a very high level, allowing programmers to focus on the salient aspects of their applications. Experience in application area such as scheduling and packing, digital and hybrid circuit design, and finance has shown the merit of this technology.
the APPLAUSE ESPRIT Project is building major applications using the ElipSys parallel constraint logicprogramming system developed at ECRC. Two major aims of the project are to advance the state of the art in four co...
详细信息
the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task manag...
ISBN:
(纸本)9783540568919
the proceedings contain 79 papers. the special focus in this conference is on Fundamentals of Computation theory. the topics include: Simulation-based comparison of hash functions for emulated shared memory;task management, virtual shared memory, and multithreading in a distributed memory implementation of sisal;simulating the data diffusion machine;an FP based programming language for efficient parallel programming of multiprocessor networks;the data-parallel categorical abstract machinedata parallel implementation of extensible sparse functional arrays;embeddings of tree-related networks in incomplete hypercubes;optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k;the united functions and objects approach;detection of recurrences in sequential programs with loops;parallel programming using skeleton functions;data-parallel portable software platform: principles and implementation;a compositional approach for fault-tolerance using specification transformation;concurrent metatem — a language for modelling reactive systems;trace-based compositional reasoning about fault tolerant systems;a kahn principle for networks of nonmonotonic real-time processes;adaptive multicast wormhole routing in 2D mesh multicomputer;the impact of packetization in wormhole-routed networks;a high-performance flat concurrent logicprogramming system;exploiting recursion-parallelism in prolog;why and how in the elipsys or-parallel CLP system;skewed-associative caches;trace-splitting for the parallel simulation of cache memory;locality and false sharing in coherent-cache parallel graph reduction;SLiD — a cost-effective and scalable limited-directory scheme for cache coherence and formal development of actor programs using structured algebraic petri nets.
We define the operational and denotational semantics for L2O2, a language incorporating the typical mechanisms of object oriented programming into concurrent logic languages. Our proposal allows the exploitation of tw...
详细信息
A fine-grained highly parallel program has many threads of execution. the first task to debug it is comprehending the situation of the execution. For this task, it is important to visualize the execution. Our debugger...
详细信息
ElipSys is a programming system supporting a constraint logicprogramming (CLP) language and OR-parallel execution. these two features complement each other: CLP programming eases the writing of efficient search progr...
详细信息
A method translating CLP(R) rules into object classes of OOP is presented in this paper. Operationally, the original inference process is replaced by simple object invocation. Backtracking is accomplished by a while l...
详细信息
ISBN:
(纸本)0818642009
A method translating CLP(R) rules into object classes of OOP is presented in this paper. Operationally, the original inference process is replaced by simple object invocation. Backtracking is accomplished by a while loop in a class member function. Mathematical constraints are collected incrementally when corresponding constraint objects are invoked. In this manner, mathematical models composed of such constrains can also be formed dynamically along the way of object invocation. During execution, objects of are created and the communications among them are through the message passing scheme. After the translation, there is no distinctions between rules and ordinary procedural functions because they are all the same in the form of classes. therefore, powerful and efficient computational procedures, such as mathematical solvers, can be easily integrated with original reasoning process so that traditional logic programs which are intelligent but less efficient can equip with powerful procedures easily to upgrade its efficiency. Moreover, because of the rich resources on the OOP platform nowadays, the translation process also greatly increases the flexibility and portability of a CLP(R) systems.
暂无评论