Sciweavers

1194 search results - page 166 / 239
» A Calculus for Predicative Programming
Sort
View
ICFP
2000
ACM
15 years 4 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
CSFW
1999
IEEE
15 years 4 months ago
Secure Composition of Insecure Components
Software systems are becoming heterogeneous: instead of a small number of large programs from well-established sources, a user's desktop may now consist of many smaller compo...
Peter Sewell, Jan Vitek
ICFEM
2007
Springer
15 years 3 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
LMO
1996
15 years 1 months ago
Using Metaobjects to Model Concurrent Objects with PICT
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
Markus Lumpe, Jean-Guy Schneider, Oscar Nierstrasz
ENTCS
2002
101views more  ENTCS 2002»
14 years 11 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier