385 search results - page 61 / 77 » Extensionality in the Calculus of Constructions |
TCS
2010
14 years 8 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
193
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
80
Voted
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
FMCO
2003
Springer
15 years 2 months ago
2003
Springer
Web services security specifications are typically expressed as a mixture of XML schemas, example messages, and narrative explanations. We propose a new specification language fo...
POPL
2000
ACM
15 years 2 months ago
2000
ACM
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...