default search action
Information and Computation, Volume 248
Volume 248, June 2016
- Simona Ronchi Della Rocca:
Preface. 1 - Clément Aubert
, Thomas Seiller
Logarithmic space and permutations. 2-21 - Martin Avanzini, Georg Moser
A combination framework for complexity. 22-55 - Patrick Baillot, Ugo Dal Lago
Higher-order interpretations and program complexity. 56-81 - Guillaume Bonfante, Reinhard Kahle
Two function algebras defining functions in NCk boolean circuits. 82-103 - Daniel de Carvalho, Lorenzo Tortora de Falco
A semantic account of strong normalization in linear logic. 104-129 - Jacek Chrzaszcz, Aleksy Schubert
The role of polymorphism in the characterisation of complexity by soft types. 130-149 - Ugo Dal Lago
Computation by interaction for space-bounded functional programming. 150-194 - Erika De Benedetti, Simona Ronchi Della Rocca:
A type assignment for λ-calculus complete both for FPTIME and strong normalization. 195-214 - Brian F. Redmond:
Bounded Combinatory Logic and lower complexity. 215-226
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 2024-12-23 19:36 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: