5,658 research outputs found
A Rational Deconstruction of Landin's SECD Machine with the J Operator
Landin's SECD machine was the first abstract machine for applicative
expressions, i.e., functional programs. Landin's J operator was the first
control operator for functional languages, and was specified by an extension of
the SECD machine. We present a family of evaluation functions corresponding to
this extension of the SECD machine, using a series of elementary
transformations (transformation into continu-ation-passing style (CPS) and
defunctionalization, chiefly) and their left inverses (transformation into
direct style and refunctionalization). To this end, we modernize the SECD
machine into a bisimilar one that operates in lockstep with the original one
but that (1) does not use a data stack and (2) uses the caller-save rather than
the callee-save convention for environments. We also identify that the dump
component of the SECD machine is managed in a callee-save way. The caller-save
counterpart of the modernized SECD machine precisely corresponds to Thielecke's
double-barrelled continuations and to Felleisen's encoding of J in terms of
call/cc. We then variously characterize the J operator in terms of CPS and in
terms of delimited-control operators in the CPS hierarchy. As a byproduct, we
also present several reduction semantics for applicative expressions with the J
operator, based on Curien's original calculus of explicit substitutions. These
reduction semantics mechanically correspond to the modernized versions of the
SECD machine and to the best of our knowledge, they provide the first syntactic
theories of applicative expressions with the J operator
New results on pushdown module checking with imperfect information
Model checking of open pushdown systems (OPD) w.r.t. standard branching
temporal logics (pushdown module checking or PMC) has been recently
investigated in the literature, both in the context of environments with
perfect and imperfect information about the system (in the last case, the
environment has only a partial view of the system's control states and stack
content). For standard CTL, PMC with imperfect information is known to be
undecidable. If the stack content is assumed to be visible, then the problem is
decidable and 2EXPTIME-complete (matching the complexity of PMC with perfect
information against CTL). The decidability status of PMC with imperfect
information against CTL restricted to the case where the depth of the stack
content is visible is open. In this paper, we show that with this restriction,
PMC with imperfect information against CTL remains undecidable. On the other
hand, we individuate an interesting subclass of OPDS with visible stack content
depth such that PMC with imperfect information against the existential fragment
of CTL is decidable and in 2EXPTIME. Moreover, we show that the program
complexity of PMC with imperfect information and visible stack content against
CTL is 2EXPTIME-complete (hence, exponentially harder than the program
complexity of PMC with perfect information, which is known to be
EXPTIME-complete).Comment: In Proceedings GandALF 2011, arXiv:1106.081
Skeleton-aided Articulated Motion Generation
This work make the first attempt to generate articulated human motion
sequence from a single image. On the one hand, we utilize paired inputs
including human skeleton information as motion embedding and a single human
image as appearance reference, to generate novel motion frames, based on the
conditional GAN infrastructure. On the other hand, a triplet loss is employed
to pursue appearance-smoothness between consecutive frames. As the proposed
framework is capable of jointly exploiting the image appearance space and
articulated/kinematic motion space, it generates realistic articulated motion
sequence, in contrast to most previous video generation methods which yield
blurred motion effects. We test our model on two human action datasets
including KTH and Human3.6M, and the proposed framework generates very
promising results on both datasets.Comment: ACM MM 201
Enriched MU-Calculi Module Checking
The model checking problem for open systems has been intensively studied in
the literature, for both finite-state (module checking) and infinite-state
(pushdown module checking) systems, with respect to Ctl and Ctl*. In this
paper, we further investigate this problem with respect to the \mu-calculus
enriched with nominals and graded modalities (hybrid graded Mu-calculus), in
both the finite-state and infinite-state settings. Using an automata-theoretic
approach, we show that hybrid graded \mu-calculus module checking is solvable
in exponential time, while hybrid graded \mu-calculus pushdown module checking
is solvable in double-exponential time. These results are also tight since they
match the known lower bounds for Ctl. We also investigate the module checking
problem with respect to the hybrid graded \mu-calculus enriched with inverse
programs (Fully enriched \mu-calculus): by showing a reduction from the domino
problem, we show its undecidability. We conclude with a short overview of the
model checking problem for the Fully enriched Mu-calculus and the fragments
obtained by dropping at least one of the additional constructs
A novel physiological role for ARF1 in the formation of bidirectional tubules from the Golgi.
Capitalizing on CRISPR/Cas9 gene-editing techniques and super-resolution nanoscopy, we explore the role of the small GTPase ARF1 in mediating transport steps at the Golgi. Besides its well-established role in generating COPI vesicles, we find that ARF1 is also involved in the formation of long (∼3 µm), thin (∼110 nm diameter) tubular carriers. The anterograde and retrograde tubular carriers are both largely free of the classical Golgi coat proteins coatomer (COPI) and clathrin. Instead, they contain ARF1 along their entire length at a density estimated to be in the range of close packing. Experiments using a mutant form of ARF1 affecting GTP hydrolysis suggest that ARF1[GTP] is functionally required for the tubules to form. Dynamic confocal and stimulated emission depletion imaging shows that ARF1-rich tubular compartments fall into two distinct classes containing 1) anterograde cargoes and clathrin clusters or 2) retrograde cargoes and coatomer clusters
- …