Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization

Proof-term synthesis on dependent-type systems via explicit substitutions

Theoretical Computer Science

Characterising Explicit Substitutions which Preserve Termination

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications

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

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic

Perpetuality in a named lambda calculus with explicit substitutions

Mathematical Structures in Computer Science

A λ-calculus with explicit weakening and explicit substitution

Mathematical Structures in Computer Science