Sciweavers

460 search results - page 71 / 92
» Operational Semantics of Constraint Logic Programs with Coro...
Sort
View
POPL
1998
ACM
14 years 26 days ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
14 years 26 days ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
ECAI
2000
Springer
14 years 29 days ago
An Embedding of ConGolog in 3APL
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...
Koen V. Hindriks, Yves Lespérance, Hector J...
VL
2002
IEEE
105views Visual Languages» more  VL 2002»
14 years 1 months ago
A Visual Framework for Modelling with Heterogeneous Notations
There is a range of modelling notations, both textual and diagrammatic, whose semantics are based on first-order predicate logic. This paper presents a visual framework for organ...
Jean Flower, John Howse, John Taylor, Stuart Kent
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 9 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia