Abstract is missing.
- Process Types as a Descriptive Tool for Interaction - Control and the Pi-CalculusKohei Honda, Nobuko Yoshida, Martin Berger. 1-20 [doi]
- Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)Manfred Schmidt-Schauß. 21-30 [doi]
- Unnesting of CopatternsAnton Setzer, Andreas Abel, Brigitte Pientka, David Thibodeau. 31-45 [doi]
- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing DiagramsTakahito Aoto, Yoshihito Toyama, Kazumasa Uchida. 46-60 [doi]
- Predicate Abstraction of Rewrite TheoriesKyungmin Bae, José Meseguer. 61-76 [doi]
- Unification and Logarithmic SpaceClément Aubert, Marc Bagnol. 77-92 [doi]
- Ramsey Theorem as an Intuitionistic Property of Well Founded RelationsStefano Berardi, Silvia Steila. 93-107 [doi]
- A Model of Countable Nondeterminism in Guarded Type TheoryAles Bizjak, Lars Birkedal, Marino Miculan. 108-123 [doi]
- Cut Admissibility by SaturationGuillaume Burel. 124-138 [doi]
- Automatic Evaluation of Context-Free Grammars (System Description)Carles Creus, Guillem Godoy. 139-148 [doi]
- Tree Automata with Height Constraints between BrothersCarles Creus, Guillem Godoy. 149-163 [doi]
- A Coinductive Confluence Proof for Infinitary Lambda-CalculusLukasz Czajka. 164-178 [doi]
- An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free RewritingDaniel de Carvalho, Jakob Grue Simonsen. 179-193 [doi]
- Preciseness of Subtyping on Intersection and Union TypesMariangiola Dezani-Ciancaglini, Silvia Ghilezan. 194-207 [doi]
- Abstract Datatypes for Real Numbers in Type TheoryMartín Hötzel Escardó, Alex Simpson. 208-223 [doi]
- Self Types for Dependently Typed Lambda EncodingsPeng Fu, Aaron Stump. 224-239 [doi]
- First-Order Formative RulesCarsten Fuhs, Cynthia Kop. 240-256 [doi]
- Automated Complexity Analysis Based on Context-Sensitive RewritingNao Hirokawa, Georg Moser. 257-271 [doi]
- Amortised Resource Analysis and Typed Polynomial InterpretationsMartin Hofmann 0001, Georg Moser. 272-286 [doi]
- Confluence by Critical Pair AnalysisJiaxiang Liu, Nachum Dershowitz, Jean-Pierre Jouannaud. 287-302 [doi]
- Proof Terms for Infinitary RewritingCarlos Lombardi, Alejandro Ríos, Roel de Vrijer. 303-318 [doi]
- Construction of Retractile Proof StructuresRoberto Maieli. 319-333 [doi]
- Local States in String DiagramsPaul-André Melliès. 334-348 [doi]
- Reduction System for Extensional Lambda-mu CalculusKoji Nakazawa, Tomoharu Nagai. 349-363 [doi]
- The Structural Theory of Pure Type SystemsCody Roux, Floris van Doorn. 364-378 [doi]
- Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMBManfred Schmidt-Schauß, David Sabel. 379-394 [doi]
- Implicational Relevance Logic is 2-ExpTime-CompleteSylvain Schmitz. 395-409 [doi]
- Near Semi-rings and Lambda CalculusRick Statman. 410-424 [doi]
- All-Path Reachability LogicAndrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon M. Moore, Traian-Florin Serbanuta, Grigore Rosu. 425-440 [doi]
- Formalizing Monotone Algebras for Certification of Termination and Complexity ProofsChristian Sternagel, René Thiemann. 441-455 [doi]
- Conditional Confluence (System Description)Thomas Sternagel, Aart Middeldorp. 456-465 [doi]
- Nagoya Termination ToolAkihisa Yamada 0002, Keiichirou Kusakari, Toshiki Sakabe. 466-475 [doi]
- Termination of Cycle RewritingHans Zantema, Barbara König, Harrie Jan Sander Bruggink. 476-490 [doi]