VSL 2014: VIENNA SUMMER OF LOGIC 2014

A
Abel, Andreas	Unnesting of Copatterns
Aoto, Takahito	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
Aubert, Clément	Unification and Logarithmic Space
B
Bae, Kyungmin	Predicate Abstraction of Rewrite Theories
Bagnol, Marc	Unification and Logarithmic Space
Berardi, Stefano	Ramsey Theorem as an intuitionistic property of well founded relations
Birkedal, Lars	A Model of Countable Nondeterminism in Guarded Type Theory
Bizjak, Aleš	A Model of Countable Nondeterminism in Guarded Type Theory
Bruggink, Sander	Termination of Cycle Rewriting
Burel, Guillaume	Cut Admissibility by Saturation
C
Ciobaca, Stefan	All-Path Reachability Logic
Creus, Carles	Tree Automata with Height Constraints between Brothers Automatic Evaluation of Context-Free Grammars (System Description)
Czajka, Łukasz	A Coinductive Confluence Proof for Infinitary Lambda-Calculus.
D
de Carvalho, Daniel	An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
de Vrijer, Roel	Proof terms for infinitary rewriting
Dershowitz, Nachum	Confluence by Critical Pair Analysis
Dezani-Ciancaglini, Mariangiola	Preciseness of subtyping on intersection and union types
E
Escardo, Martin	Abstract datatypes for real numbers in type theory
F
Fu, Peng	Self Types for Dependently Typed Lambda Encodings
Fuhs, Carsten	First-Order Formative Rules
G
Gambino, Nicola	A unified approach to Univalent Foundations and Homotopical Algebra
Ghilezan, Silvia	Preciseness of subtyping on intersection and union types
Godoy, Guillem	Tree Automata with Height Constraints between Brothers Automatic Evaluation of Context-Free Grammars (System Description)
H
Hirokawa, Nao	Automated Complexity Analysis Based on Context-Sensitive Rewriting
Hofmann, Martin	Amortised Resource Analysis and Typed Polynomial Interpretations
J
Jouannaud, Jean-Pierre	Confluence by Critical Pair Analysis
K
Koenig, Barbara	Termination of Cycle Rewriting
Kop, Cynthia	First-Order Formative Rules
Kusakari, Keiichirou	Nagoya Termination Tool (System Description)
L
Liu, Jiaxiang	Confluence by Critical Pair Analysis
Lombardi, Carlos	Proof terms for infinitary rewriting
M
Maieli, Roberto	Construction of retractile proof structures
Melliès, Paul-André	Local stores in string diagrams
Mereuta, Radu	All-Path Reachability Logic
Meseguer, Jose	Predicate Abstraction of Rewrite Theories
Miculan, Marino	A Model of Countable Nondeterminism in Guarded Type Theory
Middeldorp, Aart	Conditional Confluence (System Description)
Moore, Brandon	All-Path Reachability Logic
Moser, Georg	Automated Complexity Analysis Based on Context-Sensitive Rewriting Amortised Resource Analysis and Typed Polynomial Interpretations
N
Nagai, Tomoharu	Reduction System for Extensional Lambda-mu Calculus
Nakazawa, Koji	Reduction System for Extensional Lambda-mu Calculus
P
Pientka, Brigitte	Unnesting of Copatterns
R
Rios, Alejandro	Proof terms for infinitary rewriting
Rosu, Grigore	All-Path Reachability Logic
Roux, Cody	The Structural Theory of Pure Type Systems
S
Sabel, David	Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
Sakabe, Toshiki	Nagoya Termination Tool (System Description)
Schmidt-Schauß, Manfred	Concurrent Programming Languages and Methods for Semantic Analyses Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
Schmitz, Sylvain	Implicational Relevance Logic is 2-ExpTime-Complete
Serbanuta, Traian Florin	All-Path Reachability Logic
Setzer, Anton	Unnesting of Copatterns
Simonsen, Jakob Grue	An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
Simpson, Alex	Abstract datatypes for real numbers in type theory
Statman, Richard	Near semi-rings and lambda calculus
Stefanescu, Andrei	All-Path Reachability Logic
Steila, Silvia	Ramsey Theorem as an intuitionistic property of well founded relations
Sternagel, Christian	Formalizing monotone algebras for certification of termination- and complexity proofs
Sternagel, Thomas	Conditional Confluence (System Description)
Stump, Aaron	Self Types for Dependently Typed Lambda Encodings
T
Thibodeau, David	Unnesting of Copatterns
Thiemann, René	Formalizing monotone algebras for certification of termination- and complexity proofs
Toyama, Yoshihito	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
U
Uchida, Kazumasa	Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
V
van Doorn, Floris	The Structural Theory of Pure Type Systems
Y
Yamada, Akihisa	Nagoya Termination Tool (System Description)
Yoshida, Nobuko	Process types as a descriptive tool for distributed protocols
Z
Zantema, Hans	Termination of Cycle Rewriting

Disclaimer | Powered by EasyChair Smart Program