Sciweavers

60 search results - page 12 / 12
» Recursive Definitions of Monadic Functions
Sort
View
PODS
1994
ACM
91views Database» more  PODS 1994»
13 years 9 months ago
A Polymorphic Calculus for Views and Object Sharing
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Atsushi Ohori, Keishi Tajima
ICFP
2008
ACM
14 years 5 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...
NOMS
1998
IEEE
160views Communications» more  NOMS 1998»
13 years 9 months ago
SP-to-SP service ordering specification and its implementation
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
Graham Chen, Qinzheng Kong, Pierre-Yves Benain
ICFP
2005
ACM
14 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
POPL
2010
ACM
14 years 2 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...