![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Logical Methods in Computer Science, Volume 12
Volume 12, Number 1, 2016
- Søren Debois
, Thomas T. Hildebrandt, Tijs Slaats, Nobuko Yoshida
:
Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion. - Willem Heijltjes
, Robin Houston:
Proof equivalence in MLL is PSPACE-complete. - Marie Kerjean
:
Weak topologies for Linear Logic. - Beniamino Accattoli, Ugo Dal Lago
:
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed. - Thomas Place, Marc Zeitoun:
Separating Regular Languages with First-Order Logic. - Piotr Hofman, Slawomir Lasota
, Richard Mayr, Patrick Totzke
:
Simulation Problems Over One-Counter Nets. - Radu Grigore, Nikos Tzevelekos:
History-Register Automata. - Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, Johannes Åman Pohjola
:
A Sorted Semantic Framework for Applied Process Calculi. - Pablo Barceló, Leonid Libkin
:
Order-Invariant Types and Their Applications.
Volume 12, Number 2, 2016
- Laurent Bienvenu, Damien Desfontaines, Alexander Shen
:
Generic algorithms for halting problem and optimal machines revisited. - John Case, Michael Ralston:
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties. - Florent Jacquemard, Luc Segoufin, Jerémie Dimino:
FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems. - Flavien Breuvart:
On the characterization of models of H*: The semantical aspect. - Paola Bruscoli, Alessio Guglielmi
, Tom Gundersen, Michel Parigot:
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae. - Jean-Philippe Bernardy, Patrik Jansson
:
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda. - Guillaume Cano, Cyril Cohen
, Maxime Dénès, Anders Mörtberg, Vincent Siles:
Formalized linear algebra over Elementary Divisor Rings in Coq. - Witold Charatonik, Piotr Witkowski
:
Two-variable Logic with Counting and a Linear Order. - Yasuhiko Minamide:
Weighted Pushdown Systems with Indexed Weight Domains. - Giovanni Bernardi, Matthew Hennessy:
Using higher-order contracts to model session types. - Joachim Parrow, Tjark Weber:
The Largest Respectful Function. - Álvaro García-Pérez
, Pablo Nogueira:
No solvable lambda-value term left behind.
Volume 12, Number 3, 2016
- Stéphane Demri, Diego Figueira
, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. - Harley Eades III, Aaron Stump, Ryan McCleeary:
Dualized Simple Type Theory. - Andrzej S. Murawski, Nikos Tzevelekos:
Block structure vs scope extrusion: between innocence and omniscience. - Felix Klein, Martin Zimmermann
:
How Much Lookahead is Needed to Win Infinite Games? - Milan Bankovic
:
Solving finite-domain linear constraints in presence of the alldifferent. - Konstantinos Mamouras:
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism. - Ranald Clouston, Ales Bizjak, Hans Bugge Grathwohl, Lars Birkedal:
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types. - Giorgi Japaridze:
Build your own clarithmetic I. - Michael Shulman:
Idempotents in intensional type theory. - Douglas S. Bridges, James E. Dent, Maarten McKubre-Jordens:
Z-stability in Constructive Analysis. - Sung-Shik T. Q. Jongmans, Farhad Arbab:
Data optimizations for constraint automata. - Giorgi Japaridze:
Build your own clarithmetic II. - Federico Aschieri:
On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC.
Volume 12, Number 4, 2016
- Franz Baader
, Stefan Borgwardt
, Barbara Morawska
:
Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification. - Vincenzo Ciancia, Diego Latella
, Michele Loreti
, Mieke Massink
:
Model Checking Spatial Logics for Closure Spaces. - Dimiter Skordev
:
Some theorems on passing from local to global presence of properties of functions. - Takayuki Kihara
:
Borel-piecewise continuous reducibility for uniformization problems. - Roberto Vigo, Flemming Nielson, Hanne Riis Nielson:
Discovering, quantifying, and displaying attacks. - Davide Basile
, Pierpaolo Degano, Gian-Luigi Ferrari
:
Automata for Specifying and Orchestrating Service Contracts. - Massimo Bartoletti
, Alceste Scalas
, Emilio Tuosto, Roberto Zunino:
Honesty by Typing. - Frederik Harwath, Nicole Schweikardt:
On the locality of arb-invariant first-order formulas with modulo counting quantifiers. - Anupam Das
, Lutz Straßburger:
On linear rewriting systems for Boolean logic and some applications to proof theory. - Bartek Klin
, Jurriaan Rot:
Coalgebraic trace semantics via forgetful logics. - Aleksy Schubert
, Pawel Urzyczyn, Konrad Zdanowski
:
On the Mints Hierarchy in First-Order Intuitionistic Logic. - Daniel Gebler, Kim G. Larsen
, Simone Tini
:
Compositional bisimulation metric reasoning with Probabilistic Process Calculi. - Jasmin Christian Blanchette, Sascha Böhme, Andrei Popescu, Nicholas Smallbone:
Encoding Monomorphic and Polymorphic Types.
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.