Sciweavers

228 search results - page 15 / 46
» Two Normal Forms for Rewriting P Systems
Sort
View
LFP
1990
171views more  LFP 1990»
13 years 8 months ago
Operational and Axiomatic Semantics of PCF
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
Brian T. Howard, John C. Mitchell
KBSE
1997
IEEE
13 years 11 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
LCPC
1995
Springer
13 years 11 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...
AMAST
2008
Springer
13 years 9 months ago
System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries
We demonstrate Spiral, a domain-specific library generation system. Spiral generates high performance source code for linear transforms (such as the discrete Fourier transform and ...
Yevgen Voronenko, Franz Franchetti, Fréd&ea...
DOLAP
2004
ACM
14 years 25 days ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman