You have Guest access.
Log In
Samson Abramsky
Front matter
1
Many Happy Re urns
2-3
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
4-5
Definability of Total Objects in PCF and Related Calculi
6-7
Categorical Semantics of Control
8-21
Representations of First Order Function Types as Terminal Coalgebras
22-28
A Finitary Subsystem of the Polymorphic λ-Calculus
29-45
Sequentiality and the π-Calculus
46-60
Logical Properites of Name Restriction
61-75
Subtyping Recursive Games
76-90
Typing Lambda Terms in Elementary Logic with Linear Constraints
91-105
Ramied Recurrence with Dependent Types
106-120
Game Semantics for the Pure Lazy λ-Calculus
121-135
Reductions, intersection types, and explicit substitutions
136-150
The Stratified Foundations as a Theory Modulo
151-165
Normalization by Evaluation for the Computational Lambda-Calculus
166-181
Induction Is Not Derivable in Second Order Dependent Type Theory
182-196
Strong Normalization of Classical Natural Deduction with Disjunction
197-216
Partially Additive Categories and Fully Complete Models of Linear Logic
217-239
Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types
240-252
The Finitely Generated Types of the λ-Calculus
253-267
Deciding Monadic Theories of Hyperalgebraic Trees
268-282
A Deconstruction of Non-deterministic Classical Cut Elimination
283-297
A Token Machine for Full Geometry of Interaction (Extended Abstract)
298-314
Second-Order Pre-logical Relations and Representation Independence
315-328
Characterizing Convergent Terms in Object Calculi via Intersection Types
329-343
Parigot’s Second Order λ μ -Calculus and Inductive Types
344-359
The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
360-375
Evolving Games and Essential Nets for Affine Polymorphism
376-384
Retracts in Simple Types
385-399
Parallel Implementation Models for the λ-Calculus Using the Geometry of Interaction (Extended Abstract)
400-414
The complexity of β-reduction in low orders
415-429
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
Back matter
Olivier Danvy
Martin Hofmann
Dag Normann
Peter Selinger
Thorsten Altenkirch
Thorsten Altenkirch and Thierry Coquand
Martin Berger, Kohei Honda and Nobuko Yoshida
Luca Cardelli and Andrew D. Gordon
Juliusz Chroboczek
Paolo Coppola and Simone Martini
Norman Danner
Pietro Di Gianantonio
Dan Doughertyy and Pierre Lescanne
Gilles Dowek
Andrzej Filinski
Herman Geuvers
Philippe de Groote
Esfandiar Haghverdi
C. Barry Jay
Thierry Joly
Teodor Knapik, Damian Niwiński and Paweł Urzyczyn
J. Laird
Olivier Laurent
Hans Leiβ
Ugo de’Liguoro
Ralph Matthes
Alexandre Miquel
Andrzej S. Murawski and C. -H. Luke Ong
Vincent Padovani
Jorge Sousa Pinto
Aleksy Schubert
Christian Urban
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info