Sciweavers

6054 search results - page 780 / 1211
» Implementation of Andorra-based Languages
Sort
View
CIDR
2009
126views Algorithms» more  CIDR 2009»
15 years 8 months ago
Declarative Reconfigurable Trust Management
In recent years, there has been a proliferation of declarative logic-based trust management languages and systems proposed to ease the description, configuration, and enforcement ...
William R. Marczak, David Zook, Wenchao Zhou, Molh...
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 7 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
CONCURRENCY
2008
83views more  CONCURRENCY 2008»
15 years 7 months ago
A definition of and linguistic support for partial quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 7 months ago
Sawja: Static Analysis Workshop for Java
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
Laurent Hubert, Nicolas Barré, Fréd&...
ENTCS
2008
92views more  ENTCS 2008»
15 years 7 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed