Sciweavers

776 search results - page 75 / 156
» Language Constructs for Structured Parallel Programming
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
ICFP
2007
ACM
14 years 9 months ago
Functional pearl: the great escape or, how to jump the border without getting caught
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts p...
David Herman
ICFP
2002
ACM
14 years 9 months ago
Final shift for call/cc: : direct implementation of shift and reset
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating s...
Martin Gasbichler, Michael Sperber
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 4 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
ENTCS
2006
109views more  ENTCS 2006»
13 years 9 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone