Notions of computation and monads
Information and Computation
A calculus of mobile processes, II
Information and Computation
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Parallel reductions in &lgr;-calculus
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 lambda-calculus for dynamic binding
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Term rewriting and all that
Theoretical Computer Science
Template meta-programming for Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
A Simply Typed Context Calculus with First-Class Environments
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Open Proofs and Open Terms: A Basis for Interactive Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
An Idealized MetaML: Simpler, and More Expressive
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Hierarchical Nominal Terms and Their Theory of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Capture-avoiding substitution as a nominal algebra
Formal Aspects of Computing
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A Nominal Axiomatization of the Lambda Calculus
Journal of Logic and Computation
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
Information and Computation
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
| Hi-index | 0.00 |
We present the Lambda Context Calculus. This simple lambda-calculus features variables arranged in a hierarchy of strengths such that substitution of a strong variable does not avoid capture with respect to abstraction by a weaker variable. This allows the calculus to express both capture-avoiding and capturing substitution (instantiation). The reduction rules extend the 'vanilla' lambda-calculus in a simple and modular way and preserve the look and feel of a standard lambda-calculus with explicit substitutions. Good properties of the lambda-calculus are preserved. The LamCC is confluent, and a natural injection into the LamCC of the untyped lambda-calculus exists and preserves strong normalisation. We discuss the calculus and its design with full proofs. In the presence of the hierarchy of variables, functional binding splits into a functional abstraction @l (lambda) and a name-binder @? (new). We investigate how the components of this calculus interact with each other and with the reduction rules, with examples. In two more extended case studies we demonstrate how global state can be expressed, and how contexts and contextual equivalence can be naturally internalised using function application.