Sciweavers

39 search results - page 3 / 8
» A Calculus for Type Predicates and Type Coercion
Sort
View
PPDP
2001
Springer
13 years 9 months ago
Trust in the Pi-Calculus
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
Mark Hepburn, David Wright
CORR
2010
Springer
84views Education» more  CORR 2010»
13 years 3 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
ADC
2008
Springer
146views Database» more  ADC 2008»
13 years 11 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
CONCUR
2008
Springer
13 years 7 months ago
Spatial and Behavioral Types in the Pi-Calculus
We present a framework that combines ideas from spatial logics and Igarashi and Kobayashi's behavioural type systems, drawing benefits from both. In our approach, type systems...
Lucia Acciai, Michele Boreale
ENTCS
2007
113views more  ENTCS 2007»
13 years 5 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi