POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Artificial intelligence and mathematical theory of computation
A theory of binding structures and applications to rewriting
Theoretical Computer Science
Using typed lambda calculus to implement formal systems on a machine
Journal of Automated Reasoning
A variable typed logic of effects
Information and 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
A first order logic of effects
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
A lambda-calculus for dynamic binding
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Reasoning about functions with effects
Higher order operational techniques in semantics
Theoretical Computer Science
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages
A foundation for actor computation
Journal of Functional Programming
Macros as multi-stage computations: type-safe, generative, binding macros in MacroML
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition
Higher-Order and Symbolic Computation
A Calculus of Lambda Calculus Contexts
Journal of Automated Reasoning
A Simply Typed Context Calculus with First-Class Environments
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Formal Foundations of Operational Semantics
Higher-Order and Symbolic Computation
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
First-class substitutions in contextual type theory
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
We investigate a representation of contexts, expressionswith holes in them, that enables them to be meaningfully transformed,in particular α-converted and β-reduced. In particularwe generalize the set of λ-expressions to include holes, andon these generalized entities define β-reduction (i.e.,substitution) and filling so that these operations preserveα-congruence and commute. The theory is then applied to allowthe encoding of reduction systems and operational semantics ofcall-by-value calculi enriched with control, imperative andconcurrent features.