Explicit Environments

Authors:
Masahiko Sato;Takafumi Sakurai;Rod M. Burstall
Affiliations:
-;-;-
Venue:
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Year:
1999

Citing 6
Cited 1

Pebble, a kernel language for modules and abstract data types

Information and Computation - Semantics of Data Types
Proofs and types

Proofs and types
Parallel reductions in λ-calculus

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

Theoretical Computer Science
A typed context calculus

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

Journal of Functional Programming

A Simply Typed Context Calculus with First-Class Environments

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce λƐ, a simply typed calculus with environments as first class values. As well as the usual constructs of λ and application, we have e[[a]] which evaluates term a in an environment e. Our environments are a set of variable-value pairs, but environments can also be computed by function application and evaluation in some other environments. The notion of environments here is a generalization of explicit substitutions and records. We show that the calculus has desirable properties such as subject reduction, confluence, conservativity over the simply typed λβ-calculus and strong normalizability.