eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
0
0
10.4230/OASIcs.WPTE.2015
article
OASIcs, Volume 46, WPTE'15, Complete Volume
Chiba, Yuki
Escobar, Santiago
Nishida, Naoki
Sabel, David
Schmidt-Schauß, Manfred
OASIcs, Volume 46, WPTE'15, Complete Volume
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015/OASIcs.WPTE.2015.pdf
Conference proceedings, Concurrent Programming, Formal Definitions and Theory, Specifying and Verifying and Reasoning about Programs, Semantics of Programming Languages, Mathematical Logic, Grammars and Other Rewriting Systems, Deduction and Theorem Proving
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
i
xvi
10.4230/OASIcs.WPTE.2015.i
article
Frontmatter, Table of Contents, Preface, Workshop Organization
Chiba, Yuki
Escobar, Santiago
Nishida, Naoki
Sabel, David
Schmidt-Schauß, Manfred
Frontmatter, Table of Contents, Preface, Workshop Organization
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.i/OASIcs.WPTE.2015.i.pdf
Frontmatter
Table of Contents
Preface
Workshop Organization
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
1
1
10.4230/OASIcs.WPTE.2015.1
article
Mechanizing Meta-Theory in Beluga (Invited Talk)
Pientka, Brigitte
Mechanizing formal systems, given via axioms and inference rules, together with proofs about them plays an important role in establishing trust in formal developments. In this talk, I will survey the proof environment Beluga. To specify formal systems and represent derivations within them, Beluga provides a sophisticated infrastructure based on the logical framework LF; in particular, its infrastructure not only supports modelling binders via binders in LF, but extends and generalizes LF with first-class contexts to abstract over a set of assumptions, contextual objects to model derivations that depend on assumptions, and first-class simultaneous substitutions to relate contexts. These extensions allow us to directly support key and common concepts that frequently arise when describing formal systems and derivations within them.
To reason about formal systems, Beluga provides a dependently typed functional language for implementing inductive proofs about derivations as recursive functions on contextual objects following the Curry-Howard isomorphism. Recently, the Beluga system has also been extended with a totality checker which guarantees that recursive programs are well-founded and correspond to inductive proofs and an interactive program development environment to support incremental proof / program construction. Taken together these extensions enable direct and compact mechanizations. To demonstrate Beluga's strength, we develop a weak normalization proof using logical relations. The Beluga system together with examples is available from http://complogic.cs.mcgill.ca/beluga.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.1/OASIcs.WPTE.2015.1.pdf
Type systems
Dependent Types
Logical Frameworks
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
3
17
10.4230/OASIcs.WPTE.2015.3
article
Head reduction and normalization in a call-by-value lambda-calculus
Guerrieri, Giulio
Recently, a standardization theorem has been proven for a variant of Plotkin's call-by-value lambda-calculus extended by means of two commutation rules (sigma-reductions): this result was based on a partitioning between head and internal reductions. We study the head normalization for this call-by-value calculus with sigma-reductions and we relate it to the weak evaluation of original Plotkin's call-by-value lambda-calculus. We give also a (non-deterministic) normalization strategy for the call-by-value lambda-calculus with sigma-reductions.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.3/OASIcs.WPTE.2015.3.pdf
sequentialization
lambda-calculus
sigma-reduction
call-by-value
head reduction
internal reduction
(strong) normalization
evaluation
confluence
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
19
29
10.4230/OASIcs.WPTE.2015.19
article
Towards Modelling Actor-Based Concurrency in Term Rewriting
Palacios, Adrián
Vidal, Germán
In this work, we introduce a scheme for modelling actor systems within sequential term rewriting. In our proposal, a TRS consists of the union of three components: the functional part (which is specific of a system), a set of rules for reducing concurrent actions, and a set of rules for defining a particular scheduling policy. A key ingredient of our approach is that concurrent systems are modelled by terms in which concurrent actions can never occur inside user-defined function calls. This assumption greatly simplifies the definition of the semantics for concurrent actions, since no term traversal will be needed. We prove that these systems are well defined in the sense that concurrent actions can always be reduced.
Our approach can be used as a basis for modelling actor-based concurrent programs, which can then be analyzed using existing techniques for term rewrite systems.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.19/OASIcs.WPTE.2015.19.pdf
concurrency
actor model
rewriting
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
31
46
10.4230/OASIcs.WPTE.2015.31
article
Observing Success in the Pi-Calculus
Sabel, David
Schmidt-Schauß, Manfred
A contextual semantics - defined in terms of successful termination and may- and should-convergence - is analyzed in the synchronous pi-calculus with replication and a constant Stop to denote success.
The contextual ordering is analyzed, some nontrivial process equivalences are proved, and proof tools for showing contextual equivalences are provided. Among them are a context lemma and new notions of sound applicative similarities for may- and should-convergence. A further result is that contextual equivalence in the pi-calculus with Stop conservatively extends barbed testing equivalence in the (Stop-free) pi-calculus and thus results on contextual equivalence can be transferred to the (Stop-free) pi-calculus with barbed testing equivalence.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.31/OASIcs.WPTE.2015.31.pdf
Concurrency
Process calculi
Pi-calculus
Rewriting
Semantics
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2015-06-17
46
47
61
10.4230/OASIcs.WPTE.2015.47
article
Formalizing Bialgebraic Semantics in PVS 6.0
Smetsers, Sjaak
Madlener, Ken
van Eekelen, Marko
Both operational and denotational semantics are prominent approaches for reasoning about properties of programs and programming languages. In the categorical framework developed by Turi and Plotkin both styles of semantics are unified using a single, syntax independent format, known as GSOS, in which the operational rules of a language are specified. From this format, the operational and denotational semantics are derived. The approach of Turi and Plotkin is based on the categorical notion of bialgebras. In this paper we specify this work in the theorem prover PVS, and prove the adequacy theorem of this formalization. One of our goals is to investigate whether PVS is adequately suited for formalizing metatheory. Indeed, our experiments show that the original categorical framework can be formalized conveniently. Additionally, we present a GSOS specification for the simple imperative programming language While, and execute the derived semantics for a small example program.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol046_wpte2015/OASIcs.WPTE.2015.47/OASIcs.WPTE.2015.47.pdf
operational semantics
denotational semantics
bialgebras
distributive laws
adequacy
theorem proving
PVS
WHILE