Data distribution algebras are an abstract notion for the description of parallel programs. their dynamic execution can be optimized if they are shapely. In this paper we describe a shape analysis which allows compile...
详细信息
Data distribution algebras are an abstract notion for the description of parallel programs. their dynamic execution can be optimized if they are shapely. In this paper we describe a shape analysis which allows compile-time shapeliness-tests. It operates on the structure of algebraic data types and works for arbitrary functional programs rather than only shapely ones. Besides a first-order calculus we also propose a higher-order version which can handle higher-order functions as well. (C) 2000 Elsevier Science B.V. All rights reserved.
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction stra...
详细信息
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outermost-fair-like strategy that is allowed to be unfair to some redex of a term when contracting the redex is useless for the normalization of the term. Unlike the strategy of Kennaway, our strategy does not rely on syntactic restrictions that imply confluence. On the contrary, it can easily be applied to any term rewriting system, and we show that the class of term rewriting systems for which our strategy is normalizing properly includes all (almost) orthogonal systems. Our strategy is more versatile;in case of (almost) orthogonal term rewriting systems, it can be used to detect certain cases of non-termination, Our normalization proof is more accessible than Kennaway's. We also show that our sequential strategy sometimes succeeds where the parallel-outermost strategy fails.
Many specification and programming languages have adopted term rewriting and pattern matching as a key feature. However, implementation techniques and observed performance greatly vary across languages and tools. To p...
详细信息
ISBN:
(数字)9783319998404
ISBN:
(纸本)9783319998404;9783319998398
Many specification and programming languages have adopted term rewriting and pattern matching as a key feature. However, implementation techniques and observed performance greatly vary across languages and tools. To provide for an objective comparison, we developed an open, experimental platform based upon the ideas of the three Rewrite Engines Competitions (2006, 2008, and 2010), which we significantly enhanced, extended, and automated. We used this platform to benchmark interpreters and compilers for a number of algebraic, functional, and object-oriented languages, and we report about the results obtained for CafeOBJ, Clean, Haskell, LNT, LOTOS, Maude, mCRL2, OCaml, Opal, Rascal, Scala, SML (MLton and SML-NJ), Stratego/XT, and Tom.
logicprogramming and (Hyper-)Graph Rewriting are two well known fields of Computer Science. In this paper we show how to model logic program computations through algebraic techniques familiar to the graph rewriting c...
详细信息
programminglogicthinking is the most important competence for computer science students. However, programming is one of the difficult subject in computer science program. this paper reports our work about enhancing ...
详细信息
programminglogicthinking is the most important competence for computer science students. However, programming is one of the difficult subject in computer science program. this paper reports our work about enhancing students' programminglogicthinking using Analogy Mapping for basic programming subject. Analogy Mapping is a computer application which converts source code into analogies images. this research used time series evaluation and the result showed that Analogy Mapping can enhance students' programminglogicthinking.
作者：
Higuchi, TAoki, TTohoku Univ
Grad Sch Informat Sci Dept Syst Informat Sci Aoba Ku Sendai Miyagi 9808579 Japan
this paper presents the concept of multiplex computing as a foundation for next-generation integrated systems free from interconnection problems. Computing with multiplexable information carriers makes it possible to ...
详细信息
this paper presents the concept of multiplex computing as a foundation for next-generation integrated systems free from interconnection problems. Computing with multiplexable information carriers makes it possible to achieve highly parallel processing with reduced interconnections. A unified algebraic framework for set-valued logic, in which a collection of information carriers on a single line is treated as a set-valued signal, is proposed for the systematic synthesis of multiplex-computing circuits. Also, possible approaches to implementations are discussed. (C) 1998 Elsevier Science Ltd. All rights reserved.
the proceedings contains 18 papers. Topics discussed include simulation models of short rotation forestry, willow wood properties, production and economy, poplar cultivation, seasonal amount, growth and depth distribu...
详细信息
the proceedings contains 18 papers. Topics discussed include simulation models of short rotation forestry, willow wood properties, production and economy, poplar cultivation, seasonal amount, growth and depth distribution of roots, demographic studies of canopy development, biomass fuel, and coppice culture.
the presented HO-RAP system combines λ-calculus with Horn clause specifications interpreted by rewriting and narrowing techniques. therefore, higher-order programming becomes available for the prototyper together wit...
详细信息
this book constitutes the refereed conference proceedings of the 20thinternational Workshop on Functional and Constraint logicprogramming, WFLP 2011, held in Odense, Denmark, in July 2011 as Part of the 13th Interna...
详细信息
ISBN:
(数字)9783642225314
ISBN:
(纸本)9783642225307
this book constitutes the refereed conference proceedings of the 20thinternational Workshop on Functional and Constraint logicprogramming, WFLP 2011, held in Odense, Denmark, in July 2011 as Part of the 13thinternational Symposium on Principles and Practice of Declarative programming (PPDP 2011), the 22st international Symposium on logic-Based Program Synthesis and Transformation (LOPSTR 2011), and the 4thinternational Workshop on Approaches and Applications of Inductive programming (AAIP 2011).
From the 10 papers submitted, 9 were accepted for presentation the proceeding. the papers cover current research in all areas of functional and logicprogramming as well as the integration of constraint logic and object-oriented programming, and term rewriting.
In this paper we study generic expansions of logics of continuous t-norms with truth-constants, taking advantage of previous results for Lukasiewicz logic and more recent results for Godel and Product logics. Indeed, ...
详细信息
In this paper we study generic expansions of logics of continuous t-norms with truth-constants, taking advantage of previous results for Lukasiewicz logic and more recent results for Godel and Product logics. Indeed, we consider algebraic semantics for expansions of logics of continuous t-norms with a set of truth-constants {(r) over bar vertical bar r is an element of C}, for a suitable countable C subset of [0, 1], and provide a full description of completeness results when (i) the t-norm is a finite ordinal sum of Lukasiewicz, Godel and Product components, (ii) the set of truth-constants covers all the unit interval in the sense that each component of the t-norm contains at least one value of C different from the bounds of the component, and (iii) the truth-constants in Lukasiewicz components behave as rational numbers. (C) 2006 Elsevier B.V. All rights reserved.
暂无评论