18 search results - page 1 / 4 » Focalisation and Classical Realisability |
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
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...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
We show how to extract classical programs expressed in Krivine λc-calculus from proof-terms built in a proof-irrelevant and classical version of the calculus of constructions with...
BNCOD
2009
13 years 5 months ago
2009
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration, but with reduced upfront costs, combined with opportunities for in...
ENTCS
2006
13 years 4 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...