Sciweavers

2477 search results - page 250 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
LISP
2006
91views more  LISP 2006»
15 years 6 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
PUC
2006
93views more  PUC 2006»
15 years 6 months ago
Comparing end-user and intelligent remote control interface generation
Traditional remote controls typically allow users to activate functionality of a single device. Given that users activate a subset of functionality across devices to accomplish a p...
Olufisayo Omojokun, Jeffrey S. Pierce, Charles Lee...
CCS
2004
ACM
15 years 12 months ago
Formally verifying information flow type systems for concurrent and thread systems
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
Gilles Barthe, Leonor Prensa Nieto
PLPV
2011
ACM
14 years 9 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
DRM
2007
Springer
16 years 23 days ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...