Sciweavers

640 search results - page 91 / 128
» Logical types for untyped languages
Sort
View
TLCA
2009
Springer
14 years 3 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
ICALP
2010
Springer
14 years 1 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
EACL
2009
ACL Anthology
14 years 9 months ago
Evaluating the Inferential Utility of Lexical-Semantic Resources
Lexical-semantic resources are used extensively for applied semantic inference, yet a clear quantitative picture of their current utility and limitations is largely missing. We pr...
Shachar Mirkin, Ido Dagan, Eyal Shnarch
RSEISP
2007
Springer
14 years 3 months ago
Interpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
Yiyu Yao, Bing Zhou, Yaohua Chen
TGC
2007
Springer
14 years 3 months ago
Access Control Based on Code Identity for Open Distributed Systems
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
Andrew Cirillo, James Riely