the proceedings contain 18 papers. the special focus in this conference is on programming Languages and Systems. the topics include: Concurrent constraint programming based on functionalprogramming;a bisimulation met...
ISBN:
(纸本)3540643028
the proceedings contain 18 papers. the special focus in this conference is on programming Languages and Systems. the topics include: Concurrent constraint programming based on functionalprogramming;a bisimulation method for cryptographic protocols;a polyvariant binding-time analysis for off-line partial deduction;complexity of concrete type-inference in the presence of exceptions;an efficient new fixpoint algorithm for distributive constraint systems;reasoning about classes in object-oriented languages;language primitives and type discipline for structured communication-based programming;recursive object types in a logic of object-oriented programs;about modes and states for reactive systems;building a bridge between pointer aliases and program dependences;a complete declarative debugger of missing answers;systematic change of data representation and a generic framework for specialization.
We have recently defined a framework for Narrowing-driven Partial Evaluation (NPE) of functionallogic programs. this method is as powerful as partial deduction of logic programs and positive supercompilation of funct...
详细信息
ISBN:
(纸本)3540650148
We have recently defined a framework for Narrowing-driven Partial Evaluation (NPE) of functionallogic programs. this method is as powerful as partial deduction of logic programs and positive supercompilation of functional programs. Although it is possible to treat complex terms containing primitive functions (e.g. conjunctions or equations) in the NPE framework, its basic control mechanisms do not allow for effective polygenetic specialization of these complex expressions. We introduce a sophisticated unfolding rule endowed with a dynamic narrowing strategy which permits flexible scheduling of the elements (in conjunctions) which are reduced during specialization. We also present a novel abstraction operator which extends some partitioning techniques defined in the framework of conjunctive partial deduction. We provide experimental results obtained from an implementation using the INDY system which demonstrate that the control refinements produce better specializations.
the proceedings contain 17 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: A multi-level approach to program synthesis;programs without failures;gener...
ISBN:
(纸本)3540650741
the proceedings contain 17 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: A multi-level approach to program synthesis;programs without failures;generalised logic program transformation schemas;logic program schemas, constraints and semi-unification;implicit program synthesis by a reversible metainterpreter;termination analysis for tabled logicprogramming;on correct program schemas;analysis of logic programs with delay;constraint-based partial evaluation of rewriting-based functionallogic programs;preserving termination of tabled logic programs while unfolding;unfolding the mystery of mergesort;towards a logic for reasoning about logic programs transformation;a higher order reconstruction of stepwise enhancement;development of correct transformation schemata for prolog programs;constrained regular approximation of logic programs;a logic framework for the incremental inductive synthesis of datalog theories and to parse or not to parse.
We propose a formal framework for functionallogicprogramming, supporting lazy functions, non-determinism and polymorphic datatypes whose data constructors obey a given set C of equational axioms. On top of a given C...
详细信息
this paper describes a new compilation method for the residuation mechanism underlying a multiparadigm language. Furthermore, it proposes the constraint functional and functionallogic paradigms for the programming la...
详细信息
ISBN:
(纸本)3540616977
this paper describes a new compilation method for the residuation mechanism underlying a multiparadigm language. Furthermore, it proposes the constraint functional and functionallogic paradigms for the programming language of symbolic computation systems. the integration of functional and logicprogramming for the programming language of the symbolic computation system AlgBench is demonstrated using the residuation evaluation mechanism. the proposed multiparadigm language LAB could serve as a stand alone programming language. We present a residuation compiler and a collection of new commands and structures for a uniform abstract machine, an extension of the Warren's Abstract Machine (WAM), with a common memory for bothfunctional and logic programs. Our Implementation is done in an object-oriented way and it shows that the proposed approach and optimizations leads to a better execution and evaluation performance.
We propose a new technique for automatic generation of test cases for predicates. Earlier we proposed an efficient and effective test generation strategy for Boolean expressions. We now extend this strategy to predica...
详细信息
We propose a new technique for automatic generation of test cases for predicates. Earlier we proposed an efficient and effective test generation strategy for Boolean expressions. We now extend this strategy to predicates. Our new strategy addresses a number of issues, including: analysis of dependencies between relational expressions in a predicate P; generation of test constraints for P based on the detection of Boolean and relational operator faults in P; and generation of actual tests according to the generated test constraints for P. We propose the use of constraint logicprogramming (CLP) to automate test data generation for a predicate. Furthermore, we propose an incremental approach to apply CLP techniques to solve a constraint system. Since our technique is specification-based, it can facilitate generation of expected outputs for actual tests.
the design and development of the user interface is one of the most important and difficult part of the development of many current database applications. the authors describe the graphical system of the Fibonacci lan...
详细信息
the design and development of the user interface is one of the most important and difficult part of the development of many current database applications. the authors describe the graphical system of the Fibonacci language, which is a set of functions, types, language constructs, and tools, which make it possible for a Fibonacci programmer to develop the user interface of a Fibonacci application. the main feature of their proposal is that a prototype of the user interface can be realized with, essentially no effort, and can be later customized by working at different abstraction levels.
Presents a replication technique based on the FTAG (fault-tolerant attribute grammar) computation model, where instances of a replicated application are active on different groups of processors called replicas. FTAG i...
详细信息
Presents a replication technique based on the FTAG (fault-tolerant attribute grammar) computation model, where instances of a replicated application are active on different groups of processors called replicas. FTAG is a functional and attribute-based model. the developed replication technique implements "active parallel replication", i.e. all replicas are active and concurrently compute a different piece of the application's parallel code. In our model, replicas cooperate not only to detect and mask failures but also to perform parallel computation. the replication mechanisms are supported by the FTAG run-time system and are fully application-transparent. Different novel mechanisms for checkpointing and recovery are developed. Rollback is achieved only if the system experiences multiple failures, otherwise forward recovery is performed. the replication technique takes full advantage of parallel computation to reduce the computation time.
Although there exist a lot of deterministic implementations of functionallogicprogramming languages, up to now, none of them;has been verified. For abolishing this grievance, we present a simple implementation of th...
详细信息
ISBN:
(纸本)354060359X
Although there exist a lot of deterministic implementations of functionallogicprogramming languages, up to now, none of them;has been verified. For abolishing this grievance, we present a simple implementation of the leftmost outermost narrowing strategy for a restricted functionallogicprogramming language and prove its correctness.
Using higher-order functions is standard practice in functionalprogramming, but most functionallogicprogramming languages that have been described in the literature lack this feature. the natural way to deal with h...
详细信息
ISBN:
(纸本)354060359X
Using higher-order functions is standard practice in functionalprogramming, but most functionallogicprogramming languages that have been described in the literature lack this feature. the natural way to deal with higher-order functions in the framework of (first-order) term rewriting is through so-called applicative term rewriting systems. In this paper we argue that existing calculi for lazy narrowing either do not apply to applicative systems or handle applicative terms very inefficiently. We propose a new lazy narrowing calculus for applicative term rewriting systems and prove its completeness.
暂无评论