default search action
Theoretical Computer Science, Volume 398
Volume 398, Numbers 1-3, May 2008
- Stefano Berardi, Ugo de'Liguoro:
Calculi, types and applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca. 1-11
- Henk Barendregt:
Towards the range property for the lambda theory H. 12-15 - Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer:
Lambda calculus with patterns. 16-31 - Ugo Dal Lago, Simone Martini:
The weak lambda calculus as a reasonable machine. 32-50 - Luca Paolini:
Parametric lambda -theories. 51-62 - Gérard Boudol:
On strong normalization and type inference in the intersection type discipline. 63-81 - Steffen van Bakel:
The heart of intersection type assignment: Normalisation proofs revisited. 82-94 - Viviana Bono, Betti Venneri, Lorenzo Bettini:
A typed lambda calculus with intersection types. 95-113 - Daniel J. Dougherty, Silvia Ghilezan, Pierre Lescanne:
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage. 114-128 - Fabio Alessi:
An irregularfilter model. 129-149 - Pietro Di Gianantonio, Furio Honsell, Marina Lenisa:
A type assignment system for game semantics. 150-169 - Mathieu Hoyrup, Arda Kolçak, Giuseppe Longo:
Computability and the morphological complexity of some dynamics on continuous domains. 170-182 - Ines Margaria, Maddalena Zacchi:
Access control in mobile ambient calculi: A comparative view. 183-202 - Adriana B. Compagnoni, Elsa L. Gunter, Philippe Bidinger:
Role-based access control for boxed ambients. 203-216 - Giuseppe Castagna, Rocco De Nicola, Daniele Varacca:
Semantic subtyping for the pi-calculus. 217-242 - Luigi Liquori, Arnaud Spiwack:
Extending FeatherTrait Java with Interfaces. 243-260
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.