Sciweavers

TLCA
1993
Springer
13 years 11 months ago
A Term Calculus for Intuitionistic Linear Logic
P. N. Benton, Gavin M. Bierman, Valeria de Paiva, ...
TLCA
1993
Springer
13 years 11 months ago
The Conservation Theorem revisited
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
Philippe de Groote
TLCA
1993
Springer
13 years 11 months ago
An Abstract Notion of Application
Pietro Di Gianantonio, Furio Honsell
TLCA
1993
Springer
13 years 11 months ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
TLCA
1993
Springer
13 years 11 months ago
Pure Type Systems Formalized
James McKinna, Robert Pollack
STACS
1993
Springer
13 years 11 months ago
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarze...