Sciweavers

686 search results - page 36 / 138
» Foundations for Bidirectional Programming
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
14 years 9 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
BIRTHDAY
2010
Springer
14 years 10 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz
DCC
2011
IEEE
14 years 4 months ago
Computing bilinear pairings on elliptic curves with automorphisms
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
Changan Zhao, Dongqing Xie, Fangguo Zhang, Jingwei...
FLOPS
2010
Springer
15 years 4 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
75
Voted
ASWEC
2004
IEEE
15 years 1 months ago
Obstacles to a Totally Functional Programming Style
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...
Paul A. Bailes, Colin J. M. Kemp