Confluence results for the pure strong categorical logic CCL. &lgr;-calculi as subsystems of CCL

On laziness and optimality in lambda interpreters: tools for specification and analysis

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Confluence properties of weak and strong calculi of explicit substitutions

Journal of the ACM (JACM)

A Polymorphic Environment Calculus and its Type-Inference Algorithm

Higher-Order and Symbolic Computation

Characterising Explicit Substitutions which Preserve Termination

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

Explicit Environments

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

Explicit Substitutions and Programming Languages

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science

Life without the Terminal Type

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic

A λ-calculus with explicit weakening and explicit substitution

Mathematical Structures in Computer Science

Sequent combinators: a Hilbert system for the lambda calculus

Mathematical Structures in Computer Science

Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms

Journal of Functional Programming

Explicit Environments

Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)

Abstract Conditions for the Confluence of Explicit Substitution Calculi

Electronic Notes in Theoretical Computer Science (ENTCS)

Axiomatic rewriting theory i: a diagrammatic standardization theorem

Processes, Terms and Cycles

On Explicit Substitution with Names

Journal of Automated Reasoning

Explicit Environments

Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)