PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Artificial intelligence and mathematical theory of computation
Enriching the lambda calculus with contexts: toward a theory of incremental program construction
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
Higher-Order and Symbolic Computation
Orthogonal Higher-Order Rewrite Systems are Confluent
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
An Algorithm for Checking Incomplete Proof Objects in Type Theory with Localization and Unification
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Development Closed Critical Pairs
HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Dependent Types with Explicit Substitutiuons: A Meta-theoretical development
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Comparing combinatory reduction systems and higher-order rewrite systems
Comparing combinatory reduction systems and higher-order rewrite systems
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
ACM Transactions on Computational Logic (TOCL)
Proof contexts with late binding
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
| Hi-index | 0.00 |
The calculus λic serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole filling, by a mechanism of delayed substitution. The context calculus λic is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a ipretyping, which we illustrate by three examples.