Sciweavers

4854 search results - page 236 / 971
» It's the Programming, Stupid
Sort
View
ESOP
2012
Springer
14 years 2 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
POPL
2012
ACM
14 years 2 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
PLDI
2012
ACM
13 years 9 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
SIGCSE
1990
ACM
126views Education» more  SIGCSE 1990»
15 years 11 months ago
A philosophy and example of CS-1 programming projects
This paper presents a philosophy underlying CS-1 programming projects, and illustrates this philosophy with a concrete example. Integral to the philosophy is the use of Ada packag...
Richard E. Pattis
USS
2008
15 years 9 months ago
Verifying Compliance of Trusted Programs
In this paper, we present an approach for verifying that trusted programs correctly enforce system security goals when deployed. A trusted program is trusted to only perform safe ...
Sandra Rueda, Dave King 0002, Trent Jaeger