Sciweavers

1171 search results - page 68 / 235
» A Logical Language for Expressing Authorizations
Sort
View
TCS
2011
15 years 1 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
AMAST
2000
Springer
15 years 10 months ago
Meta Languages in Algebraic Compilers
Abstract. Algebraic compilers provide a powerful and convenient mechanism for specifying language translators. With each source language operation one associates a computation for ...
Eric Van Wyk
PLPV
2012
ACM
14 years 1 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
OWLED
2007
15 years 7 months ago
An Examination of OWL and the Requirements of a Large Health Care Terminology
This paper presents a brief initial look at some of the possible benefits and barriers to using OWL as the language for the development, dissemination and implementation of termin...
Kent A. Spackman
IUI
2009
ACM
16 years 26 days ago
A scientific workflow construction command line
Workflows have emerged as a common tool for scientists to express their computational analyses. While there are a multitude of visual data flow editors for workflow construction, ...
Paul T. Groth, Yolanda Gil