Sciweavers

551 search results - page 73 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
AOSD
2012
ACM
12 years 6 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau
EACL
2006
ACL Anthology
14 years 7 days ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 11 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
IPM
2007
139views more  IPM 2007»
13 years 10 months ago
"What is a good digital library?" - A quality model for digital libraries
In this article, we elaborate on the meaning of quality in digital libraries (DLs) by proposing a model that is deeply grounded in a formal framework for digital libraries: 5S (St...
Marcos André Gonçalves, Bárba...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 11 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...