Sciweavers

385 search results - page 7 / 77
» Extensionality in the Calculus of Constructions
Sort
View
POPL
2009
ACM
15 years 10 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
POPL
2005
ACM
15 years 10 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic
LICS
2012
IEEE
12 years 12 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
ICFP
2012
ACM
12 years 12 months ago
Propositions as sessions
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...
Philip Wadler
ENTCS
2000
80views more  ENTCS 2000»
14 years 9 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner