Sciweavers

3583 search results - page 52 / 717
» A Type System for the Relational Calculus of Object Systems
Sort
View
FOSSACS
2004
Springer
14 years 2 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
LACL
1998
Springer
14 years 1 months ago
Anaphora and Quantification in Categorial Grammar
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Gerhard Jäger
ECAI
2006
Springer
14 years 15 days ago
Formalizing Complex Task Libraries in Golog
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
Alfredo Gabaldon
ESOP
2010
Springer
14 years 6 months ago
Stateful Contracts for Affine Types
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and performance benefits, but difficulty arises in intera...
Jesse A. Tov, Riccardo Pucella
ESOP
1999
Springer
14 years 1 months ago
Types and Subtypes for Client-Server Interactions
We define an extension of the π-calculus with a static type system which supports high-level specifications of extended patterns of communication, such as client-server protocol...
Simon J. Gay, Malcolm Hole