Sciweavers

105 search results - page 9 / 21
» Proving optimizations correct using parameterized program eq...
Sort
View
POPL
2007
ACM
15 years 12 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
100
Voted
AGP
1997
IEEE
15 years 3 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
TOPLAS
2008
79views more  TOPLAS 2008»
14 years 10 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken
ECOOP
2009
Springer
16 years 7 days ago
Fine-Grained Access Control with Object-Sensitive Roles
Role-based access control (RBAC) is a common paradigm to ensure that users have sufficient rights to perform various system operations. In many cases though, traditional RBAC does ...
Jeffrey Fischer, Daniel Marino, Rupak Majumdar, To...
JFP
2000
163views more  JFP 2000»
14 years 11 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini