2272 search results - page 298 / 455 » A Calculus for |
135
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
123
Voted
JUCS
2010
14 years 11 months ago
2010
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
161
Voted
ENTCS
2011
14 years 10 months ago
2011
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode a...
155
Voted
CMSB
2011
Springer
14 years 4 months ago
2011
Springer
Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be comp...
241
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...