20 search results - page 3 / 4 » Continuous semantics for strong normalisation |
ENTCS
2008
14 years 9 months ago
2008
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
ENTCS
2002
14 years 9 months ago
2002
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
83
Voted
CLA
2007
14 years 11 months ago
2007
Abstract. This paper presents a mathematization of the philosophical doctrine of judgments as an extension of the mathematization of the philosophical doctrine of concepts develope...
86
Voted
ESOP
2010
Springer
15 years 23 days ago
2010
Springer
Language-based information flow methods offer a principled way to enforce strong security properties, but enforcing noninterference is too inflexible for realistic applications. Se...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...