the proceedings contain 11 papers. the topics discussed include: programming with multiple paradigms in Lua;constraint based strategies;termination of context-sensitive rewriting with built-in numbers and collection d...
ISBN:
(纸本)3642119980
the proceedings contain 11 papers. the topics discussed include: programming with multiple paradigms in Lua;constraint based strategies;termination of context-sensitive rewriting with built-in numbers and collection data structures;semantic labeling for proving termination of combinatory reduction systems;a taxonomy of some right-to-left string-matching algorithms;type checking and inference are equivalent in lambda calculi with existential types;fast and accurate strong termination analysis with an application to partial evaluation;new results on type systems for functionallogicprogramming;a simple region inference algorithm for a first-order functional language;and theoretical framework for the declarative debugging of functionallogic programs with lambda abstractions.
constraint satisfaction modeling is both an efficient, and an elegant approach to model and solve many real world problems. In this paper, we present a constraint solver targeting module placement in static and partia...
详细信息
constraint satisfaction modeling is both an efficient, and an elegant approach to model and solve many real world problems. In this paper, we present a constraint solver targeting module placement in static and partial run-time reconfigurable systems. We use the constraint solver to compute feasible placement positions. Our placement model incorporates communication, implementation variants and device configuration granularity. In addition, we model heterogeneous resources such as embedded memory, multipliers and logic. Furthermore, we take into account that logic resources consist of different types including logic only LUTs, arithmetic LUTs with carry chains, and LUTs with distributed memory. Our work targets state of the art field-programmable gate arrays (FPGAs) in both design-time and run-time applications. In order to evaluate our placement model and module placer implementation, we have implemented a repository containing 200 fully functional, placed and routed relocatable modules. the modules are used to implement complete systems. this validates the feasibility of boththe model and the module placer. Furthermore, we present simulated results for run-time applications, and compare this to other state of the art research. In run-time applications, the results point to improved resource utilization. this is a result of using a finer tile grid and complex module shapes.
the proceedings contain 9 papers. the special focus in this conference is on functional and (constraint) logicprogramming. the topics include: A new compiler from curry to Haskell;new functionallogic design patterns...
ISBN:
(纸本)9783642225307
the proceedings contain 9 papers. the special focus in this conference is on functional and (constraint) logicprogramming. the topics include: A new compiler from curry to Haskell;new functionallogic design patterns;xquery in the functional-logic language toy;size invariant and ranking function synthesis in a functional language;memoizing a monadic mixin DSL;a functional approach to worst-case execution time analysis;building a faceted browser in couchdb using views on views and erlang metaprogramming;combining object-oriented and logicprogramming;on proving termination of constrained term rewrite systems by eliminating edges from dependency graphs.
the proceedings contain 9 papers. the topics discussed include: transforming functionallogic programs into monadic functional programs;mixed-level embedding and JIT compilation for an iteratively staged DSL;an access...
ISBN:
(纸本)9783642207747
the proceedings contain 9 papers. the topics discussed include: transforming functionallogic programs into monadic functional programs;mixed-level embedding and JIT compilation for an iteratively staged DSL;an access control language based on term rewriting and description logic;lazy and enforceable assertions for functionallogic programs;parameterized models for on-line and off-line use;efficient and compositional higher-order streams;an adequate, denotational, functional-style semantics for typed FlatCurry;bridging the gap between two concurrent constraint languages;and types for role-based access control of dynamic web data.
In this paper, we are interested in resource allocation for energy constrained and security-critical embedded systems. Tasks in such systems need to be successfully executed under certain energy budget and be robust a...
详细信息
Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is global...
详细信息
ISBN:
(纸本)9783642335570
Establishing local consistency is one of the most frequently used algorithmic techniques in constraint satisfaction in general and in spatial and temporal reasoning in particular. A collection of constraints is globally consistent if it is completely explicit, that is, every partial solution may be extended to a full solution by greedily assigning values to variables one at a time. We will say that a structure B has local-to-global consistency if establishing local-consistency yields a globally consistent instance of . this paper studies local-to-global consistency for ORD-Horn languages, that is, structures definable over the ordered rationals (
We present the integration of the Kodkod high-level interface to SAT-solvers into the kernel of ProB. As such, predicates from B, Event-B, Z and TLA+ can be solved using a mixture of SAT-solving and ProB's own con...
详细信息
the constraint satisfaction problem (CSP) and its quantified extensions, whether without (QCSP) or with disjunction (QCSP ), correspond naturally to the model checking problem for three increasingly stronger fragments...
详细信息
In this paper we present our first steps towards a new system to compile functionallogic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to repre...
详细信息
ISBN:
(纸本)9783642225307;9783642225314
In this paper we present our first steps towards a new system to compile functionallogic programs of the source language Curry into purely functional Haskell programs. Our implementation is based on the idea to represent non-deterministic results as values of the data types corresponding to the results. this enables the application of various search strategies to extract values from the search space. We show by several benchmarks that our implementation can compete with or outperform other existing implementations of Curry.
暂无评论