Sciweavers

2542 search results - page 1 / 509
» An Operational Definition of Context
Sort
View
CONTEXT
2007
Springer
13 years 10 months ago
An Operational Definition of Context
The definition of context experienced an evolution in the research area of context-aware computing, but still suffers from either generality or incompleteness. Furthermore, many de...
Andreas Zimmermann, Andreas Lorenz, Reinhard Opper...
CL
2000
Springer
13 years 4 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
ESOP
2009
Springer
13 years 8 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
ECCC
2006
88views more  ECCC 2006»
13 years 4 months ago
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
Mihir Bellare, Oded Goldreich
SYNASC
2006
IEEE
86views Algorithms» more  SYNASC 2006»
13 years 10 months ago
Implementing Parameterized Type Algorithm Definitions in Mathematica
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
Alina Andreica