Sciweavers

5096 search results - page 73 / 1020
» Associations as a Language Construct
Sort
View
OOPSLA
2005
Springer
15 years 5 months ago
Adding trace matching with free variables to AspectJ
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...
Chris Allan, Pavel Avgustinov, Aske Simon Christen...
POPL
2011
ACM
14 years 2 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
SAC
2005
ACM
15 years 5 months ago
A two-dimensional separation of concerns for compiler construction
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...
Xiaoqing Wu, Suman Roychoudhury, Barrett R. Bryant...
TYPES
2000
Springer
15 years 3 months ago
Formalizing the Halting Problem in a Constructive Type Theory
We present a formalization of the halting problem in Agda, a language based on Martin-L
Kristofer Johannisson