Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar19. FoSSaCS 2016: Eindhoven, The Netherlands (Part of ETAPS 2016)
Bart Jacobs, Christof Löding:
Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings. Lecture Notes in Computer Science 9634, Springer 2016, ISBN 978-3-662-49629-9
Types
- Neil Ghani, Fredrik Nordvall Forsberg, Alex Simpson:
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory. 3-19 - Ales Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus Ejlers Møgelberg, Lars Birkedal:
Guarded Dependent Type Theory with Coinductive Types. 20-35
Recursion and Fixed-Points
- Holger Bock Axelsen, Robin Kaarsgaard:
Join Inverse Categories as Models of Reversible Recursion. 73-90 - Stefan Milius, Dirk Pattinson, Thorsten Wißmann:
A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. 107-125 - Silvio Ghilardi, Maria João Gouveia, Luigi Santocanale:
Fixed-Point Elimination in the Intuitionistic Propositional Calculus. 126-141
Verification and Program Analysis
- Marie Fortin, Paul Gastin:
Verification of Parameterized Communicating Automata via Split-Width. 197-213
Automata, Logic, Games
- Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. 252-268 - Antoine Durand-Gasselin, Peter Habermehl:
Regular Transformations of Data Words Through Origin Information. 285-300
Probabilistic and Timed Systems
- Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. 303-318 - Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. 319-334 - Shankara Narayanan Krishna, Khushraj Madnani, Paritosh K. Pandya:
Metric Temporal Logic with Counting. 335-352
Proof Theory and Lambda Calculus
- Michele Pagani, Christine Tasson, Lionel Vaux:
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms. 408-423
Algorithms for Infinite Systems
- Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke:
Coverability Trees for Petri Nets with Unordered Data. 445-461 - Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest Paths in One-Counter Systems. 462-478
Monads
- Soichiro Fujii, Shin-ya Katsumata, Paul-André Melliès:
Towards a Formal Theory of Graded Monads. 513-530 - Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations, and Reiterman's Theorem. 531-547
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-10-20 21:04 CEST by the dblp team