Arrow Research search
Back to CSL

CSL 1999

Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting

Conference Paper Lambda Calculus, Linear Logic Logic in Computer Science · Theoretical Computer Science

Abstract

Abstract We propose a calculus of explicit substitutions with de Bruijn indices for implementing objects and functions which is confluent and preserves strong normalization. We start from Abadi and Cardelli’s ς-calculus [ 1 ] for the object calculus and from the λ ν -calculus [ 20 ] for the functional calculus. The de Bruijn setting poses problems when encoding the λ ν -calculus within the ς-calculus following the style proposed in [ 1 ]. We introduce fields as a primitive construct in the target calculus in order to deal with these difficulties. The solution obtained greatly simplifies the one proposed in [ 17 ] in a named variable setting. We also eliminate the conditional rules present in the latter calculus obtaining in this way a full non-conditional first order system.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
127423286463922966
v2026.09.13