default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 212
Volume 212, Numbers 1-2, 6 February 1999
- Marcin Benke:
Some Complexity Bounds for Subtype Inequalities. 3-27 - Alessandro Berarducci
, Mariangiola Dezani-Ciancaglini:
Infinite lambda-Calculus and Types. 29-75 - Harold Boley:
Functional-Logic Integration via Minimal Reciprocal Extensions. 77-99 - Viviana Bono, Michele Bugliesi:
Matching for the lambda Calculus of Objects. 101-140 - Roy Dyckhoff, Luís Pinto:
Permutability of Proofs in Intuitionistic Sequent Calculi. 141-155 - Martin Emms, Hans Leiß:
Extending the Type Checker of Standard ML by Polymorphic Recursion. 157-181 - Furio Honsell, Marina Lenisa:
Semantical Analysis of Perpetual Strategies in lambda-Calculus. 183-209 - Benedetto Intrigila, Marisa Venturini Zilli:
Orders, Reduction Graphs and Spectra. 211-231 - Adolfo Piperno:
An Algebraic View of the Böhm-Out Technique. 233-246 - Helmut Schwichtenberg:
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. 247-260 - Dieter Spreen:
On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. 261-303
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 2025-12-04 01:27 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:
