Sciweavers

49 search results - page 5 / 10
» Variables as Resource for Shared-Memory Programs: Semantics ...
Sort
View
ICFP
2003
ACM
14 years 7 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
FLOPS
2004
Springer
14 years 1 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
Masahito Hasegawa
PPDP
2010
Springer
13 years 6 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
BIRTHDAY
2005
Springer
14 years 1 months ago
a-logic
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Murdoch Gabbay, Michael Gabbay