Sciweavers

200 search results - page 25 / 40
» Algebraic Operational Semantics and Occam
Sort
View
AGP
1993
IEEE
15 years 2 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
LISP
2006
105views more  LISP 2006»
14 years 10 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Complexity Analysis of H.264 Decoder for FPGA Design
— A major challenge in the design of any real time system is the proper selection of implementation and platform alternatives. In this paper, a suitable FPGA-based design of the ...
Tuomas Lindroth, Nastooh Avessta, Jukka Teuhola, T...
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 2 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
SIGMOD
2005
ACM
93views Database» more  SIGMOD 2005»
15 years 10 months ago
Supporting Executable Mappings in Model Management
Model management is an approach to simplify the programming of metadata-intensive applications. It offers developers powerful operators, such as Compose, Diff, and Merge, that are...
Sergey Melnik, Philip A. Bernstein, Alon Y. Halevy...