680 search results - page 63 / 136 » Types for the Ambient Calculus |
HASKELL
2009
ACM
14 years 3 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with...
VMCAI
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
ASIAN
2006
Springer
14 years 23 days ago
2006
Springer
Abstract. We aim to provide information hiding support in concurrent object-oriented programming languages. We study the issue both at the object level and class level, in the cont...
ICFP
2012
ACM
11 years 11 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...