Sciweavers

2529 search results - page 101 / 506
» The Logical Structure of Binding
Sort
View
PPDP
2004
Springer
15 years 3 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
RSCTC
2004
Springer
150views Fuzzy Logic» more  RSCTC 2004»
15 years 3 months ago
Extracting Protein-Protein Interaction Sentences by Applying Rough Set Data Analysis
illion abstracts. Problem. How to find sentences that talk about protein-protein interactions? Example (Non-Interaction Sentence) All our data are consistent with models in which ...
Filip Ginter, Tapio Pahikkala, Sampo Pyysalo, Jorm...
ESOP
2009
Springer
15 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
BIRTHDAY
2008
Springer
14 years 12 months ago
A Category of Explicit Fusions
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...
Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Cia...
VDB
1998
169views Database» more  VDB 1998»
14 years 11 months ago
What You See is What You Store: Database-Driven Interfaces
Any graphical user interface (GUI) requires large amounts of complex metadata for the layout of windows and menus, their style and behavior, their bindings, etc. Designing, debugg...
Jens Thamm, Lutz Michael Wegner