


default search action
Mathematical Structures in Computer Science, Volume 28
Volume 28, Number 1, January 2018
- Hongwei Li, Li Yang:

A quantum algorithm to approximate the linear structures of Boolean functions. 1-13 - Guillaume Bonfante, Florian L. Deloup:

The genus of regular languages. 14-44 - Jean-Louis Krivine:

Realizability algebras III: some examples. 45-76 - Thomas Seiller

:
A correspondence between maximal abelian sub-algebras and linear logic fragments. 77-139
- Benno van den Berg, Ieke Moerdijk:

W-types in homotopy-type theory - CORRIGENDUM. 140
Volume 28, Number 2, February 2018
- Alonso González, Alejandro Hevia:

A second note on the feasibility of generalized universal composability. 141-154 - Yves Guiraud, Philippe Malbos:

Polygraphs of finite derivation type. 155-201 - Linda Brodo:

On the expressiveness of π-calculus for encoding mobile ambients. 202-240 - Steve Awodey:

Natural models of homotopy type theory. 241-286 - Makoto Hamana

, Kazutaka Matsuda, Kazuyuki Asada:
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics. 287-337
Volume 28, Number 3, March 2018
- Ekaterina B. Fokina

:
Preface. 338-339
- Pablo Arrighi, Simon Martiel, Vincent Nesme:

Cellular automata over generalized Cayley graphs. 340-383 - Marat M. Arslanov

:
Splitting and non-splitting in the difference hierarchy. 384-391 - Nikolay Bazhenov

:
Autostability spectra for decidable structures. 392-411 - Giovanna D'Agostino

, Alberto Marcone
:
The logic of the reverse mathematics zoo. 412-428 - Margarita V. Korovina, Oleg V. Kudinov

:
Complexity for partial computable functions over computable Polish spaces. 429-447 - Andrew S. Marks

:
The universality of polynomial time Turing equivalence. 448-456 - André Nies

, Andrea Sorbi:
Calibrating word problems of groups via the complexity of equivalence relations. 457-471
Volume 28, Number 4, April 2018
- Marie Kerjean

, Christine Tasson
:
Mackey-complete spaces and power series - a topological model of differential linear logic. 472-507 - Paolo Bottoni

, Daniele Gorla
, Stefano Kasangian, Anna Labella:
A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes. 508-532 - Zhongxi Zhang, Qingguo Li

, Xiaodong Jia
:
θ-continuity and D θ-completion of posets. 533-547 - Tristan Bice

:
Yoneda completeness. 548-561 - Ichiro Hasuo

, Toshiki Kataoka, Kenta Cho:
Coinductive predicates and final sequences in a fibration. 562-611
Volume 28, Number 5, May 2018
- Sandra Alves, Iliano Cervesato:

Preface to special issue: LINEARITY 2014. 612-613
- Taus Brock-Nannestad

, Nicolas Guenot:
Multi-focused cut elimination. 614-650 - Kaustuv Chaudhuri

:
Expressing additives using multiplicatives and subexponentials. 651-666 - Marco Solieri

:
Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: a minimalist approach. 667-709 - Jennifer Paykin

, Steve Zdancewic:
A linear/producer/consumer model of classical linear logic. 710-735
Volume 28, Number 6, June 2018
- Paul-André Melliès, Noam Zeilberger:

An Isbell duality theorem for type refinement systems. 736-774 - Georg Struth:

Hoare Semigroups. 775-799 - José Luiz Fiadeiro, Antónia Lopes

, Benoît Delahaye
, Axel Legay:
Dynamic networks of heterogeneous timed machines. 800-855 - Michael Shulman

:
Brouwer's fixed-point theorem in real-cohesive homotopy type theory. 856-941 - Vincent Rahli

, Mark Bickford:
Validating Brouwer's continuity principle for numbers using named exceptions. 942-990
Volume 28, Number 7, August 2018
- Lorenzo Tortora de Falco:

Preface. 991-994
- Thomas Ehrhard:

An introduction to differential linear logic: proof-nets, models and antiderivatives. 995-1060 - Christine Tasson

, Lionel Vaux
:
Transport of finiteness structures and applications. 1061-1096 - Damiano Mazza

:
The true concurrency of differential interaction nets. 1097-1125 - Emmanuel Beffara

:
Order algebras: a quantitative model of interaction. 1126-1168 - Daniel de Carvalho:

Execution time of λ-terms via denotational semantics and intersection types. 1169-1203 - Paolo Di Giamberardino:

Jump from parallel to sequential proofs: exponentials. 1204-1252 - Paul-André Melliès

, Nicolas Tabareau
, Christine Tasson
:
An explicit formula for the free exponential modality of linear logic. 1253-1286
Volume 28, Number 8, September 2018
- Rachid Echahed:

Foreword: special issue on term and graph rewriting. 1287-1289
- H. J. Sander Bruggink, Barbara König:

Recognizable languages of arrows and cospans. 1290-1332 - Martin Strecker

:
Interactive and automated proofs for graph transformations. 1333-1362 - Patrick Bahr:

Convergence in infinitary term graph rewriting systems is simple. 1363-1414 - Manfred Schmidt-Schauß:

Linear pattern matching of compressed terms and polynomial rewriting. 1415-1450 - Guillaume Bonfante, Bruno Guillaume:

Non-size increasing graph rewriting for natural language processing. 1451-1484 - Hans Zantema:

Finding small counterexamples for abstract rewriting properties. 1485-1505
Volume 28, Number 9, October 2018
- Iliano Cervesato, Kaustuv Chaudhuri:

Preface - Special Issue on Logical Frameworks and Meta-Languages 2015. 1506
- Amy P. Felty, Alberto Momigliano

, Brigitte Pientka:
Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions. 1507-1540 - Roly Perera

, James Cheney
:
Proof-relevant π-calculus: a constructive account of concurrency and causality. 1541-1577 - Furio Honsell, Luigi Liquori, Petar Maksimovic

, Ivan Scagnetto:
Plugging-in proof development environments using Locks in LF. 1578-1605 - Andrew Cave, Brigitte Pientka:

Mechanizing proofs with logical relations - Kripke-style. 1606-1638
Volume 28, Number 10, November 2018
- Masahiro Hamano

, Philip J. Scott:
On geometry of interaction for polarized linear logic. 1639-1694 - Valery Isaev:

Model structures on categories of models of type theories. 1695-1722 - Emmanuel Haucourt:

The geometry of conservative programs. 1723-1769 - Chongxia Lu, Qingguo Li:

Essential and density topologies on s2-continuous posets. 1770-1785 - Andreas Reuß, Helmut Seidl:

Paths, tree homomorphisms and disequalities for -clauses. 1786-1846

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














