In this paper the mechanism of Default Rules for narrowing-based languages proposed in [24] is adapted to lazy narrowing. Every partial definition of a function can be completed with a default rule. In a concrete func...
详细信息
A term rewriting system is strongly innermost normalizing if every innermost derivation of it is of finite length. this property is very important in the integration of functional and logicprogramming paradigms. Unli...
详细信息
We present Skil, an imperative language enhanced with higher order functions and currying, as well as with a polymorphic type system. the high level of Skil allows the integration of algorithmic skeletons, i.e. of hig...
详细信息
ISBN:
(纸本)9780818675829
We present Skil, an imperative language enhanced with higher order functions and currying, as well as with a polymorphic type system. the high level of Skil allows the integration of algorithmic skeletons, i.e. of higher order functions representing parallel computation patterns. At the same time, the language can be efficiently implemented. After describing a series of skeletons which work with distributed arrays, we give two examples of parallel programs implemented on the basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Run time measurements show that we approach the efficiency of message passing C up to a factor between 1 and 2.5.
the proceedings contain 19 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: Preserving characteristic trees without constraints;memoing evaluation by s...
ISBN:
(纸本)3540609393
the proceedings contain 19 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: Preserving characteristic trees without constraints;memoing evaluation by source-to-source transformation;transformation of left terminating programs;derivation of concurrent algorithms in tempo;an argumentation-theoretic approach to logic program transformation;complexity of horn programs;studying the cost of logic languages in an abstract interpretation framework for granularity analysis;ideal refinement of datalog programs;guiding program development systems by a connection based proof strategy;towards an object-oriented methodology for deductive synthesis of logic programs;logic program synthesis by induction over horn clauses;logic program transformation through generalization schemata;an opportunistic approach for logic program analysis and optimisation using enhanced schema-based transformations;solving deductive planning problems using program analysis and transformation;towards a complete proof procedure to prove properties of normal logic programs under the completion;termination of logic programs using semantic unification;on the mechanics of metasystem hierarchies in program transformation and efficient translation of lazy functionallogic programs into prolog.
the proceedings contain 33 papers. the special focus in this conference is on Optimization and Nonmonotonic Semantics I. the topics include: Parallel database systems;languages for polynomial-time queries;distributed ...
ISBN:
(纸本)3540589074
the proceedings contain 33 papers. the special focus in this conference is on Optimization and Nonmonotonic Semantics I. the topics include: Parallel database systems;languages for polynomial-time queries;distributed query optimization in loosely coupled multidatabase systems;on the complexity of generating optimal left-deep processing trees with cross products;querying disjunctive databases through nonmonotonic logics;on the kolmogorov expressive power of boolean query languages;on two forms of structural recursion;partial strictness in two-phase locking;unified transaction model for semantically rich operations;domain-independent queries on databases with external functions;an algebra for pomsets;on the power of stratified logic programs with value invention for expressing database transformations;a stable model semantics for behavioral inheritance in deductive object oriented languages;a rewriting technique for the analysis and the optimization of active databases;sorts in higher-order logic data languages;uniformly-distributed random generation of join orders;a probabilistic view of datalog parallelization;a first step towards implementing dynamic algebraic dependencies;constraint-generating dependencies;optimization using tuple subsumption;deterministic and non-deterministic stable model semantics for unbound DATALOG queries;revision programming, database updates and integrity constraints;some positive results for boundedness of multiple recursive rules;increment boundedness and nonrecursive incremental evaluation of datalog queries;approximation in databases;datalog queries of set constraint databases and space usage in functional query languages.
the proceedings contain 33 papers. the special focus in this conference is on programming. the topics include: Local type reconstruction by means of symbolic fixed point iteration;an asynchronous process algebra with ...
ISBN:
(纸本)9783540578802
the proceedings contain 33 papers. the special focus in this conference is on programming. the topics include: Local type reconstruction by means of symbolic fixed point iteration;an asynchronous process algebra with multiple clocks;foundational issues in implementing constraint logicprogramming systems;characterizing behavioural semantics and abstractor semantics;simulation of SOS definitions with term rewriting systems;strategies in modular system design by interface rewriting;symbolic model checking and constraint logicprogramming: a crossfertilization;a logical denotational semantics for constraint logicprogramming;compilation of head and strong reduction;suffix trees in the functionalprogramming paradigm;suffix trees in the functionalprogramming paradigm;symbolic model checking and constraint logicprogramming: a crossfertilization;a logical denotational semantics for constraint logicprogramming;compilation of head and strong reduction;suffix trees in the functionalprogramming paradigm;a logical denotational semantics for constraint logicprogramming;compilation of head and strong reduction;suffix trees in the functionalprogramming paradigm;type classes in Haskell;lazy type inference for the strictness analysis of lists;lazy unification with simplification;polymorphic binding-time analysis;shapely types and shape polymorphism;first-class polymorphism for ml;dimension types;a synergistic analysis for sharing and groundness which traces linearity;a logical framework for evolution of specifications;a semantics for higher-order functors;an abstract machine for sound evaluation of parallel functional programs with first-class continuations;a tiny constraint functionallogic language and its continuation semantics;fully abstract translations and parametric polymorphism.
We present an extension of λ-calculus by logical features and constraints, which yields a minimal core language for constraint functionallogicprogramming. We define a denotational semantics based on continuation pa...
详细信息
In this paper we present a constructive method of learning from examples using typed equational programming. the main contribution is a concept of type maintenance which appears to be theoretically and practically use...
详细信息
functionallogic languages amalgamate functional and logicprogramming paradigms. they can be efficiently implemented by extending techniques known from logicprogramming. In this paper we show how global information ...
详细信息
A constraint logicprogramming system for the domain of complex functions is described. the intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, ...
详细信息
暂无评论