Explicit Environments

Authors:
Masahiko Sato;Takafumi Sakurai;Rod Burstall
Affiliations:
-;-;-
Venue:
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Year:
2001

Citing 11
Cited 6

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Structure and interpretation of computer programs

Structure and interpretation of computer programs
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
Explicit substitution on the edge of strong normalization

Theoretical Computer Science
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Typed lambda-calculi with explicit substitutions may not terminate

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms

Journal of Functional Programming

CAL: A Computer Assisted Learning System for Computation and Logic

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Theory of Judgments and Derivations

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The λ-context Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
Two-level Lambda-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)

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 sets 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.