Sciweavers

632 search results - page 29 / 127
» Explicit Substitutions and Programming Languages
Sort
View
DOOD
1997
Springer
134views Database» more  DOOD 1997»
14 years 26 days ago
Well-Founded Semantics for Deductive Object-Oriented Database Languages
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...
Wolfgang May, Bertram Ludäscher, Georg Lausen
AOSD
2009
ACM
14 years 3 months ago
The art of the meta-aspect protocol
ive semantics for aspect-oriented abstractions can be defined by language designers using extensible aspect compiler frameworks. However, application developers are prevented fro...
Tom Dinkelaker, Mira Mezini, Christoph Bockisch
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 1 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
POPL
2010
ACM
13 years 11 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
ACL
2012
11 years 11 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires ...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku