2,819 research outputs found
Sequentiality vs. Concurrency in Games and Logic
Connections between the sequentiality/concurrency distinction and the
semantics of proofs are investigated, with particular reference to games and
Linear Logic.Comment: 35 pages, appeared in Mathematical Structures in Computer Scienc
A proof-theoretic analysis of the classical propositional matrix method
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory. © 2012 The Author, 2012. Published by Oxford University Press
Glueability of Resource Proof-Structures: Inverting the Taylor Expansion
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resource proof-structures: its Taylor expansion. We introduce a new criterion characterizing those sets of resource proof-structures that are part of the Taylor expansion of some MELL proof-structure, through a rewriting system acting both on resource and MELL proof-structures
Proactive-reactive, robust scheduling and capacity planning of deconstruction projects under uncertainty
A project planning and decision support model is developed and applied to identify and reduce risk and uncertainty in deconstruction project planning. It allows calculating building inventories based on sensor information and construction standards and it computes robust project plans for different scenarios with multiple modes, constrained renewable resources and locations. A reactive and flexible planning element is proposed in the case of schedule infeasibility during project execution
The Session Abstract Machine (Extended Version)
We build on a fine-grained analysis of session-based interaction as provided
by the linear logic typing disciplines to introduce the SAM, an abstract
machine for mechanically executing session-typed processes. A remarkable
feature of the SAM's design is its ability to naturally segregate and
coordinate sequential with concurrent session behaviours. In particular,
implicitly sequential parts of session programs may be efficiently executed by
deterministic sequential application of SAM transitions, amenable to
compilation, and without concurrent synchronisation mechanisms. We provide an
intuitive discussion of the SAM structure and its underlying design, and state
and prove its correctness for executing programs in a session calculus
corresponding to full classical linear logic CLL. We also discuss extensions
and applications of the SAM to the execution of linear and session-based
programming languages.Comment: Extended Version of ESOP pape
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
Proceedings of the Conference on Hypothetical Reasoning, 23-24 August 2014, Tübingen
Hypothetical reasoning or reasoning under assumptions is a key concept of logic, philosophy of science and mathematics. The Conference on Hypothetical Reasoning focussed on its logical aspects, such as assumption-based calculi and their proof theory,
logical consequence from a proof-theoretic or model-theoretic point of view, logics of conditionals, proof systems, structure of assumption-based proofs, hypotheses in proof-theoretic semantics, notions of implication, substructural logics, hypotheses in categorial logic, logical aspects of scientific explanation, hypothetical reasoning in mathematics and reasoning from definitions and axioms. The conference took place 23–24 August, 2014 in Tübingen at the Department of Philosophy, in conjunction with ESSLLI 2014. The proceedings collect abstracts, slides and papers of the presentations given
Client-Server Sessions in Linear Logic
We introduce coexponentials, a new set of modalities for Classical Linear
Logic. As duals to exponentials, the coexponentials codify a distributed form
of the structural rules of weakening and contraction. This makes them a
suitable logical device for encapsulating the pattern of a server receiving
requests from an arbitrary number of clients on a single channel. Guided by
this intuition we formulate a system of session types based on Classical Linear
Logic with coexponentials, which is suited to modelling client-server
interactions. We also present a session-typed functional programming language
for server-client programming, which we translate to our system of
coexponentials
Rules of Engagement: Architecture Theory and the Social Sciences in Frank Duffy’s 1974 Thesis on Office Planning
This paper addresses the broad shift that took place in architectural theory and education in the 70s, where models of the discipline asserting the autonomy of architecture eclipsed models privileging architecture’s ties to other disciplines, particularly technology and the social sciences. With Frank Duffy's Princeton thesis on open office planning (1974) as a focus, the paper explores the theoretical and institutional contexts of this shift and offers a critical reappraisal in light of contemporary issues facing architecture.architectural theory, office space, planning, architectural education
- …