default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th FoSSaCS 2017: Uppsala, Sweden (Part of ETAPS 2017)
- Javier Esparza, Andrzej S. Murawski:
Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings. Lecture Notes in Computer Science 10203, 2017, ISBN 978-3-662-54457-0
Coherence Spaces and Higher-Order Computation
- Kei Matsumoto:
Coherence Spaces and Uniform Continuity. 3-19 - Raphaëlle Crubillé, Thomas Ehrhard, Michele Pagani, Christine Tasson
:
The Free Exponential Modality of Probabilistic Coherence Spaces. 20-35 - James Laird:
From Qualitative to Quantitative Semantics - By Change of Base. 36-52 - Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada:
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. 53-68
Algebra and Coalgebra
- Michele Boreale:
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations. 71-87 - Konstantinos Mamouras:
Equational Theories of Abnormal Termination Based on Kleene Algebra. 88-105 - Damien Pous, Jurriaan Rot:
Companions, Codensity and Causality. 106-123 - Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann:
Nominal Automata with Name Binding. 124-142
Games and Automata
- Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. 145-161 - Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. 162-178 - Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. 179-195 - Sergio Abriola, Diego Figueira, Santiago Figueira:
Logics of Repeating Values on Data Trees and Branching Counter Systems. 196-212
Automata, Logic and Formal Languages
- Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of Sequentiality of Weighted Automata. 215-230 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata. 231-247 - Peter Thiemann:
Partial Derivatives for Context-Free Languages - From \mu -Regular Expressions to Pushdown Automata. 248-264 - Patricia Bouyer, Vincent Jugé:
Dynamic Complexity of the Dyck Reachability. 265-280
Proof Theory
- Alex Simpson:
Cyclic Arithmetic Is Equivalent to Peano Arithmetic. 283-300 - Stefano Berardi, Makoto Tatsuta:
Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System. 301-317
Probability
- Gaoang Bian, Alessandro Abate:
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context. 321-337 - Vincent Danos, Tobias Heindel, Ilias Garnier, Jakob Grue Simonsen:
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables. 338-354 - Florence Clerc, Vincent Danos, Fredrik Dahlqvist, Ilias Garnier:
Pointless Learning. 355-369 - Flavien Breuvart, Ugo Dal Lago, Agathe Herrou:
On Higher-Order Probabilistic Subrecursion. 370-386
Concurrency
- Ken Sakayori, Takeshi Tsukada:
A Truly Concurrent Game Model of the Asynchronous \pi -Calculus. 389-406 - Paolo Baldan, Tommaso Padoan:
Local Model Checking in a Logic for True Concurrency. 407-423 - Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi:
The Paths to Choreography Extraction. 424-440 - Julien Lange, Nobuko Yoshida:
On the Undecidability of Asynchronous Session Subtyping. 441-457
Lambda Calculus and Constructive Proof
- Jasmin Christian Blanchette, Uwe Waldmann, Daniel Wand:
A Lambda-Free Higher-Order Recursive Path Order. 461-479 - Frédéric Gilbert:
Automated Constructivization of Proofs. 480-495
Semantics and Category Theory
- Paula Severi:
A Light Modality for Recursion. 499-516 - Sergey Goncharov, Lutz Schröder, Christoph Rauch, Maciej Piróg:
Unifying Guarded and Unguarded Iteration. 517-533 - Thorsten Altenkirch, Nils Anders Danielsson, Nicolai Kraus:
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type. 534-549 - G. A. Kavvos:
On the Semantics of Intensionality. 550-566
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-14 23:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
