Results 311 to 320 of about 9,061,188 (344)

Domain decomposition and skeleton programming with OCamlP3l

Parallel Computing, 2006
Domain decomposition methods are numerically efficient for the simulation of large scale phenomena; in addition, these algorithms are naturally parallel and feature a good localization of data. Skeleton programming is a high level method for specifying the parallel structure of a program.
Clément, François, Martin, Vincent, Vodicka, Arnaud, Di Cosmo, Roberto, Weis, Pierre   +4 more
openaire   +3 more sources

Combinations of abstract domains for logic programming

Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94, 1994
Abstract interpretation [7] is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community, because of the potential for optimizations in logic programming compilers and the sophistication of the analyses which require conceptual support.
CORTESI, Agostino, BAUDOUIN LE CHARLIER, PASCAL VAN HENTENRYCK   +2 more
openaire   +3 more sources

A point-in-domain identification program

Advances in Engineering Software (1978), 1989
Abstract The present work describes a method for the determination of the position of a point with respect to a simple-connected domain. It is intended for application in the finite element mesh generation. The proposed method for identification of a point with respect to a domain appears as an extension of Sloan's method, which is an improved ...
Emil Manoach, T. A. Angelov
openaire   +2 more sources

Logic programming with recurrence domains [PDF]

, 1991
In this paper we present a formalism for finitely representing infinite sets of terms. This formalism, called ω-terms, enables us to reason finitely about certain recursive types. We present an extension of Horn logic programs, called ω-Prolog, which allows a finite schematization of infinitely many clauses via predicates with ω-terms as arguments.
Hong Chen, Jieh Hsiang
openaire   +1 more source

Global domain views for expressive and cross-domain constraint programming

Constraints, 2022
The concept of domain views is a powerful abstraction in constraint programming. It permits to define variables that do not declare any domain but instead rely on a variable x and a function f, such that y=f(x) where y is the view. In addition to making modelling easier by providing an expressive layer of abstraction, views provide an alternative to ...
Justeau-Allaire, Dimitri, Prud'Homme, Charles   +1 more
openaire   +4 more sources

Programming with VDM domains

1990
A system is presented which supports the programming with VDM domains in ordinary programming languages. The domain constructors of the formal software development method VDM can be seen as generic abstract data types. For these ADTs different implementations are collected in a database.
Uwe Schmidt, Hans-Martin Hörcher
openaire   +2 more sources

A Domain Strategy for Computer Program Testing

IEEE Transactions on Software Engineering, 1980
This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions under which this strategy is reliable are given and characterized. The control flow statements in a computer progam partition the input space into a set of mutually exclusive domains, each of which corresponds to a particular ...
E.I. Cohen, L.J. White
openaire   +2 more sources

Rational domain swaps decipher programming in fungal highly reducing polyketide synthases and resurrect an extinct metabolite.

Journal of the American Chemical Society, 2011
The mechanism of programming of iterative highly reducing polyketide synthases remains one of the key unsolved problems of secondary metabolism. We conducted rational domain swaps between the polyketide synthases encoding the biosynthesis of the closely ...
K. Fisch, Walid Bakeer, A. A. Yakasai, Zhongshu Song, Jennifer Pedrick, Zahida Wasil, A. Bailey, C. Lazarus, T. J. Simpson, Russell John Cox   +9 more
semanticscholar   +1 more source

Logic Programming in Knowledge Domains

2006
We propose an approach to combining logic programming and knowledge representation paradigms. This approach is based on the conception of description terms. LP and KR are integrated in such a way that their underlying logics are carefully separated. A core idea here is to push the KR techniques on the functional level.
Vladimir Lipovchenko, Andrei Mantsivoda, Anton Malykh   +2 more
openaire   +2 more sources

Biocatalytic Feedback-Driven Temporal Programming of Self-Regulating Peptide Hydrogels.

Angewandte Chemie, 2015
Switchable self-assemblies respond to external stimuli with a transition between near-equilibrium states. Although being a key to present-day advanced materials, these systems respond rather passively, and do not display autonomous dynamics.
T. Heuser, E. Weyandt, A. Walther
semanticscholar   +1 more source